mpz_aprcl
MPZ APRCL can prove the primality of numbers, written in C and GMP.
This code contains an implementation of the APR-CL primality proving algorithm. It is a conversion of the Java based APRT-CLE written by Dario Alpern, who had written his based on the UBASIC version from Yuji Kida. This version incorporates improvements based on Jason Moxham's APR-CL code, which greatly reduced run-time memory requirements.
mpz_aprcl is meant to be compiled on systems that support C, GMP, and a 64-bit data type. It can prove the primality of numbers up to 6021 digits long...