Note: Due to changes in the Riesel prime template, most of those pages (and related) are not shown properly.
This will take some time!
Wanna help? Please move any Riesel prime page first, then edit/add the base parameter.
Topics Register • News • History • How to • Sequences statistics • Template prototypes


From Prime-Wiki
Jump to: navigation, search
Workload type primality proving
PRP tests
First release < 2003
Latest version 3.8.24

LLR (Lucas Lehmer Riesel) is probably the fastest program available to perform primality test on numbers of the form k•2n±c.

It is written by Jean Penné and uses the most recent release (29.8) of George Woltman's gwnum library, to do fast multiplications and squarings of large integers modulo N.

LLR can take input files from Paul Jobling's NewPGen and also from some ABC format files.

LLR's port for CUDA-based GPUs is called llrCUDA.


Main algorithms:

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

ABC $a

Then running the program with following command:

./llr64 -d

will test 2521-1 (M13) for primality with APR-CL test.

External links