Function isPrimeBigint

src/compute-engine/numerics/primes.ts:171–182

(n: bigint)

  if (!Number.isInteger(n) || !Number.isFinite(n) || n <= 1) return false;
  return isPrimeBigint(BigInt(n));
}

// Above this bound, primality is decided by Miller–Rabin rather than trial
// division.
const MILLER_RABIN_THRESHOLD = 1n << 32n;

// The first 12 primes are a deterministic Miller–Rabin witness set for every
// n < 3.3·10²⁴, so `isPrimeBigint` is exact across that range (and an
// extremely reliable probable-prime test beyond it).
const MILLER_RABIN_BASES = [
  2n,
  3n,
  5n,
  7n,
  11n,