20071222, 14:39  #1 
P90 years forever!
Aug 2002
Yeehaw, FL
2×3^{2}×397 Posts 
Prime95 version 25.6
THIS IS A PREBETA VERSION  NOT FOR EVERYDAY USE
The Windows version of 25.6 is now available. If you are running version 25.5 you can install the new version on top of the old version. Steps to install version 25.6  1) DO NOT INSTALL OVER VERSION 24. If you have problems, you want to be able to revert to testing using version 24. There will be outages on the new server so you'll want to let version 24 run at lower priority to soak up those available CPU cycles. 2) Create a new directory, download version 25.6 from the link below, unzip into this new directory. 3) PM or email to get the secret line to add to prime.txt so that this version contacts the new server. 4) Run version 25.6. Follow the link in the dialog box to create a userid. Choose a work preference of either "Trial factoring to low limits" or "ECM on small Mersenne numbers". 5) Find problems. Report them to me. Known bugs  1) Time= option in prime.txt does not work. Links to 25.6 versions  Windows 32bit  ftp://mersenne.org/gimps/p95v256.zip Linux  ftp://mersenne.org/gimps/mprime256.tar.gz Linux 64bit  ftp://mersenne.org/gimps/mprime256linux64.tar.gz Windows 64bit  ftp://mersenne.org/gimps/p64v256.zip Mac OS X  ftp://mersenne.org/gimps/mprime256MacOSX.tar.gz Last fiddled with by Prime95 on 20080806 at 13:08 Reason: Patched links 
20071222, 14:45  #2 
P90 years forever!
Aug 2002
Yeehaw, FL
1101111101010_{2} Posts 
What's new compared to version 25.5? Not much. Several small bug fixes and a few important ones:
1) Bug in SSE2 trial factoring above 2^64 fixed. 2) Clientserver getting outofsync in exchanging program options fixed. 3) Endless communication loop on Error 40 fixed. The main reason for the release is it hard for me to debug version 25.5. I didn't put the sources under source control so I'm not exactly sure what bug fixes and changes are in 25.5. 25.6 is under RCS so I'll know exactly what source code you are reporting bugs on. 
20071222, 19:10  #3 
"James Heinrich"
May 2004
exNorthern Ontario
3,019 Posts 
I await your Windows64 25.6 build
But I'll try the Win32 version on my Q6600 and see if the endless fight for stage2 RAM still exists. Last fiddled with by James Heinrich on 20071222 at 19:11 
20071222, 20:02  #4 
"James Heinrich"
May 2004
exNorthern Ontario
101111001011_{2} Posts 
Of 3 threads fighting for P1 stage2 RAM, 1 now gets ~496MB (of 1024MB available) and the other 2 spend all their time fighting over the remaining ~500MB, perpetually restarting:
Code:
[Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Available memory is 499MB. [Work thread Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (13 of 480 already processed). [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Other worker threads are using lots of memory now. [Work thread Dec 22 14:33] Looking for work that uses less memory. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Available memory is 499MB. [Work thread Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (13 of 480 already processed). [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Other worker threads are using lots of memory now. [Work thread Dec 22 14:33] Looking for work that uses less memory. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Available memory is 499MB. [Work thread Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (13 of 480 already processed). [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Other worker threads are using lots of memory now. [Work thread Dec 22 14:33] Looking for work that uses less memory. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Available memory is 499MB. [Work thread Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (13 of 480 already processed). [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Other worker threads are using lots of memory now. [Work thread Dec 22 14:33] Looking for work that uses less memory. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Using FFT length 2560K [Work thread Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:33] Available memory is 499MB. [Work thread Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (13 of 480 already processed). [Work thread Dec 22 14:33] Restarting thread with new memory settings. [Work thread Dec 22 14:33] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:34] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:34] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:34] Using FFT length 2560K [Work thread Dec 22 14:34] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:34] Other worker threads are using lots of memory now. [Work thread Dec 22 14:34] Looking for work that uses less memory. [Work thread Dec 22 14:34] Optimal P1 factoring of M46000949 using up to 1024MB of memory. [Work thread Dec 22 14:34] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Work thread Dec 22 14:34] Optimal bounds are B1=560000, B2=16100000 [Work thread Dec 22 14:34] Chance of finding a factor is an estimated 6.5% [Work thread Dec 22 14:34] Restarting thread with new memory settings. [Work thread Dec 22 14:34] Using FFT length 2560K [Work thread Dec 22 14:34] Ignoring suggested B1 value, using B1=555000 from the save file [Work thread Dec 22 14:34] Available memory is 499MB. [Work thread Dec 22 14:34] Using 496MB of memory. Processing 19 relative primes (13 of 480 already processed). Code:
[Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:33] Available memory is 503MB. [Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (10 of 480 already processed). [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:33] Other worker threads are using lots of memory now. [Dec 22 14:33] Looking for work that uses less memory. [Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:33] Available memory is 503MB. [Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (10 of 480 already processed). [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:33] Other worker threads are using lots of memory now. [Dec 22 14:33] Looking for work that uses less memory. [Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:33] Available memory is 503MB. [Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (10 of 480 already processed). [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:33] Other worker threads are using lots of memory now. [Dec 22 14:33] Looking for work that uses less memory. [Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:33] Available memory is 503MB. [Dec 22 14:33] Using 496MB of memory. Processing 19 relative primes (10 of 480 already processed). [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:33] Other worker threads are using lots of memory now. [Dec 22 14:33] Looking for work that uses less memory. [Dec 22 14:33] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:33] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:33] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:33] Chance of finding a factor is an estimated 6.5% [Dec 22 14:33] Using FFT length 2560K [Dec 22 14:33] Restarting thread with new memory settings. [Dec 22 14:34] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:34] Available memory is 503MB. [Dec 22 14:34] Using 496MB of memory. Processing 19 relative primes (10 of 480 already processed). [Dec 22 14:34] Restarting thread with new memory settings. [Dec 22 14:34] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:34] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:34] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:34] Chance of finding a factor is an estimated 6.5% [Dec 22 14:34] Using FFT length 2560K [Dec 22 14:34] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:34] Other worker threads are using lots of memory now. [Dec 22 14:34] Looking for work that uses less memory. [Dec 22 14:34] Optimal P1 factoring of M46000987 using up to 1024MB of memory. [Dec 22 14:34] Assuming no factors below 2^68 and 2 primality tests saved if a factor is found. [Dec 22 14:34] Optimal bounds are B1=560000, B2=16100000 [Dec 22 14:34] Chance of finding a factor is an estimated 6.5% [Dec 22 14:34] Using FFT length 2560K [Dec 22 14:34] Restarting thread with new memory settings. [Dec 22 14:34] Ignoring suggested B1 value, using B1=555000 from the save file [Dec 22 14:34] Available memory is 503MB. [Dec 22 14:34] Using 496MB of memory. Processing 19 relative primes (10 of 480 already processed). Last fiddled with by James Heinrich on 20071222 at 20:03 
20071222, 20:09  #5 
"James Heinrich"
May 2004
exNorthern Ontario
3,019 Posts 

