Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: libcm1 | Distribution: SUSE Linux Enterprise 15 SP6 |
Version: 0.4.2 | Vendor: openSUSE |
Release: bp156.1.6 | Build date: Wed May 15 07:25:29 2024 |
Group: System/Libraries | Build host: i03-armsrv2 |
Size: 198496 | Source RPM: cm-0.4.2-bp156.1.6.src.rpm |
Packager: https://bugs.opensuse.org | |
Url: https://www.multiprecision.org/cm/ | |
Summary: Multi-precision floating-point interval arithmetic computation library |
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. It includes libraries that can be called from within a C program.
GPL-3.0-or-later
* 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
/usr/lib64/libcm.so.1 /usr/lib64/libcm.so.1.0.1
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Jul 9 20:14:19 2024