Merkle root of a single hash
ProvedBitcoinMerkle.root_singleFor every , and hash , : a single hash is its own root and no level is processed, so the flag stays clear. In a block with only a coinbase, the Merkle root is the coinbase transaction id.
import Definitions.Def_BitcoinMerkle
theorem BitcoinMerkle.root_single {H : Type} [DecidableEq H] (c : H → H → H) (z : H) (a : H) :
BitcoinMerkle.computeMerkleRoot c z [a] = (a, false) := by sorryRead-back
What the Lean code literally says, in plain math · claude-fable-5-1 (independent sub-agent, blind: Lean code + auditor instructions only)
Read-back: BitcoinMerkle.root_single
Binders and assumptions. is an arbitrary type with decidable equality (for the Boolean is exactly when ). is an arbitrary two-argument operation and an arbitrary element; nothing is assumed about either. is an arbitrary element. There are no further hypotheses.
Conclusion.
an equality of ordered pairs in : the first component of the result on the singleton list is exactly itself (not , and not ), and the second component is exactly .
Unfolding (computeMerkleRoot). , where (rootLoop) on a list and Boolean is
with the first entry of or if , Boolean "or", (pairUp) given by , , , and (hasEqualPair) the Boolean , . On the loop test fails, so the loop body is never executed — in particular is not applied, so the self-pairing rule is not triggered, and is not evaluated; the result is .
What is and is not claimed. The statement concerns only one-element inputs. It asserts that the lone element is returned unchanged as the first component and that the mutation flag is . Neither nor influences the right-hand side; the claim holds for every and every . It says nothing about inputs of any other length.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.