20071222, 22:26  #6 
Sep 2006
Odenton, MD, USA
10100100_{2} Posts 
Prime95,
Sorry for bringing this back up, but the server is still giving less credit for finding a factor in the 61bit range than not finding a factor from 2^0 to 2^60 bits. P4_2600_v256 221752123 NF 20071222 22:19 0.2 no factor to 2^60 0.0007 P4_2600_v256 221750929 NF 20071222 21:27 0.2 no factor to 2^61 0.0014 P4_2600_v256 221750927 F 20071222 21:25 0.2 2264553794801324393 0.0006 P4_2600_v256 221747791 F 20071222 19:35 0.1 1734156108967545617 0.0001 The bit size is from James Heinrich's web site. 2264553794801324393 = 60.97 bits 1734156108967545617 = 60.59 bits 
20071222, 23:32  #7 
"James Heinrich"
May 2004
exNorthern Ontario
101111001011_{2} Posts 
I've gone through the v25.5 thread and dug up all my old bugs and feature requests and compiled them here for easy reference

20071223, 02:37  #8 
P90 years forever!
Aug 2002
Yeehaw, FL
2×3^{2}×397 Posts 

20071223, 12:50  #9 
Sep 2006
Odenton, MD, USA
2^{2}·41 Posts 
Just find another 61bit factor, more credit but still less then no factor to 2^60 bits.
[Dec 23 07:42] Trial factoring of M222909889 to 2^61 is 0.01% complete. [Dec 23 07:43] M222909889 has a factor: 1647118574100374201 P4_2600_v256 222909889 F 20071223 12:43 0.0 1647118574100374201 0.0002 I consider this to be a low priority, just something I noticed and wanted to report. FYI, I've changed the worktodo.txt file to TF the next 20 exponents to 2^64 bits. Will see what happens. Last fiddled with by harlee on 20071223 at 12:57 Reason: added more info 
20071223, 13:04  #10 
Sep 2006
Odenton, MD, USA
164_{10} Posts 
This is just an FYI to show credit for the higher bit levels.
P4_2600_v256 222909959 NF 20071223 13:02 0.0 no factor from 2^63 to 2^64 0.0084 P4_2600_v256 222909959 NF 20071223 12:52 0.0 no factor from 2^62 to 2^63 0.0044 P4_2600_v256 222909959 NF 20071223 12:47 0.0 no factor from 2^61 to 2^62 0.0022 P4_2600_v256 222909959 NF 20071223 12:45 0.0 no factor to 2^61 0.0014 
20071223, 22:01  #11 
P90 years forever!
Aug 2002
Yeehaw, FL
15752_{8} Posts 

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 