MODEL
A traversal map, not a new model
We do not build a model — we build a traversal map that the model (LLM) walks on its own. The finite map separates domain structure from the narrative the model generates itself.
Structural vocabulary
Context
A bounded situation in which certain roles, evidence, and transitions make sense.
Role
An explicit authorization boundary for transitions.
State
The current position declared by integration, not silently inferred from text.
Transition
A named move between states, conditioned by gates and evidence.
Gate
A deterministic condition checked before a transition.
Bridge
An explicit move between contexts.
What you do not see on the surface
The six concepts above are only the visible part. Underneath there are really 10 typed primitives, split across 5 semantic floors — structural, binding, evidentiary, operational, publication — and each floor has its own expiry rule (TTL), not one global rule for everything. The structural floor never expires. A commitment expires after 10 steps. Evidence expires by the F×R×8 formula, based on real source trust and freshness — with high trust (0.8 × 0.9) you have 6 steps before it goes stale; with low trust (0.2 × 0.3) you have just one. None of this is arbitrary.
The gate above is not one check with exceptions bolted on later — it is 12 separate guards, each with one responsibility. And the logic behind them is not a disguised if-else: it is 6 real propositional operators (NOT, AND, OR, XOR, IMPLIES, IFF), assembled into real rules, not illustrative ones. One delivered example rule, deploy_readiness, chains two AND operators over three atomic facts to form a single rule; risk_escalation nests an AND inside an IMPLIES. You can read the actual rules now, not just the promise that they exist somewhere.
The engine declares 11 possible outcomes. 9 are live — verified directly in code, not in optimistic documentation. The remaining two (ASK, PUBLISH) are declared in the enum and named in the docstring, but no code returns them yet. This page says so plainly — you rarely see that in projects that promise more than they ship.
Finite-system interpretation
Let S be the set of states, A the candidate actions, and G the gate predicates. A transition is admissible only when the role, the evidence, and the gate formula are satisfied.