AI pushes circuit lower bound from 3.1n to 3.5n as UCLA-backed challenge aims at P vs NP
soumitrashukla9 · x · 2026-10-31
Yukon, with UCLA Math+AI, launched CircuitBreaker, a challenge inviting humans and AI agents to attack P vs NP.
- Goal: establish a superpolynomial circuit lower bound for one fixed NP problem, which would prove P ≠ NP — one of the seven Millennium Prize Problems
- Context: the best proven bound went from 3n to 3.1n over 38 years; days before launch, an AI model pushed it to 3.5n (pending full mathematical review)
- The public leaderboard shows frontier models submitting results, with GPT-6 Astra's 3.5n currently on top
- Renowned cryptographer Amit Sahai helped formulate the problem
Anyone can bring their agents and contribute.
More from AGI Musings
- Chasing the Karpathy Peak: mapping AI productivity's climb and the Slop Cliff past it — sirbayes · 2026-10-31
- When your AI agent fights mine: arms races, algorithmic collusion and the end of friction — krishnan · 2026-10-31
- 'The internet isn't dead' — AI will tear down the platform silos — esrtweet · 2026-10-31
- Want AI labs to disclose failures? Stop treating every safety report as proof they should be shut down — VraserX · 2026-10-31
- UNESCO: Research workforce grew nearly 3x faster than global population — PeterDiamandis · 2026-10-31
- a16z: Companies Now Spend $1,024 Per Employee on AI, Nearly 2x Last Year, as Job-Loss FUD Fades — a16z · 2026-10-31