Bug#1003419: ITP: primecount -- fast prime number counter C/C++ library
Package: wnpp
Severity: wishlist
Owner: Jerome Benoit <calculus@rezozer.net>
X-Debbugs-Cc: debian-devel@lists.debian.org
* Package name : primecount
Version : 7.2
Upstream Author : Kim Walisch <kim.walisch@gmail.com>
* URL : https://github.com/kimwalisch/primecount
* License : BSD-2-clause
Programming Lang: C/C++
Description : fast prime number counter C/C++ library
primecount is a command-line program and C/C++ library that counts
the primes below an integer x <= 10**31 using highly optimized
implementations of the combinatorial prime counting algorithms.
primecount includes implementations of all important combinatorial
prime counting algorithms known up to this date all of which have
been parallelized using OpenMP. primecount contains the first ever
open source implementations of the Deleglise-Rivat algorithm and
Xavier Gourdon's algorithm (that works). primecount also features
a novel load balancer that is shared amongst all implementations
and that scales up to hundreds of CPU cores. primecount has already
been used to compute several prime counting function world records.
primecount will be part of sagemath.
I am planning to maintain primecount in behalf of the
Debian Math Team. Notice that I am actually maintaining
a related package by the same author, primesieve.
Reply to: