What if an AI-generated proof contains two different things:
1) The mathematics that makes the result true
2) The history of how the machine happened to discover it?
My research on Structural Path Compression (SPC) is an attempt to separate the two and what I found next is genuinely impressive:
the boundary between discovery history and mathematical necessity can actually be made machine-testable.
I’ve now formally certified one piece of it in Lean.
[Brand New Paper in the first reply]
The idea emerged while analyzing OpenAI’s Navier-Stokes construction. Their proof repeatedly moves through a sequence of correction stages to reach higher and higher accuracy. I found evidence that some of that repeated structure may belong to the representation of the proof, rather than to the underlying mathematical dependency itself.
Imagine a pilot flying through thick fog. The navigation system guides them through turn after turn until they reach the destination. Every turn is valid.
But afterward, someone studies the terrain and discovers something strange:
some of those turns were required by the map, not by the landscape and that is the distinction SPC is trying to expose in mathematics.
A successful proof tells us one route that works. It does not automatically tell us which parts of that route are actually required for the mathematics to keep working.
My first paper showed how part of OpenAI’s repeated Section 9 correction schedule could potentially be reorganized around the accuracy we actually want, rather than treating the entire intermediate chronology as fundamental.
But that creates an obvious danger:
What if we remove something that looks unnecessary, only for a later part of the proof to need it?
My new paper begins answering that question formally.
For one important operator in OpenAI’s formal Navier-Stokes architecture, Lean has now machine-certified that a class of differences SPC proposes treating as invisible remains invisible after temporal reconstruction.
In other words, that later mathematical operation cannot resurrect the discarded distinction.
That does not yet prove that the entire Navier-Stokes construction has been reduced to its smallest possible form. Other downstream operators still have to survive the same kind of test.
But the larger possibility is hard to ignore.
AI systems may eventually generate mathematical proofs containing millions of intermediate decisions. If we only preserve the entire path a machine took, we may end up with mountains of correct mathematics that are extremely difficult for humans to understand.
SPC asks a different question:
What part of a successful proof is the mathematics, and what part is merely the path taken to discover it?
1. In my first paper, I applied that question to OpenAI’s Navier-Stokes proof and found that part of its repeated Section 9 correction schedule could potentially be reorganized into a smaller accuracy-indexed structure. In simple terms, I found evidence that some of the repeated path may belong to how the proof was constructed, not to what the mathematics ultimately needs.
2. In this new paper, I went after the dangerous part of that idea: How do we know something we remove will not become important later? I identified information SPC says should no longer matter, then had Lean prove that a later operator in OpenAI’s Navier-Stokes architecture cannot bring that information back into relevance.
So the first paper found a possible boundary between discovery history and mathematical necessity.
This paper begins machine-certifying that the boundary is real.
What that means is bigger than one Navier-Stokes proof:
if this can be extended across entire proof systems, AI would not just generate correct mathematics but it could even help identify which parts of its own reasoning were genuinely necessary, which parts were only scaffolding, and compress successful discoveries into smaller, clearer structures that humans and machines can reuse.
That is the real goal of SPC:
Turning successful reasoning into the smallest structure that still preserves everything the future mathematics needs instead of just shorter proofs.