Number theory · Oct 6, 2026
Uniformly bounded components of Gaussian-prime graphs
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.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model