← 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 HEAD716a1fd3dec50096c7b56d1f269cb0f91482e383723c7d49c24bac7f02304dc9
LEAF HASHa5d247d37661b7235494be15b3c330176f4d1c11a19d463b601e8ca8f32de1aesha256("run_meridian_001:716a1fd3…")
MERKLE ROOT03bff7c39f8e50f1fed26e72c02a17654295cf80698df6120f18b513d0646381
PROOF PATH — SIBLING HASHES
At each level, combine current node with sibling to compute parent. Repeat until root.
L1LEFT6c6f8b03599e1ad3e351355b9f90fc218a630fe1759021dc511ff44a5a2dd455
INDEPENDENT VERIFICATION
# Recompute leaf
leaf = sha256("run_meridian_001:716a1fd3dec50096c7b56d1f269cb0f91482e383723c7d49c24bac7f02304dc9")
# assert leaf == "a5d247d37661b723..."
# Walk the proof path
node = leaf
node = sha256(siblings[0] + node) # sibling is LEFT
# node must equal merkle_root
assert node == "03bff7c39f8e50f1..."