| log in |
|
1)
Message boards :
News :
prst mac app test
(Message 10676)
Posted 7 May 2025 by PhilTheNet
Phil how are you doing this ? chmod 755 ? |
|
2)
Message boards :
News :
prst mac app test
(Message 10675)
Posted 7 May 2025 by PhilTheNet
./prst_boinc -boinc -fermat -check strong "16627592*85^29-1" 16:49:31 (42332): Can't open init data file - running in standalone mode PRST version 10.0.1044, modified by SRBase, GWnum library version 31.0, GMP library version 6.3.0 Using Barrett reduction AVX FFT length 32. Fermat probabilistic test of 16627592*85^29-1, a = 3, complexity = 403. 16627592*85^29-1 Gerbicz-Li check enabled, L2 = 4*3. 16627592*85^29-1 is a probable prime. Time: 0.0 s. 16:49:31 (42332): called boinc_finish(0) ./prst_boinc -boinc -check strong "16627592*85^29-1" 16:49:52 (42351): Can't open init data file - running in standalone mode PRST version 10.0.1044, modified by SRBase, GWnum library version 31.0, GMP library version 6.3.0 Using Barrett reduction AVX FFT length 32. Fermat probabilistic test of 16627592*85^29-1, a = 3, complexity = 403. 16627592*85^29-1 Gerbicz-Li check enabled, L2 = 4*3. 16627592*85^29-1 is a probable prime. Time: 0.0 s. 16:49:52 (42351): called boinc_finish(0) |
|
3)
Message boards :
News :
prst mac app test
(Message 10672)
Posted 7 May 2025 by PhilTheNet
All the tests : ./prst_boinc -boinc -fermat -check strong "50004228*85^2000+1" 16:31:50 (41266): Can't open init data file - running in standalone mode PRST version 10.0.1044, modified by SRBase, GWnum library version 31.0, GMP library version 6.3.0 Using zero-padded AVX FFT length 1536. Fermat probabilistic test of 50004228*85^2000+1, a = 3, complexity = 14124. 50004228*85^2000+1 Gerbicz-Li check enabled, L2 = 32*25. 50004228*85^2000+1 is not prime. RES64: 0272563AE7F36547, time: 0.1 s. 16:31:50 (41266): called boinc_finish(0) ./prst_boinc -boinc -fermat -check strong "50000958*85^2747+1" 16:34:27 (41434): Can't open init data file - running in standalone mode PRST version 10.0.1044, modified by SRBase, GWnum library version 31.0, GMP library version 6.3.0 Using zero-padded AVX FFT length 2K. Fermat probabilistic test of 50000958*85^2747+1, a = 3, complexity = 19124. 50000958*85^2747+1 Gerbicz-Li check enabled, L2 = 38*29. 50000958*85^2747+1 is a probable prime. Time: 0.4 s. 16:34:27 (41434): called boinc_finish(0) ./prst_boinc -boinc -check strong "50004228*85^2000+1" 16:35:04 (41491): Can't open init data file - running in standalone mode PRST version 10.0.1044, modified by SRBase, GWnum library version 31.0, GMP library version 6.3.0 Using zero-padded AVX FFT length 1536. Pocklington test of 50004228*85^2000+1, a = 3, complexity = 14092. 50004228*85^2000+1 Gerbicz-Li check enabled, L2 = 32*25. 50004228*85^2000+1 is not prime. RES64: 0272563AE7F36547, time: 0.1 s. 16:35:04 (41491): called boinc_finish(0) ./prst_boinc -boinc -check strong "50000958*85^2747+1" 16:35:43 (41529): Can't open init data file - running in standalone mode PRST version 10.0.1044, modified by SRBase, GWnum library version 31.0, GMP library version 6.3.0 Using zero-padded AVX FFT length 2K. Pocklington test of 50000958*85^2747+1, a = 3, complexity = 19168. 50000958*85^2747+1 Gerbicz-Li check enabled, L2 = 44*25. 50000958*85^2747+1 is a probable prime. Time: 0.2 s. 50000958*85^2747+1 Checking gcd with factors {2, 5, 7, 17, 396833}. 50000958*85^2747+1 is prime! (5308 digits) 16:35:43 (41529): called boinc_finish(0) ./prst_boinc -boinc -check strong "12600*85^3491-1" 16:36:10 (41555): Can't open init data file - running in standalone mode PRST version 10.0.1044, modified by SRBase, GWnum library version 31.0, GMP library version 6.3.0 Using AVX FFT length 2560. Fermat probabilistic test of 12600*85^3491-1, a = 3, complexity = 24083. 12600*85^3491-1 Gerbicz-Li check enabled, L2 = 45*31. 12600*85^3491-1 is a probable prime. Time: 0.3 s. 16:36:11 (41555): called boinc_finish(0) |
|
4)
Message boards :
News :
prst mac app test
(Message 10671)
Posted 7 May 2025 by PhilTheNet
without -boinc : ./prst_boinc -check strong "12600*85^3491-1" Strong check is not implemented in Morrison test. Use -fermat first. 12600*85^3491-1 is prime! (6740 digits) Time: 0.5 s |
|
5)
Message boards :
News :
prst mac app test
(Message 10670)
Posted 7 May 2025 by PhilTheNet
./prst_boinc -boinc -check strong "12600*85^3491-1" 16:17:12 (40398): Can't open init data file - running in standalone mode PRST version 10.0.1044, modified by SRBase, GWnum library version 31.0, GMP library version 6.3.0 Using AVX FFT length 2560. Fermat probabilistic test of 12600*85^3491-1, a = 3, complexity = 24083. 12600*85^3491-1 Gerbicz-Li check enabled, L2 = 45*31. 12600*85^3491-1 is a probable prime. Time: 0.3 s. 16:17:12 (40398): called boinc_finish(0) |
|
6)
Message boards :
News :
prst mac app test
(Message 10667)
Posted 7 May 2025 by PhilTheNet
Good |
|
7)
Message boards :
News :
prst mac app test
(Message 10665)
Posted 7 May 2025 by PhilTheNet
./prst_boinc -check strong "50004228*85^2000+1" -log info Using zero-padded AVX FFT length 1536. Pocklington test of 50004228*85^2000+1, a = 3, complexity = 14092. 50004228*85^2000+1 Gerbicz-Li check enabled, L2 = 32*25. 50004228*85^2000+1 is not prime. RES64: 0272563AE7F36547, time: 0.1 s. |
|
8)
Message boards :
News :
prst mac app test
(Message 10664)
Posted 7 May 2025 by PhilTheNet
./prst_boinc -check strong "50000958*85^2747+1" -log info Using zero-padded AVX FFT length 2K. Pocklington test of 50000958*85^2747+1, a = 3, complexity = 19168. 50000958*85^2747+1 Gerbicz-Li check enabled, L2 = 44*25. 50000958*85^2747+1 is a probable prime. Time: 0.2 s. 50000958*85^2747+1 Checking gcd with factors {2, 5, 7, 17, 396833}. 50000958*85^2747+1 is prime! (5308 digits) |
|
9)
Message boards :
News :
prst mac app test
(Message 10662)
Posted 7 May 2025 by PhilTheNet
4/ Using zero-padded AVX FFT length 2K. Fermat probabilistic test of 50000958*85^2747+1, a = 3, complexity = 19124. 50000958*85^2747+1 Gerbicz-Li check enabled, L2 = 38*29. 50000958*85^2747+1 is a probable prime. Time: 0.2 s. |
|
10)
Message boards :
News :
prst mac app test
(Message 10661)
Posted 7 May 2025 by PhilTheNet
3/ Using zero-padded AVX FFT length 1536. Fermat probabilistic test of 50004228*85^2000+1, a = 3, complexity = 14124. 50004228*85^2000+1 Gerbicz-Li check enabled, L2 = 32*25. 50004228*85^2000+1 is not prime. RES64: 0272563AE7F36547, time: 0.1 s. |
|
11)
Message boards :
News :
prst mac app test
(Message 10660)
Posted 7 May 2025 by PhilTheNet
2/ Using zero-padded AVX FFT length 2K. Fermat probabilistic test of 50000958*85^2747+1, a = 3, complexity = 19124. 50000958*85^2747+1 Gerbicz-Li check enabled, L2 = 38*29. 50000958*85^2747+1 is a probable prime. Time: 0.2 s. |
|
12)
Message boards :
News :
prst mac app test
(Message 10658)
Posted 7 May 2025 by PhilTheNet
First on MacMini os 11.7.10 (20G1427): Using zero-padded AVX FFT length 1536. Fermat probabilistic test of 50004228*85^2000+1, a = 3, complexity = 14124. 50004228*85^2000+1 Gerbicz-Li check enabled, L2 = 32*25. 50004228*85^2000+1 is not prime. RES64: 0272563AE7F36547, time: 0.1 s. |