OpenAI Solves 50-Year Math Conjecture in Just One Hour Using GPT-5.6 Sol Ultra

OpenAI announced it developed a proof for a long-standing mathematics problem using its latest AI model, though formal recognition requires academic review and independent verification. Researcher Ileen Knight revealed that GPT-5.6 Sol Ultra, OpenAI's newest model, generated a proof for the 'Cycle Double Cover Conjecture' within an hour by leveraging 64 sub-agents. The conjecture, a 1970s graph theory problem, posits that any bridgeless undirected graph can have multiple cycle paths covering each edge exactly twice. While OpenAI shared its prompt and proof documentation, the result remains unverified by peer review and requires further scrutiny from mathematicians.