The beautiful mathematics behind OpenAI's sphere packing result
brandonb
14 points
3 comments
August 17, 2026
Related Discussions
Found 5 related stories in 152.9ms across 8,795 title embeddings via pgvector HNSW
- AI-assisted proof of optimal packing for 11 squares bluepeter · 113 pts · October 07, 2026 · 53% similar
- OpenAI Says It Has Cracked One of Math's 'Millennium Problems' doener · 13 pts · September 08, 2026 · 52% similar
- New results in square packing problem by a hobbyist cheeseblubber · 11 pts · September 09, 2026 · 52% similar
- The OpenAI Bubble elorant · 30 pts · July 15, 2026 · 52% similar
- Mathematical manuscripts and supporting proof artifacts produced by OpenAI vikas-sharma · 42 pts · October 06, 2026 · 51% similar
Discussion Highlights (1 comments)
brandonb
(OP) The first of ten problems OpenAI solved was an improvement to the Cohn-Elkies bound. I briefly worked with Henry Cohn on sphere packing in undergrad. This topic is actually surprisingly accessible to the amateur mathematician so I thought I'd write up a primer and accessible description of the actual result.