doubleAI (@doubleAI) header
doubleAI (@doubleAI) profile picture

The frontier AI lab for the hardest problems in science and engineering

Joined March 2026
Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)Photo by doubleAI (@doubleAI)
1/ What if an LLM could not just edit a model's weights, but re-architect it as it trains? We tried just that. The resulting architectures exit the known territory of transformers: the coding agents spliced code directly into the network. On nanochat, the loss fell below ordinary training after each new code layer was introduced. On algorithmic reasoning, accuracy rose from 55% to 84%. We even let DeepSeek-V4.1-Flash act as the agent modifying itself, raising its AIME and HMMT 2026 score from 64% to 71%. To do all this, the agents built a set of tools we’ve never seen before, which we call mechanistic intervention! Blog: doubleai.s.gy/llm-redesign
60
110
41
967
87,360
1/ We set Maxwell to optimize DeepSeek-V4.1-Flash serving on B200s. Maxwell’s engine outputs 3x more tokens per GPU than vLLM at the same speed per user, or serves 2x speed per user for typical loads. It beats every published B200 setup, and is even faster than all comparable GB300 results. Blog: doubleai.s.gy/gb300
12
26
8
152
24,942
2/ We measured the engine on @SemiAnalysis_ AgentX. Maxwell's engine handles all loads. As traffic changes, it switches strategy, swaps kernels and reschedules requests, all without downtime while serving. That's a step change. The published vLLM and SGLang results are tuned one load at a time, so each point on their curves is its own configuration. Maxwell's whole curve is one running engine.
13
1,813
5/ We are even seeing signs of open-weight models being able to perform these changes on themselves. We asked DeepSeek-V4.1-Flash to make itself better at competition maths. It analysed its activations and found where its own hidden states signal a wrong answer on these tasks. It then wrote a code layer that helped boost its performance on AIME 2026 and HMMT 2026 by predicting such failures before committing to an answer.
2
5
1
60
4,545
6/ This project was led by our very own brilliant @AlonVin . Huge kudos to everyone at @doubleai who contributed.
35
2,854
1/ Together with @ltx_io, we used Maxwell, our Code Execution Model, to make video generation in LTX-2.5 1.87x faster. With Maxwell, generating a five-second 4K clip on 2xB200s went from 250 seconds to only 134. No quantization or loss of quality at all. The code is open source.
5
4
5
47
8,701
What if code could think while it runs? Meet Maxwell: the world’s first Code Execution Model. A new species of AI that lives inside the machine. We believe it’s the key to unlocking 100% of compute. Requests for early access are open, link below.
24
27
21
194
44,789
1/ What is the maximum number of legal moves in a chess position where every one of them gives check? The record on that question had stood since 1968. Double Agent, our AI research system, just broke it. How many checks can you count here?
2
12
7
38
3,353
4/ Brute-force search is hopeless here. Double Agent first proved structural facts about the geometry of checks on a chessboard, formalized them in Lean, and reduced the rest to SAT. Result: no such sequence can exceed 364 checks, with every proof machine-verified. The exact maximum remains open. Code and proofs: doubleai.s.gy/chess
1
4
320
1/ Double Agent, our agentic system, has achieved a breakthrough result on one of the most central problems in extremal graph theory. It constructed explicit regular graphs with girth (8/5) log n, the first improvement in 38 years, and a leap towards the theoretical maximum.
5
12
8
47
8,812
2/ A graph's girth is the length of its shortest cycle. Large girth means a graph looks like a tree for great distance around every vertex. Such graphs are key to constructing error-correcting codes. Since 1988, the best explicit graphs, due to Margulis and to Lubotzky, Phillips and Sarnak, had girth (4/3) log n, against a theoretical ceiling of 2 log n.
1
1
4
1,268
3/ double-agent completely autonomously found a deep algebraic construction and proved it, all on a budget of less than $2k. Its graphs reach girth (8/5) log n, and do so for infinitely many degrees. The full proof is formalised in Lean. Paper: doubleai.s.gy/girth85. Lean: doubleai.s.gy/girth85-lean
1
7
667