Description:

This module provides an optimized implementation of the Sieve of
Eratosthenes, and uses it to return a reference to an array all primes up
to any integer specified, within the limitations of addressable memory.

Additionally the module provides access to other Prime-related functions
that are facilitated as a by-product of having a really fast Prime Sieve.

At the time of writing, the 'primes' function will return all primes up to
and including '$n' faster than any other module I can find on CPAN
(including Math::Prime::XS). While a segmented sieve (which this isn't)
would extend the range of primes accessible, the fact that this module uses
a bit-sieve means that primes over a billion are easily within reach of
most modern systems.