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 ratpoints2.1.3, March 10, 2011.
This version of 2.1.3 corrects a small bug in the test program rptest. Download ratpoints2.1.3.tar.gz. 

JPointsJpoints 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. Notes:
Download jpoints1.2.tar.gz. 

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 3Clause BSD License. Download reals.lisp. See also https://github.com/stylewarning/computablereals for a version maintained by Robert Smith (stylewarning). 