How to get the ECPP package

There are two parts in the distribution: the first one contains all the data needed to perform the computations (Weber polynomials, etc.) and the second depends on the architecture you want ECPP to run on. Each tar file was compressed using gzip.

Once you have ftp-ed all the files, use gzip -d to uncompress them. This will create the directory Ecpp among others. Go into that directory and read the file README.ecpp to learn how to finish the installation.

The Data part

For convenience (that is smaller files are easier to get than larger ones), the data part has been divided into five parts.

You need all of them!

Here they are:

ECPPDATA To give an example, on your machine toto, once you have ftp-ed the file ecppweber1.tar.gz, you have to type:
toto% gzip -d ecppweber1.tar.gz
toto% tar xvf ecppweber1.tar

The binaries part

Now, to get the binaries, select one of:

ECPPBINARIES

Important remarks: all the binaries are for Un*x-like operating systems. As time goes by, more binaries will flow in, depending on my taking time to do so.

Benchmarks

This benchmark consists in proving the primality of the 222 decimal digit cofactor of 2, 1958M = 2^979+2^490+1.
                                                           66921125696\
3738586471992473357177695309368664238677386377989897942842973147723610\
2597067638539982680157521103531959968006552170889359188835475305453190\
56042889912017237320157749017499115968180112317315484537264218388048013
This number is taken from the tables of the Cunningham Project ("Factorizations of b**n+/-1 up to high powers" by John Brillhart, D. H. Lehmer, J. L. Selfridge, Bryant Tuckerman and S. S. Wagstaff, Jr., vol 22 of AMS Contemporary Mathematics series), which are regularily updated. It is the first non trivial number whose primality I proved in 1987. ECPPBENCHMARKS Timings are in second. The benchmarks are given as is. In particular, this does imply any judgment of mine, or of my Laboratory.