Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(B.5), p. 40 — R(cᵢ + γg)/(R + γg²) = cᵢ + γfᵢ (printed middle term has a sign slip)

Proved
PoWMining.CostStatics.eq_B5

by mikedeng1 · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

comparative-staticsmining-gamep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the standing assumptions (n≥2n \ge 2n≥2, R>0R > 0R>0, γ≥0\gamma \ge 0γ≥0, all ck>0c_k > 0ck​>0, all nnn miners active), let ggg be the aggregate equilibrium hash rate and fi=g(R−cig)/(R+γg2)f_i = g(R - c_i g)/(R + \gamma g^2)fi​=g(R−ci​g)/(R+γg2) the equilibrium hash rate of miner iii (B.3). Then

R ci+γgR+γg2=ci+γfi.R\,\frac{c_i + \gamma g}{R + \gamma g^2} = c_i + \gamma f_i.RR+γg2ci​+γg​=ci​+γfi​.

This identity converts the derivative ∂fi/∂g\partial f_i/\partial g∂fi​/∂g into the form gR+γg2(Rg−2(ci+γfi))\frac{g}{R+\gamma g^2}\big(\frac Rg - 2(c_i + \gamma f_i)\big)R+γg2g​(gR​−2(ci​+γfi​)) that controls the sign of the indirect sensitivity.

Formalization Note. The paper prints a middle term ci−γgR−cigR+γg2c_i - \gamma g\frac{R - c_i g}{R + \gamma g^2}ci​−γgR+γg2R−ci​g​, which is a sign slip: it equals neither side; with +++ in place of −-− it equals both. Only the outer equality, which is what the proof uses, is stated. Miner indices are 0-based (Fin n).

Preamble
import Mathlib
import Definitions.Def_PoWMining_CostStatics_Setting
Formal statement
namespace PoWMining.CostStatics

theorem eq_B5 {n : ℕ} (c : Fin n → ℝ) (γ R : ℝ) (hS : Standing c γ R) (i : Fin n) :
    R * ((c i + γ * gH c γ R) / (R + γ * gH c γ R ^ 2)) = c i + γ * hstar c γ R i := by sorry

end PoWMining.CostStatics
Source
Capponi, Ólafsson & Alsabah, Proof-of-Work Cryptocurrencies: Does Mining Technology Undermine Decentralization?, arXiv:2106.09783v1, p. 40, (B.5), proof of Propositions 4.6 and 4.8
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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