Edit: Sorry about misinterpretingAssume $xy=0$ but $yx\neq 0$. What my previous argument shows isWe can take $x$ and $y$ to be $2$-adic quaternions, and then we have $xy=0$ modulo $2^s$ but $yx\neq 0$ modulo $2^s$. We can factor out the highest possible power of $2$ from $x$ and $y$, and then divide $2^s$ by that there is a counterexample ifpower, so without loss of generality $x$ and only if there is a counterexample for $s=2$$y$ are nontrivial modulo $2$.
Unfortunately, there$xy\bar{y}=x|y|^2$. $|y|^2$ is a counterexample forregular $s=2$$2$-adic number and is the sum of four squares, at least one odd, and so is nonzero mod $8$.
$(1-i-j-k)(1+i+j+k)=4=0$ $x$ has a coefficient that is nonzero mod $4$$2$ so that same coefficient in $x|y|^2$ is nonzero mod $8$, so $x|y|^2$ is nonzero mod $8$, so $xy$ is nonzero mod $8$.
$(1+i+j+k)i(1-i-j-k)=(1-i-j-k)(i-1+k-j)=j^2 - (1-i-k)^2$
$= -1-1+1+1+2i+2k=2i+2k\neq 0$ mod Therefore $4$$s$ must be $1$ or $2$. Since a-fortiori computed that reversibility holds for $s=1,2$, it holds for every $s$.