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 sufficiently optimized implementations of asymptotically fast algorithms and to support fine-grained parallel computation.[1]
The development of FLINT has led to significant contributions in the areas of integer factorization and polynomial arithmetic.[2] For example on certain platforms FLINT factors integers in the quadratic sieve range faster than any other general implementation and provides the fastest polynomial multiplication of any package.[3]
FLINT is primary being developed to address the speed limitations of the Pari and NTL libraries to meet the research goals of the Sage project.
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