Glossary
What is recompute at the anchored recent horizon?
The property of a hash-chained record that a party outside the emitter can walk a bounded recent window against the external anchor and confirm each entry. Scope is bounded to the recent horizon; a mismatch is a tamper signal.
§ 01 Definition
Walk the window that matters, anchor the rest.
The scope of what is verified is bounded to the recent horizon (the high-water mark of the chain, minus a defined window of events); older entries beyond that horizon remain attested by the anchor rather than re-walked as part of a routine verification cycle.
Recompute at the anchored recent horizon is not full-chain recomputation. Full-chain recomputation walks every entry from the genesis of the chain forward and is a stronger guarantee at higher operational cost, particularly at fleet scale where the chain accrues events continuously.
§ 02 Questions
Recent-horizon recompute, answered.
How is recompute at the recent horizon different from full-chain recomputation?
Recompute at the recent horizon walks a bounded recent window and relies on the external anchor to attest the earlier record.
What does the verifier need in order to run the recompute?
Read access to the stored entries in the recent-horizon window, the hash-chain algorithm the entries were written under, and the external anchor value at the window’s boundary. Any mismatch anywhere in the walk indicates tampering or corruption of the record.
What does "match-false" mean in this context?
It means the verifier walked the recent-horizon window, recomputed each entry’s hash from what is stored, and found a hash that did not match.
§ 03 Related