Fast Library for Number Theory

FLINT
FLINT
Developer(s)	William Hart and David Harvey
Stable release	1.0.9 / March 11, 2008
Repository	github.com/wbhart/flint2 ;
Written in	C
Operating system	POSIX systems
Type	Mathematical software
License	GNU General Public License
Website	flintlib.org

The Fast Library for Number Theory (FLINT) is a highly optimized C library for number theory applications. It is actively developed by William Hart of the University of Warwick and David Harvey of Harvard University to address the speed limitations of the Pari and NTL libraries. FLINT is built on top of the GNU Multi-Precision Library and is released under the GNU General Public License.

The development of FLINT has led to significant contributions in the areas of integer factorization and polynomial arithmetic.^[1] 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 $\mathbb {Z} [x]$ faster than any other package.^[3]

References

^ Page 2 of William Hart's grant proposal Algorithms for Algebraic Number Theory under the section Computer Packages and Computer Algebra Systems
^ Bottom of page 11 of Abstract of Talks, Illinois Number Theory Fest 2007
^ Slide 25 of the talk Numbers in Sage by William Stein

FLINT 1.0.9: Fast Library for Number Theory by William Hart and David Harvey
Video of the talk Parallel Computation in Number Theory by William Hart

[1] Page 2 of William Hart's grant proposal Algorithms for Algebraic Number Theory under the section Computer Packages and Computer Algebra Systems

[2] Bottom of page 11 of Abstract of Talks, Illinois Number Theory Fest 2007

[3] Slide 25 of the talk Numbers in Sage by William Stein

[1]

[2]

[3]