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
- Proto-tools, a universal infrastructure layer for generative biology, now open source — jmschreiber91 · 2026-10-26
- New paper finds AI agents negotiate badly under uncertainty and break deals on purpose — xuanalogue · 2026-10-26
- MCP fault injection study: agent task scores drop 60% under realistic tool failures, scale doesn't help — dair_ai · 2026-10-26
- Study: AI reviewing AI misses most reward hacking; best models miss 25%+ of hacks — ronbodkin · 2026-10-26
- FLUX.3 Klein step-distilled to 4-8 steps with CFG baked in — Fit-Structure-6489 · 2026-10-26
- NLI alone rejects 5/6 new agent memories; a 0.45 similarity gate fixes it all — Alternative_Pin9598 · 2026-10-26