Function modPow

src/compute-engine/numerics/primes.ts:185–195

(base: bigint, exp: bigint, mod: bigint)

  5n,
  7n,
  11n,
  13n,
  17n,
  19n,
  23n,
  29n,
  31n,
  37n,
];

export function isPrimeBigint(n: bigint): boolean {
  if (n < 2n) return false;
  if (n <= LARGEST_SMALL_PRIME) return SMALL_PRIMES.has(Number(n));
  if (n < MILLER_RABIN_THRESHOLD) {