Paper 2026/2926

γ₁₁: Computational Certificates — the macadamias 0001, 0014, 0015, 0059 and 0052

Rémi Géraud-Stewart, École Normale Supérieure - PSL
David Naccache, École Normale Supérieure - PSL, Fakultet inženjerskih nauka, Univerziteta u Kragujevcu
Abstract

The macadamias are the ten perfect forms of rank 9 for which the proof of the Hermite constant $\gamma_{11}$ cannot be completed at rank 10. Four of them, 0001, 0014, 0059 and 0015, were treated at rank 11 by contact geometry in our previous work, and a fifth, 0052, by a gluing argument with a computer proof. To reduce dependency on pen-and-paper mathematical proofs and increase confidence in the announced results, this paper gives a second, machine-checked confirmation of these five cases. The new proof relies on computed certificates. A certificate counts only in general mode: it must hold for every lattice of rank nine that is admissibly marked by the form, and not only for the form itself. The certificate of a form is a tree of boxes over the space of its first gluings, every leaf of which is checked exactly, together with a ball of gluings around the rank-ten lattice stored with the form, on which some leaves rely. The ball comes from an exact theorem in which the gluing and the rank-nine member both move; the bound $\det L\ge 972$ follows from the inequality $\det L\ge\det M\,(4-\rho^2(M))$ between a lattice $L$ of rank 11, its primitive sublattice $M$ of rank 10 and the covering radius $\rho(M)$. For 0059 the ball uses a contact-cone certificate of degree three; for 0015, whose stored lattice has no margin, a sharper localisation and an off-mean covering bound, both proved here; 0052 needs no ball. We state what each program checks, give the checking algorithms, all in integer and rational arithmetic, including a parallel final verification of a tree, and describe the publicly available database that stores the certificates, with the commands that check each form again from the database, the build and the reproduction pack. Floating point is used to find certificates but never to accept them. The five certificates check again, by a second route, the proofs of these five cases in our previous papers; they do not replace them.

Note: Data on https://zenodo.org/records/24269559

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-21: approved
2026-11-17: received
See all versions
Short URL
https://ia.cr/2026/2926
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2926,
      author = {Rémi Géraud-Stewart and David Naccache},
      title = {γ₁₁: Computational Certificates — the macadamias 0001, 0014, 0015, 0059 and 0052},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2926},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2926}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.