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
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
Primality test using fast checks and miller-rabin (all in one)
Eratosthenes primality implementation
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
A high-performance TypeScript library for primality testing using Miller-Rabin and Fermat algorithms.
integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test
Test if a number is a prime using Strengthening the Baillie-PSW primality test.
Ultra-fast primality testing with Montgomery arithmetic (32-bit and 64-bit)
Uses the Fermat primality test with 100 runs to determine if a number is prime
A Miller-Rabin primality test implementation for TypeScript
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
Suite for testing primality, finding primes, and finding prime k-tuples
TypeScript implementation of a probabilistic primality testing on the basis of Fermat's Little Theorem and Miller Rabin Theorem
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
Test if number is prime with Miller–Rabin primality test
Minimal implementation of older cryptography algorithms: RSA, DSA, DH, ElGamal
Returns true or false depending on the number's parity (odd/even) and primality (prime/composite); Also checks if integer does not exceed the JavaScript MAXIMUM_SAFE_INTEGER.
An implementation of the Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt
check if a number is prime
Check if a number is prime
Primality Test crate
`primal` puts raw power into prime numbers. This crates includes: optimised prime sieves, checking for primality, enumerating primes, factorising numbers, and state-of-the-art estimation of upper and lower bounds for π(n) (the number of primes below n) and p_k (the k-th prime).
An interface to primal using crossbeam's channels. This allows the worker thread to stop once the receiver is dropped, for example.
An interface to primal using tokio's streams. This allows the worker to stop once the receiver is dropped, for example.
Linear programming library that provides primal and dual simplex solvers.
Implementation of primality tests for multi-precision numbers using crypto-bigint
A simple sieve of Eratosthenes designed for testing faster sieves. You probably want `primal-sieve`, or even just `primal` itself.
red_primality provides zero-setup primality testing and factoring for all u64
Implementation of primality tests for multi-precision numbers using crypto-bigint
A library for primality testing algorithms with benchmarking
ne plus ultra primality testing for machine-sized integers
test primality
JSON API support for the Primalize gem
An Uber-fast primality testing library.
An Uber-fast primality testing library.
imple gem for generating primal table mutifications.
Ruby gem for accessing Primal Data web services
A number theory library written in pure Ruby. Provides methods for primality test, factoring integers, and more.