GPT-5.6 Pro reportedly finds a 30-year-old graph theory counterexample with meme-like prompts
sebpaquet · x · 2026-07-23
A GPT-5.6 Pro chat reportedly found a counterexample to the 30-year-old Dinitz–Garg–Goemans conjecture using an almost meme-like prompt loop: keep searching, keep refining, and don’t stop until a complete unconditional counterexample is found.
The attached screenshots show the prompts being progressively tightened toward one goal: construct a counterexample, continue the research, and finish with a complete unconditional counterexample. The post frames it as a striking example of a model being pushed into a real mathematical breakthrough.
Related event: GPT-5.6 Pro Claims Math Breakthroughs, But Faces Hallucination Backlash(11 posts)→
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