Chain growth for one party
ProvedBitcoinBackbone.chain_growth_selfThe same bound with and .
import Definitions.Def_BitcoinBackbone
theorem BitcoinBackbone.chain_growth_self (E : BitcoinBackbone.Execution) (hE : E.Legal)
(p : ℕ) (hp : p < E.n) (r s : ℕ) (hrs : r ≤ s) :
(E.chain p r).length + ∑ i ∈ Finset.Ico (r + 1) s, E.X i ≤ (E.chain p 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_self
Statement. Let be an execution of the backbone model, assumed legal (no party has its mined-flag set in round ; for , the chain is valid; for every block of has round ; for all and all , ; for the chain is valid with all blocks of round ). Let be a natural number with , and let be natural numbers with (non-strict). Then
where is party 's chain at the end of round (; for , followed by if , else alone), is list length, and is exactly when some party index has .
Range of the sum. The index runs over , excluding both and . This set is empty when ; in particular, when the statement is the triviality , and when it is .
Differences from chain_growth. The same party appears on both sides (no second party ), and is permitted. Typicality is not assumed. is allowed (). If the hypothesis cannot hold and the statement is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.