mpz_aprcl

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.

mpz_aprcl32 is meant to be compiled on systems that support C, GMP, a 32-bit data type, but no 64-bit data type. This project can prove the primality of numbers up to 3827 digits long.

Version 1.1 was posted on 2013/12/27. This new version is around 1.5-2.2x faster and has some bug fixes. Please see the readme.txt file for some more details and a table showing some sample timings to prove various sized numbers prime.

Project Activity

See All Activity >

License

GNU Library or Lesser General Public License version 3.0 (LGPLv3)

Follow mpz_aprcl

mpz_aprcl Web Site

Other Useful Business Software

Digital Payments by Deluxe Payment Exchange

A single integrated payables solution that takes manual payment processes out of the equation, helping reduce risk and cutting costs for your business

Save time, money and your sanity. Deluxe Payment Exchange+ (DPX+) is our integrated payments solution that streamlines and automates your accounts payable (AP) disbursements. DPX+ ensures secure payments and offers suppliers alternate ways to receive funds, including mailed checks, ACH, virtual credit cards, debit cards, or eCheck payments. By simply integrating with your existing accounting software like QuickBooks®, you’ll implement efficient payment solutions for AP with ease—without costly development fees or untimely delays.

Learn More

Rate This Project