A JavaScript library for prime numbers.

Miller Rabin algorithm for primality test

Implementation of the Miller-Rabin primality test.

Lucas-Lehmer primality test

Fermat's probabilistic primality test

Primality test using fast checks and miller-rabin (all in one)

A high-performance TypeScript library for primality testing using Miller-Rabin and Fermat algorithms.

Number-theory toolkit: deterministic Miller-Rabin primality, sieve, factorization, Euler totient, gcd/lcm and modular exponentiation.

An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.

A Miller-Rabin primality test implementation for TypeScript

integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test

High-performance primality testing for JS/TS with zero dependencies. Auto-selects optimal algorithm (Number, BigInt, deterministic 64-bit, arbitrary-precision) based on input.

Eratosthenes primality implementation

Test if a number is a prime using Strengthening the Baillie-PSW primality test.

Test if number is prime with Miller–Rabin primality test

A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes

Suite for testing primality, finding primes, and finding prime k-tuples

Uses the Fermat primality test with 100 runs to determine if a number is prime

An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.

Arbitrary precision modular arithmetic, cryptographically secure random numbers and strong probable prime generation/testing. It works in modern browsers, Angular, React, Node.js, etc. since it uses the native JS implementation of BigInt