20101005, 03:12  #122 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts 
I don't know if people actually do that, but it's best to guard against it, in any case. Score aside, we wouldn't want to miss a prime, or otherwise have garbage data, (if not total garbage, at least not up to the mathematician's standard of closeaspossibletoperfection) just because it was easy for some "doublecheckers" to do no work and just report the last person's residues.
Last fiddled with by MiniGeek on 20101005 at 03:13 
20101006, 01:51  #123 
May 2010
3^{2}·7 Posts 
26.2 passes 4 LLD tests
I just completed 4 LLD checks using 26.2 64bit. All four successfully completed the double checks by verifying the previous LL run, so I'm happy with the accuracy of 26.2 for LL tests.
(M24309653, M24350327, M24441799, M24309661) I'm also happy with the performance. No worse than a 0.25 round off error (that I saw). Approximately a 15% increase in calculation speed, less a 2% drop because I had SUM(Inputs) and Roundoff error checking marked. Per iteration time was ~ 16ms (i7920 @ 3.71 GHz) for a 1280K FFT. I'm trying ECM & ECMF runs next  but unless I find a factor, that's going to be a less certain test than LLD. Nice job, George. Last fiddled with by Rhyled on 20101006 at 01:52 
20101008, 01:11  #124 
Mar 2004
775_{8} Posts 
I once requested that on multicore computers, the LL test of a 100M digit Mersenne be started during the part of the P1 factoring that does not take up all cores of the processor. (My argument was based on computer lifetime and human lifetime arguments).
Can you add this feature as an option that can be written into prime.txt? Last fiddled with by JuanTutors on 20101008 at 01:12 
20101008, 02:16  #125 
May 2010
3^{2}×7 Posts 
26.2 finds ECM factor
I got lucky and found an ECM factor in my first dozen attempts on 26.2. (M5308217) I have no idea if the ECM speed is any different than the previous version, but the logic looks solid.
Back to my search for the 48th 
20101008, 02:49  #126 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts 

20101009, 04:43  #127  
"Richard B. Woods"
Aug 2002
Wisconsin USA
17014_{8} Posts 
Quote:
If you're referring to the nonFFT operations in P1: they occupy only a very small slice of time, principally for the GCD calculation, which takes only a few minutes at most, at the end of stage 1 or stage 2. Were you perhaps thinking of stage 2's large memory usage? That bears no relation to the number of processor cores used. Last fiddled with by cheesehead on 20101009 at 04:52 

20101009, 06:42  #128  
Sep 2006
The Netherlands
2^{6}·11 Posts 
Quote:
So it's a simpler form of a FFT in case of LL/LLR when compared with most generic codes which need regurarly multiplication and not so easy modulo. 

20101011, 08:41  #129 
Oct 2010
1 Posts 
Does 26.2 support Windows 7? If so, both 32bit and 64bit are support?

20101012, 03:01  #130 
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
3×5×307 Posts 

20101012, 05:03  #131 
Aug 2008
Good old Germany
3×47 Posts 

20101013, 05:31  #132  
"Richard B. Woods"
Aug 2002
Wisconsin USA
7692_{10} Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Prime95 version 27.3  Prime95  Software  148  20120318 19:24 
Prime95 version 26.3  Prime95  Software  76  20101211 00:11 
Prime95 version 25.5  Prime95  PrimeNet  369  20080226 05:21 
Prime95 version 25.4  Prime95  PrimeNet  143  20070924 21:01 
When the next prime95 version ?  pacionet  Software  74  20061207 20:30 