GMP is a free library for arbitrary precision
arithmetic, operating on signed integers, rational
numbers, and floating point numbers. There is no
limit to the precision, except for the ones
implied by available memory. It has a rich set of
functions, and the functions have a regular
interface. It is designed to be as fast as
possible, both for small operands and for huge
operands. The speed is achieved by using fullwords
as the basic arithmetic type, by using fast
algorithms with carefully optimized assembly code
for the most common inner loops for a lot of CPUs,
and by a general emphasis on speed (instead of
simplicity or elegance). It is believed to be
faster than any other similar library. The
advantage increases with the operand sizes for
certain operations, since GMP in many cases has
asymptotically faster algorithms.
Project Release infomations and Project Resources. Note that these informations are from this projects Freecode.com page and the downloads themselves may not be hosted with SourceForge.JP.
This release series contain a very large amount of new code, and countless improvements to existing code. There are also a large number of changes between 5.0.0 and 5.0.1, to fix certain regressions. Fat builds have been fixed. A crash with the FFT_TABLE2 parameter has been fixed. More Core i3, i5, and Core i7 processor models are recognized. Upgraded to the latest autoconf, automake, and libtool.
Shared library numbers were corrected. Broken
support for 32-bit AIX was fixed. A bug was fixed
in hamdist/popcount for powerpc64 mode32. Exact
division (mpz_divexact) now falls back to plain
division for large operands. Basic x86-64 assembly
code was added. The FFT multiply code is now about
25% faster. Division is now always subquadratic.