Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Point masses are distributions

Proved
BitcoinSelfishErgodic.isDist_delta

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

bitcoincesaroergodicformal-verificationlong-run-averagemarkov-chainmathlibrenewalselfish-mining

IsDist (delta t).

Preamble
import Definitions.Def_BitcoinSelfishErgodic
import Definitions.Def_BitcoinSelfishMining
open BitcoinSelfishErgodic BitcoinSelfishMining BitcoinSelfishUnique Filter Topology
Formal statement
theorem BitcoinSelfishErgodic.isDist_delta (t : BitcoinSelfishMining.State) :
    BitcoinSelfishErgodic.IsDist (BitcoinSelfishErgodic.delta t) := 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.isDist_delta

Setting. ttt is an arbitrary state. No parameters α,γ\alpha,\gammaα,γ are involved.

Assertion. The point mass δt\delta_tδt​ is a distribution: δt(s)≥0\delta_t(s) \ge 0δt​(s)≥0 for every sss; the sequence (δt(leadm))m≥0\big(\delta_t(\mathsf{lead}_m)\big)_{m\ge0}(δt​(leadm​))m≥0​ is summable; and Σδt=δt(zero)+δt(tie)+∑m≥0δt(leadm)=1\Sigma\delta_t = \delta_t(\mathsf{zero}) + \delta_t(\mathsf{tie}) + \sum_{m\ge0}\delta_t(\mathsf{lead}_m) = 1Σδt​=δt​(zero)+δt​(tie)+∑m≥0​δt​(leadm​)=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.

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.

Probability distribution. A function μ:S→R\mu : S \to \mathbb{R}μ:S→R is a distribution exactly when all three hold: (i) μ(s)≥0\mu(s) \ge 0μ(s)≥0 for every state sss; (ii) the sequence (μ(leadm))m≥0\big(\mu(\mathsf{lead}_m)\big)_{m\ge0}(μ(leadm​))m≥0​ is summable; (iii) Σμ=1\Sigma\mu = 1Σμ=1, i.e. μ(zero)+μ(tie)+∑m≥0μ(leadm)=1\mu(\mathsf{zero}) + \mu(\mathsf{tie}) + \sum_{m \ge 0}\mu(\mathsf{lead}_m) = 1μ(zero)+μ(tie)+∑m≥0​μ(leadm​)=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