Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The tail of the distribution in closed form

Proved
BitcoinSelfishMining.tail_sum

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: ∑n′plead(n+2)=p1(α1−α)21−α1−2α\sum'_{n} p_{\text{lead}(n+2)} = p_1 \left(\frac{\alpha}{1-\alpha}\right)^2 \frac{1-\alpha}{1-2\alpha}∑n′​plead(n+2)​=p1​(1−αα​)21−2α1−α​. A geometric series with ratio α/(1−α)<1\alpha/(1-\alpha) < 1α/(1−α)<1.

Preamble
import Definitions.Def_BitcoinSelfishMining
Formal statement
theorem BitcoinSelfishMining.tail_sum (α : ℝ) (h0 : 0 < α) (h1 : α < 1 / 2) :
    ∑' n : ℕ, BitcoinSelfishMining.stationary α (.lead (n + 2)) =
      BitcoinSelfishMining.stationary α (.lead 0) * (α / (1 - α)) ^ 2 * (1 - α) / (1 - 2 * α) := 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.tail_sum

Let α\alphaα be a real number with 0<α0<\alpha0<α and α<12\alpha<\tfrac12α<21​ (both hypotheses named and usable). Then

∑n=0∞′  πα(leadn+2)  =  πα(lead0)⋅(α1−α)2⋅(1−α)1−2α.\sum_{n=0}^{\infty}{}'\;\pi_\alpha(\mathrm{lead}_{n+2}) \;=\; \frac{\pi_\alpha(\mathrm{lead}_0)\cdot\left(\dfrac{\alpha}{1-\alpha}\right)^{2}\cdot(1-\alpha)}{1-2\alpha}.n=0∑∞​′πα​(leadn+2​)=1−2απα​(lead0​)⋅(1−αα​)2⋅(1−α)​.

The left-hand side is Mathlib's tsum over n∈Nn\in\mathbb{N}n∈N of the values of the custom family πα=\pi_\alpha=πα​= stationary α\alphaα at the states lead2,lead3,…\mathrm{lead}_2,\mathrm{lead}_3,\dotslead2​,lead3​,… (i.e. the lead states with index at least 222; the states lead0\mathrm{lead}_0lead0​ and lead1\mathrm{lead}_1lead1​ are excluded from the sum); it equals the sum of the series when that family is summable and 000 otherwise. The right-hand side is parsed as ((πα(lead0)⋅(α/(1−α))2)⋅(1−α)) / (1−2α)\big(\big(\pi_\alpha(\mathrm{lead}_0)\cdot(\alpha/(1-\alpha))^2\big)\cdot(1-\alpha)\big)\,/\,(1-2\alpha)((πα​(lead0​)⋅(α/(1−α))2)⋅(1−α))/(1−2α); under α<12\alpha<\tfrac12α<21​ both 1−α1-\alpha1−α and 1−2α1-2\alpha1−2α are non-zero, so these divisions are genuine.

Unfolding πα(leadm)=(α/(1−α))m⋅c\pi_\alpha(\mathrm{lead}_m) = (\alpha/(1-\alpha))^m\cdot cπα​(leadm​)=(α/(1−α))m⋅c with c=(α−2α2)/D(α)c = (\alpha-2\alpha^2)/D(\alpha)c=(α−2α2)/D(α), D(α)=2α3−4α2+1D(\alpha)=2\alpha^3-4\alpha^2+1D(α)=2α3−4α2+1 (real division by zero equal to 000, so c=0c=0c=0 if D(α)=0D(\alpha)=0D(α)=0) and ρ=α/(1−α)\rho=\alpha/(1-\alpha)ρ=α/(1−α), the statement reads

∑n=0∞′  ρ n+2 c  =  c⋅ρ2⋅(1−α)1−2αfor every α∈(0,12).\sum_{n=0}^{\infty}{}'\;\rho^{\,n+2}\,c \;=\; \frac{c\cdot\rho^{2}\cdot(1-\alpha)}{1-2\alpha}\qquad\text{for every }\alpha\in(0,\tfrac12).n=0∑∞​′ρn+2c=1−2αc⋅ρ2⋅(1−α)​for every α∈(0,21​).

No γ\gammaγ and no transition weights appear.

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