<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Will Sturgeon</title>
  <subtitle>Personal website and writing</subtitle>
  <link href="/feed.xml" rel="self"/>
  <link href="/"/>
  <updated>2026-04-16T00:00:00+00:00</updated>
  <id>/</id>
  <author>
    <name>Will Sturgeon</name>
  </author>
  
  <entry>
    <title>Give me formally verified toasters or give me death</title>
    <link href="/2026/04/16/first-post/"/>
    <id>/2026/04/16/first-post/</id>
    <updated>2026-04-16T00:00:00+00:00</updated>
    <summary>On the upcoming tsunami of AI-discovered vulnerabilities</summary>
    <content type="html">&lt;p&gt;Written while visiting a &lt;a href=&quot;https://alok.github.io&quot;&gt;friend&lt;/a&gt; at &lt;a href=&quot;https://www.inkhaven.blog&quot;&gt;Inkhaven&lt;/a&gt;. Created this site and wrote this post in two hours total. Needs some polish and a proper ending, but I stand by its contents.&lt;/p&gt;

&lt;h1 id=&quot;ai-is-pretty-darn-good-at-math&quot;&gt;AI is pretty darn good at math&lt;/h1&gt;

&lt;p&gt;Yesterday, an artificial intelligence agent, GPT 5.4 Pro, did what mathematicians had long considered impossible:
GPT proved a conjecture which mathematicians had long considered interesting, and on which many had worked intermittently for years,
with a single prompt, no back-and-forth, and less than an hour and a half of wall-clock time.&lt;/p&gt;

&lt;p&gt;The problem is the 1196th conjecture of Erdős (a famously prolific conjecturer, as the number shows),
and the original chat transcript is &lt;a href=&quot;https://chatgpt.com/share/69dd1c83-b164-8385-bf2e-8533e9baba9c&quot;&gt;here&lt;/a&gt; (note in particular “Thought for 80m 17s”).&lt;/p&gt;

&lt;p&gt;Some &lt;a href=&quot;https://www.erdosproblems.com/forum/thread/1196&quot;&gt;comments from working mathematicians&lt;/a&gt; are particularly illuminating:&lt;/p&gt;

&lt;ul&gt;
  &lt;li&gt;My former colleague Jared Lichtman, a number theorist at Stanford:
    &lt;blockquote&gt;
      &lt;p&gt;I care deeply about this problem, and I’ve been thinking about it for the past 7 years.
I’d frequently talk to Maynard about it in our meetings, and consulted over the years with several experts (Granville, Pomerance, Sound, Fox…) and others at Oxford and Stanford.
This problem was not a question of low-visibility per-se. Rather, it seems like a proof which becomes strikingly compact post-hoc, but the construction is quite special among many similar variations.&lt;/p&gt;
    &lt;/blockquote&gt;
  &lt;/li&gt;
  &lt;li&gt;Jared &lt;a href=&quot;https://x.com/jdlichtman/status/2044298382852927894&quot;&gt;again&lt;/a&gt;:
    &lt;blockquote&gt;
      &lt;p&gt;The closest analogy I would give would be that the main openings in chess were well-studied, but AI discovers a new opening line that had been overlooked based on human aesthetics and convention.&lt;/p&gt;
    &lt;/blockquote&gt;
  &lt;/li&gt;
  &lt;li&gt;Terence Tao, widely considered the greatest living mathematician:
    &lt;blockquote&gt;
      &lt;p&gt;. . . the AI-generated paper inadvertently highlighted a tighter connection between two areas of mathematics . . . than had previously been made explicit in the literature (though there were hints and precursors scattered therein which one can see in retrospect).
That would be a meaningful contribution to the anatomy of integers that goes well beyond the solution of this particular Erdos problem.&lt;/p&gt;
    &lt;/blockquote&gt;
  &lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Roon, the poet laureate of Silicon Valley, &lt;a href=&quot;https://x.com/tszzl/status/2044442153833644102&quot;&gt;sums&lt;/a&gt; it up: “seems like the first time the math community seems universally impressed with an ai proof”&lt;/p&gt;

&lt;p&gt;Yet, despite the warranted fanfare surrounding the proof itself, the more interesting point is that this was not simply a case of agents brute-forcing a result.
In eighty minutes, an agent found a chess opening that humans hadn’t considered, then kicked our ass with it.&lt;/p&gt;

