GNU Multiple Precision Arithmetic Library (GMP) is a free library for arbitrary-precision arithmetic, operating on signed integers, rational numbers, and floating-point numbers.[3] There are no practical limits to the precision except the ones implied by the available memory (operands may be of up to 232−1 bits on 32-bit machines and 237 bits on 64-bit machines).[4][5] GMP has a rich set of functions, and the functions have a regular interface. The basic interface is for C, but wrappers exist for other languages, including Ada, C++, C#, Julia, .NET, OCaml, Perl, PHP, Python, R, Ruby, and Rust. Prior to 2008, Kaffe, a Java virtual machine, used GMP to support Java built-in arbitrary precision arithmetic.[6] Shortly after, GMP support was added to GNU Classpath.[7]
 | |
| Developer(s) | GNU Project |
|---|---|
| Initial release | 1991[1] |
| Stable release | 6.3.0[2]  / 30 July 2023 |
| Repository | gmplib |
| Written in | C, (C++, assembly optionally) |
| Type | Mathematical software |
| License | Dual LGPLv3 and GPLv2[3] |
| Website | gmplib |
The main target applications of GMP are cryptography applications and research, Internet security applications, and computer algebra systems.
GMP aims to be faster than any other bignum library for all operand sizes. Some important factors in doing this are:
- Full words are the basic type for all arithmetic.
- Different algorithms are used for different operand sizes; algorithms which are more efficient with large numbers are not used when dealing with small numbers.
- Assembly (specialized for different processors) are used in the most common inner loops to optimize them as much as possible.
The first GMP release was made in 1991. It is constantly developed and maintained.[8]
GMP is part of the GNU project (although its website being off gnu.org may cause confusion), and is distributed under the GNU Lesser General Public License (LGPL).
GMP is used for integer arithmetic in many computer algebra systems such as Mathematica[9] and Maple.[10] It is also used in the Computational Geometry Algorithms Library (CGAL).
GMP is needed to build the GNU Compiler Collection (GCC).[11]
Examples
Here is an example of C code showing the use of the GMP library to multiply and print large numbers:
#include <stdio.h>#include <gmp.h>int main(void) { mpz_t x, y, result; mpz_init_set_str(x, "7612058254738945", 10); mpz_init_set_str(y, "9263591128439081", 10); mpz_init(result); mpz_mul(result, x, y); gmp_printf(" %Zd\n" "*\n" " %Zd\n" "--------------------\n" "%Zd\n", x, y, result); /* free used memory */ mpz_clear(x); mpz_clear(y); mpz_clear(result); return 0;}This code calculates the value of 7612058254738945 × 9263591128439081.
Compiling and running this program gives this result. (The -lgmp flag is used if compiling on Unix-type systems.)
7612058254738945* 9263591128439081--------------------70514995317761165008628990709545For comparison, one can write instead the following equivalent C++ program. (The -lgmpxx -lgmp flags are used if compiling on Unix-type systems.)
#include <iostream>#include <gmpxx.h>int main() { mpz_class x("7612058254738945"); mpz_class y("9263591128439081"); std::cout << " " << x << "\n" << "*\n" << " " << y << "\n" << "--------------------\n" << x * y << "\n"; return 0;}