Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The pool's revenue rate reduces to equation (8)

Proved
BitcoinSelfishMining.pool_revenue_eq

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γ: poolRevenue α γ =p0′(2α+γ(1−α))+p2⋅2(1−α)+(∑n′plead(n+2))(1−α)= p_{0'}(2\alpha + \gamma(1-\alpha)) + p_2 \cdot 2(1-\alpha) + \left(\sum'_{n} p_{\text{lead}(n+2)}\right)(1-\alpha)=p0′​(2α+γ(1−α))+p2​⋅2(1−α)+(∑n′​plead(n+2)​)(1−α), the paper's (8) with the k≥3k \ge 3k≥3 tail as a tsum.

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

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

rα,γpool  =  πα(tie)⋅(α⋅2+γ(1−α)⋅1)  +  πα(lead1)⋅((1−α)⋅2)  +  (∑n=0∞′ πα(leadn+2))⋅((1−α)⋅1).r^{\mathrm{pool}}_{\alpha,\gamma} \;=\; \pi_\alpha(\mathrm{tie})\cdot\big(\alpha\cdot 2 + \gamma(1-\alpha)\cdot 1\big) \;+\; \pi_\alpha(\mathrm{lead}_1)\cdot\big((1-\alpha)\cdot 2\big) \;+\; \Big(\sum_{n=0}^{\infty}{}'\,\pi_\alpha(\mathrm{lead}_{n+2})\Big)\cdot\big((1-\alpha)\cdot 1\big).rα,γpool​=πα​(tie)⋅(α⋅2+γ(1−α)⋅1)+πα​(lead1​)⋅((1−α)⋅2)+(n=0∑∞​′πα​(leadn+2​))⋅((1−α)⋅1).

Left-hand side. rα,γpoolr^{\mathrm{pool}}_{\alpha,\gamma}rα,γpool​ is the custom poolRevenue α γ\alpha\,\gammaαγ, the custom stateSum of s↦πα(s) gα,γpool(s)s\mapsto\pi_\alpha(s)\,g^{\mathrm{pool}}_{\alpha,\gamma}(s)s↦πα​(s)gα,γpool​(s):

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

with gα,γpool(s)=∑opα,γ(o)⋅poolGain(s,o)g^{\mathrm{pool}}_{\alpha,\gamma}(s)=\sum_o p_{\alpha,\gamma}(o)\cdot\mathrm{poolGain}(s,o)gα,γpool​(s)=∑o​pα,γ​(o)⋅poolGain(s,o), where pα,γ(pool)=αp_{\alpha,\gamma}(\mathrm{pool})=\alphapα,γ​(pool)=α, pα,γ(honestOnPool)=(1−α)γp_{\alpha,\gamma}(\mathrm{honestOnPool})=(1-\alpha)\gammapα,γ​(honestOnPool)=(1−α)γ, pα,γ(honestOnOthers)=(1−α)(1−γ)p_{\alpha,\gamma}(\mathrm{honestOnOthers})=(1-\alpha)(1-\gamma)pα,γ​(honestOnOthers)=(1−α)(1−γ), and poolGain\mathrm{poolGain}poolGain: (tie,pool)↦2(\mathrm{tie},\mathrm{pool})\mapsto 2(tie,pool)↦2, (tie,honestOnPool)↦1(\mathrm{tie},\mathrm{honestOnPool})\mapsto 1(tie,honestOnPool)↦1, (tie,honestOnOthers)↦0(\mathrm{tie},\mathrm{honestOnOthers})\mapsto 0(tie,honestOnOthers)↦0, (lead1,pool)↦0(\mathrm{lead}_1,\mathrm{pool})\mapsto 0(lead1​,pool)↦0, (lead1,either honest)↦2(\mathrm{lead}_1,\text{either honest})\mapsto 2(lead1​,either honest)↦2, (leadm+2,pool)↦0(\mathrm{lead}_{m+2},\mathrm{pool})\mapsto 0(leadm+2​,pool)↦0, (leadm+2,either honest)↦1(\mathrm{lead}_{m+2},\text{either honest})\mapsto 1(leadm+2​,either honest)↦1, and 000 otherwise (all of zero\mathrm{zero}zero and all of lead0\mathrm{lead}_0lead0​). Hence

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

So the left-hand side equals πα(tie)(2α+(1−α)γ)+∑n′πα(leadn) gα,γpool(leadn)\pi_\alpha(\mathrm{tie})\big(2\alpha+(1-\alpha)\gamma\big) + \sum'_{n}\pi_\alpha(\mathrm{lead}_n)\,g^{\mathrm{pool}}_{\alpha,\gamma}(\mathrm{lead}_n)πα​(tie)(2α+(1−α)γ)+∑n′​πα​(leadn​)gα,γpool​(leadn​), where the tail is a single tsum over all n∈Nn\in\mathbb{N}n∈N whose n=0n=0n=0 term is 000, whose n=1n=1n=1 term is πα(lead1)⋅2((1−α)γ+(1−α)(1−γ))\pi_\alpha(\mathrm{lead}_1)\cdot 2\big((1-\alpha)\gamma+(1-\alpha)(1-\gamma)\big)πα​(lead1​)⋅2((1−α)γ+(1−α)(1−γ)), and whose terms for n≥2n\ge 2n≥2 are πα(leadn)((1−α)γ+(1−α)(1−γ))\pi_\alpha(\mathrm{lead}_n)\big((1-\alpha)\gamma+(1-\alpha)(1-\gamma)\big)πα​(leadn​)((1−α)γ+(1−α)(1−γ)); this tsum is 000 if that family is not summable.

Right-hand side. Three explicit terms: the tie\mathrm{tie}tie term with coefficient 2α+γ(1−α)2\alpha+\gamma(1-\alpha)2α+γ(1−α); the lead1\mathrm{lead}_1lead1​ term with coefficient 2(1−α)2(1-\alpha)2(1−α); and a separate tsum over n∈Nn\in\mathbb{N}n∈N of πα(leadn+2)\pi_\alpha(\mathrm{lead}_{n+2})πα​(leadn+2​) (the lead states of index ≥2\ge 2≥2), multiplied by (1−α)(1-\alpha)(1−α). This second tsum is likewise 000 if the family n↦πα(leadn+2)n\mapsto\pi_\alpha(\mathrm{lead}_{n+2})n↦πα​(leadn+2​) is not summable. The two sides therefore involve two different tsums, each with its own summability convention, and the statement equates them after the finite bookkeeping above. The right-hand side uses the factor (1−α)(1-\alpha)(1−α) where the left-hand side has (1−α)γ+(1−α)(1−γ)(1-\alpha)\gamma+(1-\alpha)(1-\gamma)(1−α)γ+(1−α)(1−γ).

πα\pi_\alphaπα​. The custom family 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, real division by zero equal to 000 (if D(α)=0D(\alpha)=0D(α)=0 both sides are 000). Under the hypotheses 1−α≠01-\alpha\ne 01−α=0. The identity is asserted for every α∈(0,12)\alpha\in(0,\tfrac12)α∈(0,21​) and every real γ\gammaγ.

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