← 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
challenge_challenge_run_meridian_002_claude-haiku-4-5-20251001_claude-haiku-4-5-20251001
CHAIN HEAD & LEAF
CHAIN HEADba930fe7bf547e386f5df8576b0ac9f055287551696e96b8a9149e0e8ef68071
LEAF HASH7f7a3765c3868099ba4f8f2db2f3ef9dc68840caad419ad64d04ddc484d42e78sha256("challenge_challenge_run_meridian_002_claude-haiku-4-5-20251001_claude-haiku-4-5-20251001:ba930fe7…")
MERKLE ROOT65988226cec31caaaacbbfbceba476105ee2be03b4caab4f34eaa081fc5e56ee
Single-run day — no sibling nodes needed; leaf is the root.
INDEPENDENT VERIFICATION
# Recompute leaf
leaf = sha256("challenge_challenge_run_meridian_002_claude-haiku-4-5-20251001_claude-haiku-4-5-20251001:ba930fe7bf547e386f5df8576b0ac9f055287551696e96b8a9149e0e8ef68071")
# assert leaf == "7f7a3765c3868099..."
# Walk the proof path
node = leaf
# node must equal merkle_root
assert node == "65988226cec31caa..."