Execution proofs are an audit layer OVER the chain, never under it. For that
layer to mean anything, the claim chain must be continuous, and this tool
measures three properties from the live chain: linkage (each window's
prevStateRoot equals the previous window's postStateRoot and the chain's real
root before the first), no gaps or overlaps in the tiling, and anchoring (each
postStateRoot equals the header.stateRoot the chain actually published, so the
proof proves the committed state and not a parallel one). It reports proving
LAG as a first-class number, because lag is the cost curve of proving and
hiding it is the failure.
Run and measured 2026-08-15 against rpc.aere.network: an 8-window synthetic
chain built from live state roots verifies clean; four negative controls (gap,
overlap, linkage, anchor) each make the detector go red, and the anchor plant
is isolated on the last window so it trips the anchoring rule specifically,
not linkage. Read-only, installs nothing. Points at a claims file when a public
proof endpoint exists; the deprecated aggregator V1 stays fenced.
42dd039ddb