Enter a 64-character hex hash or a numeric leaf index (e.g. 0, 1, 25…)
How it works
Fetch STH
The verifier fetches the current Signed Tree Head via the Protocol Worker. The STH contains the Merkle root, tree size, timestamp, and a 3-of-4 quorum signature from the validator network.
Request Inclusion Proof
Given a leaf hash or index, the log returns a Merkle audit path — the minimal set of sibling hashes needed to recompute the root from your leaf.
Recompute Root
Your browser recomputes the Merkle root by hashing your leaf with each sibling in sequence using the Web Crypto API (SHA-256). No custom tools. No proprietary libraries.
Compare
If the computed root matches the signed root in the STH, the leaf is proven to be in the log. If it doesn't match, the leaf was not present at that tree size.
After successful verification, you can replay the decision that produced this leaf — see the exact evidence and gate-by-gate reasoning.