Fedora 34 Update: primecount-6.3-1.fc34

--------------------------------------------------------------------------------
Fedora Update Notification
FEDORA-2021-452c43ebc0
2021-03-19 19:51:22.365700
--------------------------------------------------------------------------------

Name        : primecount
Product     : Fedora 34
Version     : 6.3
Release     : 1.fc34
URL         : https://github.com/kimwalisch/primecount/
Summary     : Fast prime counting function implementation
Description :
Primecount is a command-line program and 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 world records e.g. pi(10**27)
(http://www.mersenneforum.org/showthread.php?t=20473) and
nth_prime(10**24) (https://oeis.org/A006988).

--------------------------------------------------------------------------------
Update Information:

Changes in primecount 6.3:  This is a minor new release, the API and ABI
(Application binary interface) are backwards compatible.  The memory usage of
the PiTable and SegmentedPiTable has been reduced by about 2x, this speeds up
the computation of the easy special leaves (S2_easy & AC formulas) by up to 30%
for large pi(x) computations with x ��� 1e23. Furthermore, the partial sieve
function a.k.a. phi(x, a) has been improved significantly, it now runs 3 to 5x
faster for most input. phi(x, a) is used extensively by many other functions
such as pi_legendre(x) and pi_meissel(x) which now also run up to 5x faster.  -
PiTable.cpp: Reduce memory usage by 2x. - SegmentedPiTable.cpp: Reduce memory
usage by 2x. - Sieve.cpp: Reduce memory usage of counters array by 2x. -
phi.cpp: Fixed integer overflow #39. - phi.cpp: Cache 40x more phi(x, a)
results. - phi.cpp: Use pi(x) if a > pi(sqrt(x)). - phi.cpp: Use larger c
constant if phi(x, larger_c) is cached. - generate_phi.hpp: Same optimizations
as phi.cpp. - LoadBalancer.cpp: Tune for new phi(x, a) implementation. -
FactorTable.hpp: Reduce number of branches. - DFactorTable.hpp: Reduce number of
branches.
--------------------------------------------------------------------------------
ChangeLog:

* Fri Mar  5 2021 Jerry James  - 6.3-1
- Version 6.3
--------------------------------------------------------------------------------

This update can be installed with the "dnf" update program. Use
su -c 'dnf upgrade --advisory FEDORA-2021-452c43ebc0' at the command
line. For more information, refer to the dnf documentation available at
http://dnf.readthedocs.io/en/latest/command_ref.html#upgrade-command-label

All packages are signed with the Fedora Project GPG key. More details on the
GPG keys used by the Fedora Project can be found at
https://fedoraproject.org/keys
--------------------------------------------------------------------------------