| FLINT | |
|---|---|
| Original authors | William Hart, David Harvey, and others |
| Developers | Fredrik Johansson, Albin Ahlbäck (maintainers), and others |
| Stable release | 3.4.0 / 25 November 2025 |
| Repository | |
| Written in | C |
| Operating system | POSIX systems |
| Type | Mathematical software |
| License | GNU Lesser General Public License |
| Website | flintlib |
The Fast Library for Number Theory (FLINT) is a C library for number theory applications. It implements efficient versions of various ring arithmetics as well as derived functionality such as integer factorization using a quadratic sieve. The library is designed to be compiled with the GNU Multi-Precision Library (GMP) and is released under the GNU General Public License. It is developed by William Hart of the University of Kaiserslautern (formerly University of Warwick) and David Harvey of University of New South Wales (formerly Harvard University) to address the speed limitations of the PARI and NTL libraries. [1]
Contents
FLINT along with a Cython wrapper for it is distributed with SageMath. The development of FLINT has led to significant contributions in the areas of integer factorization and polynomial arithmetic. For example as of May, 2007 on certain platforms FLINT factors integers in the quadratic sieve range faster than any other general implementation [2] , and as of February, 2008 it does arithmetic in faster than any other package. [3] [4]
