Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 5 — a nonfaulty originator yields a singleton S_pq

Proved
InteractiveConsistency.Authenticated.nonfaulty_origin_set

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, N⊆PN\subseteq PN⊆P the nonfaulty set, and m≤∣P∣m\le|P|m≤∣P∣ an upper bound on the number of faults, so that ∣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. For nonfaulty processors p,q∈Np,q\in Np,q∈N, the originator qqq has a private value v∈Vv\in Vv∈V and

σ(q)=v,Spq={v}.\sigma(q)=v,\qquad S_{pq}=\{v\}.σ(q)=v,Spq​={v}.

This identifies the set from which receiver ppp makes its decision when the originator is nonfaulty, including the case p=qp=qp=q.

Formalization Note The set is computed from ppp's view w↦σ(pw)w\mapsto\sigma(pw)w↦σ(pw), with intermediate strings of distinct processors of length at most mmm. The theorem makes the paper's actual private value explicit by asserting σ(q)=v\sigma(q)=vσ(q)=v, rather than treating NIL as a possible private value.

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

/-- Section 5, p. 233: a nonfaulty originator's value is the sole non-NIL
value visible in the receiver's set. -/
theorem nonfaulty_origin_set {α 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 q : α) (hp : p ∈ N) (hq : q ∈ N) :
    ∃ v : V, σ [q] = some v ∧ S m P (view σ p) p q = {v} := by sorry

end InteractiveConsistency.Authenticated
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), p. 233, Section 5 final 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