Search results
249 packages found
Miller Rabin algorithm for primality test
JavaScript library for efficient prime number detection and arithmetic, with customizable algorithms for large numbers.
A package to compute and check for prime numbers within a specified range.
elliptic curves implementations in wasm
Low memory-usage implementation of a Sieve of Eratosthenes.
Implementation of the Miller-Rabin primality test.
This adapter integrates with system described as: cisco prime
Checks if a number is prime or not
Generate a cryptographically-random probable prime number that passes the Miller-Rabin test with the given number of bits of entropy.
elliptic curves implementations in wasm
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
Fastest Prime Number Calculation logic for nodejs and browser (checks, random generator, prime range generator, primes count generator, summation of primes, factorial of primes)
- Fastest
- Prime
- Number
- Calculation
- fast primes
- fast prime
- fast
- primes
- numbers
- prime numbers
- prime
- get prime
- get primes
- fetch prime
- View more
A function that deterministically checks if a number is prime.
Generate a random prime number
Test if a number is prime in constant time, using a cached Sieve of Eratosthenes.
Finds any prime numbers up to given limit. Based on linear Sieve of Eratosthenes algo.
Check prime number using only RegExp!