GPT-5.6 Pro improves lower bound for Moser's worm problem to 0.2374
zero0_one1 · reddit · 2026-09-04
A Reddit user reports a new lower bound for Moser's convex worm problem using the ProofAtlas.ai harness with GPT-5.6 Pro: every convex universal cover for unit-length planar curves has area greater than 0.2374, improving the 2013 best of 0.232239. The 60-year-old problem asks for the smallest-area convex region containing any planar curve of length one; the smallest known cover (Wichiramala & Panraksa, 2026) is about 0.260956, leaving a gap under 0.024. The proof is Lean-formalized and published on ProofAtlas.ai.
More from Models
- More GPT-6 codenames spotted: GPT-6-Pro and mysterious 'WM' suffix fuel world model speculation — scaling01 · 2026-09-04
- Meta's speech model targets messy real rooms as the ears for its glasses and agent stack — heypearlai · 2026-09-04
- Meta claims top spot on Artificial Analysis for streaming speech-to-text and diarization at launch — heypearlai · 2026-09-04
- OpenAI ships GPT-6 Astra; Brockman suggests it could be AGI — steph_palazzolo · 2026-09-04
- Follow-up links added to GPT-6 Astra leak thread — Angaisb_ · 2026-09-04
- GPT-6-Astra, GPT-6-Pro codenames spotted in ChatGPT frontend, fueling unconfirmed rumors — Angaisb_ · 2026-09-04