
> 
> "One cannot walk to infinity on the real line if one uses steps of bounded
> length and steps on the prime numbers. This is simply
> a restatement of the classic result that there are arbitrarily
> large gaps in the primes."
> 
> 
> 


So begins the paper by
Gethner, Wagon, and Wick,
["A Stroll Through the Gaussian Primes"](https://www.jstor.org/stable/2589708)
(*American Mathematical Monthly*
**105**(4): 327-337 (1998).)
They explain that it is unknown if one can walk to infinity on the Gaussian primes
with steps of bounded length.
Paul Erdős was reported to have conjectured this is possible
("A conjecture of Paul Erdős concerning Gaussian primes."
*Math. Comp* **24**: 221-223 (1970);
[PDF](https://www.ams.org/journals/mcom/1970-24-109/S0025-5718-1970-0256976-8/S0025-5718-1970-0256976-8.pdf)).
Later Erdős is reported to have conjectured the opposite:
that no such walk-to-$\infty$ is possible [GWW98, p.327].
This has become known as the *Gaussian moat problem*, apparently still unresolved.


My question is:



> 
> Is there an analogous *quaternion moat problem*?
> Is it solved? open? Is it easier or harder than the Gaussian moat problem?
> 
> 
> 


Define a nonzero quaternion $q = a + bi + cj + dk$ as *prime* iff (a) it is a [Hurwitz quaternion](https://en.wikipedia.org/wiki/Hurwitz_quaternion) (all components integer, or all components half-integer)
and (b) its norm $a^2 + b^2 +c^2 + d^2$ is prime.
(Part (b) is a consequence of the inability to factor $q$; see, e.g.,
Theorem 15 in \*"A proof of Lagrange's four square theorem using quaternion algebras."
Drew Stokesbary, 2007; [PDF](http://www.duke.edu/%7Eds53/QuaternionAlgebra.pdf), DOI: [10.2139/ssrn.2396123](https://doi.org/10.2139/ssrn.2396123)).



> 
> Can one "walk-to-$\infty$" on the quaternion primes using steps of bounded length?
> 
> 
> 


Perhaps relevant here is
[Lagrange's four-square theorem](https://en.wikipedia.org/wiki/Lagrange%27s_four-square_theorem), which states
that any natural number can be represented as the sum of four squares.


I ask this question in relative naïveté, and appreciate being enlightened.



The quaternion moat problem
Having an infinite walk of bounded step length in the quaternions (or in $\mathbb Z^k$ in Gerry's version), gives us a sequence of primes $p\_1,p\_2\dots$ with $p\_{k+1}-p\_k=O(\sqrt{p\_k})$. However the best unconditional result we have so far on prime gaps is $O(p\_k^{0.525})$ by Baker, Harman and Pintz. So these problems are all open in general.


That said the heuristics that work for Gaussian primes can almost always be translated to a more general setting. One famous article on the topic is Vardi's paper ["Prime percolation"](https://projecteuclid.org/journals/experimental-mathematics/volume-7/issue-3/Prime-percolation/em/1047674208.full). There it is mentioned that the percolation model can be extended to the general case of primes represented by quadratic forms, quaternion primes etc. (where one can make the same predictions), though this is not written anywhere.


