Follow-up on the same 11-square packing breakthrough: 300-line verifiable proof via 1,121 weighted dots
ctjlewis · x · 2026-10-05
A follow-up on the same AI-assisted math story: with Claude models (Opus and others), the author obtained s(11) ≥ 381/100, the first significant result in 23 years on this open problem. The lower-bound proof is verifiable with 300 lines of Python exact rational arithmetic and works by placing 1,121 unavoidable weighted dots inside the container square, with an explainer paper and interactive graphics.
More from coding & agent
- Running pi-durable inside a single Durable Object: a home-brew Cloudflare — threepointone · 2026-10-05
- Grok Bot as a real personal assistant: 12 hands-free use cases from food ordering to job hunting — aitrendz_xyz · 2026-10-05
- Dev says telling his coding agent to stop using subagents made everything work better — QuixiAI · 2026-10-05
- Permission granted but action wrong: the agent authorization problem — Invisible_act1988 · 2026-10-05
- AI agents given one prompt and $1 each to produce 30s videos: Opus 5.5 vs GPT-6 Astra — no3us · 2026-10-05
- Agentic Field Guide launches with 7 hands-on Kubernetes agent labs, 9 more coming — davemccollough · 2026-10-05