go_util

ca

computational algebra

pardic.go

implementation of $p$-adic integers

nat

• my greatest appreciation to apgoucher for the prime $p = 2^{64} - 2^{32} + 1$ with $g=7$ being the generator of $(\mathbb{Z}/p)^\times$
• (almost) arbitrary precision unsigned integer $[0, 2^{4294967294 \times 16})$ $\sim$ 8GB
• multiplication using FFT
• division using Newton iteration
• support signed integers by wrapping a sign bit