Skip to content

Documentary state: DRAFT_UNACCEPTED. This draft has NOT been editorially admitted. Mathematical claims require independent checking.

OAI-26 family 028: the Gaussian moat conjecture

Editorial status: DRAFT_UNACCEPTED. NO_CERTIFICATION. This is an account of a pinned manuscript's claims, not an independently checked proof.

The question in plain language

Gaussian integers are numbers of the form \(a+bi\), where \(a\) and \(b\) are ordinary integers and \(i\) is the square root of minus one. Some Gaussian integers are prime in this larger ring: they cannot be factored nontrivially into two nonunits.

Picture these Gaussian primes as points on an infinite grid. Could someone walk forever between distinct Gaussian-prime points while taking steps no longer than a fixed distance? The Gaussian moat conjecture says no. The pinned OAI-26 source overview claims a proof and states a stronger uniform bound on the number of points in any connected cluster of bounded-step Gaussian primes.

A small example

Fix a positive distance threshold \(D\). Form a graph whose vertices are Gaussian primes, joining two vertices by an edge whenever their Euclidean distance in the complex plane is at most \(D\).

A path in this graph represents a walk using steps of length at most \(D\). Showing that every connected component is finite would rule out an infinite path through distinct vertices, but it would not by itself bound how large those finite components can become.

The stronger indexed assertion says there is a finite number \(M(D)\) such that every connected component contains at most \(M(D)\) vertices. That bound depends on the chosen step threshold but not on where the component lies on the Gaussian-integer lattice.

The claim expressly includes Gaussian primes lying on the real and imaginary coordinate axes, which cannot simply be omitted from the graph.

What is known

The pinned catalogue names one Family 028 manuscript, Bounded-Step Walks on Gaussian Primes (September 26, 2026).

The publisher overview asserts two nested results:

  • No infinite walk through distinct Gaussian primes can keep every step below one fixed distance bound.
  • More strongly, for each fixed \(D\), all connected components of the Gaussian-prime graph with distance threshold \(D\) are finite and have size bounded uniformly by a function of \(D\). The claim includes primes on the coordinate axes.

These statements should not be conflated with the classical distribution of ordinary rational primes, or with a theorem about primes only in a selected quadrant. They are claims about all Gaussian-prime vertices in the plane, subject to the source's exact conventions for associates and graph edges.

The original manuscript's proof, definitions and any exceptional small thresholds have not been examined here. The claims above are publisher-reported.

GCL verification state

The documentary source is pinned to openai/math@1581d4cbdd69a0faf34b2089614fe2a814316a6a. The protected OAI-26 catalogue records the single source PDF for Family 028.

This pass does not independently validate the geometric or sieve estimates needed to control components. It identifies no verified Family 028-specific Lean proof, Comparator replay, semantic correspondence judgment or MATHCERT certificate. Source indexing and editorial documentation do not certify the theorem.

What remains

A source critic should inspect the pinned PDF, identify the principal theorem and the precise graph definition, and check whether the result permits the usual Gaussian-prime associates as separate vertices. Verify that coordinate-axis primes are included and the component bound is genuinely uniform in position for each fixed \(D\).

The mathematical audit must distinguish a prohibition on infinite self-avoiding walks from a uniform finite component-size bound, and identify the argument establishing the stronger claim. It should also inspect whether bounds depend only on \(D\) or on additional arithmetic parameters.

Finally, validate the mathematical Markdown and rendered compendium, record source-bound editorial criticism and obtain protected merge/readback. Documentary admission is separate from mathematical certification.

Sources and claim boundaries

Boundary: NO_CERTIFICATION. This article reports the Gaussian moat resolution claimed by the source and does not independently prove or formally certify it.


Indexed primary manuscript paths: