Cumulative issuance is bounded by the final total
ProvedBitcoinSubsidy.issuance_le_totalFor every ,
The cumulative subsidy below any height is at most the total reached at the zero height: below it the sum is still growing, and from it on every further term is zero, so the sum is constant. This is the exact form of the supply bound for the subsidy schedule alone.
import Definitions.Def_BitcoinSubsidy
theorem BitcoinSubsidy.issuance_le_total (n : Nat) : issuedBelow n ≤ 2099999997690000 := 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.issuance_le_total
Binders. One universally quantified variable: a natural number . No hypotheses; the claim is made for every , including and arbitrarily large .
Statement. For every ,
a non-strict inequality (, equality permitted) between a natural number and the explicit numeral (sixteen digits: ). The right-hand side is a literal number written in the statement, not a named constant; it is not MAX_MONEY (which is ) and is not expressed via COIN, intervalSum, or zeroHeight. Its difference from MAX_MONEY is .
The left-hand side is defined recursively by and , so
(sum over heights ; height excluded; when ), with
where , , , divisions truncate, and the second branch is a right shift of by bits.
What is literally asserted. For every , the cumulative sum of coreSubsidy over heights through never exceeds ; reaching exactly that number is allowed. The statement does not assert that this bound is attained for any (that is a separate theorem, issuance_total), nor anything 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.