Closure hunts for hidden defaults

Consistency cannot prove sufficiency — four authorities can faithfully agree on an under-specified model. Operand closure is the independent witness: every stored tensor must map to a generic operation, every operation must carry judged semantics, and per-layer accounting must be total. The proof is causal: mutate a stored fact and the computation must change; where mutation changes nothing, a default was hiding.

SUPPORTED · G5 sealed — closure, golden parity and causal controls all landed; the controls found no hidden defaults