Engineering

Receptive tools and generative tools. The receptive ones return values that come from the human, regardless of what the agent says. Trying to bypass them fills the center: with produced sparks (L2) or with false access to ∞0 (L3). The validator catches both.

The cycle expressed in LangGraph: each phase a node, the edges S→G→Q→P→V, the validator the terminal check. Execution interrupts at attestation points so a human fills the slots no model can fill for them. The graph carries the discipline by construction.

The validator emits findings the validator itself cannot resolve. ATTESTATION_REQUIRED for L2 at the spark, for L3 at the resonance — only the human inquirer can attest. The validator refuses to silently certify a cycle whose human side was empty.

A model validator refuses to construct a cycle whose B'' is present without ∞0'. The Completion Rule made impossible to violate by construction, regardless of what code path produced the cycle. The first surface where the language becomes executable rather than legible.

reST is usually treated as the documentation layer beneath 'real' software. The codex inverts that. The Constitutional Block becomes a directive that fails the build on paraphrase. The validation protocol becomes doctests. One canonical source, every later surface linking in.