2026-10-11 17:15 UTC

ProofAtlas.ai and zero0_one1 claim a ProofAtlas harness using GPT-5.6 Pro improved the lower bound for Moser’s convex worm problem from 0.2322 to greater than 0.2374.

state: expiredheat: lowuncertainty: highconvergesscott: mediumai-assisted-mathematics agent-harnessesProofAtlas.aizero0_one1OpenAI

What is this?

ProofAtlas.ai and zero0_one1 report that a ProofAtlas agent harness using OpenAI’s GPT-5.6 Pro produced a Lean-verified lower bound greater than 0.2374 for Moser’s convex worm problem, improving the previously published bound of about 0.232239. The supplied Wikipedia snippet confirms the older bound and says the problem remains open. However, the other search results concern a different zeroth-order convex-optimization result, so they do not independently substantiate the ProofAtlas claim or the assertion that it closes the broader theoretical gap.

Why it matters to Scott

The claimed workflow concretely converges with Scott’s verification-loop architecture: an agent harness generates mathematical work while Lean supplies a mechanically different, deterministic acceptance boundary. A second ProofAtlas result could strengthen the pattern already tracked in “Proof Atlas Collatz formalization,” but the supplied evidence remains announcement-level and lacks independent expert review or reproduction.
ip:concept.verification-loopsip:concept.mechanically-different-verifiersip:concept.evidence-class-ladderip:framework.agent-loopradar:proofatlas-collatz-formalizationradar:concept.formal-verificationradar:concept.mathematical-discoveryradar:concept.ai-mathematics
queries asked of Scott's wikis
  • agent harnesses for mathematical discovery
  • Lean verification as an AI-agent feedback loop
  • formal proof systems for grounding LLM outputs
  • long-context prompting versus iterative agent workflows
  • evidence standards for claimed AI scientific breakthroughs
  • human-model division of labor in theorem proving

Measured heat

no measured readings yet — the hourly heat pass fills this in

How the heat travelled

no chain yet — the hourly chain pass fills this in

Evidence (1) — ⭐ canonical anchor

sourceobjectauthorscorecomments
🟠 reddit ⭐A new lower bound for Moser's convex worm problem using ProofAtlas.ai harness and GPT-5.6 Pro: every convex universal cover for unit-length planar curves has area greater than 0.2374, improving the previous lower bound of 0.2322
singularity
zero0_one1344

Interpretation history

Decision trace