MARKOVIAN LOG · VERIFY ONE LEAF

Leaf …, checked in your browser

Every step below runs here, against bytes fetched from the log. Nothing is taken from us on trust except two public keys pinned in this page from the operators’ own key pages, and the one step a browser cannot do, the Bitcoin check, is handed to you with the exact command. Change the number in the address bar to check any leaf.

1. The leaf fetching…

The bytes the submitter sent. A public note carries the SHA-256 of a file and the time the log took it.

…

2. Inclusion in the tree waiting…

The log serves a Merkle inclusion proof for this leaf against the checkpoint of size … (the newest one confirmed in Bitcoin; the log is at … now). The page recomputes the tree root from the leaf and the proof, RFC 6962 hashing, and compares it with the root the checkpoint states.

…

…

…

3. The log’s signature waiting…

The checkpoint is a signed note. The signing key is pinned here from the log’s own policy file, key id 0302c6c8.

4. The witnesses waiting…

Independent operators cosign the same checkpoint after checking it only grows. Keys are pinned from each operator’s own key page, not from this log. The policy needs four of seven; two of the seven are run by one operator, TrustFabric, so no single operator can make the quorum alone.

5. Bitcoin waiting…

…

Longer version: what a stamp proves, and what it doesn’t. What this proves: that these bytes were in this log at a position below a checkpoint that independent parties signed and that Bitcoin has carried since the block named. What it does not prove: anything about what the bytes say. A hash in the log is evidence a file existed in that form by that time, not that the file is right. Code in this page: RFC 6962 hashing with WebCrypto, Ed25519 and ML-DSA-44 from the noble libraries bundled inline. Endpoints: /leaf/N, /inclusion?leaf=N&size=S, /checkpoint/S, /anchor, /policy on log.markovianprotocol.com.