MPZ APR-CL

From Prime-Wiki
Revision as of 19:44, 14 February 2019 by Karbon (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
MPZ APR-CL
Workload type APR-CL
First release 2011
Latest version v1.2
2015-03-07

MPZ APR-CL is an implementation of the APR-CL primality proving algorithm. It is created by David Cleaver in C using the GMP library.

MPZ APR-CL is a conversion of the Java-based APRT-CLE program written by Dario Alpern, which was based on the UBASIC's implementation by Yuji Kida. This version incorporates improvements based on Jason Moxham's APR-CL code, which greatly reduced run-time memory requirements. ("APRT-CLE" refers to the "extended" version of APRT-CL test, first programmed by Koichiro Akiyama in 1988 and subsequently used in UBASIC. [1])

MPZ APR-CL comes in 64- and 32-bit versions:

  • MPZ APR-CL is meant to be compiled on systems that support 64-bit data type. It can prove the primality of numbers up to 6021 digits long.
  • MPZ APR-CL32 is meant to be compiled on systems that only support 32-bit data type. It can prove the primality of numbers up to 3827 digits long.

Prefix MPZ in the name of the program refers to "multiple precision integer" (MP Z) and comes from the GMP library.

External links