The block subsidy is always a valid amount
ProvedBitcoinSubsidy.subsidy_le_maxMoneyFor every block height ,
Since amounts are natural numbers here, this is exactly the MoneyRange condition of consensus/amount.h applied to the subsidy: it is nonnegative and at most MAX_MONEY. The bound is far from tight, as the subsidy never exceeds satoshi; the point is that the subsidy term of the block reward is always a representable, in-range amount.
import Definitions.Def_BitcoinSubsidy
theorem BitcoinSubsidy.subsidy_le_maxMoney (height : Nat) : coreSubsidy height ≤ MAX_MONEY := 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: theorem BitcoinSubsidy.subsidy_le_maxMoney
Binders. One universally quantified natural number (named "height"). No hypotheses; the claim is made for every , including and arbitrarily large .
Statement. For every ,
a non-strict inequality (; equality is permitted by the statement) of natural numbers. The right-hand side is the constant
The left-hand side is, with (truncating division by ),
where and the second branch is a right shift of by bits (truncating division by ).
What is literally asserted. The subsidy of any single height, as computed by coreSubsidy, is at most . This is a bound on one height's value, not on any sum of values; it does not involve issuedBelow, intervalSum, or specSubsidy. At the left-hand side is by definition, so the statement there reads ; for every other the left-hand side is a truncated quotient of by a power of two, or .
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.