|Workload type||primality proving|
|First release||< 2003|
LLR (Lucas Lehmer Riesel) is probably the fastest program available to perform primality test on numbers of the form k*2n ± c.
- the fastest algorithms are for base two numbers (with k<2n):
- for non-base-two numbers (with k<bn):
- k·bn+c numbers with |c| <> 1 or k > bn can be PRP-tested.
- APR-CL primality test for general numbers.
Apart from these, the program also implements "special algorithms" for Gaussian-Mersenne norms and Wagstaff numbers (2p+1)/3. The latter uses a strong Fermat PRP-test and the Vrba-Reix algorithm.
Example input file input.abc:
ABC $a 6864797660130609714981900799081393217269435300143305409394463459185543183397656052122559640661454554977296311391480858037121987999716643812574028291115057151
Then running the program with following command:
./llr64 -d input.abc
will test 2521-1 (M13) for primality with APR-CL test.