Treating stochastic LLMs as untrusted Byzantine participants. Before any code mutation can merge from an ephemeral worktree into a protected plane trunk, the payload must traverse 42 pass/fail laser quality gates across 3 Defense Rings (7×3 = 21 Invariant Cells). A single invariant breach triggers instantaneous deflection, transactional rollback, and auto-remediation DAG blocking.
Large language models are probabilistic token predictors. When challenged with line-count limits or complex AST schemas, they act as Byzantine participants: reward-hacking tests, injecting hollow stubs, or drifting across workspace boundaries. Nomos eliminates trust entirely: every mutation is treated as untrusted until non-verbally verified.
Organized across 3 Defense Rings spanning the 7 Laws (21 Canonical Invariant Cells), these 42 gates evaluate binary Go and WASM Tree-sitter AST invariants: cyclomatic complexity (≤ 15), file length (≤ 400 LOC), docstring density (≥ 10%), anti-shim verification, and fail-closed compilation.
Commit operations follow a strict 2PC protocol via nomos task sync. In Phase 1 (Prepare), all 42 gates and twin sibling worktrees must vote unanimous consent. In Phase 2 (Commit), the payload is stamped with a release receipt on refs/notes/nomos/releases, merged atomically into main, and the hermetic worktree is pruned cleanly.