1 · The essentials
The Gaussian moat question asks whether you can keep moving forever among distinct Gaussian primes without ever taking a step longer than a fixed limit. Gaussian primes are the special points considered in this number-theory problem. The manuscript answers no, and its main result has a Lean formalization. It also establishes something stronger: for any fixed finite step limit, every group of primes linked by allowed steps contains at most a common maximum number of primes. That maximum depends only on the step limit, not on where you start. The result includes primes lying on the coordinate axes. It does not give an explicit value for that maximum.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine stepping stones where each jump must stay within a fixed distance. The result says not only that you cannot visit new stones forever, but that every reachable cluster has a common size ceiling for that jump limit. This image illustrates the conclusion, not the arithmetic behind it.
Why it matters
Ruling out an endless walk does not by itself supply a common size limit for all reachable groups. The stronger result supplies exactly that uniform control, for every starting Gaussian prime. Its inclusion of primes on the coordinate axes makes the scope explicit.
2 · Going further
For a fixed finite distance bound , form a graph whose vertices are Gaussian primes, joining two distinct vertices when their distance is at most . The main result states that there is a finite bound such that every connected component contains at most vertices. The bound is uniform over all starting primes, including those on the coordinate axes, but is nonexplicit.
The source identifies the Gaussian moat conjecture as the assertion that no infinite walk through distinct Gaussian primes can have uniformly bounded steps. The component-size statement is stronger: such a walk would have to remain inside one component of the graph for its step bound, whereas that component has only finitely many vertices.
The abstract describes the argument as constructing a finite periodic sieve obstruction using geometric sampling and information-theoretic estimates. It does not supply further details of these ingredients. The supplied family contains one main manuscript, “Bounded-Step Walks on Gaussian Primes,” marked as Lean-formalized; no companion manuscripts are described.
Useful notions
- Gaussian primes and their locations
- Distance between points
- Graphs and connected components
- Finite bounds and uniformity
What was known before / what is new
Before
The source presents the impossibility of an infinite bounded-step walk through distinct Gaussian primes as the Gaussian moat conjecture. It gives no account of earlier partial results or historical development.
New
The manuscript establishes the Gaussian moat statement and the stronger uniform bound on component sizes. This bound applies to every starting prime, including primes on the coordinate axes. The abstract identifies a finite periodic sieve obstruction, built using geometric sampling and information-theoretic estimates, as the argument's main construction.
Limits and assumptions
The distance bound must be fixed and finite; the component-size bound depends on it. The prohibition on infinite walks concerns walks through distinct Gaussian primes. The size bound is nonexplicit, so the source supplies no numerical formula for it. The main result has a Lean formalization, but the supplied text does not specify whether every supporting claim or construction is covered. It identifies no further open problem.
Mini glossary
- Gaussian-prime graph —
- The graph with Gaussian primes as vertices and an edge between distinct primes whose distance is at most a chosen bound.
- Connected component —
- A group of vertices reachable from one another by following edges, including every vertex reachable from that group.
- Uniform bound —
- A common upper limit that here depends only on the step bound, not on the starting prime or component.
- Nonexplicit bound —
- A bound whose existence is established without an explicit value being supplied.
- Gaussian moat conjecture —
- The statement that no infinite walk through distinct Gaussian primes can have uniformly bounded steps.
Keywords : Gaussian primes · Gaussian moat conjecture · Uniform component bounds
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
Proves the Gaussian moat conjecture: no infinite walk through distinct Gaussian primes can have uniformly bounded steps. More strongly, for every distance bound D, the graph joining Gaussian primes at distance at most D has uniformly bounded finite component sizes, depending only on D, including primes on the coordinate axes.
Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.
Manuscripts in this family
Bounded-Step Walks on Gaussian Primes
26/09/2026We prove the Gaussian moat conjecture: no infinite walk through distinct Gaussian primes can have bounded steps. More strongly, for each fixed finite step bound, the connected components of the Gaussian-prime graph have uniformly bounded size. This bound applies to every starting prime, including primes on the coordinate axes, and is nonexplicit. The proof constructs a finite periodic sieve obstruction using geometric sampling and information-theoretic estimates.