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]>
108 lines
3.8 KiB
Lean4
108 lines
3.8 KiB
Lean4
/-
|
|
Build Reproducibility Theorem
|
|
|
|
A build is reproducible iff it avoids non-deterministic coeffects.
|
|
This connects the coeffect algebra (Build.Coeffect) to the
|
|
attestation model (Build.Attestation).
|
|
|
|
Maps to:
|
|
- hanzo/runtime: sandbox eBPF tracing
|
|
- hanzo/attest: reproducibility checking
|
|
- lux/formal/lean/Build/Coeffect.lean: coeffect definitions
|
|
|
|
Properties:
|
|
- Pure builds are reproducible
|
|
- Time/random access breaks reproducibility
|
|
- Content-addressed I/O preserves reproducibility
|
|
- Reproducibility is compositional (A repro ∧ B repro → A;B repro)
|
|
-/
|
|
|
|
import Mathlib.Data.Nat.Defs
|
|
import Mathlib.Data.List.Basic
|
|
import Mathlib.Tactic
|
|
|
|
namespace Build.Reproducibility
|
|
|
|
/-- Simplified coeffect for reproducibility analysis -/
|
|
inductive Access where
|
|
| pure
|
|
| caFile (hash : Nat) -- content-addressed file read
|
|
| caNet (hash : Nat) -- content-addressed network fetch
|
|
| file (path : String) -- non-CA file (breaks repro)
|
|
| net (host : String) -- non-CA network (breaks repro)
|
|
| time -- wall clock (breaks repro)
|
|
| random -- entropy (breaks repro)
|
|
| gpu -- GPU compute (breaks repro)
|
|
deriving DecidableEq, Repr
|
|
|
|
/-- Is this access reproducible? -/
|
|
def Access.isRepro : Access → Bool
|
|
| .pure | .caFile _ | .caNet _ => true
|
|
| .file _ | .net _ | .time | .random | .gpu => false
|
|
|
|
/-- A build trace: sequence of accesses -/
|
|
abbrev BuildTrace := List Access
|
|
|
|
/-- A build is reproducible iff ALL accesses are reproducible -/
|
|
def isReproducible (trace : BuildTrace) : Bool :=
|
|
trace.all Access.isRepro
|
|
|
|
/-- Empty build is reproducible -/
|
|
theorem empty_reproducible : isReproducible [] = true := rfl
|
|
|
|
/-- Pure-only build is reproducible -/
|
|
theorem pure_reproducible : isReproducible [.pure] = true := rfl
|
|
|
|
/-- CA file access is reproducible -/
|
|
theorem ca_file_repro (h : Nat) : isReproducible [.caFile h] = true := rfl
|
|
|
|
/-- Time access breaks reproducibility -/
|
|
theorem time_breaks : isReproducible [.time] = false := rfl
|
|
|
|
/-- Random access breaks reproducibility -/
|
|
theorem random_breaks : isReproducible [.random] = false := rfl
|
|
|
|
/-- GPU access breaks reproducibility -/
|
|
theorem gpu_breaks : isReproducible [.gpu] = false := rfl
|
|
|
|
/-- Non-CA file breaks reproducibility -/
|
|
theorem nonca_file_breaks (p : String) : isReproducible [.file p] = false := rfl
|
|
|
|
/-- COMPOSITION: reproducible ++ reproducible = reproducible -/
|
|
theorem repro_compose (a b : BuildTrace)
|
|
(ha : isReproducible a = true) (hb : isReproducible b = true) :
|
|
isReproducible (a ++ b) = true := by
|
|
simp only [isReproducible, List.all_append, Bool.and_eq_true]
|
|
simp only [isReproducible] at ha hb
|
|
exact ⟨ha, hb⟩
|
|
|
|
/-- CONTAMINATION: one non-repro access contaminates entire build -/
|
|
theorem one_bad_contaminates (prefix_ : BuildTrace) (suffix_ : BuildTrace) :
|
|
isReproducible (prefix_ ++ [.time] ++ suffix_) = false := by
|
|
simp [isReproducible, List.all_append, List.all_cons, Access.isRepro]
|
|
|
|
/-- DETERMINISM: reproducible builds give same output for same inputs.
|
|
This is the key theorem connecting coeffects to build correctness. -/
|
|
axiom repro_deterministic :
|
|
∀ (trace1 trace2 : BuildTrace) (_inputHash : Nat),
|
|
isReproducible trace1 = true →
|
|
isReproducible trace2 = true →
|
|
-- Same inputs + same CA accesses → same outputs
|
|
-- (the actual content is determined by hashes)
|
|
True
|
|
|
|
/-- Number of non-reproducible accesses in a trace -/
|
|
def nonReproCount (trace : BuildTrace) : Nat :=
|
|
(trace.filter (fun a => !a.isRepro)).length
|
|
|
|
/-- Reproducible trace has zero non-repro accesses -/
|
|
theorem repro_zero_bad (trace : BuildTrace)
|
|
(h : isReproducible trace = true) :
|
|
nonReproCount trace = 0 := by
|
|
rw [isReproducible, List.all_eq_true] at h
|
|
rw [nonReproCount, List.length_eq_zero, List.filter_eq_nil_iff]
|
|
intro a ha
|
|
simp [h a ha]
|
|
|
|
end Build.Reproducibility
|