← 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.
RUN ID
0fad52a1610cbd0303a11d80f7b765fc
CHAIN HEAD & LEAF
CHAIN HEAD4f76a4ecfe5d0ed37874c30efa6b9f32596e862b65673b83b92d1b2a8f148cff
LEAF HASHc97224551a7d7a2f90396f2e649921bf643ae8954d0111be5b5dfa2cba68dee0sha256("0fad52a1610cbd0303a11d80f7b765fc:4f76a4ec…")
MERKLE ROOTdc84ac430f41ffee154d465be968a39b600ac9b87bc19e2599f92982d9819cc3
Single-run day — no sibling nodes needed; leaf is the root.
INDEPENDENT VERIFICATION
# Recompute leaf
leaf = sha256("0fad52a1610cbd0303a11d80f7b765fc:4f76a4ecfe5d0ed37874c30efa6b9f32596e862b65673b83b92d1b2a8f148cff")
# assert leaf == "c97224551a7d7a2f..."
# Walk the proof path
node = leaf
# node must equal merkle_root
assert node == "dc84ac430f41ffee..."