Rupert's problem
Independently settled a 350-year-old open mathematical conjecture — whether every convex polyhedron fits through itself.
From the CV:
- Heavily computer-assisted proof involving 10,000+ lines of C++ utilising interval arithmetic to bound floating-point inaccuracy.
- Novel solutions to numerous complex sub-problems; 1,000+ hours of independent research; preprint in progress.
- C++ and TypeScript, June 2024 – present.
[ write-up — to be written ]