Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 5 — a faulty originator's reports transfer between nonfaulty receivers

Proved
InteractiveConsistency.Authenticated.faulty_origin_set_subset

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

authenticated-messagesbyzantine-agreementdistributed-computingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a finite set of processors with m≤∣P∣m\le|P|m≤∣P∣, and let N⊆PN\subseteq PN⊆P satisfy ∣P∣≤∣N∣+m|P|\le|N|+m∣P∣≤∣N∣+m. Let σ\sigmaσ be an authenticated (m+1)(m+1)(m+1)-level scenario consistent with NNN, with non-NIL private values. If p,p′∈Np,p'\in Np,p′∈N are nonfaulty and q∈P∖Nq\in P\setminus Nq∈P∖N is faulty, then

Spq⊆Sp′q.S_{pq}\subseteq S_{p'q}.Spq​⊆Sp′q​.

The inclusion is valid for every ordered pair of nonfaulty receivers. Applying it with their roles exchanged gives equality of the two sets, which supplies agreement for a faulty originator.

Formalization Note Each set uses only its named receiver's own view. The bound on the number of faulty processors includes qqq, and the relay strings have distinct letters, avoid the receiver and originator, and have length at most mmm.

Preamble
import Mathlib
import Definitions.Def_InteractiveConsistency_Authenticated_Procedure
set_option autoImplicit false
Formal statement
namespace InteractiveConsistency.Authenticated

/-- Section 5, p. 234: for a faulty originator, every non-NIL report seen by
one nonfaulty receiver is also seen by every other nonfaulty receiver. -/
theorem faulty_origin_set_subset {α V : Type*} [DecidableEq α]
    (P N : Finset α) (m : ℕ) (σ : List α → Option V)
    (hmn : m ≤ P.card) (hN : N ⊆ P) (hcount : P.card ≤ N.card + m)
    (hscenario : IsAuthScenario P σ)
    (hconsistent : AuthConsistent P N m σ)
    (p p' q : α) (hp : p ∈ N) (hp' : p' ∈ N)
    (hqP : q ∈ P) (hqN : q ∉ N) :
    S m P (view σ p) p q ⊆ S m P (view σ p') p' q := by sorry

end InteractiveConsistency.Authenticated
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), p. 234, Section 5 proof paragraph; https://doi.org/10.1145/322186.322188
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