Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3, Induction Step ¶1 (p. 231) — for nonfaulty p, q, step (1) succeeds and p records σ(q)

Proved
InteractiveConsistency.OralAlgorithm.record_of_nonfaulty

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, m≥0m\ge 0m≥0 with n≥3m+1n\ge 3m+1n≥3m+1, N⊆PN\subseteq PN⊆P a set of nonfaulty processors 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. For all nonfaulty p,q∈Np, q\in Np,q∈N, the condition of step (1) of the Section 3 procedure holds for ppp's view σp\sigma_pσp​ and the processor qqq, and

record(m,P,σp,q)=σ(q)=Vq.\mathrm{record}(m, P, \sigma_p, q) = \sigma(q) = V_q .record(m,P,σp​,q)=σ(q)=Vq​.

This is clause (i) of interactive consistency. The paper argues it at the start of the induction step: the set of nonfaulty processors has n−m>(n+m)/2n-m > (n+m)/2n−m>(n+m)/2 members and every relay chain through it reproduces VqV_qVq​, so it qualifies as QQQ in step (1).

Formalization Note. The paper writes this inside the induction step (m>0m>0m>0) and the basis m=0m=0m=0 separately; the statement covers every m≥0m\ge 0m≥0. The paper's "p records VqV_qVq​ and qqq" is a printed slip for "records VqV_qVq​ for qqq". The view of ppp is fun w => σ (p :: w) and the recorded value is some (σ [q]).

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

theorem record_of_nonfaulty {α V : Type*} [DecidableEq α] (P N : Finset α) (m : ℕ)
    (hn : 3 * m + 1 ≤ P.card) (hNP : N ⊆ P) (hN : P.card ≤ N.card + m)
    (σ : List α → V) (hσ : ConsistentUpTo P N (m + 1) σ)
    (p q : α) (hp : p ∈ N) (hq : q ∈ N) :
    StepOne m P (fun w => σ (p :: w)) q ∧
      record m P (fun w => σ (p :: w)) q = some (σ [q]) := by sorry

end InteractiveConsistency.OralAlgorithm
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), p. 231, Section 3, Basis and Induction Step ¶1
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