[haggs]

• I added bounded candidate, signal, and span inspection helpers so the compiler can inspect recorded facts without rebuilding trace viewers or printing entire traces. Pages expose continuation offsets, exact field reads remain available, and ordering, authorship, and signal limitations stay explicit.
• Claims register their predicates and example checks through a Python helper and return session-local handles. The application constructs the final objects, validates references, and preserves existing claims and metadata. Existing insights without persistent IDs can be updated by their session-local index.
• Final verification scans the stored trace payloads in one pass and gives each predicate an isolated decoded trace. It does not cache mutable predicate results. A batch telemetry span reports per-claim matches, unknowns, failures, and evaluation time; failed scans retain the checked seed references.

Compilation reasoning remains separately configurable, with high as the default. The latency comparison uses high reasoning in both arms.

Verified locally: Regression coverage checks handle validation, bounded source reads, predicate isolation, fresh final scans, and preservation of existing evidence and metadata. End-to-end latency validation on a small trace corpus is in progress; no speedup is established yet.