Candidate proof shows 1998 packing of 17 squares is optimal, built with Codex and Claude
ctjlewis · x · 2026-10-13
- Marc Leonard Overbeck released a candidate proof claiming that Bidwell's 1998 packing of 17 unit squares is optimal: s(17) = 4.67553009…
- The work was built with OpenAI Codex and Anthropic Claude, ships with exact certificates each checked by two independent implementations, and is open for public verification with Lean formalization planned.
- It builds on prior work by others in the community, and the author invites anyone to try to break the proof.
More from coding & agent
- Harness code becomes a research battleground: CMU rewrites it with RL, Apple says it doesn't matter — burkov · 2026-10-13
- FrontierCode speed analysis: DeepSeek V4.1 Flash runs tasks ~7 min, 40% of Opus 5.5's time — ArtificialAnlys · 2026-10-13
- Full FrontierCode 1.1 leaderboard goes live, Claude Opus 5.5 leads at 52.2% — ArtificialAnlys · 2026-10-13
- FrontierCode 1.1 leaderboard: Claude Opus 5.5 tops at 52% as leading models fail 40%+ of tasks — ArtificialAnlys · 2026-10-13
- FrontierCode cost analysis: $0.09 to $12 per task, GPT-6 models lead token efficiency — ArtificialAnlys · 2026-10-13
- Anaconda adds Kilo Agent Swarms and Enkrypt AI autonomous red-team agents — anacondainc · 2026-10-13