OPERAND CLOSURE

Every stored tensor must map to a generic operation, every operation must carry judged semantics, and per-layer accounting must be total — a missing operand is a named refusal, never a silently skipped step.

The proof is causal: mutate a stored fact and the computation must change; where mutation changes nothing, a hidden default was hiding. The gate primitive entered the IR exactly this way — 52 layers refused by name until the semantics were judged. And since schema 6, closure is enforced at encode: a container whose operands do not close is removed, not written — encoding is the proof boundary.

IN THE GRAPH