SAT solver proves pigeonhole UNSAT in 33,423 steps, verified by VeriPB
TinfoilTricorn · x · 2026-10-30
rookepoole's homegrown SAT solver proved the pigeonhole instance '40 objects into 39 slots' UNSAT in 33,423 steps, with the proof externally verified by VeriPB — a classic hard case in proof complexity and a strong correctness milestone.
More from Research
- Is sycophantic AI inflating research publications? Two mechanisms worth questioning — KLdivergence · 2026-10-30
- Tahoe AI's Tara plug-in brings 100M-cell drug datasets to Claude Code, Codex and Cursor — anshulkundaje · 2026-10-30
- Joy dataset: 100,000 hours of unscripted two-person calls to teach voice models real timing — Scobleizer · 2026-10-30
- Exo: Berkeley's self-improving agent architecture cuts costs 31-62% vs Codex — arena · 2026-10-30
- New paper asks why teams of AI agents fail where a single agent often matches them — JoshPurtell · 2026-10-30
- Prime Intellect makes DeepSeek's MegaMoE trainable, up to 55% faster MoE training — samsja19 · 2026-10-30