Project : tanc
F. Morain has been improving his primality proving algorithm called ECPP. Binaries for version 6.4.5 are available since 2001 on his web page. Proving the primality of a 512 bit number requires less than a second on a GHz PC. His personal record is about decimal digits, with the fast version he developped last year.
The mpc library, developed by A. Enge in collaboration with P. Zimmermann, implements the basic operations on complex numbers in arbitrary precision, which can be tuned to the bit. This library is based on the multiprecision libraries gmp and mpfr. Each operation has a precise semantics, in such a way that the results do not depend on the underlying architecture. Several rounding modes are available. This software, licensed under the GNU Lesser General Public License (LGPL), can be downloaded freely from the URL
http://www.lix.polytechnique.fr/Labo/Andreas.Enge/Software.html This library is used in our team to build curves with complex multiplication, and is de facto incorporated in the ECPP program.