Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The relative revenue equals the paper's closed form (10)

Proved
BitcoinSelfishMining.relative_revenue

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 and any γ\gammaγ: relativeRevenue α γ = closedForm α γ, i.e. R=α(1−α)2(4α+γ(1−2α))−α31−α(1+(2−α)α)R = \frac{\alpha(1-\alpha)^2(4\alpha + \gamma(1-2\alpha)) - \alpha^3}{1 - \alpha(1 + (2-\alpha)\alpha)}R=1−α(1+(2−α)α)α(1−α)2(4α+γ(1−2α))−α3​.

Preamble
import Definitions.Def_BitcoinSelfishMining
Formal statement
theorem BitcoinSelfishMining.relative_revenue (α γ : ℝ) (h0 : 0 < α) (h1 : α < 1 / 2) :
    BitcoinSelfishMining.relativeRevenue α γ = BitcoinSelfishMining.closedForm α γ := 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.relative_revenue

Let α,γ\alpha,\gammaα,γ be real numbers with 0<α0<\alpha0<α and α<12\alpha<\tfrac12α<21​ (named, usable hypotheses) and no hypothesis on γ\gammaγ (any real). Then

Rα,γ  =  C(α,γ),R_{\alpha,\gamma} \;=\; C(\alpha,\gamma),Rα,γ​=C(α,γ),

where both sides are custom quantities, unfolded as follows.

Left-hand side Rα,γR_{\alpha,\gamma}Rα,γ​ is relativeRevenue α γ\alpha\,\gammaαγ:

Rα,γ=rα,γpoolrα,γpool+rα,γoth,equal to 0 if rα,γpool+rα,γoth=0,R_{\alpha,\gamma} = \frac{r^{\mathrm{pool}}_{\alpha,\gamma}}{r^{\mathrm{pool}}_{\alpha,\gamma} + r^{\mathrm{oth}}_{\alpha,\gamma}},\qquad\text{equal to } 0 \text{ if } r^{\mathrm{pool}}_{\alpha,\gamma}+r^{\mathrm{oth}}_{\alpha,\gamma}=0,Rα,γ​=rα,γpool​+rα,γoth​rα,γpool​​,equal to 0 if rα,γpool​+rα,γoth​=0,

with

rα,γpool=πα(zero) gpool(zero)+πα(tie) gpool(tie)+∑n=0∞′ πα(leadn) gpool(leadn),rα,γoth=πα(zero) goth(zero)+πα(tie) goth(tie)+∑n=0∞′ πα(leadn) goth(leadn),r^{\mathrm{pool}}_{\alpha,\gamma} = \pi_\alpha(\mathrm{zero})\,g^{\mathrm{pool}}(\mathrm{zero}) + \pi_\alpha(\mathrm{tie})\,g^{\mathrm{pool}}(\mathrm{tie}) + \sum_{n=0}^{\infty}{}'\,\pi_\alpha(\mathrm{lead}_n)\,g^{\mathrm{pool}}(\mathrm{lead}_n),\qquad r^{\mathrm{oth}}_{\alpha,\gamma} = \pi_\alpha(\mathrm{zero})\,g^{\mathrm{oth}}(\mathrm{zero}) + \pi_\alpha(\mathrm{tie})\,g^{\mathrm{oth}}(\mathrm{tie}) + \sum_{n=0}^{\infty}{}'\,\pi_\alpha(\mathrm{lead}_n)\,g^{\mathrm{oth}}(\mathrm{lead}_n),rα,γpool​=πα​(zero)gpool(zero)+πα​(tie)gpool(tie)+n=0∑∞​′πα​(leadn​)gpool(leadn​),rα,γoth​=πα​(zero)goth(zero)+πα​(tie)goth(tie)+n=0∑∞​′πα​(leadn​)goth(leadn​),

each tail being Mathlib's tsum (equal to 000 when the family is not summable). Here πα\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(α) with D(α)=2α3−4α2+1D(\alpha)=2\alpha^3-4\alpha^2+1D(α)=2α3−4α2+1 and real division by zero equal to 000. The per-state expected gains (dropping the subscript α,γ\alpha,\gammaα,γ) are, with weights p(pool)=αp(\mathrm{pool})=\alphap(pool)=α, p(honestOnPool)=(1−α)γp(\mathrm{honestOnPool})=(1-\alpha)\gammap(honestOnPool)=(1−α)γ, p(honestOnOthers)=(1−α)(1−γ)p(\mathrm{honestOnOthers})=(1-\alpha)(1-\gamma)p(honestOnOthers)=(1−α)(1−γ):

gpool(zero)=0, gpool(tie)=2α+(1−α)γ, gpool(lead0)=0, gpool(lead1)=2(1−α)γ+2(1−α)(1−γ), gpool(leadm+2)=(1−α)γ+(1−α)(1−γ);g^{\mathrm{pool}}(\mathrm{zero})=0,\ g^{\mathrm{pool}}(\mathrm{tie})=2\alpha+(1-\alpha)\gamma,\ g^{\mathrm{pool}}(\mathrm{lead}_0)=0,\ g^{\mathrm{pool}}(\mathrm{lead}_1)=2(1-\alpha)\gamma+2(1-\alpha)(1-\gamma),\ g^{\mathrm{pool}}(\mathrm{lead}_{m+2})=(1-\alpha)\gamma+(1-\alpha)(1-\gamma);gpool(zero)=0, gpool(tie)=2α+(1−α)γ, gpool(lead0​)=0, gpool(lead1​)=2(1−α)γ+2(1−α)(1−γ), gpool(leadm+2​)=(1−α)γ+(1−α)(1−γ); goth(zero)=(1−α)γ+(1−α)(1−γ), goth(tie)=(1−α)γ+2(1−α)(1−γ), goth(leadn)=0.g^{\mathrm{oth}}(\mathrm{zero})=(1-\alpha)\gamma+(1-\alpha)(1-\gamma),\ g^{\mathrm{oth}}(\mathrm{tie})=(1-\alpha)\gamma+2(1-\alpha)(1-\gamma),\ g^{\mathrm{oth}}(\mathrm{lead}_n)=0 .goth(zero)=(1−α)γ+(1−α)(1−γ), goth(tie)=(1−α)γ+2(1−α)(1−γ), goth(leadn​)=0.

Right-hand side C(α,γ)C(\alpha,\gamma)C(α,γ) is closedForm α γ\alpha\,\gammaαγ:

C(α,γ)=α(1−α)2(4α+γ(1−2α))−α31−α(1+(2−α)α),C(\alpha,\gamma) = \frac{\alpha(1-\alpha)^2\big(4\alpha+\gamma(1-2\alpha)\big) - \alpha^3}{1-\alpha\big(1+(2-\alpha)\alpha\big)},C(α,γ)=1−α(1+(2−α)α)α(1−α)2(4α+γ(1−2α))−α3​,

whose denominator expands to 1−α−2α2+α31-\alpha-2\alpha^2+\alpha^31−α−2α2+α3 (a different polynomial from D(α)D(\alpha)D(α)), and which is 000 by the division convention whenever that denominator vanishes.

The equality is asserted for every α∈(0,12)\alpha\in(0,\tfrac12)α∈(0,21​) and every real γ\gammaγ, including γ\gammaγ outside [0,1][0,1][0,1]. It is an equality of two real numbers each of which is defined via total operations (division by zero giving 000, non-summable tsum giving 000), so no side condition about non-vanishing denominators or summability is part of the claim.

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