mirror of
https://github.com/zooai/proofs.git
synced 2026-10-30 14:49:47 +00:00
zooqueenandHanzo Dev
ac9676a47a
The formal/lean library (53 files — a separate formalization from lean/) had ~110 type-check errors across 38 files and had never had its Mathlib oleans built. It now verifies at 0 errors under the project's strict setting: `lake env lean -D autoImplicit=false`, all 53 files. Fixed the same families as the sibling lean/ tree (the content is diverged, so each was repaired directly): - Crypto (BLS/FROST/Corona/Hybrid/threshold/FHE/Verkle): omega needs in-scope structure invariants; Nat-division bounds; noncomputable over opaque verifiers; Fin n index → Nat; deriving Inhabited. - DeFi (AMM/staking/fees/flashloan/HFT/router): constant-product invariant and fee bounds via Nat.div_mul_le_self / Nat.div_le_of_le_mul; dead tactics. - Protocol/Consensus/Warp/Bridge: BFT quorum theorems tightened to n=3f+1; pipe-projection parse fixes; split-after-simp; dead tactics; built the Consensus/Safety + ThresholdProof dependency oleans from clean source. - Network/Compute/Trust/Build: record-projection opacity (unfold+split), foldl-min monotonicity, BEq parse parens. - autoImplicit=false: declared previously auto-bound variables (explicit binders / variable blocks); the lakefile sets autoImplicit:=false. Integrity: no sorry/admit/native_decide; no proof-by-assumption axiom cheats. Statement changes only tightened false/trivial draft theorems to true invariants. Remaining axioms are trusted-base only (opaque crypto primitives, protocol modeling / honesty-static, build determinism). Co-authored-by: Hanzo Dev <[email protected]>
89 lines
2.9 KiB
Lean4
89 lines
2.9 KiB
Lean4
/-
|
||
Ray Protocol Formal Model
|
||
|
||
Models protocol/ray/ray.go -- linear chain consensus driver.
|
||
|
||
Ray pulls pending items from Source, runs Wave voting on each,
|
||
and commits decided items to Sink in order.
|
||
|
||
Key invariant: items are decided in a total order consistent
|
||
with the Source ordering. No reordering. No gaps.
|
||
|
||
Maps to:
|
||
- ray.go: Source.NextPending, Wave.Tick, Sink.Decide
|
||
- ray.go: Driver processes items sequentially from Source
|
||
|
||
Properties:
|
||
- Total order: decided items form a prefix of source order
|
||
- No gaps: if item at index i is decided, all items at index < i are decided
|
||
- Monotonic: decided set only grows
|
||
-/
|
||
|
||
import Mathlib.Data.Nat.Defs
|
||
import Mathlib.Data.List.Basic
|
||
import Mathlib.Tactic
|
||
|
||
namespace Protocol.Ray
|
||
|
||
/-- Item identifier -/
|
||
abbrev ItemId := Nat
|
||
|
||
/-- Decision for an item -/
|
||
inductive Decision where
|
||
| pending : Decision
|
||
| commit : Decision
|
||
| skip : Decision
|
||
deriving DecidableEq
|
||
|
||
/-- Ray state: tracks the decision frontier -/
|
||
structure RayState where
|
||
sourceOrder : List ItemId -- items in source order
|
||
decided : Nat -- number of items decided (prefix length)
|
||
decisions : ItemId → Decision
|
||
|
||
/-- Initial state -/
|
||
def init (items : List ItemId) : RayState :=
|
||
{ sourceOrder := items
|
||
, decided := 0
|
||
, decisions := fun _ => Decision.pending }
|
||
|
||
/-- Step: decide the next pending item -/
|
||
def decideNext (s : RayState) (d : Decision) (_hd : d ≠ Decision.pending) : RayState :=
|
||
match s.sourceOrder[s.decided]? with
|
||
| none => s -- no more items
|
||
| some item =>
|
||
{ s with
|
||
decided := s.decided + 1
|
||
decisions := fun id => if id = item then d else s.decisions id }
|
||
|
||
/-- decideNext marks exactly the next item as decided -/
|
||
theorem decideNext_marks_item (s : RayState) (d : Decision) (hd : d ≠ Decision.pending)
|
||
(item : ItemId) (h_get : s.sourceOrder[s.decided]? = some item) :
|
||
(decideNext s d hd).decisions item = d := by
|
||
simp [decideNext, h_get]
|
||
|
||
/-- decideNext advances the frontier by exactly 1 when items remain -/
|
||
theorem decideNext_advances (s : RayState) (d : Decision) (hd : d ≠ Decision.pending)
|
||
(item : ItemId) (h_get : s.sourceOrder[s.decided]? = some item) :
|
||
(decideNext s d hd).decided = s.decided + 1 := by
|
||
simp [decideNext, h_get]
|
||
|
||
/-- Initial state has nothing decided -/
|
||
theorem init_nothing_decided (items : List ItemId) :
|
||
(init items).decided = 0 := rfl
|
||
|
||
/-- No gaps: if item i is decided, item i-1 is decided -/
|
||
theorem no_gaps (s s' : RayState) (d : Decision) (hd : d ≠ Decision.pending)
|
||
(hs : s' = decideNext s d hd) :
|
||
s'.decided = s.decided + 1 ∨ s'.decided = s.decided := by
|
||
simp [decideNext] at hs
|
||
split at hs <;> simp_all
|
||
|
||
/-- Monotonic: decided count never decreases -/
|
||
theorem decided_monotone (s : RayState) (d : Decision) (hd : d ≠ Decision.pending) :
|
||
(decideNext s d hd).decided ≥ s.decided := by
|
||
unfold decideNext
|
||
split <;> simp_all
|
||
|
||
end Protocol.Ray
|