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
- User spots eerie moment: device starts running on its own with no user action — generativist · 2026-10-27
- 'We're not bad at forecasting—I'm bad at QA-ing my posts,' dlwh wraps up — dlwh · 2026-10-27
- Dev shows striking SD vs HD game texture upgrade alongside a level editor — maxleiter · 2026-10-27
- AI-generated movie-grade clip goes viral, blurring the line with real cinema — cneuralnetwork · 2026-10-27
- Drinking under the JD dog: Beijing's satellite-factory bar next to Moonshot's faux temple — teortaxesTex · 2026-10-27
- Creator's 2566-rated champion bot dethroned on Arena Ladder, training a comeback version — tristanbob · 2026-10-27