An AI lab for the hardest problems in science and engineering. We search the space of ideas and verify every result.

Joined March 2026
RL algorithms for post-training (e.g., GRPO) typically optimize top-1 performance. But this can create a diversity problem. In agentic systems tackling expert-level problems, what we often really care about is best@k. So how do you derive an unbiased gradient estimator for best@k? See the nice work below 👇 Kudos to my academic grandson @NadavSchweiger! doubleai.com/research/argmax…
6
15
1
133
8,119
Another research from @_doubleAI_ Most RL objectives for language models maximize average reward per generation. They do not explicitly reward maintaining several distinct, high-quality solutions, so output diversity can shrink during training—limiting the gains from best-of-k sampling. ArgMaxRL directly optimizes the expected quality of the best among k samples for continuous rewards. This better aligns training with test-time scaling: generate multiple candidates, verify them, and select the best. The result could be models that preserve useful diversity and benefit more from additional inference compute. doubleai.com/research/argmax…
2
6
18
1,126
WarpSpeed is @_doubleAI_ 's self-improving, formally verified AI system. We've used it for kernel optimization (cuGraph), performance engineering (SOL-execbench), optimizing Python libraries like Pandas, and quantum circuits for ECDSA. Now: hardware design. NVIDIA's CVDP covers the digital-design stage — write RTL from a spec, complete it, modify it, debug it, and optimize it. The optimization split is the one we focused on: given existing RTL and a spec, produce a functionally identical design using fewer cells. Cell count drives area and complexity, so it's scored as % reduction against the original. WarpSpeed hits 82.5% there, and solves 98.5% on the design split. Guaranteeing correctness is the harder problem. A design that drops its snapshot registers and reads live wires passes every CVDP test — the tests hold inputs fixed — while behaving differently from the spec. Claude Code w/ Fable scores 80.1% on average over all problems in the benchmark, but its solution on 16.2% of the problems is invalid. WarpSpeed solutions were correct on 100% of the problems, because every candidate has to discharge a formal contract derived from the spec and original RTL before it's accepted. For more details see doubleai.s.gy/doubleAI-RTL
1
4
25
1,198
1/ Since WarpSpeed topped NVIDIA's SOL-ExecBench (99% of its hardest kernels, 3x faster than NVIDIA's own baselines), the question I keep getting is the right one: that is a benchmark. Can it do the same on the workloads I actually run? We are about to find out, in the open.
2
6
4
17
2,597
We gave WarpSpeed a second day on NVIDIA’s SOL-ExecBench: 235 of the hardest CUDA kernels used in production. Spoiler: it now beats NVIDIA’s own baselines on 99% of them, 3.14× faster on average. Day one: 90% wins, 2.24× speedup. Day two: 233/235 wins, 3.14× speedup, #1 on the benchmark, and on many kernels, close to the speed of light: the fastest a B200 can physically run them. But the bigger point is correctness. A faster kernel that is silently wrong is worse than a slow one that is right. Our verifier caught a kernel that passes NVIDIA’s official test, yet quietly corrupts training on real data. Speed without correctness is a trap. This is the engine behind what we’re building at @_doubleAI_ make the code you already run far faster, with every optimization verified correct. Early access is opening. DM @_doubleAI_ to get in. Full technical blog: doubleai.com/research/warpsp…
5
13
1,181
DoubleAI’s AI system just beat a decade of expert GPU engineering WarpSpeed just beat a decade of expert-engineered GPU kernels — every single one of them. cuGraph is one of the most widely used GPU-accelerated libraries in the world. It spans dozens of graph algorithms, each written and continuously refined by some of the world’s top performance engineers. @_doubleAI_'s WarpSpeed autonomously rewrote and re-optimized these kernels across three GPU architectures (A100, L4, A10G). Today, we released the hyper-optimized version on GitHub — install it with no change to your code. The numbers: - 3.6x average speedup over human experts - 100% of kernels benefit from speedup - 55% see more than 2x improvement. But hasn’t AI already achieved expert-level status — winning gold medals at IMO, outperforming top programmers on CodeForces? Not quite. Those wins share three hidden crutches: abundant training data, trivial validation, and short reasoning chains. Where all three hold, today’s AI shines. Remove any one of them and it falls apart (as Shai Shalev Shwartz wrote in his post). GPU performance engineering breaks all three. Data is scarce. Correctness is hard to validate. And performance comes from a long chain of interacting choices — memory layout, warp behavior, caching, scheduling, graph structure. Even state-of-the-art agents like Claude Code, Codex, and Gemini CLI fail dramatically here, often producing incorrect implementations even when handed cuGraph’s own test suite. Scaling alone can’t break this barrier. It took new algorithmic ideas — our Diligent framework for learning from extremely small datasets, our PAC-reasoning methodology for verification when ground truth isn’t available, and novel agentic search structures for navigating deep decision chains. This is the beginning of Artificial Expert Intelligence (AEI) — not AGI, but something the world needs more: systems that reliably surpass human experts in the domains where expertise is rarest, slowest, and most valuable. If AI can surpass the world’s best GPU engineers, which domain falls next? For the full blog: doubleai.com/research/double… CuGraph: docs.rapids.ai/api/cugraph/s… Winning Gold at IMO 2025: arxiv.org/abs/2507.15855 Codeforces benchmarks: rdworldonline.com/openai-rel… @shai_s_shwartz post: xitter.cf/shai_s_shwartz/status/… From Reasoning to Super-Intelligence: A Search-Theoretic Perspective arxiv.org/abs/2507.15865 Artificial Expert Intelligence through PAC-reasoning arxiv.org/abs/2412.02441
Are frontier AI models really capable of “PhD-level” reasoning? To answer this question, we introduce FormulaOne, a new reasoning benchmark of expert-level Dynamic Programming problems. We have curated a benchmark consisting of three tiers, in increasing complexity, which we call ‘shallow’, ‘deeper’, ‘deepest’. The results are remarkable: - On the ‘shallow’ tier, top models reach performance of 50%-70%, indicating that the models are familiar with the subject matter. - On ‘deeper’, Grok 4, Gemini-Pro, o3-Pro, Opus-4 all solve at most 1/100 problems. GPT-5 Pro is significantly better, but still solves only 4/100 problems. - On ‘deepest’, all models collapse to 0% success rate. 🧵
17
34
11
195
67,807