cm-0.4.2-bp156.1.6 RPM for ppc64le

From OpenSuSE Leap 15.6 for ppc64le

The CM software implements the construction of ring class fields of
imaginary quadratic number fields and of elliptic curves with complex
multiplication via floating point approximations.

Provides

• cm
• cm(ppc-64)

Requires

• /bin/sh
• /bin/sh
• libc.so.6()(64bit)
• libc.so.6(GLIBC_2.17)(64bit)
• libc.so.6(GLIBC_2.34)(64bit)
• libcm.so.1()(64bit)
• libflint.so.17()(64bit)
• libgmp.so.10()(64bit)
• libmpc.so.3()(64bit)
• libmpfr.so.6()(64bit)
• libmpfrcx.so.1()(64bit)
• libpari-gmp-tls.so.8()(64bit)
• rpmlib(CompressedFileNames) <= 3.0.4-1
• rpmlib(FileDigests) <= 4.6.0-1
• rpmlib(PayloadFilesHavePrefix) <= 4.0-1
• rpmlib(PayloadIsXz) <= 5.2-1

License

GPL-3.0-or-later

Changelog

* Sat Jun 24 2023 Jan Engelhardt <jengelh@inai.de>
  - 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.
* Sat Aug 27 2022 Jan Engelhardt <jengelh@inai.de>
  - Update to snapshot 0.4.0+gb2b8d4bd
    * Fix 32-bit testsuite run
* Thu Jun 16 2022 Jan Engelhardt <jengelh@inai.de>
  - 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.
* Mon Sep 28 2020 Jan Engelhardt <jengelh@inai.de>
  - Update to release 0.3.1
    * Correct a bug in computing powers of 2.
      (fixed: "left shift count >= width of type")
* Thu Sep 17 2020 Jan Engelhardt <jengelh@inai.de>
  - Initial package (version 0.3) for build.opensuse.org

Files

/usr/bin/classpol
/usr/bin/cm
/usr/bin/ecpp
/usr/share/cm
/usr/share/cm/af
/usr/share/cm/af/af_0047.dat.gz
/usr/share/cm/af/af_0059.dat.gz
/usr/share/cm/af/af_0071.dat.gz
/usr/share/cm/af/af_0131.dat.gz
/usr/share/cm/df
/usr/share/cm/df/df_0004.dat.gz
/usr/share/cm/df/df_0006.dat.gz
/usr/share/cm/df/df_0009.dat.gz
/usr/share/cm/df/df_0010.dat.gz
/usr/share/cm/df/df_0014.dat.gz
/usr/share/cm/df/df_0015.dat.gz
/usr/share/cm/df/df_0021.dat.gz
/usr/share/cm/df/df_0026.dat.gz
/usr/share/cm/df/df_0035.dat.gz
/usr/share/cm/df/df_0039.dat.gz
/usr/share/cm/mf
/usr/share/cm/mf/mf_0030.dat.gz
/usr/share/cm/mf/mf_0042.dat.gz
/usr/share/cm/mf/mf_0070.dat.gz
/usr/share/cm/mf/mf_0078.dat.gz
/usr/share/cm/mf/mf_0105.dat.gz
/usr/share/cm/mf/mf_0130.dat.gz
/usr/share/info/cm.info.gz

Generated by rpm2html 1.8.1

Fabrice Bellet, Tue Jul 9 19:51:39 2024