Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

With no honest miners on the pool's branch, the threshold is 1/3

Proved
BitcoinSelfishMining.threshold_gamma_zero

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

bitcoineyal-sirerformal-verificationgame-theorymarkov-chainmathlibminingselfish-mining

For 0<α<1/20 < \alpha < 1/20<α<1/2: relativeRevenue α 0 > α iff α>1/3\alpha > 1/3α>1/3.

Preamble
import Definitions.Def_BitcoinSelfishMining
Formal statement
theorem BitcoinSelfishMining.threshold_gamma_zero (α : ℝ) (h0 : 0 < α) (h1 : α < 1 / 2) :
    BitcoinSelfishMining.relativeRevenue α 0 > α ↔ α > 1 / 3 := by sorry
Source
I. Eyal, E. G. Sirer, Majority is not Enough: Bitcoin Mining is Vulnerable, Financial Cryptography 2014, arXiv:1311.0243, Section 4 (Figure 1, equations (7)-(11)): https://arxiv.org/abs/1311.0243
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: BitcoinSelfishMining.threshold_gamma_zero

Let α\alphaα be a real number with 0<α0<\alpha0<α and α<12\alpha<\tfrac12α<21​ (named, usable hypotheses). Then the following are equivalent (if and only if):

Rα,0>α⟺α>13,R_{\alpha,0} > \alpha \qquad\Longleftrightarrow\qquad \alpha > \tfrac13,Rα,0​>α⟺α>31​,

both inequalities strict, where Rα,0R_{\alpha,0}Rα,0​ is the custom relativeRevenue evaluated at γ=0\gamma=0γ=0. The right-hand side is the literal rational constant 13\tfrac1331​ (the statement does not mention profitThreshold).

Unfolding at γ=0\gamma=0γ=0. The outcome weights become p(pool)=αp(\mathrm{pool})=\alphap(pool)=α, p(honestOnPool)=(1−α)⋅0=0p(\mathrm{honestOnPool})=(1-\alpha)\cdot 0=0p(honestOnPool)=(1−α)⋅0=0, p(honestOnOthers)=(1−α)⋅(1−0)=1−αp(\mathrm{honestOnOthers})=(1-\alpha)\cdot(1-0)=1-\alphap(honestOnOthers)=(1−α)⋅(1−0)=1−α. Then

Rα,0=rα,0poolrα,0pool+rα,0oth(=0 if the denominator is 0),R_{\alpha,0} = \frac{r^{\mathrm{pool}}_{\alpha,0}}{r^{\mathrm{pool}}_{\alpha,0}+r^{\mathrm{oth}}_{\alpha,0}}\quad(=0\text{ if the denominator is }0),Rα,0​=rα,0pool​+rα,0oth​rα,0pool​​(=0 if the denominator is 0),

with

rα,0pool=πα(zero)⋅0+πα(tie) (2α+0⋅1+(1−α)⋅0)+∑n=0∞′ πα(leadn) gα,0pool(leadn),r^{\mathrm{pool}}_{\alpha,0} = \pi_\alpha(\mathrm{zero})\cdot 0 + \pi_\alpha(\mathrm{tie})\,(2\alpha + 0\cdot 1 + (1-\alpha)\cdot 0) + \sum_{n=0}^{\infty}{}'\,\pi_\alpha(\mathrm{lead}_n)\,g^{\mathrm{pool}}_{\alpha,0}(\mathrm{lead}_n),rα,0pool​=πα​(zero)⋅0+πα​(tie)(2α+0⋅1+(1−α)⋅0)+n=0∑∞​′πα​(leadn​)gα,0pool​(leadn​),

where gα,0pool(lead0)=0g^{\mathrm{pool}}_{\alpha,0}(\mathrm{lead}_0)=0gα,0pool​(lead0​)=0, gα,0pool(lead1)=0⋅2+(1−α)⋅2=2(1−α)g^{\mathrm{pool}}_{\alpha,0}(\mathrm{lead}_1)=0\cdot 2+(1-\alpha)\cdot 2 = 2(1-\alpha)gα,0pool​(lead1​)=0⋅2+(1−α)⋅2=2(1−α), gα,0pool(leadm+2)=0⋅1+(1−α)⋅1=1−αg^{\mathrm{pool}}_{\alpha,0}(\mathrm{lead}_{m+2})=0\cdot 1+(1-\alpha)\cdot 1 = 1-\alphagα,0pool​(leadm+2​)=0⋅1+(1−α)⋅1=1−α, and

rα,0oth=πα(zero) (0⋅1+(1−α)⋅1)+πα(tie) (0⋅1+(1−α)⋅2)+∑n=0∞′ πα(leadn)⋅0.r^{\mathrm{oth}}_{\alpha,0} = \pi_\alpha(\mathrm{zero})\,\big(0\cdot 1 + (1-\alpha)\cdot 1\big) + \pi_\alpha(\mathrm{tie})\,\big(0\cdot 1 + (1-\alpha)\cdot 2\big) + \sum_{n=0}^{\infty}{}'\,\pi_\alpha(\mathrm{lead}_n)\cdot 0 .rα,0oth​=πα​(zero)(0⋅1+(1−α)⋅1)+πα​(tie)(0⋅1+(1−α)⋅2)+n=0∑∞​′πα​(leadn​)⋅0.

Each ∑′\sum'∑′ is Mathlib's tsum over n∈Nn\in\mathbb{N}n∈N (000 if the family is not summable; the all-zero family sums to 000). πα\pi_\alphaπα​ is stationary α\alphaα: πα(zero)=(1−2α)/D(α)\pi_\alpha(\mathrm{zero})=(1-2\alpha)/D(\alpha)πα​(zero)=(1−2α)/D(α), πα(tie)=(1−α)(α−2α2)/D(α)\pi_\alpha(\mathrm{tie})=(1-\alpha)(\alpha-2\alpha^2)/D(\alpha)πα​(tie)=(1−α)(α−2α2)/D(α), πα(leadn)=(α/(1−α))n(α−2α2)/D(α)\pi_\alpha(\mathrm{lead}_n)=(\alpha/(1-\alpha))^n(\alpha-2\alpha^2)/D(\alpha)πα​(leadn​)=(α/(1−α))n(α−2α2)/D(α), D(α)=2α3−4α2+1D(\alpha)=2\alpha^3-4\alpha^2+1D(α)=2α3−4α2+1, with real division by zero equal to 000.

So the theorem asserts that, for every α∈(0,12)\alpha\in(0,\tfrac12)α∈(0,21​), the real number Rα,0R_{\alpha,0}Rα,0​ strictly exceeds α\alphaα exactly when α>13\alpha>\tfrac13α>31​; in particular for α∈(0,13]\alpha\in(0,\tfrac13]α∈(0,31​] it asserts Rα,0≤αR_{\alpha,0}\le\alphaRα,0​≤α. Nothing is said about α\alphaα outside (0,12)(0,\tfrac12)(0,21​).

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