What happened?
Result family 265 in OpenAI's mathematics collection claims an entropy area law for two dimensional quantum systems on a square grid Catalogue ↗. It says that if the whole system has a spectral gap, entanglement between any region and the rest is bounded by a constant times the region's boundary Manuscript ↗. This is a claim from an unreleased model and has not been independently confirmed Repository README ↗.
Entanglement is a quantum link in which parts of a system share information that cannot be described separately. For the lowest energy state of a system, the simple upper bound grows with the number of sites in a region Manuscript ↗. An area law says it grows only with the boundary, which makes such states much easier to describe and simulate. A spectral gap means there is a fixed energy jump between the lowest state and the next one Manuscript ↗.
In one dimension, Hastings proved an area law for gapped systems Manuscript ↗. In two dimensions, earlier proofs needed extra assumptions, such as frustration free interactions where the lowest state satisfies every local rule at once, and covered only certain cuts Manuscript ↗ Earlier arXiv result ↗. The new manuscript, dated September 24, 2026, claims to drop those extra assumptions and to cover any region in any finite square grid domain Manuscript ↗.
What are the two pieces?
The area law paper
Claims the entropy bound for unique gapped ground states with finite range interactions, using only the full system gap and fixed local bounds Catalogue ↗. It is a 90 page manuscript Manuscript ↗.
The PEPS companion
Claims these states can be approximated by projected entangled pair states, a compact network description, of manageable size Catalogue ↗. The paper says it is an existence result, not a recipe Catalogue ↗.
If it holds, this would answer a well known question about when quantum matter in two dimensions stays simple enough to describe efficiently. That is a big if, and the check has only just started.
Leapscope interpretation of the reported result.How did AI help?
OpenAI says the vast majority of its collection, which includes this family, came from one fixed procedure using an unreleased model, with outputs grouped and filtered for significance by OpenAI Repository README ↗. The manuscript lists OpenAI as its author Manuscript ↗. OpenAI has not published a reasoning summary for this family Repository README ↗.
From the catalogue entry Catalogue ↗ and the manuscript Manuscript ↗.
Unlike the quasi-Riemann result, family 265 has no Lean formalisation in the catalogue, so no computer has checked its proof Catalogue ↗. OpenAI warns that some unformalised results could have issues Repository README ↗. An outside open source project has opened a tracker to formalise both papers, but it states that no new theorem is claimed proved by its plan so far TNLean tracker ↗.
Which fields could this affect?
The immediate value is a precise claim for mathematical physicists to test; other uses depend on it being confirmed, and these connections are our assessment.
Mathematical physics
Specialists can read the argument and compare it with earlier results that needed stronger assumptions Manuscript ↗ Earlier arXiv result ↗. Confirming or finding a gap is the next useful step.
Explore scienceQuantum simulation
The companion paper claims gapped states have compact network descriptions Catalogue ↗. If true, this would add theoretical support for simulation methods built on such networks.
Explore softwareQuantum materials and computing
Better theory of entanglement could guide research on quantum matter over time. This result does not establish a new quantum computer, material or energy source.
What has been checked?
The evidence is an unreviewed preprint released by the developer, with no computer checked proof yet. Leapscope reviewed these sources; we did not repeat the experiments.
Shown so far
- OpenAI published two manuscripts claiming a 2D area law and a compact network approximation Catalogue ↗.
- The paper sets out its assumptions and compares itself with earlier one and two dimensional results Manuscript ↗.
- An outside project has begun planning a Lean formalisation of both papers TNLean tracker ↗.
Still unknown
- Whether the proof is correct; it has no Lean proof and no published expert review Catalogue ↗ Repository README ↗.
- Whether the assumptions, a full system gap on a finite square grid, fit the physical systems people care about.
- Whether the network approximation could lead to practical algorithms, since it is only an existence result Catalogue ↗.
Evidence status: Claim under review. Stage: Claim. A claimed result still under review.
From claim to accepted physics
This is our suggested way to follow the result, not a promised timetable.
Can I use it today?
Anyone can read both manuscripts in OpenAI's public repository Catalogue ↗. There is no tool or product here, and the model that wrote the papers is not available Repository README ↗.
A few things you might be wondering
Does this mean a better quantum computer?
No. It is a claimed mathematical bound about entanglement in certain systems Catalogue ↗. It does not build or improve any device.
Has anyone checked the proof?
Not yet in public. It has no Lean formalisation in OpenAI's catalogue Catalogue ↗, and an outside formalisation effort is only at the planning stage TNLean tracker ↗.
How does it relate to the other OpenAI results?
It is one of 372 result families in the same release Repository README ↗. The quasi-Riemann claim in that release has a Lean proof; this one does not Catalogue ↗.
Go straight to the sources
Checked Oct 8, 2026. The first source is the original announcement or research. Later sources add independent context; background pages do not validate the result on their own.
01Summary of the claimed result and links to its two manuscripts.
The 90 page manuscript with the theorem, assumptions and history of related work.
How the collection was produced and the warning that unformalised results could have issues.
An outside project's plan to formalise both papers in Lean.
Earlier two dimensional area law that needed frustration free and local gap assumptions.