New Advances in Machine-Verified Mathematical Proofs
kevrussell · x · 2026-07-11
This post highlights a new mathematical result: the upper bounds for the number of points in the dual kissing configuration problem for R¹¹ and R¹² cannot exceed 820 and 1,228, respectively.
The author emphasizes two key aspects of this approach:
- It provides tighter bounds in these dimensions compared to the "halving upper bound."
- The same pipeline can exactly reproduce classic sharp values, such as 120 for E₈ and 12 for D₄.
Technically, it utilizes a Delsarte linear programming method based on "completely rational exact arithmetic":
- Uses rational multipliers
- Employs Sturm root-counting over ℚ for root counting
- The certification path avoids floating-point numbers entirely
The author also provides a way to reproduce the experiments: clone the repository and run make verify. The verifier can reconstruct the theorem from raw coefficients in seconds. The post notes this is the fifth machine-verified note in the series and includes a DOI.
More from Research
- SUFLECA shows NOC-based correspondence can improve CAD-to-image alignment — ducha_aiki · 2026-07-21
- OpenAI-style autonomous researchers could become real scientific collaborators — Promptmethus · 2026-07-21
- Soft Clamp cuts tool-call overuse in multi-teacher distillation, from 13.7% to 9.0% — antgroup · 2026-07-21
- ShotPlan adds learnable planning tokens for cinematic multi-shot video generation — Tele-AI · 2026-07-21
- A silicon photonic reservoir chip compensates fiber distortion in real time at 28 Gbps — bravo_abad · 2026-07-21
- A developer maps out six design rules for CLIs that humans and AI agents can both use — yujiezha · 2026-07-21