The genesis header hashes to hashGenesisBlock
ProvedBitcoinSer.genesis_hash: the transcribed genesis header (with the merkle root computed from the coinbase) double-SHA-256's to 000000000019d668…0a8ce26f, the mainnet genesis hash of chainparams.cpp. Checked by kernel evaluation; this ties the hash transcription to the real chain.
import Definitions.Def_BitcoinSer
theorem BitcoinSer.genesis_hash : BitcoinSer.headerHash BitcoinSer.genesisHeader = BitcoinSer.genesisHash := 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_hash
Binders and hypothesis. None. This is a closed statement about two concrete byte strings; there are no variables and no assumptions.
Conclusion. The header hash of the file's constant genesisHeader equals the file's constant 32-byte list genesisHash:
Unfolding the left side. — the file's SHA-256 applied twice to the serialized header. The constant genesisHeader is the record with: version (as a signed integer); previous-block field equal to 32 zero bytes; merkle-root field equal to , i.e. the double-SHA-256 of the witness-free serialization of the constant coinbase transaction (version ; one input with outpoint (32 zero bytes, ), the 77-byte genesisScriptSig, sequence , empty witness; one output of value with the 67-byte genesisOutputScript; lock time ); time ; bits ; nonce . Its serialization is the 80-byte string
with all integers little-endian. Note that the merkle-root slot is a computed value: the statement implicitly involves the correctness of the whole transaction serializer and of the SHA-256 implementation on the 204-byte coinbase serialization, and then of SHA-256 again on the 80-byte header — four SHA-256 evaluations in all, each on inputs of one or more 64-byte padded chunks (the 204-byte message pads to 256 bytes, i.e. 4 chunks; the 80-byte header pads to 128 bytes, 2 chunks; each 32-byte intermediate pads to 1 chunk).
Unfolding the right side. genesisHash is the literal 32-byte list . Its last five bytes are zero; the file's comment describes it as the byte-reversal of a displayed hex string, but the theorem compares against the list as written, in the order written.
Nature of the claim. Both sides are closed terms over decidable data, so the statement is a single ground equality that is in principle verifiable by evaluation. It asserts in one stroke that the serializer, the double-SHA-256, and the two constant tables agree on this one example, and in particular (since the txid sits inside the hashed data) that has the specific value that makes the final hash come out as genesisHash — though the statement does not name that intermediate value.
What is not said. The theorem does not state that equals the literal genesisMerkleRoot (that is the separate genesis_merkle). It does not state that genesisHeader.merkleRoot equals genesisMerkleRoot. It makes no claim about genesisBlock, about blockWeight, about any header other than this one, or about the SHA-256 function on any other input. It does not say the hash is below any target, nor anything about the display order of hashes. It is one ground equality between two 32-byte strings.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.