A $3,000 graph-theory bounty is now formalized in Lean and open for counterexamples
MarioKrenn6240 · x · 2026-07-23
A repost points to a graph-theory conjecture with a $3,000 bounty and a Lean formalization, inviting people to use a prompt to search for a counterexample.
The quoted context says the Dinitz-Garg-Goemans conjecture was recently shown false via a graph found with GPT-5.6 Pro, where a graph with fractional flow cost 58 forced any unsplittable flow under a capacity violation of 15 to cost at least 60.
More from Fun
- Open ECDSA.fail challenge uses AI agents to shrink Shor's-algorithm quantum circuits for Bitcoin keys — StefanoGogioso · 2026-09-11
- Someone built a website where you can sign up for AI not to kill you — motionbynick · 2026-09-11
- Fruit fly brain as an LLM: connectome-driven language model demo goes live — ngxson · 2026-09-11
- Meme: Engineers Unleash 10,000 Claude Sub-Agents on Friday Afternoon to Clear a Week's Work — _jaydeepkarale · 2026-09-11
- AI safety isn't a coordinated cabal: half the field has posted their life stories on LessWrong — ShakeelHashim · 2026-09-11
- Kid Coins "Princessmaxxing" After Subway Chat About Same-Sex Wedding Attire — anderssandberg · 2026-09-11