A private fork loses (the core of Lemma 15)
ProvedBitcoinBackbone.common_prefix_privateFor a legal, typical execution and honest party at round : any valid chain of rounds that forks from an honest block of round (or from genesis) and is adversarial above the fork, with , is strictly shorter than chain p r.
import Definitions.Def_BitcoinBackbone
theorem BitcoinBackbone.common_prefix_private (E : BitcoinBackbone.Execution) (hE : E.Legal)
(lam : ℕ) (hT : E.Typical lam) (p : ℕ) (hp : p < E.n) (r : ℕ)
(D : BitcoinBackbone.Chain) (hD : E.ValidChain D) (hDr : ∀ B ∈ D, B.round ≤ r)
(f r₀ : ℕ) (hfD : f ≤ D.length)
(hfork : (f = 0 ∧ r₀ = 0) ∨
∃ q, ∃ hf : f - 1 < D.length, 0 < f ∧ D[f - 1] = BitcoinBackbone.Block.honest q r₀)
(hadv : ∀ k (hk : k < D.length), f ≤ k → D[k].isHonest = false)
(hwin : r₀ + lam ≤ r) : D.length < (E.chain p r).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.common_prefix_private
Statement. Let be an execution of the backbone model, assumed legal (no mined-flag in round ; for , , is a valid chain; for every block of has round ; for and all , ; for , is valid with all blocks of round ). Let and assume is -typical:
with iff exactly one party index has , else . Let be a party index and a round. Let be an arbitrary chain (list of blocks, ) satisfying:
- is valid for : for every position , the block extends exactly the list , meaning: if then , and ; if then and .
- All rounds of are : every block in has .
Let with , and assume:
- Fork point (a disjunction):
- either and ;
- or there exist a natural number and a proof that such that and (the block at -based position is the honest block of party in round ).
- Adversarial tail: for every position with , the block is adversarial, i.e. , equivalently has the shape .
- Window: .
Then
where is party 's chain at the end of round ( if ; for , with appended iff ) and is list length. The inequality is strict.
Unpacking the fork disjunction. The two disjuncts are mutually exclusive via the value of : if the second disjunct fails (it requires ), so the first forces ; if the first disjunct fails, so the second must hold, and then is automatic from . So the hypothesis says: either and (in which case, by item 4, every block of is adversarial and item 5 reads ), or , position of holds for some (unconstrained in the hypothesis itself, but validity of at position entails , and ), and all blocks at positions are adversarial. The blocks at positions are not constrained in honesty by hypotheses 3–4 (only by validity and the round bound).
Edge cases. need not be the chain of any party; it is any list satisfying 1–2. is allowed (empty adversarial tail; then 's last block is if ). If then , hence , item 4 is vacuous, item 5 is , and the conclusion asserts , i.e. that 's chain at round is non-empty. - and -typicality are unsatisfiable (for take ; for take ), so the theorem is vacuous for ; typicality also forces . Legality's round- rule means an honest block with cannot occur in the valid chain , so in the second disjunct is forced; in the first disjunct by fiat.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.