Go Back > Other Stuff > Archived Projects > 15k Search

Thread Tools
Old 2006-02-08, 23:56   #1
robert44444uk's Avatar
Jun 2003
Oxford, UK

1,933 Posts
Default LLR performance on k and n

Sorry guys and lassies for dropping into you forum but what is the value of k that LLR can handle that is faster than pfgw at large value of n?

The reason for asking this is that I am dying to get some hot prp software that can take the many Payam numbers k (Riesel and Proth) which are hugely prime in the n>260K<400K range.

Axn1 has software to generate such Payam k, there are billions to choose from, but they are quite large in absolute k terms maybe too large for LLR to be efficient.

Pfgw seems to suffer a huge slow down at n appox 260K for such large k and the effort beyond this point seems not worthwhile in terms of building a solid portfolio of prps which will last beyond next year in the top 5000.

So who knows this stuff?


Robert Smith
robert44444uk is offline  
Old 2006-02-09, 01:43   #2
P90 years forever!
Prime95's Avatar
Aug 2002
Yeehaw, FL

2×5×7×107 Posts

LLR should be as fast or faster than pfgw for all k/n that it can handle. The underlying assembly code routines can handle k values up to 50 bits or so.

Last fiddled with by Prime95 on 2006-02-09 at 01:43
Prime95 is offline  

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
CPU performance counters, how to use them? ldesnogu Programming 2 2009-02-22 13:45
ICC performance gain testi Msieve 5 2008-11-20 03:00
64-bit performance of v25.6 James Heinrich PrimeNet 11 2008-04-24 01:42
64 bit performance? zacariaz Hardware 1 2007-05-10 13:08
Performance battlemaxx Prime Sierpinski Project 4 2005-06-29 20:32

All times are UTC. The time now is 14:46.

Tue May 11 14:46:24 UTC 2021 up 33 days, 9:27, 1 user, load averages: 3.18, 2.99, 2.54

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.