← run detailMerkle Inclusion Proof
✓ 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 HEAD898dafa045e0ad9595bb09c6581f39edf983022e4f9633b547e42050f6750659
LEAF HASH6c6f8b03599e1ad3e351355b9f90fc218a630fe1759021dc511ff44a5a2dd455sha256("run_4187:898dafa0…")
MERKLE ROOT03bff7c39f8e50f1fed26e72c02a17654295cf80698df6120f18b513d0646381
PROOF PATH — SIBLING HASHES
At each level, combine current node with sibling to compute parent. Repeat until root.
L1RIGHTa5d247d37661b7235494be15b3c330176f4d1c11a19d463b601e8ca8f32de1ae
INDEPENDENT VERIFICATION
# Recompute leaf
leaf = sha256("run_4187:898dafa045e0ad9595bb09c6581f39edf983022e4f9633b547e42050f6750659")
# assert leaf == "6c6f8b03599e1ad3..."
# Walk the proof path
node = leaf
node = sha256(node + siblings[0]) # sibling is RIGHT
# node must equal merkle_root
assert node == "03bff7c39f8e50f1..."