For 0<α<1/2, any γ and every state s: stationary α s = stateSum (fun t => stationary α t * P α γ t s). The balance equations are derived from step and outcomeProb, not postulated.
Preamble
import Definitions.Def_BitcoinSelfishMining
Formal statement
theorem BitcoinSelfishMining.stationary_balance (α γ : ℝ) (h0 : 0 < α) (h1 : α < 1 / 2)
(s : BitcoinSelfishMining.State) :
BitcoinSelfishMining.stationary α s =
BitcoinSelfishMining.stateSum
(fun t => BitcoinSelfishMining.stationary α t * BitcoinSelfishMining.P α γ t s) := 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)
Let α and γ be real numbers, with the hypotheses 0<α and α<21 (named and usable) and no hypothesis at all on γ (it may be any real number). Let s be any state in {zero,tie}∪{leadn:n∈N}. Then
The right-hand side is the custom stateSum of the function t↦πα(t)Pα,γ(t,s): value at zero, plus value at tie, plus Mathlib's tsum over n∈N of the values at leadn (a tsum is 0 for a non-summable family). Note the order of arguments: the second factor is the weight fromtto the fixed s.
with real division by zero equal to 0. Pα,γ(t,s) is the sum over the three outcomes o of pα,γ(o) if step(t,o)=s and 0 otherwise, where pα,γ(pool)=α, pα,γ(honestOnPool)=(1−α)γ, pα,γ(honestOnOthers)=(1−α)(1−γ), and step is: zeropoollead0, zerootherzero; tieanyzero; lead0poollead1, lead0othertie; lead1poollead2, lead1otherzero; leadn+2poolleadn+3, leadn+2otherleadn+1. Write h:=(1−α)γ+(1−α)(1−γ) for the sum of the two "honest" weights (algebraically equal to 1−α for all real γ).
Unfolded per case of s. For each fixed s only finitely many t have Pα,γ(t,s)=0, so the tail tsum is a finite sum and the statement reads:
Confirmed by the moderator at approval.