Executive Summary: What Held, What Failed, and What the Sweep Found
Testing the three weight-only codebook families proposed in PR #6 against equal-bit scalar mixes (S) and E8 mixes across Gaussian (G), heavy-tailed Student-t4 (T), and 32 real speech-model matrices (Real) yields a sharp split: as proposed, every candidate loses to both scalar and E8 on every family because pyramidal Voronoi cells carry a 0.68–1.69 dB normalized second-moment penalty over cubes. However, an unplanned sweep (larger_t.py) letting the axis offset t move to 3.2–4.0 uncovered an outlier-escape regime that beats scalar rounding in 38/40 synthetic cells (up to −1.72 dB on Student-t) and beats E8 in 8/40 low-bit cells.
Why Packing Fraction (ρ) Does Not Govern Quantization Error (G)
PR #6 cited sphere-packing fractions (ρ = 0.2233 for F3 and φ = 0.746865 for CaB6) as evidence of quantization quality. Sphere packing governs channel noise resistance, whereas fine-cell source coding distortion obeys D ≈ G · V2/n, where G is the dimensionless normalized second moment of the Voronoi cell. The cube achieves G = 1/12 = 0.083333 and E8 achieves 0.071682; pyramidal Voronoi cells in Fn and CaBn have higher second moments, losing 0.68 to 1.69 dB before data distribution effects even enter.
Normalized Second Moment G: Closed-Form vs. Measured (bounds.out §7)
Precision Check: All 14 measured G values sit within 1.7 standard errors of the new closed-form expressions (0.1 and 0.9 SE on 40M-point checks for n = 8, 16). Even placing t at the pyramid centroid rather than the incentre still leaves F8 1.48 dB worse than a cube.
The 6 Empirical Conclusions in Short
Proof Summary: Why Pyramidal Voronoi Decoding Holds for Any t ∈ (0, 1)
Translate x into [-1, 1]ⁿ with x1 ≥ |xj| for all j. Any point of Fn has the form p = 2m + s·t·ek with 0 < t < 1.
For l ≠ k, (xl − 2ml)² ≥ xl² since |xl| ≤ 1. On coordinate k, the nearest of 2m ± t is sign(xk)·t because midpoints sit at 0 and ±1.
|x − p|² ≥ |x|² − 2t|xk| + t² ≥ |x − t e1|². Checked against exhaustive search on 200,000 points for n = 2..5 and 75 full codebooks (40 main + 35 sweep): max difference = 0.