For all real α,γ and every state s: stateSum (fun t => P α γ s t) = 1. Each row of the chain sums to one (the three outcome probabilities sum to 1 for any α,γ).
Preamble
import Definitions.Def_BitcoinSelfishMining
Formal statement
theorem BitcoinSelfishMining.P_row_sum (α γ : ℝ) (s : BitcoinSelfishMining.State) :
BitcoinSelfishMining.stateSum (fun t => BitcoinSelfishMining.P α γ s t) = 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.P_row_sum
For every real number α and every real number γ (no constraints whatsoever: they may be negative, larger than 1, etc.), and for every state s of the type State={zero,tie}∪{leadn:n∈N}, the following real number equals 1:
Here Pα,γ(s,t) is the custom one-step weight from s to t, defined as the three-term sum over the outcomes o∈{pool,honestOnPool,honestOnOthers} of pα,γ(o) when step(s,o)=t and 0 otherwise, where pα,γ(pool)=α, pα,γ(honestOnPool)=(1−α)γ, pα,γ(honestOnOthers)=(1−α)(1−γ), and step is the deterministic table: zeropoollead0, zerootherzero; tieanyzero; lead0poollead1, lead0othertie; lead1poollead2, lead1otherzero; leadn+2poolleadn+3, leadn+2otherleadn+1 ("other" meaning either honest outcome).
The left-hand side is the custom stateSum of the function t↦Pα,γ(s,t): the value at zero, plus the value at tie, plus Mathlib's tsum over n∈N of the values at leadn (a tsum is 0 for a non-summable family). For each fixed s, by the table above at most two indices n give a non-zero term Pα,γ(s,leadn), so the tail family has finite support and its tsum is an ordinary finite sum. Written out per case, the assertion is:
s=zero: [(1−α)γ+(1−α)(1−γ)]+0+α=1;
s=tie: [α+(1−α)γ+(1−α)(1−γ)]+0+0=1;
s=lead0: 0+[(1−α)γ+(1−α)(1−γ)]+α=1;
s=lead1: [(1−α)γ+(1−α)(1−γ)]+0+α=1;
s=leadn+2: 0+0+[α+(1−α)γ+(1−α)(1−γ)]=1.
Because α and γ are arbitrary reals, the statement includes, e.g., α=5 or γ=−3; it is a purely algebraic identity about these sums, with no probabilistic hypotheses.
Confirmed by the moderator at approval.