Chain growth (Lemma 7): an honest chain grows by at least the successful rounds
ProvedBitcoinBackbone.chain_growthFor a legal execution, honest parties and rounds : (chain p r).length + ∑_{i ∈ [r+1, s)} X i ≤ (chain q s).length. Every successful round adds a block to every honest party's chain by the next round.
import Definitions.Def_BitcoinBackbone
theorem BitcoinBackbone.chain_growth (E : BitcoinBackbone.Execution) (hE : E.Legal)
(p q : ℕ) (hp : p < E.n) (hq : q < E.n) (r s : ℕ) (hrs : r < s) :
(E.chain p r).length + ∑ i ∈ Finset.Ico (r + 1) s, E.X i ≤ (E.chain q s).length := 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_growth
Statement. Let be an execution of the backbone model (a 5-tuple , see the definition read-back), and assume is legal (the six conditions: no party has its mined-flag set in round ; for and the chain is valid; for every block of has round ; for all and all , ; for the chain is valid and all its blocks have round ). Let be natural numbers with and (so is forced), and let be natural numbers with (strict). Then
Meaning of the symbols.
- is party 's chain at the end of round : , and for it is with the block appended if , and itself otherwise. is list length.
- equals exactly when at least one party index has , and otherwise.
- The sum runs over the half-open integer interval : it excludes round and round themselves. When the interval is empty and the sum is , so the statement reduces to .
Edge cases made explicit. is allowed. is allowed, in which case and the claim is . The hypothesis -typicality does not appear in this theorem; only legality is assumed. Nothing is claimed about prefix relations between the two chains, only about their lengths. If the hypotheses , are unsatisfiable and the statement is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.