The Mathocalypse

Yesterday marked a monumental day in mathematical history, with OpenAI releasing 372 groundbreaking results, including a proof of Subhash Khot's Unique Games Conjecture (UGC). Khot has spent her entire career working on proving the UGC, which implies that a wide array of optimization problems are NP-hard, even when seeking slightly better approximations than semidefinite programming relaxation.

Despite the excitement surrounding these findings, there exists uncertainty about their comprehension, as no human has fully grasped the proofs. Moreover, the papers are reportedly poorly written and require AI assistance to understand.