← 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 HEAD56fe4352374ba51315e4ddd4aec1e29a0a6198e7fda8871f7272f2d03c153367
LEAF HASHed5f3b1bb0d2af2bc227ccf66e938b121917ee2498bb1fda97537589f0806affsha256("h_cost_da287bf1:56fe4352…")
MERKLE ROOT095b999c7b71fc4f222a0f498f7e85741a2ce8bc47ff25867b778865f7454297
Single-run day — no sibling nodes needed; leaf is the root.
INDEPENDENT VERIFICATION
# Recompute leaf
leaf = sha256("h_cost_da287bf1:56fe4352374ba51315e4ddd4aec1e29a0a6198e7fda8871f7272f2d03c153367")
# assert leaf == "ed5f3b1bb0d2af2b..."
# Walk the proof path
node = leaf
# node must equal merkle_root
assert node == "095b999c7b71fc4f..."