Advancing one interval halves the subsidy
ProvedBitcoinSubsidy.subsidy_halvingFor every block height ,
Moving forward by exactly one halving interval halves the subsidy, with the remainder discarded. This is the defining recurrence of the schedule stated directly on the implementation; iterating it from height reproduces the sequence bitcoin.
import Definitions.Def_BitcoinSubsidy
theorem BitcoinSubsidy.subsidy_halving (height : Nat) :
coreSubsidy (height + halvingInterval) = coreSubsidy height / 2 := 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: theorem BitcoinSubsidy.subsidy_halving
Binders. One universally quantified natural number (named "height"). No hypotheses; the claim is made for every , including and arbitrarily large .
Statement. For every ,
where and the division by on the right-hand side is truncating natural-number division (so if is odd, the right-hand side is , and if the right-hand side is ).
Both sides unfold via the definition: for any height , with ,
with , , and the second branch a right shift of by bits. Note that , so the left-hand side uses one more halving than the right-hand side's inner value.
What is literally asserted. Moving the height forward by exactly changes the value from to its truncated half. The statement covers, in particular:
- heights with , for which the left-hand side falls into the explicit branch and equals , so the statement there asserts ;
- heights with , for which both sides are by the first branch;
- the general case , where the statement asserts , an identity between two truncated divisions.
The statement is an equality (not merely ), it concerns only shifts by exactly one interval of (not by a general multiple), and it says nothing about specSubsidy.
The file supplies only the statement; the proof is left as a placeholder.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.