A minimal proof substrate that formally verifies the correctness of autonomous governance stack components through deterministic, replayable, machine-verifiable proofs.
FAK serves as a kernel-level verification system beneath DIO, ZT-AAS, ICAE, and POC. It consumes immutable artifacts from these systems and attaches formal proofs to them, ensuring behavioral soundness, authority non-escalation, economic invariance, and semantic preservation.
┌─────────────┐ ┌──────────────┐ ┌─────────────┐ ┌─────────────┐
│ DIO │ │ ZT-AAS │ │ ICAE │ │ POC │
│ (Execution) │ │(Capabilities)│ │ (Cost) │ │ (Policy) │
└──────┬──────┘ └──────┬───────┘ └──────┬──────┘ └──────┬──────┘
│ │ │ │
└───────────────┴───────┬────────┴───────────────┘
▼
┌───────────────────────────────────────────────┐
│ FAK - Formal Assurance Kernel │
│ │
│ ┌─────────────┐ ┌─────────────┐ │
│ │ Invariant │ │ Proof │ │
│ │ DSL │ │ Engine │ │
│ └─────────────┘ └─────────────┘ │
│ ▲ ▲ │
│ └─────────┬─────────┘ │
│ ┌──────────────────┴─────────────────────┐ │
│ │ Artifact Manager │ │
│ │ (Content-addressable storage) │ │
│ └────────────────────────────────────────┘ │
└───────────────────────┬───────────────────────┘
│
▼
┌───────────────────────────────────────────────┐
│ Verifier │
│ (Standalone verification tool) │
└───────────────────────────────────────────────┘
Minimal language for declaring invariants, preconditions, postconditions, and temporal properties. Avoids general-purpose computation by design.
Combines trace replay with invariant checking using SMT-style reasoning where required. Produces deterministic, replayable proof witnesses.
Ensures immutability, content-addressability, and versioning of all inputs. Artifacts are uniquely identified by content hash.
Standalone tool that accepts proof bundles and re-checks invariants without runtime dependencies. Performs integrity checks to ensure content-addressability and prevent tampering.
cargo build --releasecargo test./fak # Linux/macOS
.\fak.exe # Windows- Deterministic - All proofs are reproducible with identical inputs.
- Replayable - Proofs can be re-executed without external dependencies.
- Machine-Verifiable - Proofs compile to verifiable intermediate representations.
- Content-Addressable - Artifacts are immutable and uniquely identified.
- Minimal DSL - Invariant language avoids general-purpose computation.
- Explicit Failures - Clear counterexamples on invariant violations.
- Rust 1.56+