Shared frame history
Dependency orderNo frames yet.
Proof 1 of 6 · Causal order
Two devices can disagree about wall time and still produce one verifiable order. Each frame names the SHA-256 address of its predecessor; timestamps remain evidence, but they do not decide causality.
Two simulated devices append records to one chain. The displayed hashes are computed by your browser, not prewritten examples.
Timestamp sorting moves a later frame ahead of its dependency. Chain order stays stable. Tampering then turns chain integrity red.
Dependency links preserve causal order under clock skew, and recomputation detects a changed link. It does not prove signatures, transport security, or global consensus.
No frames yet.
Independent reproduction
Copy this specification into another model. Compare its implementation and failure path with this page rather than asking it to endorse this page.