IX. The E₈ Lattice
E₈ appears twice in this story — as a Lie algebra (248D) and as a lattice (8D).
The E₈ lattice is an infinite discrete structure in 8D space.
It's defined as:
E₈ = D₈ ∪ (D₈ + ½)
D₈ = { z ∈ ℤ⁸ : Σzᵢ is even }
This is an infinite lattice — every point satisfying this condition is in E₈.
The 240 "roots" are just the closest lattice points to the origin
(at distance √2). They're the kissing number, not the whole lattice.
Viazovska's Theorem (Fields Medal 2022)
In 2016, Maryna Viazovska proved that the E₈ lattice is the densest
possible sphere packing in 8 dimensions. No other arrangement of spheres
can do better.
Δ₈ = π⁴/384 ≈ 0.25367
Residual Lattice Quantization
The architecture uses nearest-point quantization to the full E₈ lattice —
not just the 240 roots. Any 8D vector maps to its closest lattice point.
The encoding: Each lattice point is stored as 8 integers
(half-step coordinates), encoded with variable-length varint.
Deeper residual levels have smaller coordinates → fewer bytes.
This is entropy-efficient, not a fixed 240-way lookup.
The Lie algebra E₈ (248D) is at the top of the hierarchy.
The E₈ lattice (infinite, in 8D) is at the bottom, for quantization.