Quantum

Talk by Dana Moshkovitz: The Unique Games Conjecture – Proved (!!?)

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 30/10/2026, 23:31:25 UTC.

Briefings

Dana Moshkovitz, a researcher working on Subhash Khot's Unique Games Conjecture since 2009, presented a technical talk at UT Austin on November 4, 2026, explaining the proof of the conjecture. The talk focuses on a new code construction called 'Hadamard with a noise test' and its application to proving the conjecture is NP-hard. Dana is collaborating with Subhash Khot, Johan Håstad, Dor Minzer, and GPT-6 Astra to understand the proof, which OpenAI released in October 2026.

Key points

• Dana Moshkovitz presented a technical talk at UT Austin on November 4, 2026, explaining the proof of the Unique Games Conjecture.
• The proof relies on a new code construction named 'Hadamard with a noise test' to demonstrate the conjecture's NP-hardness.

Context

Dana Moshkovitz has been researching Subhash Khot's Unique Games Conjecture since 2009 while working at the Simons Institute. She collaborated with Subhash Khot, Johan Håstad, Dor Minzer, and GPT-6 Astra to study the proof, which OpenAI released in October 2026. The talk at UT Austin was part of a series of events to share the proof's details with the theoretical computer science community.

Limitations

The evidence is limited to the provided article text, which describes the talk's content and participants without providing the full mathematical details of the proof or the specific results achieved. The article does not include the actual proof text, formal analysis, or any quantitative data from the research.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 30/10/2026, 23:48:05 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeic6mtasdiglxs2ihqh62dam5o3ftsgb7agxz6e44wxwcbfveoryzy