Fast Library for Number Theory
| Original author(s) | William Hart, David Harvey, and others |
|---|---|
| Developer(s) | Fredrik Johansson, Albin Ahlbäck (maintainers), and others |
| Stable release | 3.1.2
/ 18 March 2024 |
| 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. The two major areas of functionality currently implemented in FLINT are polynomial arithmetic over the integers and 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]
Design Philosophy
[edit]- Asymptotically Fast Algorithms
- Implementations Fast as or Faster than Alternatives
- Written in Pure C
- Reliance on GMP
- Extensively Tested
- Extensively Profiled
- Support for Parallel Computation
Functionality
[edit]- Polynomial Arithmetic over the Integers
- Quadratic Sieve
References
[edit]- ^ Page 10 of the Project Description for UW 2006 COMPMATH Proposal by William Stein
Further reading
[edit]- FLINT 1.0.9: Fast Library for Number Theory by William Hart and David Harvey