We ask a narrow, falsifiable question: can a ~3.3 bit-per-weight (bpw) trellis codec be made near-lossless — retaining at least 96.5% of the full-precision model's item-level benchmark performance — by better mathematics or better training, on consumer hardware? We answer with measurements on Qwen2.5-1.5B (1.54B deployed parameters) on a single 12 GB GPU, cross-checked at 3B. (i) The ceiling is arithmetic: the coder sits 1.23–1.32x above the Shannon bound at K=3,4,5,6, approximately constant, so perfect coding is worth about +5 retention points, not the 17 the bar demands; at 3.34 bpw the bar requires an effective weight error 3.8x below the bound. (ii) The source offers no exploitable structure: post-rotation weights are white (kurtosis 3.07; spectral AM/GM 1.13–1.24; residual AM/GM 1.22–1.38), and an activation-side anisotropy gain of 1.47x in sample collapses to 0.98–1.02x out of sample. (iii) The codec column closes by identification: the trellis is numerically the D8 lattice (0.02723 vs 0.02735); E8 is 1.22x better at entropy-matched rate but only 1.03–1.10x once a fixed-rate 2^(8R) container is imposed; entropy coding of the stored stream is exactly 1.000x. Training saturates: scales-only QAT buys +6.1 points (p = 0.004) for 0.09% of the parameters and 0.77M tokens, then drives perplexity below the full-precision model while coding stays flat; latent training is significantly worse on HellaSwag (p = 0.0139). The residual damage is additive and unlocalisable. What moves the number is rate and scale. The release contains the paper (LaTeX and PDF), the three figures, the per-item result files behind every table, and the scripts that produce the tables.
No takes yet. Share an insight, caveat, or question.
Baran Mamo (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: