![]() |
![]() |
#56 | |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
368210 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#57 |
Sep 2002
Database er0rr
118816 Posts |
![]()
R49081's certificate has been independently verified by factorDB
![]() |
![]() |
![]() |
![]() |
#58 |
Bemusing Prompter
"Danny"
Dec 2002
California
5·499 Posts |
![]()
For those who don't follow the "And now for something completely different" forum, here's another new ECPP record as well as a new open source ECPP implementation that's faster than Primo: https://mersenneforum.org/showthread.php?t=27775
Last fiddled with by ixfd64 on 2022-05-08 at 18:24 |
![]() |
![]() |
![]() |
#59 |
Sep 2002
Database er0rr
23×3×11×17 Posts |
![]()
Congrats to Andreas Enge for using his own ECPP software CM to prove tau 199^4518 at 57,125 digits
![]() In factorDB - http://factordb.com/index.php?id=1100000003886300622 |
![]() |
![]() |
![]() |
#60 |
Jul 2003
So Cal
72×53 Posts |
![]()
125330^3+3^125330, at 59,798 digits, is prime.
|
![]() |
![]() |
![]() |
#61 | |
Sep 2002
Database er0rr
23×3×11×17 Posts |
![]() Quote:
Pray tell what hardware you used and how long the proof took. Last fiddled with by paulunderwood on 2022-12-13 at 21:36 |
|
![]() |
![]() |
![]() |
#62 | |
Jul 2003
So Cal
A2516 Posts |
![]() Quote:
Last fiddled with by frmky on 2022-12-13 at 23:46 |
|
![]() |
![]() |
![]() |
#63 |
If I May
"Chris Halsall"
Sep 2002
Barbados
26×173 Posts |
![]() |
![]() |
![]() |
![]() |
#64 |
Jul 2003
So Cal
259710 Posts |
![]() |
![]() |
![]() |
![]() |
#65 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
32×1,117 Posts |
![]()
I can relate.
I recently had a test where Stage 2 "test #0" was not finished when 90% of the other tests were already finished. If that process gets killed - you have to start from scratch because no data in the state file (.cert2) are written that are not in sequence from #0 to #tests. Maybe this can be refactored (thinking about it)? So if you had the same then you are stuck on redoing all the same things again and again until the resources are enough for compound Stage 2 test. I think even if suboptimal - the Primo strategy of writing finished <base>.t#n files are written when the are finished. They do not have to be a "single flat file" database; they can be (fwiw) a flat fileset database |
![]() |
![]() |
![]() |
#66 | |
Sep 2002
Database er0rr
23·3·11·17 Posts |
![]() Quote:
Last fiddled with by paulunderwood on 2022-12-14 at 03:56 |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
ECPP-DJ | danaj | Computer Science & Computational Number Theory | 59 | 2020-10-10 04:57 |
Can I just leave this here? (ECPP) | trhabib | Miscellaneous Math | 6 | 2011-08-19 16:34 |
Looking for ECPP software | nuggetprime | Software | 14 | 2010-03-07 17:09 |
Fast ECPP | T.Rex | Math | 6 | 2007-06-25 16:42 |
Where ECPP is needed? | nuggetprime | Information & Answers | 9 | 2007-04-06 16:22 |