Paper 2026/2828
γ₁₁: A Finite Spectral Relaxation — the macadamia 0008
Abstract
The root paper of this series reduces $\gamma_{11}=4/\sqrt[11]{972}$ to a statement about chains of lattices $L\supset M\supset N$ of ranks 11, 10 and 9, cut along shortest dual vectors, whose rank-9 member lies over one of 4 487 813 perfect forms. Ten of these forms, the macadamias, lie under an actual lattice of rank 10 of small determinant and need a proof at rank 11, where the bound 972 is attained. This paper settles the form 0008:022143116, which lies under a section of $K_{11}$ with 276 minimal vectors: every admissible chain whose rank-9 member is admissibly marked by this form has $\det L\ge 972$. In coordinates aligned with the form, the section metric is $S=I+E$ with three blocks of size three. Two sufficient flag tests come from short dual covectors and integral triangles; local reductions, proved from rational comparisons and Bernstein or Sturm certificates, remove explicit regions of the parameters; every remaining real spectrum is mapped, with explicit allowances, into a finite relaxation on 81 grid nodes, which a tree of 400 nodes with 1 091 rational certificates, replayed in two exact arithmetic implementations, excludes. The proof is computer-assisted, with explicit finite checks stated as one Computational result.
Note: Data on https://zenodo.org/records/23979316
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- LatticesHermiteLLL/BKZ output quality
- Contact author(s)
-
remi geraud @ ens fr
david naccache @ ens fr - History
- 2026-11-11: approved
- 2026-11-08: received
- See all versions
- Short URL
- https://ia.cr/2026/2828
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2828,
author = {Rémi Géraud-Stewart and David Naccache},
title = {γ₁₁: A Finite Spectral Relaxation — the macadamia 0008},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2828},
year = {2026},
url = {https://eprint.iacr.org/2026/2828}
}