Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 5 — the authenticated S_pq procedure assures interactive consistency for n ≥ m

Proved
InteractiveConsistency.Authenticated.signed_procedure_assures_ic

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 nnn processors, let VVV be a set of private values, and let m≤nm\le nm≤n. For every nonfaulty set N⊆PN\subseteq PN⊆P with ∣N∣≥n−m|N|\ge n-m∣N∣≥n−m and every authenticated (m+1)(m+1)(m+1)-level scenario σ\sigmaσ consistent with NNN, assume that every processor has a non-NIL private value. Processor ppp applies the singleton-set procedure to its own view w↦σ(pw)w\mapsto\sigma(pw)w↦σ(pw) and records an optional value Rp(q)R_p(q)Rp​(q) for each q∈Pq\in Pq∈P. Then

Rp(q)=σ(q)(p,q∈N),Rp(r)=Rp′(r)(p,p′∈N, r∈P).R_p(q)=\sigma(q)\quad(p,q\in N),\qquad R_p(r)=R_{p'}(r)\quad(p,p'\in N,\ r\in P).Rp​(q)=σ(q)(p,q∈N),Rp​(r)=Rp′​(r)(p,p′∈N, r∈P).

Thus every nonfaulty processor records the actual private value of each nonfaulty originator, and all nonfaulty processors produce the same vector, including the entries for faulty originators.

Formalization Note The printed n≥mn\ge mn≥m condition is retained. The theorem quantifies over every admissible NNN; the procedure receives neither NNN nor the full scenario. Strings are bounded to those inspected by the (m+1)(m+1)(m+1)-level procedure. NIL is represented by none, and the source's private values are required to be non-NIL. The authenticator's cryptographic construction and its probability guarantee are outside this theorem.

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

/-- Section 5, pp. 233–234: the authenticated-message procedure assures
interactive consistency for every `n ≥ m`. -/
theorem signed_procedure_assures_ic {α V : Type*} [DecidableEq α]
    (P : Finset α) (m : ℕ) (hmn : m ≤ P.card) :
    ∀ N : Finset α, N ⊆ P → P.card ≤ N.card + m →
    ∀ σ : List α → Option V,
      IsAuthScenario P σ → AuthConsistent P N m σ →
      (∀ p ∈ N, ∀ q ∈ N, record m P (view σ p) p q = σ [q]) ∧
      (∀ p ∈ N, ∀ p' ∈ N, ∀ r ∈ P,
        record m P (view σ p) p r = record m P (view σ p') p' r) := by sorry

end InteractiveConsistency.Authenticated
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), pp. 233–234, Section 5 procedure and Q.E.D.; interactive-consistency clauses, p. 232; 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