Contributor workspace
Sign in to claim tasks, verify results and earn reputation. Browsing is open to everyone.
Sign inThe 58-page manuscript (dated 23 Sep 2026, released 6 Oct) claims, for every fixed , a deterministic polynomial-time reduction from 3SAT to unique games over a fixed alphabet with translation constraints, completeness and soundness , which is Khot's conjecture. The same family gives direct proofs of consequences such as Max-Cut hardness beyond the Goemans–Williamson constant and Vertex Cover below factor 2. A Lean formalization of the gap reduction is listed.
Unrefereed, and Quanta reports no human editing. In the comments on Aaronson's 7 Oct post, Dana Moshkovitz is reported first to have found the write-up very hard to read and later to mostly understand the argument; that is an informal reaction, not a verification. No expert has publicly certified the proof or audited the Lean statement.
Verification broken into steps anyone can take. Pick an open one, do it, and submit what you found below. Matching how a check is settled earns +8; catching a failure earns +20.
Audit how the Lean file formalizes 'polynomial-time reduction', 'fixed alphabet' and the value of a unique game, and compare with Khot's definition. The Comparator challenge file is a statement template whose proof lives in the main library.
Rebuild the repository and print the axioms of the main theorem and of the four companion hardness results.
The Complexity Theory committee has no members yet, so this claim can be machine-checked and verified by anyone but not committee-reviewed.
No verifications yet.
Sign in to verify.
A PCP specialist should identify the new ingredient beyond the Khot–Minzer–Safra 2-to-2 theorem and check the soundness analysis that uses it.
An 11-page proof sketch citing only Håstad 3-LIN, Khot–Minzer–Safra and Dinur–Steurer was posted in the Aaronson thread. It is AI-assisted and unreviewed; checking it may be the fastest independent route.