Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).
Navigation
Topics Help • Register • News • History • How to • Sequences statistics • Template prototypes

LLR

From Prime-Wiki
Revision as of 14:05, 7 February 2019 by Karbon (talk | contribs) (Karbon moved page Lucas Lehmer Riesel to LLR without leaving a redirect: name)
Jump to: navigation, search
LLR
Workload type primality proving
PRP tests
First release < 2003
Latest version 3.8.21
2018-01-28

LLR 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 (28.14) of George Woltman's Gwnums library, to do fast multiplications and squarings of large integers modulo N.

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

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

Algorithms

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.

Usage

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.

External links