95440 Bayreuth, Germany
This 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).
The current version is ratpoints-2.2.1 from January 18, 2022. This version can use 256-bit AVX registers and has been optimized further, so that it now runs considerably faster.
ratpoints on Github.
J-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.
This 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.