light client · in your tab

Verify a whole history in one proof

A finalized history is a chain of turns: each turn's after-state is the next turn's before-state. Instead of re-executing every turn to trust the result, a producer (a node or relayer that ran the history) folds the whole chain into one succinct recursive proof. A light client — your browser tab, here — then verifies that single proof, re-witnessing nothing: no re-execution, no re-hashing, no walk of the chain. If it verifies, every folded turn executed correctly, in order, from genesis to the final root.

▼ folded once, natively, off the verifier ▼
π ✓
one recursive STARK — what your tab verifies below, re-witnessing nothing

the verification carries the recursion engine's FRI soundness. The verification is the trust.

produce · off the verifier
Fold once
The real k-turn aggregate below was folded natively by the producer — the expensive step, done once. Each leaf is a real EffectVM proof verified in-circuit; the recursion binds the chain.
verify · in your tab
Check cheaply
Your tab runs the real recursion verify over the wire proof — independent of how many turns the history holds. Verification is the light step, and it runs client-side in WebAssembly.
anchor · your config
Trust nothing but your anchor
The trust anchor is configuration you hold separately — never read off the proof under verification. A proof built for a different circuit cannot pass your anchor.

1 · Verify a real history in your tab

The aggregate below is a real, pre-folded whole-history proof (shipped as a wire envelope). Click Verify and your tab runs the genuine recursion verify against the config anchor — re-witnessing nothing. The carried public commitments (genesis/final root, the ordered-history digest, the turn count) are re-attested against the binding proof.

loading the in-tab verifier and the baked aggregate…
—

2 · Check it against your own anchor

The anchor is your config — a separate input, never taken from the artifact. Verify against the correct anchor and it attests; tamper one hex digit and it is refused outright. "You did not trust the producer, you checked it against your own anchor."

—

Named floor: the verification carries the recursion engine's FRI soundness. The verification is the trust — if the aggregate verifies under a sound engine, the whole history is attested. This is the executable counterpart of the Lean theorem light_client_verifies_whole_history.

← back to dregg / deos