← run detailMerkle Inclusion Proof
✗ NOT VERIFIEDProves this run's chain head is committed into the day's Merkle root. Leaf = sha256(run_id + ":" + chain_head). Siblings enable independent root reconstruction.
CHAIN HEAD & LEAF
CHAIN HEAD0e27793fb21b504b67a4389256098e9166c466a85640174d6442d51f8dbec6cd
LEAF HASH7bd1f2b5d16fcd56a6fd113c56e9e535632e880a3577e4e3c33061f0b019ac69sha256("h_gdpr_555ca404:0e27793f…")
MERKLE ROOT095b999c7b71fc4f222a0f498f7e85741a2ce8bc47ff25867b778865f7454297
Single-run day — no sibling nodes needed; leaf is the root.
INDEPENDENT VERIFICATION
# Recompute leaf
leaf = sha256("h_gdpr_555ca404:0e27793fb21b504b67a4389256098e9166c466a85640174d6442d51f8dbec6cd")
# assert leaf == "7bd1f2b5d16fcd56..."
# Walk the proof path
node = leaf
# node must equal merkle_root
assert node == "095b999c7b71fc4f..."