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
- Open models below 4-bit struggle at self-iterating 3D asset generation, HF dev finds — mervenoyann · 2026-10-21
- Researcher Finds Two Windows 0-Days, First in 76 Minutes with a Frontier Model — moyix · 2026-10-21
- Dev finds Gemini Argon's debug-log analysis beats Fable 5.1 — ShikharMurty · 2026-10-21
- ChatGPT Gets Stuck Screaming "AAHH" in an Infinite Loop After a Simple Prompt — AutomaticScene · 2026-10-21
- Open-weights Ornith-1.5-122B debuts with 84.5% SWE-bench Verified, runs on a single DGX card — _akhaliq · 2026-10-21
- qev-0.8B: a tiny local decision model that picks moves in 3.5ms on 1.3GB — fajfas3 · 2026-10-21