A compact (bitfield) primesieve in JavaScript together with the functions to use it
> TODO: description
Generate a Sieve of Eratosthenes with constant time lookup
JavaScript implementation of the Sieve of Sundaram for finding prime numbers.
Sieve for prime numbers using a segmented sieve.
Wrapper for Primesieve C library
Raw bindings to the [primesieve](http://primesieve.org) C library
Access to the C function primesieve_generate_primes
Single-Shot Miller-Rabin primality test for small integers
A wrapper for the primesieve C prime number generator
DEPRECATED: use https://github.com/robertjlooby/primesieve-ruby