Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chain growth (Lemma 7): an honest chain grows by at least the successful rounds

Proved
BitcoinBackbone.chain_growth

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

backbonebitcoinchain-growthchain-qualitycommon-prefixformal-verificationgaray-kiayias-leonardosmathlibnakamoto-consensus

For a legal execution, honest parties p,qp, qp,q and rounds r<sr < sr<s: (chain p r).length + ∑_{i ∈ [r+1, s)} X i ≤ (chain q s).length. Every successful round adds a block to every honest party's chain by the next round.

Preamble
import Definitions.Def_BitcoinBackbone
Formal statement
theorem BitcoinBackbone.chain_growth (E : BitcoinBackbone.Execution) (hE : E.Legal)
    (p q : ℕ) (hp : p < E.n) (hq : q < E.n) (r s : ℕ) (hrs : r < s) :
    (E.chain p r).length + ∑ i ∈ Finset.Ico (r + 1) s, E.X i ≤ (E.chain q s).length := by sorry
Source
J. Garay, A. Kiayias, N. Leonardos, The Bitcoin Backbone Protocol: Analysis and Applications, EUROCRYPT 2015 (full version ePrint 2014/765): https://eprint.iacr.org/2014/765; Lemmas 7, 14, 15, Theorem 16, the chain-quality theorem; Bitcoin Core a773e1e33b349dc819b5a0edc1c7a4839dc73b48: GetBlockProof (chain.cpp) through the block mission's chainWork
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: BitcoinBackbone.chain_growth

Statement. Let EEE be an execution of the backbone model (a 5-tuple (n,mined,Z,base,advParent)(n, \mathrm{mined}, Z, \mathrm{base}, \mathrm{advParent})(n,mined,Z,base,advParent), see the definition read-back), and assume EEE is legal (the six conditions: no party has its mined-flag set in round 000; for p<np<np<n and r≥1r\ge1r≥1 the chain base(p,r)\mathrm{base}(p,r)base(p,r) is valid; for p<np<np<n every block of base(p,r)\mathrm{base}(p,r)base(p,r) has round <r<r<r; for all p,q<np,q<np,q<n and all rrr, ∣Cq(r)∣≤∣base(p,r+1)∣|\mathcal{C}_q(r)| \le |\mathrm{base}(p,r+1)|∣Cq​(r)∣≤∣base(p,r+1)∣; for j<Zrj<Z_rj<Zr​ the chain advParent(r,j)\mathrm{advParent}(r,j)advParent(r,j) is valid and all its blocks have round ≤r\le r≤r). Let p,qp, qp,q be natural numbers with p<np < np<n and q<nq < nq<n (so n≥1n \ge 1n≥1 is forced), and let r,sr, sr,s be natural numbers with r<sr < sr<s (strict). Then

∣Cp(r)∣  +  ∑i=r+1s−1Xi  ≤  ∣Cq(s)∣.|\mathcal{C}_p(r)| \;+\; \sum_{i=r+1}^{s-1} X_i \;\le\; |\mathcal{C}_q(s)| .∣Cp​(r)∣+i=r+1∑s−1​Xi​≤∣Cq​(s)∣.

Meaning of the symbols.

  • Cp(r)\mathcal{C}_p(r)Cp​(r) is party ppp's chain at the end of round rrr: Cp(0)=[ ]\mathcal{C}_p(0) = [\,]Cp​(0)=[], and for r≥1r \ge 1r≥1 it is base(p,r)\mathrm{base}(p,r)base(p,r) with the block honest(p,r)\mathsf{honest}(p,r)honest(p,r) appended if mined(p,r)=true\mathrm{mined}(p,r) = \mathtt{true}mined(p,r)=true, and base(p,r)\mathrm{base}(p,r)base(p,r) itself otherwise. ∣⋅∣|\cdot|∣⋅∣ is list length.
  • Xi∈{0,1}X_i \in \{0,1\}Xi​∈{0,1} equals 111 exactly when at least one party index p′<np' < np′<n has mined(p′,i)=true\mathrm{mined}(p', i) = \mathtt{true}mined(p′,i)=true, and 000 otherwise.
  • The sum runs over the half-open integer interval {r+1,…,s−1}\{r+1, \dots, s-1\}{r+1,…,s−1}: it excludes round rrr and round sss themselves. When s=r+1s = r+1s=r+1 the interval is empty and the sum is 000, so the statement reduces to ∣Cp(r)∣≤∣Cq(r+1)∣|\mathcal{C}_p(r)| \le |\mathcal{C}_q(r+1)|∣Cp​(r)∣≤∣Cq​(r+1)∣.

Edge cases made explicit. p=qp = qp=q is allowed. r=0r = 0r=0 is allowed, in which case ∣Cp(0)∣=0|\mathcal{C}_p(0)| = 0∣Cp​(0)∣=0 and the claim is ∑i=1s−1Xi≤∣Cq(s)∣\sum_{i=1}^{s-1} X_i \le |\mathcal{C}_q(s)|∑i=1s−1​Xi​≤∣Cq​(s)∣. The hypothesis λ\lambdaλ-typicality does not appear in this theorem; only legality is assumed. Nothing is claimed about prefix relations between the two chains, only about their lengths. If n=0n = 0n=0 the hypotheses p<np<np<n, q<nq<nq<n are unsatisfiable and the statement is vacuous.

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

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Oct 29, 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