Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3, Induction Step ¶3 (p. 231) — two step-(1) quorums give the same value

Proved
InteractiveConsistency.OralAlgorithm.step_one_values_agree

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

byzantine-agreementdistributed-computinginteractive-consistencyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a finite set of nnn processors, N⊆PN\subseteq PN⊆P with ∣N∣≥n−m|N|\ge n-m∣N∣≥n−m, and σ\sigmaσ an (m+1)(m+1)(m+1)-level scenario consistent with NNN. Let p,p′∈Np, p'\in Np,p′∈N be nonfaulty and q∈Pq\in Pq∈P. Suppose Q1,Q2⊆PQ_1, Q_2\subseteq PQ1​,Q2​⊆P both have more than (n+m)/2(n+m)/2(n+m)/2 members, and v,v′∈Vv, v'\in Vv,v′∈V satisfy

σ(p w q)=v for every string w over Q1 with ∣w∣≤m,σ(p′ w q)=v′ for every string w over Q2 with ∣w∣≤m.\sigma(p\,w\,q) = v \text{ for every string } w \text{ over } Q_1 \text{ with } |w|\le m,\qquad \sigma(p'\,w\,q) = v' \text{ for every string } w \text{ over } Q_2 \text{ with } |w|\le m .σ(pwq)=v for every string w over Q1​ with ∣w∣≤m,σ(p′wq)=v′ for every string w over Q2​ with ∣w∣≤m.

Then v=v′v = v'v=v′.

This is the case of the paper's proof in which both ppp and p′p'p′ exit the procedure at step (1): the two quorums share more than mmm members, one of them nonfaulty, so both quorums yield the same value.

Formalization Note. σ(p w q)\sigma(p\,w\,q)σ(pwq) is σ (p :: (w ++ [q])), i.e. σp(pwq)\sigma_p(pwq)σp​(pwq). "More than (n+m)/2(n+m)/2(n+m)/2 members" is P.card + m < 2 * Qᵢ.card. The hypothesis n≥3m+1n\ge 3m+1n≥3m+1 of Section 3 is not needed for this step and is omitted, which makes the statement stronger.

Preamble
import Mathlib
import Definitions.Def_InteractiveConsistency_OralAlgorithm_Scenario
Formal statement
namespace InteractiveConsistency.OralAlgorithm

theorem step_one_values_agree {α V : Type*} [DecidableEq α] (P N : Finset α) (m : ℕ)
    (hNP : N ⊆ P) (hN : P.card ≤ N.card + m)
    (σ : List α → V) (hσ : ConsistentUpTo P N (m + 1) σ)
    (p p' q : α) (hp : p ∈ N) (hp' : p' ∈ N) (hq : q ∈ P)
    (Q₁ Q₂ : Finset α) (hQ₁ : Q₁ ⊆ P) (hQ₂ : Q₂ ⊆ P)
    (hQ₁card : P.card + m < 2 * Q₁.card) (hQ₂card : P.card + m < 2 * Q₂.card)
    (v v' : V)
    (hv : ∀ w : List α, IsStringOver Q₁ w → w.length ≤ m → σ (p :: (w ++ [q])) = v)
    (hv' : ∀ w : List α, IsStringOver Q₂ w → w.length ≤ m → σ (p' :: (w ++ [q])) = v') :
    v = v' := by sorry

end InteractiveConsistency.OralAlgorithm
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), p. 231, Section 3, Induction Step ¶3
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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