2763 — Uniform Consumer Compilation Needs a Bounded Decoder
Finite kernel inclusion gives exact factorization but not a continuous completed compiler. Uniform compilation is the cutoff-independent domination inequality (L_N^*L_N\le C^2R_N^*R_N). An exact family has zero kernel at every cutoff while its squared decoder cost grows as (2N^2); one transverse row restores a uniform Gram lower bound (1/2).
- Packet:
research/kitaev/uniform-consumer-compilation-needs-a-bounded-decoder.md - Checker:
research/kitaev/checkers/check_uniform_consumer_decoder.py - Results:
research/kitaev/results/uniform-consumer-decoder.json - Sequence:
seqclaim-156a59483de2086f4b9131c9 - Epistemic graph:
ev-000000004222-516a56d3-f3c9-4cbf-96fe-4097e8b86b60
The transverse repair is an algebraic signature, not authority to add a theta seam row. Theta application remains frozen. No commit or push was authorized.