&lt;p&gt;Tony Feng, a number theorist at Berkeley, &lt;a href=&quot;https://x.com/tonylfeng/status/2044214579350384710&quot;&gt;makes&lt;/a&gt; this point:
“Impressive. We hear a lot about the jaggedness of AI capabilities, but in this case it feels like human mathematical understanding was jagged.”&lt;/p&gt;

&lt;h1 id=&quot;curry-howard&quot;&gt;Curry-Howard&lt;/h1&gt;

&lt;p&gt;K, great, but you’re not a mathematician: who cares?&lt;/p&gt;

&lt;p&gt;The rhetoric above, about jagged mathematical aptitude and blindness to novel strategies, reminds me of computer scientists’ attitudes toward testing and edge cases.
Entire paradigms, like property-based testing, have been created and proselytized to further the notion that humans are particularly bad at thinking outside the box.
As a result, it should surprise no one that advanced AI models are finding vulnerabilities in longstanding systems, as has famously been alleged about Claude Mythos.&lt;/p&gt;

&lt;p&gt;But there’s a deeper connection between “mathematical” edge cases and “computational” edge cases.
There’s a mysterious connection between pure math and ordinary programming that literally changed the course of my life when I first discovered it.
The concept is called the Curry-Howard correspondence, and, in short, it states that
&lt;em&gt;writing a program with some type signature&lt;/em&gt; is &lt;strong&gt;exactly&lt;/strong&gt; the same as &lt;em&gt;writing a proof of some statement&lt;/em&gt;.
If you can show that some type “means” some statement and hand me a program that type-checks, then you’ve just proven to me, beyond any doubt, that you’ve told me the truth.&lt;/p&gt;

&lt;p&gt;Because of this correspondence, we can take some programming language — say, C — and make a precise model of how it works:
for example, by translating the C standard into a few hundred very carefully constructed types that mean things like “undefined behavior happens here.”
(This may sound absurd, but a group of very smart people have done it, building on the work of very funny French geniuses who named their language Coq. Both teams knew exactly what they were doing.)
Then, if you hand me your C code, I can prove things about it: for example, it doesn’t crash, and it outputs 42, no matter how or where it’s run.
I can do this once and for all, without ever running your program, and the only requirement is that I’m sufficiently good at math.&lt;/p&gt;

&lt;p&gt;The problem is that this particular kind of math, writing down exact programs and types, is almost unbearably long-winded. Translating the proof of the four-color theorem took five years.&lt;/p&gt;

&lt;h1 id=&quot;takeoff&quot;&gt;Takeoff&lt;/h1&gt;

&lt;p&gt;This is a somewhat sad state of affairs. We have a giant orbital laser that can erase all bugs from orbit, but no one can figure out the right settings to turn it on.
It’s like &lt;a href=&quot;https://www.404media.co/artemis-2-astronauts-microsoft-outlook-livestream/&quot;&gt;we went to space with two broken Microsoft Outlook installs&lt;/a&gt;.
With that in mind, I was beyond excited to join Math, Inc., a real company that’s really named that, to work on dedicated AI agents to write formalizations automatically.
I left a few months ago, but not before making vast progress on an agent we named Gauss, which went on to formalize Maryna Viazovska’s Fields Medal-winning result on optimal sphere packing in both 8 and 24 dimensions.
The &lt;a href=&quot;https://github.com/thefundamentaltheor3m/Sphere-Packing-Lean/pull/341&quot;&gt;final pull request&lt;/a&gt; before an airtight proof added more than fifty two thousand lines of code.&lt;/p&gt;

&lt;h1 id=&quot;ok-whats-this-all-really-about&quot;&gt;OK, what’s this all really about?&lt;/h1&gt;

&lt;p&gt;These formal verification agents are publicly accessible. Harmonic’s Aristotle, for example, is even free. This seems like a great state of affairs! Everyone will prove their favorite open-source project formally correct!&lt;/p&gt;

&lt;p&gt;Except one thing. Your favorite project is almost certainly &lt;em&gt;not&lt;/em&gt; correct. And what happens when these verification systems can’t find a proof, but they know why? They hand you a refutation.&lt;/p&gt;

&lt;p&gt;What does a refutation look like, if your question was “is the Linux kernel secure?”&lt;/p&gt;
</content>
  </entry>
  
</feed>
