Fast Library for Number Theory
| FLINT | |
|---|---|
| Developer(s) | William Hart and David Harvey |
| Stable release | 1.0.9
/ March 11, 2008 |
| Repository | |
| 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 released under the GNU General Public License. It is co-developed by William Hart of the University of Warwick and David Harvey of Harvard University. The goal of FLINT is to provide optimized implementations of asymptotically fast algorithms and to support fine-grained parallel computation.[1]
According to William Stein, who is the lead developer of the computer algebra system Sage, FLINT is being developed to address the speed limitations of the Pari and NTL libraries to meet the research goals for Sage. FLINT along with a Cython wrapper for it is distributed with Sage.
The development of FLINT has led to significant contributions in the areas of integer factorization and polynomial arithmetic.[2] For example as of May, 2007 on certain platforms FLINT factors integers in the quadratic sieve range faster than any other general implementation[3], and as of February, 2008 it does arithmetic in faster than any other package.[4]
![{\displaystyle \mathbb {Z} [x]}](/media/api/rest_v1/media/math/render/svg/0d4da3ac703cc7721ebba91a53f6752de7157124)
Notes
- ^ Page 10 of the Project Description for UW 2006 COMPMATH Proposal by William Stein
- ^ 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