mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > 15k Search

 
 
Thread Tools
Old 2005-07-11, 09:25   #1
Cruelty
 
Cruelty's Avatar
 
May 2005

161810 Posts
Question LLR / Gwnums version

Are there any plans to implement Gwnums 24.13 in LLR? Latest LLR v.3.6 is based on 24.11
Cruelty is offline  
Old 2005-07-11, 16:23   #2
TTn
 

23·181 Posts
Default

Quote:
Are there any plans to implement Gwnums 24.13 in LLR? Latest LLR v.3.6 is based on 24.11
I dont know, maybe George or Jean can answer this?
I'm not sure it is nessesary, without knowing the exact difference.
 
Old 2005-07-11, 20:30   #3
Cruelty
 
Cruelty's Avatar
 
May 2005

161810 Posts
Default

Quote:
Originally Posted by TTn
I'm not sure it is nessesary, without knowing the exact difference.
Looking at the speed increase from prime95 24.11 to 24.13 I guess it would be a good idea to update LLR too.
Cruelty is offline  
Old 2005-07-11, 23:01   #4
TTn
 

122568 Posts
Wink

Quote:
Looking at the speed increase from prime95 24.11 to 24.13 I guess it would be a good idea to update LLR too.
I particularly meant, the exact difference in code.
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
 
Old 2005-07-11, 23:20   #5
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

70468 Posts
Default

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. LLR-3.6 is very well tested and unless any new versions are more than 10% faster, IMO it's not worth the trouble to migrate.
Kosmaj is offline  
Old 2005-09-15, 11:02   #6
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default

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?
Cruelty is offline  
Old 2005-09-15, 20:03   #7
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

23·3·23 Posts
Default LLR3.6.2 / gwnum V24.14

Quote:
Originally Posted by Cruelty
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?
Congratulations for your watch !

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
Jean Penné is offline  
Old 2005-09-15, 20:06   #8
Pconfig
 
Jun 2004

5×11 Posts
Default

If i use llrnet, can i just replace llr.exe?
Pconfig is offline  
Old 2005-09-15, 20:21   #9
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

23×3×23 Posts
Default

Quote:
Originally Posted by Pconfig
If i use llrnet, can i just replace llr.exe?
No, the llrnet executable is llrnet.exe, not llr.exe, and its last version is based
on llr version 3.5, I will ask to Vincent for upgrading it, but actually, I think he is too much busy...
Jean Penné is offline  
Old 2005-09-15, 20:30   #10
Citrix
 
Citrix's Avatar
 
Jun 2003

3·5·103 Posts
Default

Jean,

Is multiplying number mod a^a-1 as fast as multiplying numbers mod k*2^n+1. Which one is faster? Secondly can LLR support a^a-1/a-1 and a^a+1/a+1?

Citrix
Citrix is offline  
Old 2005-09-16, 12:57   #11
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

10001010002 Posts
Default Present features of LLR program

Quote:
Originally Posted by Citrix
Jean,

Is multiplying number mod a^a-1 as fast as multiplying numbers mod k*2^n+1. Which one is faster? Secondly can LLR support a^a-1/a-1 and a^a+1/a+1?

Citrix
Presently, the LLR program is a special one, it is devised to prove the primality of numbers of the k*2^n-1 and k*2^n+1 forms. On numbers of any other form, it can only do PRP tests, and is then equivalent to George Woltman's PRP program.

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^n-b, with k and b not larger than 2^20, either for primality proving or PRP tests.

Jean
Jean Penné is offline  
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
LLR Version 3.8.5 is available! Jean Penné Software 11 2011-02-20 18:22
LLR Version 3.8.1 is now available! Jean Penné Software 30 2010-09-21 16:43
Which version for P-III's? richs Software 41 2009-01-07 14:40
LLR - new version Cruelty Riesel Prime Search 8 2006-05-16 15:00
Version 24.14 Prime95 Software 13 2006-02-15 16:32

All times are UTC. The time now is 06:37.

Fri Jun 5 06:37:02 UTC 2020 up 72 days, 4:10, 0 users, load averages: 0.79, 0.94, 1.02

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.