![]() |
![]() |
#1 |
Jun 2003
Suva, Fiji
204010 Posts |
![]()
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? Regards Robert Smith |
![]() |
![]() |
#2 |
P90 years forever!
Aug 2002
Yeehaw, FL
22×13×157 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 |
![]() |
Thread Tools | |
![]() |
||||
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 |