Finite ε-horizon from a geometric all-contested bound
ProvedOpenSearchLivenessTimed.epsilon_horizoncluster-coordinationconsensusformal-verificationlivenessopensearchzen2
Given any sequence of all-contested-round probabilities bounded geometrically, with , for every there is a round count with . This is the finite form of probabilistic liveness: it turns a geometric bound into an explicit -horizon without claiming a deterministic bound, and it does not itself prove the geometric bound.
Preamble
import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Topology.Order.Basic import Mathlib.Order.Filter.AtTopBot.Basic
Formal statement
theorem OpenSearchLivenessTimed.epsilon_horizon (b : ℚ) (hb0 : 0 ≤ b) (hb1 : b < 1)
(allContested : ℕ → ℚ) (hbound : ∀ K, allContested K ≤ b ^ K)
(ε : ℚ) (hε : 0 < ε) : ∃ K, allContested K < ε := by sorrySource
OpenSearch cluster coordination, pinned revision b2a54ba5c0defba3d1d20423e911d4bf920bab19 (org.opensearch.cluster.coordination); liveness/timer gap-closure analysis, new theorems mechanized from the branch's OpenSearchCoordination/OpenSearchPreVote/OpenSearchSafety/OpenSearchProgress missions.