Unique Games conjecture rumor confirmed, a major theoretical CS breakthrough
felpix_ · x · 2026-10-07
The widely circulated rumor about a breakthrough on the Unique Games conjecture has been confirmed correct. The conjecture is a central open problem in theoretical computer science with major implications for hardness of approximation. The post itself contains no technical details; a formal paper or authoritative write-up is still awaited.
More from Research
- OpenAI proof dump shows first superlinear circuit lower bound, but progress stays slow — thomasahle · 2026-11-22
- Fortnow: Fall's dramatic results show P vs NP still far from solved, as OpenAI proof dump yields first superlinear circuit lower bound — thomasahle · 2026-11-22
- One photo, 8 VLAs, only 3 correct: ERQA embodied-reasoning benchmark questioned — giffmana · 2026-11-22
- Fleuret: treat AI as oracles, not explainers — human-comprehensible math will be negligible — francoisfleuret · 2026-11-22
- Vovk paper shows probabilistically nonrandom objects have vanishing universal measure — _onionesque · 2026-11-22
- AI generates a Riemann proof, AI generates the rebuttal—and it scores 100% AI — zetalyrae · 2026-11-22