Fast prime number generator
primesieve is a command-line 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.
- Developed at devel:libraries:c_c++
- Sources inherited from project openSUSE:Factory
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:Rebuild/primesieve && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| primesieve-7.4.tar.gz | 0000165977 162 KB | |
| primesieve.changes | 0000000401 401 Bytes | |
| primesieve.spec | 0000003014 2.94 KB |
Revision 1 (latest revision is 13)
Dominique Leuenberger (dimstar_suse)
accepted
request 699883
from
Kim Walisch (walki)
(revision 1)
- Trim subjective parts from description. primesieve is a new package, it's a command-line program and C/C++ library that generates prime numbers using a highly optimized sieve of Eratosthenes implementation. primesieve is primarily used by students who learn about prime numbers in school, by research scientists and by benchmark enthusiasts e.g. for benchmarking CPUs. primesieve is quite popular on GitHub, it currently has 453 stars which is more than any other program for computing prime numbers. primesieve is already included in Debian/Ubuntu, Fedora, Homebrew, Chocolatey and the Phoronix Test Suite.
Comments 0