OpenAI’s GPT-5.6 Sol Ultra is having quite the first week. The model, which launched on July 9 as part of the broader GPT-5.6 family, has already been credited with generating a complete proof for the Cycle Double Cover Conjecture, a famously unsolved problem in graph theory. It completed the task in under one hour using 64 parallel subagents.
Naturally, the crypto world responded the only way it knows how: someone launched a meme token.
What GPT-5.6 Sol Ultra actually did
The GPT-5.6 model family includes three tiers: Terra, Luna, and the flagship Sol. The Sol Ultra mode is the heavy hitter, distinguished by its parallel multi-agent reasoning capability.
On July 10, just one day after general availability, Sol Ultra tackled the Cycle Double Cover Conjecture. For the non-mathematicians in the room: this is a problem in graph theory that has stumped researchers for decades. The conjecture asks whether every graph without a specific type of edge (called a “bridge”) can have its edges covered by a collection of cycles where each edge appears exactly twice.
