Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM (Section 4) — for |V| ≥ 2 and 3 ≤ n ≤ 3m no {F_p} assures interactive consistency for m faults

Proved
InteractiveConsistency.Impossibility.no_interactive_consistency_of_le_three_mul

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

byzantine-agreementdistributed-computingimpossibilityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a finite set of nnn processors, VVV a set of values and mmm a natural number. Suppose that VVV has at least two elements and that

3≤n≤3m.3\le n\le 3m.3≤n≤3m.

Then there is no family {Fp∣p∈P}\{F_p\mid p\in P\}{Fp​∣p∈P} of decision functions, each FpF_pFp​ taking the ppp-scenario σp\sigma_pσp​ and a processor qqq to a value Fp(σp,q)∈VF_p(\sigma_p, q)\in VFp​(σp​,q)∈V, that assures interactive consistency for mmm faults.

In words: when a third or more of the processors may be faulty, no protocol — however many rounds of message exchange it uses — lets every nonfaulty processor compute the true private value of every nonfaulty processor and lets all nonfaulty processors agree on the whole vector. Together with the algorithm of Section 3 for n≥3m+1n\ge 3m+1n≥3m+1, it shows that n≥3m+1n\ge 3m+1n≥3m+1 is exactly the condition for interactive consistency with oral (unauthenticated) messages.

Formalization Note The paper prints the hypothesis as "n≥3mn\ge 3mn≥3m". This is a misprint: the proof begins "Since n≤3mn\le 3mn≤3m", the section is titled "Proof of Impossibility for n<3m+1n<3m+1n<3m+1", and with n≥3mn\ge 3mn≥3m the statement is false (Section 3 solves n=4n=4n=4, m=1m=1m=1). The hypothesis n≥3n\ge 3n≥3, used in the proof to split PPP into three nonempty sets, is made explicit; without it the statement is false (for n≤2n\le 2n≤2, Fp(σp,q)=σ(pq)F_p(\sigma_p,q)=\sigma(pq)Fp​(σp​,q)=σ(pq) assures interactive consistency). ∣V∣≥2|V|\ge2∣V∣≥2 is written as the existence of two distinct values. Decision functions see only w↦σ(pw)w\mapsto\sigma(pw)w↦σ(pw); scenarios are defined on strings of every length.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_InteractiveConsistency_Impossibility_Scenario
Formal statement
namespace InteractiveConsistency.Impossibility

/-- Pease, Shostak & Lamport (1980), Section 4, THEOREM, p. 232 (with the printed hypothesis
`n ≥ 3m` corrected to `n ≤ 3m`, as the proof and the section title require, and with the implicit
`n ≥ 3` of the proof made explicit): if `|V| ≥ 2` and `3 ≤ n ≤ 3m`, where `n = |P|`, there exists no
family `{F_p | p ∈ P}` that assures interactive consistency for `m` faults. -/
theorem no_interactive_consistency_of_le_three_mul {α V : Type*} [DecidableEq α]
    (P : Finset α) (m : ℕ) (hV : ∃ v v' : V, v ≠ v')
    (h3 : 3 ≤ P.card) (hn : P.card ≤ 3 * m) :
    ∀ F : α → (List α → V) → α → V, ¬ AssuresIC P m F := by sorry

end InteractiveConsistency.Impossibility
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), p. 232, THEOREM (Section 4); proof pp. 232–233
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