TechnicalAI glossary
Multi-agent orchestration (sub-agents)
An architecture where an AI "conductor" breaks down a problem, delegates it to several specialised sub-agents working in parallel, then merges their results. That's how GPT-5.6 had 64 sub-agents tackle a 50-year-old mathematical conjecture before converging their leads.
In other words
A site manager who allocates work between the trades instead of building everything alone.
Alyriaz articles that mention it
- Claude Haiku 5.5: ten times cheaper than its predecessor
Anthropic launches Claude Haiku 5.5, ten times cheaper than Haiku 4.5 for most requests, at the price of GPT-6 Luna. What it is really worth.
- Navier-Stokes: OpenAI announces it has solved a millennium problem, and a dispute erupts
OpenAI claims an internal system produced a solution to the Navier-Stokes problem, with a proof formalised in Lean. The announcement comes with a dispute over priority. Here is what we know, with all the necessary caveats.
- What is a proof, if no one can verify it?
The demonstrations produced by models are becoming too long and too numerous to be verified by humans. We examine what a proof is, who it holds for, and what changes when verification is delegated.
- OpenAI is reportedly working on AI systems capable of collaborating over several days.
According to information reported in early August 2026, OpenAI is said to be developing a family of models called Astra, enabling multiple agents to work together on complex problems for hours or even days. We explain what this change of scale would entail.
- What is a "reasoning model"? These AIs that take the time to think before answering
Deep Think mode, reasoning effort, sub-agents: recent models no longer respond immediately, they think first. We explain what a reasoning model is, what actually happens during that pause, why it improves answers, and why it sends the bill through the roof.
- An AI has just solved a 50-year-old maths problem in an hour. Well, maybe.
On 10 July 2026, OpenAI announced that GPT-5.6 Sol Ultra had produced a proof of the double-cycle covering conjecture, unresolved since the 1970s, in under an hour with 64 sub-agents running in parallel. We explain the feat, the novel method, and why caution remains warranted until the proof is verified.