Michael Stoll
Mathematisches Institut
Universität Bayreuth
95440 Bayreuth, Germany
RatpointsThis is a program that uses an optimized quadratic sieve algorithm in order to find rational points on hyperelliptic curves. The program is distributed under the GNU GPL, version 2 (or later). Read the documentation. arXiv (the arXiv version may not be completely up to date) The current version is ratpoints-3.1.0 from September 24, 2026.
This version has been optimized with the help of Claude Code and
the single-threaded version runs twice to ten times faster compared
to ratpoints-2.2.4. Version 3.1.0 can also run the sieve in
multiple threads, thus speeding up the search further (in particular
for large height bounds). Download ratpoints-3.1.0.tar.gz. ratpoints on Github. |
|
J-PointsJ-points searches for rational points on the Jacobian of a genus 2 curve. This is done by searching for points on the associated Kummer Surface that lift to the Jacobian. The implementation is based on a fast quadratic sieve algorithm. The current version is j-points-3.0 from September 26, 2026. This version has been optimized with the help of Claude Code and runs much faster compared to previous versions. Like ratpoints, it can use multiple threads. Download j-points-3.0.tar.gz. j-points on Github. |
|
CLISPCLISP is a Common Lisp implementation that was originally started by Bruno Haible and myself. I am no longer active as a developer. See the CLISP Website for more information. |
|
reals.lispThis is a Common Lisp program that implements “lazy reals”.
You can construct real numbers from rational numbers, field operations,
and the basic transcendental functions, and have them compute themselves
to any desired precision afterwards. The code is essentially free (see
the statement at the beginning of the file). The code is available under the 3-Clause BSD License. Download reals.lisp. See also https://github.com/stylewarning/computable-reals for a version maintained by Robert Smith (stylewarning). |