He's onto us

Thanks! Early access is open heymaxwell.ai

Thanks! Early access is open heymaxwell.ai

Early access is open heymaxwell.ai

Thanks! Early access is open heymaxwell.ai

Request early access: doubleai.s.gy/maxwell

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.

@anishgiri @GMHikaru @GothamChess @chesscom

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

3/ Harder question: what if both players keep answering check with check? The longest known sequence is 54 consecutive checks, in a composed position by Alexey Khanyan (2013).

2/ The answer: 63. Every one of them gives check to Black’s king. That beats Norbert Ringeltaube’s record of 60, and Double Agent proved that 63 is the maximum possible. The position can be reached in a legal game.

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?

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

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/ 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.

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

2/ A graph's girth is the length of its shortest cycle. Large girth means a graph looks like a tree for as far as possible 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.

Session details: doubleai.s.gy/nvidia-gtc-ber…

Can AI reach superoptimisation across the internet, at scale? What if every single workload you ran was tailored to your exact hardware configuration? Gal Beniamini (@laginimaineb) is speaking about it at @NVIDIAGTC Berlin, Thu 22 Oct, 15:00 CEST.

Our research page: doubleai.s.gy/our-research