20050711, 09:25  #1 
May 2005
2^{2}×11×37 Posts 
LLR / Gwnums version
Are there any plans to implement Gwnums 24.13 in LLR? Latest LLR v.3.6 is based on 24.11

20050711, 16:23  #2  
6160_{8} Posts 
Quote:
I'm not sure it is nessesary, without knowing the exact difference. 

20050711, 20:30  #3  
May 2005
3134_{8} Posts 
Quote:


20050711, 23:01  #4  
7×13×101 Posts 
Quote:
Usually speed increases, translate to errors. Since George and Jean know exactly what they are doing, maybe that is why it hasn't been done yet. Or otherwise pesonal time is a factor. It is a valid question though. TTn 

20050711, 23:20  #5 
Nov 2003
2·1,811 Posts 
Jean mentioned that he is testing the new gwnum version, have a look here post #6 (and subsequent posts about the performance on HT cpu's). The new PRP based on 24.13 has been just released but note that brand new versions are risky without proper testing. LLR3.6 is very well tested and unless any new versions are more than 10% faster, IMO it's not worth the trouble to migrate.

20050915, 11:02  #6 
May 2005
3134_{8} Posts 
Am I the only one to notice new 3.6.2 version of LLR? I will give it a try later today... but perhaps somebody is already using it?

20050915, 20:03  #7  
May 2004
FRANCE
7·83 Posts 
LLR3.6.2 / gwnum V24.14
Quote:
LLR Version 3.6.2 is identical to LLR Version 3.6 about the features, but with two advantages : 1) It is linked with very last gwnum version : V24.14 2) I tested it on all the verified Riesel an Proth primes from the Chris Caldwell database, and found neither false negative result nor error message of any kind. So, I think all LLR users have better to use this version now! Happy hunting and Best Regards, Jean 

20050915, 20:06  #8 
Jun 2004
5×11 Posts 
If i use llrnet, can i just replace llr.exe?

20050915, 20:21  #9  
May 2004
FRANCE
7×83 Posts 
Quote:
on llr version 3.5, I will ask to Vincent for upgrading it, but actually, I think he is too much busy... 

20050915, 20:30  #10 
Jun 2003
5·317 Posts 
Jean,
Is multiplying number mod a^a1 as fast as multiplying numbers mod k*2^n+1. Which one is faster? Secondly can LLR support a^a1/a1 and a^a+1/a+1? Citrix 
20050916, 12:57  #11  
May 2004
FRANCE
7·83 Posts 
Present features of LLR program
Quote:
Its speed performances are mainly due to the using of the gwnum library code, so, they are the best for calculus modulo k*2^n+b or k*2^nb, with k and b not larger than 2^20, either for primality proving or PRP tests. Jean 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
LLR Version 3.8.5 is available!  Jean Penné  Software  11  20110220 18:22 
LLR Version 3.8.1 is now available!  Jean Penné  Software  30  20100921 16:43 
Which version for PIII's?  richs  Software  41  20090107 14:40 
LLR  new version  Cruelty  Riesel Prime Search  8  20060516 15:00 
Version 24.14  Prime95  Software  13  20060215 16:32 