Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Balance at state 0'

Proved
BitcoinSelfishMining.balance_tie

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: p0′=(1−α)p1p_{0'} = (1-\alpha)p_1p0′​=(1−α)p1​.

Preamble
import Definitions.Def_BitcoinSelfishMining
Formal statement
theorem BitcoinSelfishMining.balance_tie (α : ℝ) (_h0 : 0 < α) (_h1 : α < 1 / 2) :
    BitcoinSelfishMining.stationary α .tie =
      (1 - α) * BitcoinSelfishMining.stationary α (.lead 0) := 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.balance_tie

Let α\alphaα be a real number with 0<α0<\alpha0<α and α<12\alpha<\tfrac12α<21​. Both hypotheses are present in the statement but are given underscore-prefixed names (_h0, _h1), which signals that the proof is not expected to use them; they nonetheless remain hypotheses, so the theorem is asserted only for α∈(0,12)\alpha\in(0,\tfrac12)α∈(0,21​) and claims nothing outside that interval. Then

πα(tie)  =  (1−α)⋅πα(lead0).\pi_\alpha(\mathrm{tie}) \;=\; (1-\alpha)\cdot\pi_\alpha(\mathrm{lead}_0).πα​(tie)=(1−α)⋅πα​(lead0​).

Here πα\pi_\alphaπα​ is the custom family stationary α\alphaα, with

πα(tie)=(1−α)(α−2α2)D(α),πα(lead0)=(α1−α)0⋅α−2α2D(α)=α−2α2D(α),D(α)=2α3−4α2+1,\pi_\alpha(\mathrm{tie}) = \frac{(1-\alpha)(\alpha-2\alpha^2)}{D(\alpha)},\qquad \pi_\alpha(\mathrm{lead}_0) = \left(\frac{\alpha}{1-\alpha}\right)^{0}\cdot\frac{\alpha-2\alpha^2}{D(\alpha)} = \frac{\alpha-2\alpha^2}{D(\alpha)},\qquad D(\alpha)=2\alpha^3-4\alpha^2+1,πα​(tie)=D(α)(1−α)(α−2α2)​,πα​(lead0​)=(1−αα​)0⋅D(α)α−2α2​=D(α)α−2α2​,D(α)=2α3−4α2+1,

with the zeroth power equal to 111 and real division by zero equal to 000 (if D(α)=0D(\alpha)=0D(α)=0 both sides are 000). So the statement unfolds to

(1−α)(α−2α2)D(α)  =  (1−α)⋅α−2α2D(α).\frac{(1-\alpha)(\alpha-2\alpha^2)}{D(\alpha)} \;=\; (1-\alpha)\cdot\frac{\alpha-2\alpha^2}{D(\alpha)}.D(α)(1−α)(α−2α2)​=(1−α)⋅D(α)α−2α2​.

No transition probabilities and no γ\gammaγ 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