cm-0.4.2-bp157.1.5

- Update to snapshot 0.4.0+gb2b8d4bd
  * Fix 32-bit testsuite run

- Update to release 0.4.0
  * Add a decomposition of the class field into a tower of prime
    degree extensions following the algorithm described in A.
    Enge and F. Morain, Fast Decomposition of Polynomials with
    Known Galois Group.
  * Add an implementation of the fastECPP primality proving
    algorithm, complete with a version running over MPI.

- Update to release 0.3.1
  * Correct a bug in computing powers of 2.
    (fixed: "left shift count >= width of type")

- Initial package (version 0.3) for build.opensuse.org

- Update to release 0.4.2
  * When ECPP certificates are output to a file, a second file in
    Primo format is created automatically.
  * ECPP certificate creation uses class field towers
    unconditionally.
  * An optional primality test is carried out before starting ECPP.
  * For larger numbers, the BPSW primality test of GMP is replaced
    by a Miller-Rabin test to base 2.
  * New command line options make it possible to compute only the
    first or only the second phase.
  * Phase 2 results are stored in any order as they come in, which
    requires the file format to change. Checkpoint files ending in
    .cert2 from previous releases are not compatible.
  * Add an optional dependency on FLINT to speed up root finding
    in the second ECPP phase.