mirror of
https://github.com/zooai/proofs.git
synced 2026-10-30 14:49:47 +00:00
zooqueenandHanzo Dev
d3bff5e2dc
The lean/ proof library (88 files) had ~180 type-check errors across ~45 files plus 31 proof-by-assumption axiom cheats. It now type-checks cleanly under Lean 4.14.0 + Mathlib, with every theorem genuinely proven from definitions. Errors fixed: - Stale Mathlib imports: Data.Nat.Basic / Data.Int.Basic were removed this rev -> Data.Nat.Defs / Data.Int.Defs (57 files). - Shared AI/Agent/Governance/Contract/DeFi/Ecology draft files: same proof-rot as the zoo-labs sibling library (now reconciled): omega missing in-scope bounds, dead tactics after simp, simp over-reduction, doc-comment placement, reserved-word binders, deriving Repr on Finset-bearing structs, noncomputable defs over opaque primitives. - Consensus/Liveness: collapsed a 74-error cascade (undefined shared state model inlined from Safety.lean; the |>. pipe-projection vs comparison parse trap on 14 lines rewritten to explicit dot projection). - Crypto (BLS/FROST/Corona/Hybrid/threshold/FHE), Consensus, Protocol, Warp, Trust, GPU, Compute, Network, DeFi: brought structure invariants into scope for omega, Nat-division bounds via Nat.div_le_of_le_mul / Nat.div_mul_le_self, noncomputable over opaque crypto ops, deriving Inhabited for index access. Integrity: - Removed all 31 `theorem X := X_ax` cheats (axiom asserting the identical statement) and proved each from definitions; removed the UNSOUND content_addressed axiom (hash-injectivity over a struct with free fields). - Quorum-intersection theorems (BFT/Quasar/Flare/Warp/BLS/GPU/Bridge): the draft hypothesis 3f<n is insufficient (n unbounded above makes them false); tightened to the optimal-resilience invariant n=3f+1 / 2t>n. Statement intent preserved. - Net axiom change: -35 / +1 (the one addition, honesty_static, is a fixed-validator-set modeling assumption matching sibling files). - Remaining axioms are trusted-base only: opaque crypto primitives (groups, pairings, hardness, hashes, FHE encrypt/decrypt, BLS soundness, forward secrecy, Fisher-Yates uniformity) and protocol modeling assumptions. No sorry/admit/native_decide. Verified all theorems trace to [propext, Classical.choice, Quot.sound] plus those primitives. Co-authored-by: Hanzo Dev <[email protected]>
103 lines
3.3 KiB
Lean4
103 lines
3.3 KiB
Lean4
/-
|
|
Authors: Antje Worring, Zach Kelling
|
|
|
|
Content-Addressed Build Attestation
|
|
|
|
Every build artifact is content-addressed via uor.foundation URIs.
|
|
Discharge proofs attest what happened during a build.
|
|
Signatures bind ALL security-relevant fields.
|
|
|
|
Address scheme: uor.foundation/{hash}/{name}
|
|
|
|
Maps to:
|
|
- hanzo/attest: attestation service (Go)
|
|
- hanzo/kms: signing keys
|
|
- lux/mpc: threshold signing for attestations
|
|
- lux/consensus: on-chain attestation recording
|
|
|
|
Properties:
|
|
- Content addressing is injective (modulo hash axiom)
|
|
- Attestation signatures are unforgeable
|
|
- Reproducible builds have no time/random accesses
|
|
-/
|
|
|
|
import Mathlib.Data.Nat.Defs
|
|
import Mathlib.Tactic
|
|
|
|
namespace Build.Attestation
|
|
|
|
/-- Content-addressed store path: uor.foundation/{hash}/{name} -/
|
|
structure StorePath where
|
|
hash : Nat -- SHA-256 of content
|
|
name : String -- Human-readable name
|
|
deriving DecidableEq, Repr
|
|
|
|
/-- Hash function (axiomatized) -/
|
|
axiom contentHash : Nat → Nat
|
|
|
|
/-- Random oracle: hash is injective (strongest axiom) -/
|
|
axiom hash_injective : ∀ a b : Nat, contentHash a = contentHash b → a = b
|
|
|
|
/-- Build derivation: recipe for producing artifacts -/
|
|
structure Derivation where
|
|
inputs : List StorePath
|
|
builder : StorePath
|
|
args : List String
|
|
deriving DecidableEq, Repr
|
|
|
|
/-- Derivation hash covers ALL fields -/
|
|
axiom derivationHash : Derivation → Nat
|
|
|
|
/-- Discharge proof: evidence of what a build did -/
|
|
structure DischargeProof where
|
|
derivation : Nat -- hash of derivation
|
|
outputHashes : List Nat -- hashes of outputs
|
|
builder : Nat -- builder's public key
|
|
startTime : Nat -- build start
|
|
endTime : Nat -- build end
|
|
hasTimeAccess : Bool -- did it read the clock?
|
|
hasRandomAccess : Bool -- did it use entropy?
|
|
|
|
/-- Proof message binds ALL fields (prevents replay) -/
|
|
def proofMessage (p : DischargeProof) : Nat :=
|
|
-- In practice: hash of (derivation, outputs, builder, times)
|
|
p.derivation + p.outputHashes.length + p.builder + p.startTime + p.endTime
|
|
|
|
/-- Signature verification (axiomatized) -/
|
|
axiom sigVerify : Nat → Nat → Nat → Bool
|
|
|
|
/-- A proof is reproducible iff no time or random access -/
|
|
def DischargeProof.isReproducible (p : DischargeProof) : Bool :=
|
|
!p.hasTimeAccess && !p.hasRandomAccess
|
|
|
|
/-- Reproducible proofs have no time access -/
|
|
theorem reproducible_no_time (p : DischargeProof)
|
|
(h : p.isReproducible = true) :
|
|
p.hasTimeAccess = false := by
|
|
simp [DischargeProof.isReproducible, Bool.and_eq_true, Bool.not_eq_true'] at h
|
|
exact h.1
|
|
|
|
/-- Reproducible proofs have no random access -/
|
|
theorem reproducible_no_random (p : DischargeProof)
|
|
(h : p.isReproducible = true) :
|
|
p.hasRandomAccess = false := by
|
|
simp [DischargeProof.isReproducible, Bool.and_eq_true, Bool.not_eq_true'] at h
|
|
exact h.2
|
|
|
|
/-- Same content → same hash → same store path -/
|
|
theorem content_determines_path (a b : Nat)
|
|
(h : contentHash a = contentHash b) : a = b :=
|
|
hash_injective a b h
|
|
|
|
/-- uor.foundation URI construction -/
|
|
def toURI (sp : StorePath) : String :=
|
|
s!"uor.foundation/{sp.hash}/{sp.name}"
|
|
|
|
/-- Two store paths with same hash and name produce same URI -/
|
|
theorem same_path_same_uri (a b : StorePath)
|
|
(hh : a.hash = b.hash) (hn : a.name = b.name) :
|
|
toURI a = toURI b := by
|
|
simp [toURI, hh, hn]
|
|
|
|
end Build.Attestation
|