Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The first return to zero at time 1 has probability 1−α

Proved
BitcoinSelfishErgodic.firstReturn_zero

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

bitcoincesaroergodicformal-verificationlong-run-averagemarkov-chainmathlibrenewalselfish-mining

firstPassage α γ zero 0 = 1 - α: the return-time distribution charges time 1, so the renewal sequence is aperiodic.

Preamble
import Definitions.Def_BitcoinSelfishErgodic
open BitcoinSelfishErgodic BitcoinSelfishMining BitcoinSelfishUnique Filter Topology
Formal statement
theorem BitcoinSelfishErgodic.firstReturn_zero (α γ : ℝ) :
    BitcoinSelfishErgodic.firstPassage α γ .zero 0 = 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 (the revenue as a long-run share); the selfish-mining missions BitcoinSelfishMining (chain, revenues, threshold) and BitcoinSelfishUnique (uniqueness of the stationary distribution); standard Markov-chain theory (Cesàro limits, renewal equation)
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: BitcoinSelfishErgodic.firstReturn_zero

Setting. α,γ\alpha, \gammaα,γ are arbitrary real numbers: there are no hypotheses on α\alphaα or γ\gammaγ.

Assertion. f0zero=1−αf^{\mathsf{zero}}_0 = 1 - \alphaf0zero​=1−α. Unfolded: τ0zero=δzero\tau^{\mathsf{zero}}_0 = \delta_{\mathsf{zero}}τ0zero​=δzero​, so

f0zero=(Dδzero)(zero)=Σ(t↦δzero(t) Pα,γ(t,zero)),f^{\mathsf{zero}}_0 = (D\delta_{\mathsf{zero}})(\mathsf{zero}) = \Sigma\big(t\mapsto\delta_{\mathsf{zero}}(t)\,P_{\alpha,\gamma}(t,\mathsf{zero})\big),f0zero​=(Dδzero​)(zero)=Σ(t↦δzero​(t)Pα,γ​(t,zero)),

and the claim is that this equals 1−α1-\alpha1−α. (By the definition of PPP, P(zero,zero)=qhP+qhO=(1−α)γ+(1−α)(1−γ)P(\mathsf{zero},\mathsf{zero}) = q_{\mathrm{hP}} + q_{\mathrm{hO}} = (1-\alpha)\gamma + (1-\alpha)(1-\gamma)P(zero,zero)=qhP​+qhO​=(1−α)γ+(1−α)(1−γ).)


Definitions used, unfolded

State space SSS. The states are zero\mathsf{zero}zero, tie\mathsf{tie}tie, and one state leadm\mathsf{lead}_mleadm​ for every natural number m=0,1,2,…m = 0, 1, 2, \dotsm=0,1,2,…; all of these are distinct. (The source comments say that leadm\mathsf{lead}_mleadm​ stands for a private lead of m+1m+1m+1 blocks, so lead0\mathsf{lead}_0lead0​ is "lead 1", lead1\mathsf{lead}_1lead1​ is "lead 2", and so on. Formally these are only labels, and every subscript below is this shifted index.)

Sum over all states. For any f:S→Rf : S \to \mathbb{R}f:S→R,

Σf  =  f(zero)+f(tie)+∑m≥0f(leadm),\Sigma f \;=\; f(\mathsf{zero}) + f(\mathsf{tie}) + \sum_{m \ge 0} f(\mathsf{lead}_m),Σf=f(zero)+f(tie)+m≥0∑​f(leadm​),

where the infinite series is the value of the series when the real sequence (f(leadm))m≥0\big(f(\mathsf{lead}_m)\big)_{m \ge 0}(f(leadm​))m≥0​ is summable (for real sequences: absolutely summable). The series is defined to be 000 when that sequence is not summable.

One-step transition weights Pα,γP_{\alpha,\gamma}Pα,γ​. For arbitrary real numbers α,γ\alpha, \gammaα,γ (the definitions themselves impose no range), there are three outcomes, with weights

qpool=α,qhP=(1−α)γ,qhO=(1−α)(1−γ).q_{\mathrm{pool}} = \alpha, \qquad q_{\mathrm{hP}} = (1-\alpha)\gamma, \qquad q_{\mathrm{hO}} = (1-\alpha)(1-\gamma).qpool​=α,qhP​=(1−α)γ,qhO​=(1−α)(1−γ).

A deterministic successor map step(s,o)\mathrm{step}(s, o)step(s,o) is given by

current stateoutcome pooloutcome hPoutcome hO
zero\mathsf{zero}zerolead0\mathsf{lead}_0lead0​zero\mathsf{zero}zerozero\mathsf{zero}zero
tie\mathsf{tie}tiezero\mathsf{zero}zerozero\mathsf{zero}zerozero\mathsf{zero}zero
lead0\mathsf{lead}_0lead0​lead1\mathsf{lead}_1lead1​tie\mathsf{tie}tietie\mathsf{tie}tie
lead1\mathsf{lead}_1lead1​lead2\mathsf{lead}_2lead2​zero\mathsf{zero}zerozero\mathsf{zero}zero
leadm+2\mathsf{lead}_{m+2}leadm+2​ (m≥0m \ge 0m≥0)leadm+3\mathsf{lead}_{m+3}leadm+3​leadm+1\mathsf{lead}_{m+1}leadm+1​leadm+1\mathsf{lead}_{m+1}leadm+1​

and Pα,γ(s,t)=∑o : step(s,o)=tqoP_{\alpha,\gamma}(s, t) = \sum_{o \,:\, \mathrm{step}(s,o) = t} q_oPα,γ​(s,t)=∑o:step(s,o)=t​qo​ (sum of the weights of the outcomes leading from sss to ttt). Using qhP+qhO=1−αq_{\mathrm{hP}} + q_{\mathrm{hO}} = 1-\alphaqhP​+qhO​=1−α and qpool+qhP+qhO=1q_{\mathrm{pool}} + q_{\mathrm{hP}} + q_{\mathrm{hO}} = 1qpool​+qhP​+qhO​=1, the only entries that can be nonzero are

P(zero,lead0)=α,P(zero,zero)=1−α,P(tie,zero)=1,P(lead0,lead1)=α,P(lead0,tie)=1−α,P(lead1,lead2)=α,P(lead1,zero)=1−α,P(leadm+2,leadm+3)=α,P(leadm+2,leadm+1)=1−α(m≥0),\begin{aligned} &P(\mathsf{zero},\mathsf{lead}_0) = \alpha, && P(\mathsf{zero},\mathsf{zero}) = 1-\alpha, && P(\mathsf{tie},\mathsf{zero}) = 1,\\ &P(\mathsf{lead}_0,\mathsf{lead}_1) = \alpha, && P(\mathsf{lead}_0,\mathsf{tie}) = 1-\alpha, && \\ &P(\mathsf{lead}_1,\mathsf{lead}_2) = \alpha, && P(\mathsf{lead}_1,\mathsf{zero}) = 1-\alpha, && \\ &P(\mathsf{lead}_{m+2},\mathsf{lead}_{m+3}) = \alpha, && P(\mathsf{lead}_{m+2},\mathsf{lead}_{m+1}) = 1-\alpha \quad (m \ge 0), && \end{aligned}​P(zero,lead0​)=α,P(lead0​,lead1​)=α,P(lead1​,lead2​)=α,P(leadm+2​,leadm+3​)=α,​​P(zero,zero)=1−α,P(lead0​,tie)=1−α,P(lead1​,zero)=1−α,P(leadm+2​,leadm+1​)=1−α(m≥0),​​P(tie,zero)=1,​

and every other entry is 000. These identities hold for every real α,γ\alpha, \gammaα,γ: the transition weights do not depend on γ\gammaγ, each row sums to 111, and all entries are ≥0\ge 0≥0 exactly when 0≤α≤10 \le \alpha \le 10≤α≤1.

Point mass. For a state ttt, δt(s)=1\delta_t(s) = 1δt​(s)=1 if s=ts = ts=t and δt(s)=0\delta_t(s) = 0δt​(s)=0 otherwise.

One step applied to a function. For any μ:S→R\mu : S \to \mathbb{R}μ:S→R (not required to be nonnegative, summable or normalized),

(Dμ)(s)  =  Σ(t↦μ(t) Pα,γ(t,s))  =  μ(zero)P(zero,s)+μ(tie)P(tie,s)+∑m≥0μ(leadm)P(leadm,s).(D\mu)(s) \;=\; \Sigma\big(t \mapsto \mu(t)\, P_{\alpha,\gamma}(t, s)\big) \;=\; \mu(\mathsf{zero})P(\mathsf{zero},s) + \mu(\mathsf{tie})P(\mathsf{tie},s) + \sum_{m\ge 0}\mu(\mathsf{lead}_m)P(\mathsf{lead}_m,s).(Dμ)(s)=Σ(t↦μ(t)Pα,γ​(t,s))=μ(zero)P(zero,s)+μ(tie)P(tie,s)+m≥0∑​μ(leadm​)P(leadm​,s).

(The parameters α,γ\alpha,\gammaα,γ are implicit in D=Dα,γD = D_{\alpha,\gamma}D=Dα,γ​.) For a fixed target sss, at most two lead states ttt have P(t,s)≠0P(t,s) \ne 0P(t,s)=0, so the lead series here has only finitely many nonzero terms and is an ordinary finite sum.

nnn steps. D0μ=μD^0\mu = \muD0μ=μ and Dn+1μ=D(Dnμ)D^{n+1}\mu = D(D^n\mu)Dn+1μ=D(Dnμ) for n≥0n \ge 0n≥0.

Killing at zero\mathsf{zero}zero. (κμ)(s)=0(\kappa\mu)(s) = 0(κμ)(s)=0 if s=zeros = \mathsf{zero}s=zero, and (κμ)(s)=μ(s)(\kappa\mu)(s) = \mu(s)(κμ)(s)=μ(s) otherwise.

Taboo functions. For a starting state ttt: τ0t=δt\tau^t_0 = \delta_tτ0t​=δt​ (not killed, so τ0zero=δzero\tau^{\mathsf{zero}}_0 = \delta_{\mathsf{zero}}τ0zero​=δzero​ has mass 111 at zero\mathsf{zero}zero), and τn+1t=κ(Dτnt)\tau^t_{n+1} = \kappa\big(D\tau^t_n\big)τn+1t​=κ(Dτnt​) for n≥0n \ge 0n≥0.

First passage. fnt=(Dτnt)(zero)f^t_n = \big(D\tau^t_n\big)(\mathsf{zero})fnt​=(Dτnt​)(zero) for n≥0n \ge 0n≥0.

Return sequence. rn=(Dnδzero)(zero)r_n = \big(D^n\delta_{\mathsf{zero}}\big)(\mathsf{zero})rn​=(Dnδzero​)(zero) for n≥0n \ge 0n≥0 (so r0=1r_0 = 1r0​=1).

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Oct 30, 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