Applications
D-02candidate domainUnder investigation
Formal Verification
Runtime and machine-checked evaluation align naturally with the platform's design.
Current scope
Exploring the substitution of empirical runtime gates with mechanically-checked proofs where the target domain admits them (e.g. proof-carrying refactors, verified compiler passes, SMT-backed invariants).
Explicitly out of scope
- Full end-to-end proof discovery is not the near-term goal.
- Interactive theorem-prover workflows are not currently integrated.
Research strands informing this scope
Invariant taxonomy
Cataloguing invariant classes to distinguish those provable statically from those only checkable at runtime.
Evidence and provenance standard
Extending the signed-artifact contract to include proof objects alongside runtime traces.
Evidence references
Each reference links to the signed dossier for that experiment. Nothing on this page claims deployment — these are the artifacts that inform the current scope.
Open questions
- Which invariant classes in the current corpus admit machine-checked proofs without exploding proof-search cost?
- How does the ledger schema accommodate proof objects at scale?
Next milestone
Publish a signed pilot in which one gate class is replaced by a mechanically-checked proof.