The genesis coinbase hashes to the recorded merkle root
ProvedBitcoinSer.genesis_merkle: the transcribed genesis coinbase transaction, serialized and double-SHA-256'd by the transcribed algorithms, gives exactly 4a5e1e4b…eda33b. Checked by kernel evaluation of the full SHA-256.
import Definitions.Def_BitcoinSer
theorem BitcoinSer.genesis_merkle : BitcoinSer.txid BitcoinSer.genesisCoinbase = BitcoinSer.genesisMerkleRoot := by sorry
Read-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: BitcoinSer.genesis_merkle
Binders and hypothesis. None. A closed equality between two concrete byte strings.
Conclusion.
Unfolding the left side. : the file's SHA-256 applied twice to the witness-free serialization of the transaction. The constant genesisCoinbase has version , exactly one input, exactly one output and lock time . The input's previous outpoint is 32 zero bytes with index ; its script is the literal 77-byte genesisScriptSig ( followed by 69 ASCII bytes of English text); its sequence is ; its witness list is empty. The output has value and the literal 67-byte genesisOutputScript (, 65 bytes starting , then ). With the flag is , so the serialization is
a string of bytes (the two "" are CompactSize counts of one input and one output; and are the one-byte CompactSize script lengths, both below 253). No marker/flags bytes and no witness section appear. The first SHA-256 pads 204 bytes to 256 (four 64-byte chunks) and the second pads the 32-byte digest to one chunk.
Unfolding the right side. genesisMerkleRoot is the literal 32-byte list beginning and ending . The comparison is against the bytes in the order written.
Relation to other constants. The record genesisHeader has its merkle-root field defined as , so this theorem is equivalently the statement that genesisHeader.merkleRoot equals the literal genesisMerkleRoot; but the theorem is phrased in terms of txid and does not mention the header. Because the witness list is empty, would produce the same bytes and would coincide with , but that is not stated.
Nature of the claim. A ground equality over decidable data, verifiable in principle by evaluation; it tests the transaction serializer (CompactSize, little-endian, signed 64-bit amount) and the SHA-256 implementation together on one example.
What is not said. Nothing about any merkle-tree computation — the file has no merkle-tree function; the "merkle root" here is just the txid of one transaction, by the author's choice of constants. Nothing about the block hash (that is genesis_hash). Nothing about wtxid, genesisBlock, or weights. Nothing about any transaction other than this one, nor about SHA-256 on any other input. One 32-byte ground equality.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.