Eratosthemus Prime is a fast, memory-efficient prime generator which uses a segmented Sieve of Eratosthenes and mod 30 wheel factorization. It works up to 264 - 1.
git clone https://github.com/js42721/eratosthemus-prime
cd eratosthemus-prime
make
js42721/eratosthemus-prime
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|