Main changes between cado-nfs-2.1 and cado-nfs-2.1.1:

* Added test-case in wuclient2.py for buggy Python MIME encoder to prevent
  data corruption during file upload under future Python versions
* Bug fixes to multi-threading in linear algebra code
* fixed a bug in duplicate suppression, which might produce an error for
  some collisions corresponding to false duplicates
* fixed detection of minimal cmake version

Main changes between cado-nfs-2.0 and cado-nfs-2.1:
* Polynomial selection now runs in two separate phases, size optimization
  and root optimization, with improved parameters
* Unit tests added, please run "make check" after building
* Various small speed-ups
* Various bug-fixes
* The wuclient2.py script no longer requires an external download tool
  (wget or curl) to download securely via SSL under Python 2
* better support of DL in GF(p); still not fully automatic, nor
  independent of third-party software. See README.dlp.

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 cadofactor.py script written in Python, allows larger-scale distribution
  with client/server model
* files used/generated by cado-nfs-1.1 are not entirely compatible with
  cado-nfs-2.0. Relations files are compatible, but for pretty much
  everything else, it is preferrable to start afresh. Likewise,
  command-line options of several binaries have changed.
* implementations of NFS-DL and NFS-FFS (experimental, requires some
  background knowledge to use)


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

* the polynomial selection uses the new algorithm presented by Kleinjung at
  the 2008 CADO workshop (supports multithreading)
* the polynomial selection uses a faster root sieve (rootsieve5)
* the lattice siever (las) supports a larger sieving region (I=16). This is
  useful for integers greater than 200 digits
* minor bug fixes, small speedup in sieving (las) and filtering (purge)
* reorganization of the binaries in the linear algebra step and speedup
  when using many machines with MPI
* new experimental scripts to execute the sieve on a cluster.
  These scripts rely on the OAR job scheduler being used, and exploit its
  "besteffort" mode. Some even more experimental scripts for linear
  algebra are in the development version.
* addition of new parameter files and a few new parameters (cf params.c91)
* the linear algebra step now makes use of dynamically loaded shared
  libraries. This might result in configuration issues, which we hope the
  scripts get it right. See the README file.