Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.2.1, p. 298 — all correct processors decide by round GST + 4(N + 1)

Proved
DLSConsensus.BasicRound.decision_round_bound

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

consensusdistributed-computingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume the basic round model with omission (in particular fail-stop) faults and N≥2t+1N\ge 2t+1N≥2t+1. Let CCC be any set of at least N−tN-tN−t processors, GST\mathrm{GST}GST any round, deliv\mathrm{deliv}deliv any delivery pattern allowed for CCC and GST\mathrm{GST}GST, init\mathrm{init}init any initial values in an arbitrary domain VVV, and pick\mathrm{pick}pick any admissible choice function. Then every processor p∈Cp\in Cp∈C decides some value vvv at some phase kkk whose decision round satisfies

4k−1 ≤ GST+4(N+1).4k-1 \ \le\ \mathrm{GST}+4(N+1).4k−1 ≤ GST+4(N+1).

This is the quantitative form of termination for Algorithm 1: decisions come at most a constant number of phases (linear in NNN) after GST.

Formalization Note The paper's "make decisions by round GST + 4(N+1)" is read as: the decision event (the computation subround of round 4k−14k-14k−1 of the deciding phase kkk) happens at a round at most GST+4(N+1)\mathrm{GST}+4(N+1)GST+4(N+1).

Preamble
import Mathlib
import Definitions.Def_DLSConsensus_BasicRound_Model
Formal statement
namespace DLSConsensus.BasicRound

/-- Section 3.2.1, p. 298: under the hypotheses of Theorem 3.1, every processor in `C` decides at
some phase `k` whose decision round `4k - 1` is at most `GST + 4(N + 1)`. -/
theorem decision_round_bound {N t : ℕ} (hN : 2 * t + 1 ≤ N) {V : Type*} (init : Fin N → V)
    (C : Finset (Fin N)) (hC : N - t ≤ C.card) (GST : ℕ) (deliv : ℕ → Fin N → Fin N → Prop)
    (hdeliv : DelivOK C GST deliv) (pick : ℕ → Set V → V) (hpick : PickAdmissible pick) :
    ∀ p ∈ C, ∃ (k : ℕ) (v : V),
      DecidesAt t pick init deliv p k v ∧ 4 * k - 1 ≤ GST + 4 * (N + 1) := by sorry

end DLSConsensus.BasicRound
Source
Dwork, Lynch, Stockmeyer, Consensus in the presence of partial synchrony, J. ACM 35 (1988), p. 298, Section 3.2.1 (sentence after the proof of Theorem 3.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