Discussion related to cado-nfs

[Alexander Kruppa <alexander.kruppa@inria.fr>]

Dear users,

we are working towards the release of version 2.0 of CADO-NFS. There is much 
new functionality and new code; the enterprising among you are cordially 
invited to try out the current alpha release, to report any bugs that you may 
encounter and to pose any questons that may arise.

The source tarball 

cado-nfs-2.0alpha_a23402ef.tar.gz

can be found at

https://gforge.inria.fr/frs/?group_id=2065


>From the release notes:

Main changes between cado-nfs-1.1 and cado-nfs-2.0:

* the default parameters in the params subdirectory have been improved
* major speedups in the polynomial selection, sieving and filtering steps
* the filtering step produces a smaller matrix (about 5% less rows),
  see http://hal.inria.fr/hal-00734654 for more details.
* the replay step is faster and uses less memory
* fixed bug in the lattice siever (las) on 32-bit computers
* allow compilation on MinGW32. Performance is poor, however. MinGW64 is
  currently not supported
* new cadofactory script written in Python, allows larger-scale distribution
  with client/server model
* implementations of NFS-DL and NFS-FFS (experimental, requires some
  background knowledge to use)

WARNING: the cadofactor.py script starts an HTTP server through which it 
distributes work to client scripts; this server currently performs no 
authentication. This is to be fixed. For the time being, you are advised not 
to run the server on an address visible to machines which you don't control. 
Letting the server listen only on "localhost" on a private machine is a safe 
bet; alternatively the most restrictive firewall rules should be used.

Thanks and happy factoring,

The CADO team