FLINT : Fast Library for Number Theory

What is FLINT ?  ·  Citing FLINT  ·  Applications & benchmarks  ·  News  ·  Documentation  ·  Downloads  ·  Development  ·  Authors  ·  Links
15–19 June 2026: FLINT workshop in Bordeaux

What is FLINT ?

FLINT is a C library for doing number theory, freely available under the GNU Lesser General Public License version 3 or later.



Some domains handled by FLINT.

At its core, FLINT provides arithmetic in standard rings such as the integers, rationals, algebraic, real, complex and p-adic numbers, finite fields, and number fields. It also provides polynomials (univariate and multivariate), power series, and matrices.

FLINT covers a wide range of functionality: primality testing, integer factorisation, multivariate polynomial GCD and factorisation, FFTs, multimodular reconstruction, special functions, exact and approximate linear algebra, LLL, finite field embeddings, and more.

Mature & widely used

FLINT is the work of dozens of contributors, spanning 15+ years of development. The FLINT 3.0 release comprises 8,000 documented functions, 3,500 test programs, and 900,000 lines of code.

FLINT runs on most common platforms, including Linux, macOS and Windows on typical hardware configurations.

Although FLINT itself is written in C, bindings are available for various general-purpose programming languages, including Python, Julia, Haskell and C++. Several computer algebra systems also rely on FLINT as a back-end library, including SageMath, OSCAR, Singular, Macaulay2, Maple and Mathematica.

At the research frontier

FLINT has been used for many large scale research computations (for example: A Trillion Triangles) and has been cited in hundreds of publications. FLINT's authors themselves have published more than 20 papers describing new algorithms first implemented within or on top of FLINT.

Efficient

FLINT is designed for all operand sizes, from single-word to multi-gigabyte. It implements many low-level optimisations and chooses automatically between basecase, intermediate, asymptotically fast and special-purpose algorithms depending on the size and structure of the problem. Many algorithms are fully parallel (multithreaded) and some key functions use SIMD acceleration.

Handles real numbers


Some transcendental functions of a complex variable plotted using FLINT's ball arithmetic. Left to right: the elliptic j-invariant