Agent governance
grounded in formal proof.
Prolog defines the law. Z3 proves it.
Every decision is blocked or sealed; not logged after the fact.
How It Works
Four layers. Each one enforces the one above it.
Law
Agent rules and Codex laws are declared as Prolog predicates. Logic lives here, not in application code. Rules are auditable, composable, and independently queryable.
Verification
Before any action executes, Z3 proves it does not violate the declared rules. Not a best-effort check. A formal proof. Violations are blocked, not logged after the fact.
Bridge
The MRS bridge connects agents to the law layer. Every assertion passes through Codex validation. Every fact is logged to the immutable reasoning record.
Agents
Agents operate within the bounds the law permits. Authorization, memory access, and inter-agent consent all resolve through Prolog queries before execution.
Immutable Reasoning Log
Every assertion, query, and violation is written to a tamper-evident record. The log is the source of truth for why any decision was made.
Composable Agent Rules
Agents declare oaths and roles in Prolog. Trust, consent, and ownership propagate through the rule graph. No hardcoded permission checks.
Formal Proofs, Not Policies
Z3 constraints make compliance mathematically verifiable. A policy document describes intent. A Z3 constraint proves it.
Chain-Sealed Audit Trail
Reasoning log entries are sealed to the Strikaris Chain. Every decision is hash-linked, timestamped, and independently verifiable.
View the Source
Four directories: law, verification, bridge, memory. The authority hierarchy runs top to bottom. Nothing bypasses it.
- Prolog rules fully readable without tooling
- Z3 constraints independently executable
- Bridge and agent examples included
- Deployment instructions for sovereign infrastructure