Chain quality: every λ consecutive blocks of an honest chain contain an honest block
ProvedBitcoinBackbone.chain_qualityFor a legal, typical execution, honest , round and position with (chain p r).length: among the blocks of chain p r starting at position there is an honest one. The weak () form of the paper's chain-quality theorem.
import Definitions.Def_BitcoinBackbone
theorem BitcoinBackbone.chain_quality (E : BitcoinBackbone.Execution) (hE : E.Legal)
(lam : ℕ) (hT : E.Typical lam) (p : ℕ) (hp : p < E.n) (r u : ℕ)
(hu : u + lam ≤ (E.chain p r).length) :
∃ B ∈ ((E.chain p r).drop u).take lam, B.isHonest = true := by sorryRead-back
What the Lean code literally says, in plain math · claude-fable-5-1 (independent sub-agent, blind: Lean code + auditor instructions only)
Read-back: BitcoinBackbone.chain_quality
Statement. Let be an execution of the backbone model, assumed legal (no mined-flag in round ; for , , is a valid chain; for all blocks of have round ; for and all , ; for , is valid with all blocks of round ). Let and assume is -typical:
with exactly when exactly one party index has (else ). Let , let be a round and a position, and assume
where is party 's chain at the end of round ( for ; otherwise with appended iff ). Then there exists a block occurring in the list
(the chain with its first elements removed, then truncated to its first elements) such that has the shape , i.e. .
Indexing and window. Positions are -based, so consists of the blocks at positions . In general "drop then take " returns fewer than blocks when the list is too short (dropping past the end yields , taking past the end yields what remains), but under the hypothesis the window has exactly elements. The conclusion is an existence claim: at least one honest block in , with no lower bound on how many.
Degenerate cases. If then and the conclusion is false; however -typicality is unsatisfiable (taking gives the impossible ), so this case is vacuous. Likewise -typicality is unsatisfiable ( gives an empty right-hand sum). Typicality also forces (if every ). If then and forces , again vacuous. The window may start anywhere ( is unconstrained except by ), including .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.