FLINT: Fast Library for Number Theory
FLINT is a C library for doing number theory, written by William Hart and David Harvey.
Download FLINT
11-Mar-08 FLINT 1.0.9 is released!!
The tarball flint-1.0.9.tar.gz is now available.
FLINT Documentation
The documentation for FLINT 1.0.9 is available in the release tarball, or it can be downloaded here, flint-1.0.9.pdf.
Development version (not stable)
15-Mar-08 FLINT 1.1-devel
The tarball flint-1.1-devel.tar.gz is available.
The documentation for FLINT 1.1-devel is available here, flint-1.1.pdf.
Contributors
International Colleagues
- Jason Papadopoulos - Block Lanczos code for quadratic sieve and multiprecision complex root finding code for polynomials.
Undergraduate Student Projects
- Tomasz Lechowski - Contributed some NTL and Pari polynomial profiling code and researched algorithms for polynomials over finite fields. (Funded by the Nuffield Foundation)
- Daniel Scott - Researched lazy and relaxed algorithms of Joris van der Hoeven. (Funded by Warwick University's Undergraduate Research Scholars Scheme)
- David Howden - Wrote code for computing Bernoulli numbers mod many primes, including fast polynomial multiplication over Z/pZ specifically for the task. (Funded by Warwick University's Undergraduate Research Scholars Scheme)
Releases
The main functionality for version 1.0 is:
- Polynomial arithmetic over Z,
- Fast integer multiplication and factoring, including a highly optimised quadratic sieve.
Soon after 1.0, we hope to make a wrapper available in the free computer algebra system SAGE. An earlier release of FLINT is already available as a standard package in SAGE.
Get the development code
You will need a subversion client.
The development repository is hosted by Sourceforge:
You can check out the repository with this command:
svn co http://flint.svn.sourceforge.net/svnroot/flint
Mailing list
Read the development mailing list archives.
References
This site is hosted at sage.math.washington.edu thanks to William Stein