Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(B.1), p. 38 — summing the first-order conditions: 0=n−1HR−c(n)−γH=1H((n−1)R−c(n)H−γH2)0=\frac{n-1}{H}R-c^{(n)}-\gamma H=\frac1H((n-1)R-c^{(n)}H-\gamma H^2)0=Hn−1​R−c(n)−γH=H1​((n−1)R−c(n)H−γH2)

Proved
PoWMining.Equilibrium.eq_B_1

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

first-order-conditionmining-gamep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the mining game with N≥2N\ge 2N≥2 miners, reward R>0R>0R>0, capacity parameter γ≥0\gamma\ge 0γ≥0 and sorted positive costs-per-hash 0<c1≤⋯≤cN0<c_1\le\cdots\le c_N0<c1​≤⋯≤cN​ (payoff (3.4) without the fixed cost). Let h∗h^*h∗ be an equilibrium hash rate profile, H=∑jhj∗H=\sum_j h^*_jH=∑j​hj∗​ its aggregate, n=∣{i:hi∗>0}∣n=|\{i:h^*_i>0\}|n=∣{i:hi∗​>0}∣ its number of active miners, and c(n)=c1+⋯+cnc^{(n)}=c_1+\cdots+c_nc(n)=c1​+⋯+cn​ the cumulative cost of the first nnn miners. Then H>0H>0H>0 and

0=n−1HR−c(n)−γH=1H((n−1)R−c(n)H−γH2).(B.1)0=\frac{n-1}{H}R-c^{(n)}-\gamma H=\frac{1}{H}\bigl((n-1)R-c^{(n)}H-\gamma H^2\bigr). \tag{B.1}0=Hn−1​R−c(n)−γH=H1​((n−1)R−c(n)H−γH2).(B.1)

So the aggregate hash rate is the positive root of the quadratic γH2+c(n)H−(n−1)R=0\gamma H^2+c^{(n)}H-(n-1)R=0γH2+c(n)H−(n−1)R=0, which is the closed form (4.1).

Formalization Note The statement uses the cumulative cost of the first nnn miners in the paper's order (Lean indices <n<n<n); that these are exactly the active miners is the content of the preceding milestone. The paper's miner iii is Lean index i−1i-1i−1.

Preamble
import Mathlib
import Definitions.Def_PoWMining_Equilibrium_Setting
Formal statement
namespace PoWMining.Equilibrium

/-- (B.1), p. 38: summing the first-order conditions of the `n` active miners,
`0 = ((n − 1)/H) R − c⁽ⁿ⁾ − γ H = (1/H)((n − 1) R − c⁽ⁿ⁾ H − γ H²)`, with `H = H* > 0`. -/
theorem eq_B_1 {N : ℕ} (P : Params N) (hP : P.Standing) (h : Fin N → ℝ)
    (hh : IsMiningEq P h) :
    0 < aggH h ∧
      ((activeCount h : ℝ) - 1) / aggH h * P.R - cumCost P (activeCount h) - P.γ * aggH h = 0 ∧
      1 / aggH h * (((activeCount h : ℝ) - 1) * P.R - cumCost P (activeCount h) * aggH h
        - P.γ * aggH h ^ 2) = 0 := by sorry

end PoWMining.Equilibrium
Source
Capponi, Ólafsson & Alsabah, Proof-of-Work Cryptocurrencies: Does Mining Technology Undermine Decentralization?, arXiv:2106.09783v1, p. 38, proof of Proposition 4.1, (B.1)
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