Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cumulative issuance is bounded by the final total

Proved
BitcoinSubsidy.issuance_le_total

by pitimespi · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

bitcoinbitcoin-mainnetblock-subsidyconsensusformal-verificationissuance

For every n∈Nn \in \mathbb Nn∈N,

issuedBelow(n)≤2,099,999,997,690,000.\mathrm{issuedBelow}(n) \le 2{,}099{,}999{,}997{,}690{,}000 .issuedBelow(n)≤2,099,999,997,690,000.

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.

Preamble
import Definitions.Def_BitcoinSubsidy
Formal statement
theorem BitcoinSubsidy.issuance_le_total (n : Nat) : issuedBelow n ≤ 2099999997690000 := by sorry
Source
Bitcoin Core a773e1e33b349dc819b5a0edc1c7a4839dc73b48, GetBlockSubsidy, src/validation.cpp lines 1833-1844: https://github.com/bitcoin/bitcoin/blob/a773e1e33b349dc819b5a0edc1c7a4839dc73b48/src/validation.cpp#L1833; COIN and MAX_MONEY, src/consensus/amount.h: https://github.com/bitcoin/bitcoin/blob/a773e1e33b349dc819b5a0edc1c7a4839dc73b48/src/consensus/amount.h; nSubsidyHalvingInterval = 210000, CMainParams, src/kernel/chainparams.cpp: https://github.com/bitcoin/bitcoin/blob/a773e1e33b349dc819b5a0edc1c7a4839dc73b48/src/kernel/chainparams.cpp
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 n∈N={0,1,2,… }n \in \mathbb{N} = \{0, 1, 2, \dots\}n∈N={0,1,2,…}. No hypotheses; the claim is made for every nnn, including n=0n = 0n=0 and arbitrarily large nnn.

Statement. For every n∈Nn \in \mathbb{N}n∈N,

issuedBelow(n)≤2,099,999,997,690,000,\mathrm{issuedBelow}(n) \le 2{,}099{,}999{,}997{,}690{,}000,issuedBelow(n)≤2,099,999,997,690,000,

a non-strict inequality (≤\le≤, equality permitted) between a natural number and the explicit numeral 2,099,999,997,690,0002{,}099{,}999{,}997{,}690{,}0002,099,999,997,690,000 (sixteen digits: 209999999769000020999999976900002099999997690000). The right-hand side is a literal number written in the statement, not a named constant; it is not MAX_MONEY (which is 2,100,000,000,000,0002{,}100{,}000{,}000{,}000{,}0002,100,000,000,000,000) and is not expressed via COIN, intervalSum, or zeroHeight. Its difference from MAX_MONEY is 2,310,0002{,}310{,}0002,310,000.

The left-hand side is defined recursively by issuedBelow(0)=0\mathrm{issuedBelow}(0) = 0issuedBelow(0)=0 and issuedBelow(n+1)=issuedBelow(n)+coreSubsidy(n)\mathrm{issuedBelow}(n+1) = \mathrm{issuedBelow}(n) + \mathrm{coreSubsidy}(n)issuedBelow(n+1)=issuedBelow(n)+coreSubsidy(n), so

issuedBelow(n)=∑i=0n−1coreSubsidy(i)\mathrm{issuedBelow}(n) = \sum_{i=0}^{n-1} \mathrm{coreSubsidy}(i)issuedBelow(n)=i=0∑n−1​coreSubsidy(i)

(sum over heights 0,…,n−10, \dots, n-10,…,n−1; height nnn excluded; 000 when n=0n = 0n=0), with

coreSubsidy(i)={0if 64≤⌊i/210,000⌋,⌊5,000,000,000/2⌊i/210,000⌋⌋otherwise,\mathrm{coreSubsidy}(i) = \begin{cases} 0 & \text{if } 64 \le \lfloor i / 210{,}000 \rfloor,\\[4pt] \left\lfloor 5{,}000{,}000{,}000 / 2^{\lfloor i / 210{,}000 \rfloor} \right\rfloor & \text{otherwise}, \end{cases}coreSubsidy(i)={0⌊5,000,000,000/2⌊i/210,000⌋⌋​if 64≤⌊i/210,000⌋,otherwise,​

where 5,000,000,000=50⋅COIN5{,}000{,}000{,}000 = 50 \cdot \mathrm{COIN}5,000,000,000=50⋅COIN, COIN=108\mathrm{COIN} = 10^8COIN=108, 210,000=halvingInterval210{,}000 = \mathrm{halvingInterval}210,000=halvingInterval, divisions truncate, and the second branch is a right shift of 5,000,000,0005{,}000{,}000{,}0005,000,000,000 by ⌊i/210,000⌋\lfloor i / 210{,}000 \rfloor⌊i/210,000⌋ bits.

What is literally asserted. For every nnn, the cumulative sum of coreSubsidy over heights 000 through n−1n-1n−1 never exceeds 2,099,999,997,690,0002{,}099{,}999{,}997{,}690{,}0002,099,999,997,690,000; reaching exactly that number is allowed. The statement does not assert that this bound is attained for any nnn (that is a separate theorem, issuance_total), nor anything about specSubsidy.

The file supplies only the statement; the proof is left as a placeholder.

Human review
  • Endorsed by Shuze Chen · Oct 26, 2026

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Oct 26, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me