Home
primesieve is a program and C/C++ library that generates primes using a highly optimized sieve of Eratosthenes implementation. primesieve can generate primes and prime k-tuplets up to 2^64.
primesieve generates primes about 50 times faster (single-threaded) than an ordinary C/C++ sieve of Eratosthenes implementation and about 10,000 times faster than trial-division. primesieve outperforms the author's older ecprime (fastest open source prime number generator from 2002 to 2010) by about 40 percent and also substantially outperforms primegen the fastest sieve of Atkin implementation on the web.
| x | Prime Count |
Intel Core i7-6700 (4 x 3.4 GHz, 256 KiB L2 cache) |
AMD Ryzen 7 1700 (8 x 3.0 GHz, 512 KiB L2 cache) |
| 108 | 5,761,455 | 0.01s | 0.01s |
| 109 | 50,847,534 | 0.04s | 0.03s |
| 232 | 203,280,221 | 0.17s | 0.11s |
| 1010 | 455,052,511 | 0.40s | 0.27s |
| 1011 | 4,118,054,813 | 4.56s | 3.00s |
| 1012 | 37,607,912,018 | 55.14s | 35.20s |
| 1013 | 346,065,536,839 | 672.24s | 413.91s |
The above benchmarks were run on Linux and primesieve was compiled using GCC 6.3. For each benchmark primesieve used all available CPU cores and the sieve size was set to half the CPU's L2 cache size.
primesieve scales linearly up to a very large number of CPU cores. The benchmark below was run on a system with 8 physical CPU cores, at each start offset the primes inside an interval of size 10^11 were counted using different numbers of threads.
primesieve generates primes using the segmented
sieve of
Eratosthenes with
wheel
factorization, this algorithm has a complexity of
Segmentation is currently the best known practical improvement to
the sieve of Eratosthenes. Instead of sieving the interval
[2, n] at once one subdivides the sieve interval into a
number of equal sized segments that are then sieved consecutively.
Segmentation drops the memory requirement of the sieve of Eratosthenes from
Wheel factorization is used to skip multiples of small primes. If a
k-th wheel is added to the sieve of Eratosthenes then only those
multiples are crossed off that are coprime to the first k
primes, i.e. multiples that are divisible by any of the first k
primes are skipped. The 1st wheel considers only odd numbers, the 2nd
wheel (modulo 6) skips multiples of 2 and 3, the 3rd wheel (modulo 30)
skips multiples of 2, 3, 5 and so on. Pritchard has shown in
[2] that the running time of the sieve of
Eratosthenes can be reduced by a factor of
Additionally primesieve uses Tomás Oliveira e Silva's
cache-friendly bucket list algorithm
if needed [4]. This algorithm is relatively
new, it has been devised by Tomás Oliveira e Silva in 2001 in order to
speed up the segmented sieve of Eratosthenes for prime numbers past 32
bits. The idea is to store the sieving primes into lists of buckets
with each list being associated with a segment. A list of sieving
primes related to a specific segment contains only those primes that
have multiple occurrence(s) in that segment. Whilst sieving a segment
only the primes of the related list are used for sieving and each
prime is reassigned to the list responsible for its next multiple when
processed. The benefit of this approach is that it is now possible to
use segments (i.e. sieve arrays) smaller than
primesieve is written entirely in C++ and does not depend on external libraries. It's speed is mainly due to the segmentation of the sieve of Eratosthenes which prevents cache misses when crossing off multiples in the sieve array and the use of a bit array instead of a boolean sieve array. primesieve reuses and improves ideas from other great sieve of Eratosthenes implementations, namely Achim Flammenkamp's prime_sieve.c, Tomás Oliveira e Silva's A1 implementation and the author's older ecprime all written in the late '90s and '00s. Furthermore primesieve contains new optimizations to increase instruction-level parallelism and more efficiently uses the larger number of registers in today's CPUs.
- Uses a bit array with 8 flags each 30 numbers for sieving
- Pre-sieves multiples of small primes ≤ 19
- Compresses the sieving primes in order to improve cache efficiency [5]
- Starts crossing off multiples at the square
- Uses a modulo 210 wheel that skips multiples of 2, 3, 5 and 7
- Uses specialized algorithms for small, medium and big sieving primes
- Uses a custom memory pool (for big sieving primes)
- Processes multiple sieving primes per loop iteration to increase instruction-level parallelism
- Multi-threaded using C++11
std::async
primesieve's inner sieving loop has been optimized using extreme loop unrolling, on average crossing off a multiple uses just 1.375 instructions on x64 CPUs. Below is the assembly GCC generates for primesieve's inner sieving loop, each andb instruction unsets a bit (crosses off a multiple) in the sieve array.
; primesieve inner sieving loop
; Uses only 11 instructions (x86-64) to cross-off the next 8 multiples
.L99:
andb $-3, (%rax)
andb $-9, (%rax,%r14)
andb $127, (%rax,%r12)
andb $-33, (%rax,%rbp)
andb $-2, (%rax,%r10)
andb $-65, (%rax,%rbx)
andb $-5, (%rax,%r9)
andb $-17, (%rax,%r11)
addq %r13, %rax
cmpq %rdi, %rax
jb .L99- R. C. Singleton, "An efficient prime number generator",
Communications of the ACM 12, 563-564, 1969. - Paul Pritchard, "Fast compact prime number sieves (among others)",
Journal of Algorithms 4 (1983), 332-344. - Jonathan Sorenson, "An analysis of two prime number sieves",
Computer Science Technical Report Vol. 1028, 1991. - Tomás Oliveira e Silva, "Fast implementation of the segmented sieve of Eratosthenes", 2002.
- Actually not the sieving primes are compressed but their sieve and wheel indexes.