Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The honest revenue rate reduces to equation (9)

Proved
BitcoinSelfishMining.others_revenue_eq

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

bitcoineyal-sirerformal-verificationgame-theorymarkov-chainmathlibminingselfish-mining

For all real α,γ\alpha, \gammaα,γ: othersRevenue α γ =p0′(2(1−α)(1−γ)+γ(1−α))+p0(1−α)= p_{0'}(2(1-\alpha)(1-\gamma) + \gamma(1-\alpha)) + p_0 (1-\alpha)=p0′​(2(1−α)(1−γ)+γ(1−α))+p0​(1−α), the paper's (9).

Preamble
import Definitions.Def_BitcoinSelfishMining
Formal statement
theorem BitcoinSelfishMining.others_revenue_eq (α γ : ℝ) :
    BitcoinSelfishMining.othersRevenue α γ =
      BitcoinSelfishMining.stationary α .tie * ((1 - α) * (1 - γ) * 2 + γ * (1 - α) * 1)
        + BitcoinSelfishMining.stationary α .zero * ((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.others_revenue_eq

For every real α\alphaα and every real γ\gammaγ, with no hypotheses whatsoever (no positivity, no upper bound, no restriction to [0,1][0,1][0,1]),

rα,γoth  =  πα(tie)⋅((1−α)(1−γ)⋅2+γ(1−α)⋅1)  +  πα(zero)⋅((1−α)⋅1).r^{\mathrm{oth}}_{\alpha,\gamma} \;=\; \pi_\alpha(\mathrm{tie})\cdot\big((1-\alpha)(1-\gamma)\cdot 2 + \gamma(1-\alpha)\cdot 1\big) \;+\; \pi_\alpha(\mathrm{zero})\cdot\big((1-\alpha)\cdot 1\big).rα,γoth​=πα​(tie)⋅((1−α)(1−γ)⋅2+γ(1−α)⋅1)+πα​(zero)⋅((1−α)⋅1).

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

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

where gα,γoth(s)=∑opα,γ(o)⋅othersGain(s,o)g^{\mathrm{oth}}_{\alpha,\gamma}(s) = \sum_{o} p_{\alpha,\gamma}(o)\cdot\mathrm{othersGain}(s,o)gα,γoth​(s)=∑o​pα,γ​(o)⋅othersGain(s,o) over the three outcomes, with 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 othersGain\mathrm{othersGain}othersGain: (zero,pool)↦0(\mathrm{zero},\mathrm{pool})\mapsto 0(zero,pool)↦0, (zero,either honest)↦1(\mathrm{zero},\text{either honest})\mapsto 1(zero,either honest)↦1, (tie,honestOnPool)↦1(\mathrm{tie},\mathrm{honestOnPool})\mapsto 1(tie,honestOnPool)↦1, (tie,honestOnOthers)↦2(\mathrm{tie},\mathrm{honestOnOthers})\mapsto 2(tie,honestOnOthers)↦2, and 000 for every other pair (in particular (tie,pool)↦0(\mathrm{tie},\mathrm{pool})\mapsto 0(tie,pool)↦0 and (leadn,o)↦0(\mathrm{lead}_n,o)\mapsto 0(leadn​,o)↦0 for all n,on,on,o). Hence

gα,γoth(zero)=α⋅0+(1−α)γ⋅1+(1−α)(1−γ)⋅1,gα,γoth(tie)=α⋅0+(1−α)γ⋅1+(1−α)(1−γ)⋅2,gα,γoth(leadn)=0,g^{\mathrm{oth}}_{\alpha,\gamma}(\mathrm{zero}) = \alpha\cdot 0 + (1-\alpha)\gamma\cdot 1 + (1-\alpha)(1-\gamma)\cdot 1,\qquad g^{\mathrm{oth}}_{\alpha,\gamma}(\mathrm{tie}) = \alpha\cdot 0 + (1-\alpha)\gamma\cdot 1 + (1-\alpha)(1-\gamma)\cdot 2,\qquad g^{\mathrm{oth}}_{\alpha,\gamma}(\mathrm{lead}_n) = 0,gα,γoth​(zero)=α⋅0+(1−α)γ⋅1+(1−α)(1−γ)⋅1,gα,γoth​(tie)=α⋅0+(1−α)γ⋅1+(1−α)(1−γ)⋅2,gα,γoth​(leadn​)=0,

so every term of the tail tsum is 000 and the tail contributes 000 (the zero family is summable). Thus the left-hand side equals

πα(zero)((1−α)γ+(1−α)(1−γ))+πα(tie)((1−α)γ+2(1−α)(1−γ)).\pi_\alpha(\mathrm{zero})\big((1-\alpha)\gamma + (1-\alpha)(1-\gamma)\big) + \pi_\alpha(\mathrm{tie})\big((1-\alpha)\gamma + 2(1-\alpha)(1-\gamma)\big).πα​(zero)((1−α)γ+(1−α)(1−γ))+πα​(tie)((1−α)γ+2(1−α)(1−γ)).

Right-hand side. The coefficient of πα(tie)\pi_\alpha(\mathrm{tie})πα​(tie) is 2(1−α)(1−γ)+γ(1−α)2(1-\alpha)(1-\gamma) + \gamma(1-\alpha)2(1−α)(1−γ)+γ(1−α), and the coefficient of πα(zero)\pi_\alpha(\mathrm{zero})πα​(zero) is (1−α)(1-\alpha)(1−α) (written as (1−α)⋅1(1-\alpha)\cdot 1(1−α)⋅1). So, after cancelling the common tie\mathrm{tie}tie coefficient, the content of the statement is that πα(zero)((1−α)γ+(1−α)(1−γ))=πα(zero)(1−α)\pi_\alpha(\mathrm{zero})\big((1-\alpha)\gamma+(1-\alpha)(1-\gamma)\big) = \pi_\alpha(\mathrm{zero})(1-\alpha)πα​(zero)((1−α)γ+(1−α)(1−γ))=πα​(zero)(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(α), 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 (if D(α)=0D(\alpha)=0D(α)=0 both sides are 000). Since α,γ\alpha,\gammaα,γ are arbitrary reals, the identity is asserted for all of R2\mathbb{R}^2R2, including values where πα\pi_\alphaπα​ is negative or where the "weights" pα,γp_{\alpha,\gamma}pα,γ​ are negative.

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