OpenAI says GPT-6 Astra has produced two new results on prime gaps. The more accessible one improves the best known unconditional upper bound for infinitely recurring short gaps between consecutive primes to 186, down from a long-standing 246 and a concurrent 240 result. The mathematics matters, but the larger story is how AI-generated research is being packaged for verification: OpenAI released the paper, a Lean 4 formalization with explicit assumptions, and a numerical certificate. That does not turn AI output into automatically trusted mathematics. It creates a clearer path for humans and proof systems to check it.
186 Is the Headline — but It Is Not the Whole Result
OpenAI introduced GPT-6 Astra on September 4, 2026 with a long list of model benchmarks.
One scientific result is easier to understand than most of them.
Astra produced a proof that improves a bound on gaps between consecutive prime numbers to 186.
The number sounds arbitrary.
It is not.
The result says that infinitely often, two consecutive primes occur no more than 186 integers apart.
That does not mean every pair of neighboring primes is within 186. Prime gaps can become much larger.
It means the sequence of primes keeps returning, infinitely many times, to gaps at most 186.
The previous widely established benchmark from Polymath 8b was 246. A concurrent independent result reached 240. OpenAI’s new paper pushes the bound further to 186.
Prime Gaps Are About the Empty Space Between Primes
Prime numbers are integers greater than one that have no positive divisors other than one and themselves.
2, 3, 5, 7, 11 and 13 are familiar examples.
The gap between 11 and 13 is two. The gap between 23 and 29 is six.
As primes become larger, their spacing becomes irregular. Sometimes consecutive primes sit close together. Sometimes there are long stretches of composite numbers between them.
Number theory asks both kinds of questions. How small can prime gaps be infinitely often? How large can prime gaps become?
OpenAI released a new result in both directions. The short-gap result is the cleaner one to explain because 186 gives us a concrete number.
This Does Not Prove the Twin Prime Conjecture
The famous target is much smaller.
The twin prime conjecture says there are infinitely many consecutive prime pairs separated by exactly two.
Examples include 11 and 13, 17 and 19, and 29 and 31.
Mathematicians still do not know how to prove that such pairs continue forever.
The new Astra result does not solve that problem. A bound of 186 means we know there are infinitely many occasions where the gap is at most 186. It does not tell us that the gap can always be reduced to two infinitely often.
So 186 is progress on the road toward understanding bounded prime gaps. It is not the final destination.
The Modern Story Started With 70 Million
The recent history makes 186 more interesting.
In 2013, Yitang Zhang proved the first unconditional finite bound of this modern era: infinitely many consecutive primes differ by less than 70 million.
That was a breakthrough because the exact size of the number mattered less than proving that some fixed finite bound existed at all.
Then collaborative work rapidly pushed the number down. Polymath 8a strengthened parts of the distribution theory. James Maynard and Terence Tao developed a powerful multidimensional sieve approach. Polymath 8b eventually reached 246.
The Astra paper builds on this human mathematical infrastructure rather than replacing it. Its proof explicitly combines earlier equidistribution estimates with a modified sieve construction and numerical optimization.
What Astra Claims to Have Added
The short-gap paper states that the proof combines equidistribution estimates from Polymath 8a and later work by Julia Stadlmann with complementary factorization conditions.
Those conditions allow the sieve weights to use a larger support. The paper then establishes a statement called DHL[40,2].
In simplified terms, the argument constructs an admissible set of 40 integer shifts spanning a total diameter of 186. The theorem shows that infinitely many translates of that set contain at least two primes.
If two primes occur inside a window only 186 numbers wide, then some consecutive prime gap is at most 186. That is where the headline number comes from.
The 40-Number Pattern Is Explicit
The proof does not hide the final combinatorial object.
The paper lists a specific admissible set of 40 offsets beginning at 0 and ending at 186. Because that set has diameter 186, proving DHL[40,2] for it gives the short-gap result.
This is useful conceptually. The proof is not saying an AI searched the integers until it happened to notice a lucky pair of primes.
It is proving an asymptotic theorem. The claim is about infinitely many future occurrences, not one computational example.
Why a Sieve Appears in a Prime-Gap Proof
A sieve in number theory is a structured way to filter integers according to divisibility conditions.
The ancient Sieve of Eratosthenes removes multiples of small primes to reveal primes. Modern analytic sieves are much more sophisticated.
They use weighted sums to estimate how often collections of shifted integers can contain primes. The Maynard-Tao framework is one of the major tools behind modern bounded-gap results.
OpenAI’s proof does not invent prime-gap theory from zero. It modifies how the existing sieve machinery uses available distribution estimates.
That distinction matters when describing AI research. The novelty can come from recombining and extending known techniques rather than discovering an entirely new mathematical universe.
The Result Is More Than a Numerical Search
A computer can search enormous ranges of integers and find small prime gaps. That would not prove this theorem.
No finite search can establish that a phenomenon occurs infinitely often.
The 186 result depends on an analytic argument about the distribution of primes at arbitrarily large scales. Numerical optimization helps choose parameters and verify inequalities inside that proof.
But computation is supporting the theorem rather than replacing it with brute force.
This is one reason the result is scientifically more interesting than a benchmark score. The output is intended to become part of a mathematical argument that other researchers can inspect.
OpenAI Also Released a Lean 4 Formalization
The most important verification detail is that OpenAI did not publish only a natural-language PDF.
It also released a GitHub repository called PrimeGaps186. The repository contains a Lean 4 formalization and a Python numerical certificate.
Lean is a proof assistant. Instead of asking a human reader to accept every logical transition because the prose appears convincing, a formal proof expresses mathematical statements in a language that a kernel can mechanically check.
That is especially valuable for AI-generated mathematics. Language models can produce arguments that look polished while hiding subtle gaps. Formalization forces much more of the logical structure into an explicit form.
But the Lean Proof Is Conditional
This is where the verification story needs precision.
OpenAI’s own PrimeGaps186 repository says the Lean formalization remains conditional on three explicit input axioms. The repository identifies assumptions related to exponential-sum estimates and numerical integral bounds.
In other words, not every external analytic input has been formalized all the way down inside Lean.
That does not make the formalization useless. It tells reviewers exactly where the trusted boundary is.
The mechanically checked part is explicit. The remaining mathematical inputs are explicit too. That is much better than saying simply, “Lean verified the entire proof,” which would overstate what the released repository claims.
The Numerical Certificate Handles Another Part of the Trust Problem
The proof also depends on numerical inequalities.
OpenAI released a Python-FLINT program and numerical certificate to verify those bounds. That separates another fragile part of the argument from hand calculation.
The ideal verification stack starts to look layered.
Human-readable proof for understanding. Formal Lean statements for logical structure. Explicit assumptions where formalization stops. Machine-readable numerical certificates for computation-heavy inequalities.
Independent mathematicians can then attack each layer differently. This is a more mature scientific workflow than publishing a chat transcript and asking readers to trust the model.
The Paper Says the Proof Is Due to GPT-6 Astra
The authorship language is unusually direct.
The abstract states: “The proof is due to GPT 6 Astra.”
That is a much stronger attribution than saying AI helped polish a manuscript or search references. OpenAI is presenting the model as the source of the proof.
That claim will naturally receive scrutiny. Mathematics has a high verification standard for exactly this reason.
A theorem does not become accepted because the claimed author is famous, human or artificial. The argument has to survive checking. The public proof artifacts give the mathematical community something concrete to challenge.
Independent Acceptance Is Still a Separate Step
OpenAI publishing a proof is not the same as the result already being absorbed into the mathematical literature as settled consensus.
Researchers can inspect the paper. Experts can test the analytic estimates. Formal-methods specialists can inspect the Lean boundary. Others can reproduce the numerical certificate. Corrections may still appear.
That is normal scientific practice.
The strongest responsible wording today is that OpenAI has released a claimed proof with formal and numerical verification artifacts. The result is substantial enough to take seriously. It is also new enough that independent scrutiny matters.
A Concurrent Human Result Reached 240
The new paper also records an interesting timing detail.
It says that independent concurrent work by Julia Stadlmann proves a bound of 240.
That makes Astra’s 186 result easier to place historically. The field was already moving below 246.
Astra is not jumping from a decade of total stagnation directly to 186. It is pushing farther during an active period of improvement.
That context does not diminish the result. It prevents an exaggerated narrative in which AI alone suddenly restarted a dead field.
OpenAI Released a Second Prime-Gap Result Too
Short gaps ask how close primes can repeatedly get. Long gaps ask almost the opposite question.
How large can a prime-free interval become?
OpenAI released a second paper titled Improved Long Gaps Between Primes. That paper gives a stronger lower bound for the largest gap between consecutive primes up to a large threshold X.
The proof is also attributed to GPT-6 Astra. The new bound improves a classical Rankin-type expression by an additional factor involving an iterated logarithm.
That is harder to communicate in a headline than the number 186, but mathematically it matters because the problem has a long history stretching through Erdős, Rankin, Maynard, Tao and others.
The Long-Gap Result Has a More Complete Formalization Story
OpenAI’s LongGapsBetweenPrimes repository contains a Lean 4 formalization of the main result.
Its README documents how to build the formalization and how to run an independent proof-checking workflow using Lean export and a comparator.
That gives the second result its own verification path.
The short-gap and long-gap papers therefore point in the same direction. OpenAI is not treating natural-language mathematical output as sufficient evidence. It is pairing model-generated proofs with formal artifacts designed for inspection.
This Is Why the Story Is Bigger Than FrontierMath
GPT-6 Astra also posted a very high FrontierMath Tier 4 score in OpenAI’s launch materials.
Benchmarks are useful. They measure whether a model can solve a curated set of difficult problems under defined conditions.
A new mathematical result is different. There is no answer key waiting at the end. The model has to produce an argument that extends the known frontier. Then other people have to decide whether it is correct.
That transition from benchmark problem to open research problem is the important scientific milestone. A model can score extremely well on an evaluation and still contribute nothing new to mathematics. A valid new theorem is a different category of evidence.
AI Mathematical Research Is Becoming a Verification Pipeline
The emerging pattern is not simply “AI does math.”
It looks more like a pipeline.
The model explores ideas. It produces a candidate argument. Computation checks numerical components. A proof assistant formalizes part or all of the logical structure. Humans inspect assumptions, significance and mathematical context. Repositories make artifacts reproducible. The final result enters normal scientific scrutiny.
That model is more credible than asking AI to replace mathematicians. It changes where human effort goes.
Less time may be spent searching every possible proof path. More time may be spent checking, formalizing, interpreting and deciding which results matter.
Formal Verification Does Not Solve Scientific Judgment
Even a fully formal proof cannot answer every research question.
Is the theorem important? Is there a simpler proof? Does the technique generalize? Did the formal statement capture the intended informal theorem? Are the assumptions appropriate? Does the result reveal a new idea or only optimize an existing method?
Those remain mathematical judgments.
Lean can verify that a formal derivation follows from its assumptions. It cannot decide why researchers should care.
That distinction becomes more important as AI can generate larger volumes of technically plausible research.
The Real Bottleneck May Move From Discovery to Triage
If models become capable of producing many candidate proofs, science gains a new problem.
Which ones deserve attention?
Human researchers have limited time. Formalization has a cost. Independent verification has a cost. Reading a 39-page analytic number theory proof has a cost.
A future system that produces one hundred plausible theorems a day may create more work than it removes unless it can also rank significance and expose weak points clearly.
The next scientific tooling problem may therefore be triage. Not only generating new results. Helping humans decide which results are worth verifying.
What OpenAI Has Actually Released
OpenAI’s September 4 Astra announcement says the model contributed two further results on prime gaps.
The short-gap paper proves, according to the released manuscript, that the liminf of consecutive prime gaps is at most 186. The paper attributes the proof to GPT-6 Astra.
It records the earlier Polymath 8b bound of 246 and concurrent work reaching 240. OpenAI released a PrimeGaps186 GitHub repository containing a conditional Lean 4 formalization and a numerical certificate. The repository explicitly lists the assumptions on which the formalization remains conditional.
A second paper improves a lower bound for long prime gaps and is also attributed to Astra. OpenAI also released a Lean formalization repository for that result.
What We Should Not Claim Yet
We should not say Astra proved the twin prime conjecture.
We should not say all consecutive primes are at most 186 apart.
We should not say the result moved directly from 246 to 186 without concurrent human progress.
We should not say the PrimeGaps186 Lean repository proves every external analytic input from first principles.
We should not say formal verification makes the theorem scientifically important automatically.
We should not equate OpenAI publication with completed independent community validation.
And we should not reduce the result to a benchmark.
The interesting claim is narrower and stronger: OpenAI has released new prime-gap proofs attributed to Astra, together with unusually concrete verification artifacts.
The Bigger Story Is That AI Research Now Has to Be Checkable
The number 186 will get the attention.
The verification stack may matter more.
AI is getting better at producing work that resembles frontier research. That increases the value of systems that expose exactly what the model proved, what it assumed and what was checked mechanically.
For mathematics, proof assistants provide an unusually strong answer.
A model can generate an argument. Humans do not have to trust its confidence. They can inspect the paper, run the certificate and check the formal derivation.
That is a much more useful future for AI science than automated certainty.
The model proposes. The proof has to survive.