Mode B · Software tier
Provable 100% syntactic conformance to a customer-supplied schema, JSON Schema, XML, or any format expressible as a formal grammar, enforced at generation time, not caught after the fact.
The mechanism
A grammar automaton masks invalid tokens in the decoding loop, so a non-conforming token cannot be sampled. The output is conformant because no other output was reachable.
Parse, accept, or repair-and-revalidate the full response. Outputs too convoluted to parse trigger a re-prompt to simplify, never an unchecked pass.
Input
Model
Enforce
Automaton mask
Output
Conformant
What "provable" means here
Acceptance is binary and decidable, no probability, no threshold, no calibration. The guarantee is by construction, not best effort: a non-conforming output is never produced, rather than produced and caught.
That is Mode B exactly as the Enforcement Modes page defines it, delivered in software rather than silicon.
Enforcement Modes →In practice
The provider supplies its published schema as the grammar. Every response is schema-valid by construction, for every tenant, on every call. Integration breakage is eliminated rather than monitored, there is no invalid response to catch downstream, because none can be generated.
The honest boundary
Satisfies Rules 2 and 4 within the software trust boundary; Rules 1, 3 and 7 in full arrive at the hardware rung. The eight rules →