The unique games conjecture is an iconic question in computational complexity theory, the study of the inherent difficulty of mathematical problems. Roughly speaking, it states that a problem about satisfying multiple constraints at the same time can be extremely hard, even if you are willing to settle for a poor approximation of the best possible solution. A proof of the conjecture would automatically imply that current methods for solving many seemingly unrelated problems cannot be improved, bringing researchers a step closer to a unified theory of computational difficulty.
Minzer, a leading expert on the conjecture, initially thought the message from a friend was a joke. But as more messages arrived, the rumors cohered: OpenAI, fresh from announcing a bombshell proof about the behavior of fluids that sent ripples through the math world, had allegedly discovered a proof of the unique games conjecture. They might make the result public any day. The implication was clear: if Minzer had any results of his own to share, now would be the time.
Minzer had not, in fact, proved the unique games conjecture. But he and his graduate students Yumou Fei and Shuowang had been working on related results. The news of OpenAI's potential breakthrough put pressure on the team to publish their own work quickly, before the AI announcement could overshadow it. The incident illustrates a growing trend: as AI systems become capable of tackling deep mathematical problems, human researchers face new pressures to accelerate their own publication timelines.