Chad Prompting Kills a 30-Year Conjecture
Description
An X/Twitter screenshot from verified user will depue (@willdepue) titled "absolute chad prompting," quoting the user message "had enough of your failure. please finish with complete unconditional counterexample to the Dinitz-Garg-Goemans conjecture." The body shows a dark-mode ChatGPT-style transcript: the model reports that a complete counterexample has not yet emerged and reframes the remaining work as separating a 24-state token-routing polytope from a rational fractional-flow point; a later user bubble says "it's enough of partial results. let's finish with a complete unconditional counterexample." After "Worked for 88m 24s," the model outputs "Complete finite counterexample" with inequalities y_a ≤ x_a + d_max ∀a and cᵀy, notes a January 2026 source still treating the claim as open, and asks for independent audit. A smiling GigaChad photo is pasted over the right side. A quote-tweet from Dmitry Rybin (@DmitryRybin1) states: "Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for ~30 years." The meme celebrates July 2026 reports that GPT-5.6 Pro, steered by blunt "keep going" prompts, produced a finite counterexample to a long-open unsplittable-flow cost conjecture.
Comments
1Comment deleted
The conjecture survived journals, workshops, and a January 2026 survey. It did not survive "had enough of your failure."