![]() |
![]() |
#166 |
Dec 2012
1000101112 Posts |
![]()
Is anybody currently working on the PRPs <= 3000? I may do a little or a lot of work, and I don't want to run into anyone.
|
![]() |
![]() |
![]() |
#167 |
Sep 2009
2·33·43 Posts |
![]()
I'm working on them from the bottom up. If you keep away from the lowest few hundred PRPs you should be OK (anything over 1500 digits should be safe for at least a month).
|
![]() |
![]() |
![]() |
#168 |
"Oliver"
Sep 2017
Porta Westfalica, DE
2×487 Posts |
![]()
Currently, I am running a certification on Sm(2445)*10^8677+Smr(2446). While the system I am running it on has a throughput of slightly above one 10k digit number per day, it now stands at 46806/57633 bits in phase 1 after more than a week (slightly above eight days). This is with the same number of threads as with the 10k candidates. Even if I assume that Primo operates in \(\mathcal{O}(\log(n)^{5+\varepsilon})\) for small \(\varepsilon\) instead of \(\mathcal{O}(\log(n)^{4+\varepsilon})\), this seems way slower than it should be expected. Is my expectation flawed (maybe I computed the ETA wrong) or is there something else that could slow it done?
I know that ECPP is non-deterministic algorithm and I might got an extreme sample here. Can somebody chime in if this might be the case? |
![]() |
![]() |
![]() |
#169 | |
Sep 2002
Database er0rr
23·179 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#170 |
"Oliver"
Sep 2017
Porta Westfalica, DE
97410 Posts |
![]()
Yes, I used 11k digits and the maximum setting in the other field.
Watching it is only fun when it has sped up considerably towards the end of phase 1. ![]() |
![]() |
![]() |
![]() |
#171 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
7·23·61 Posts |
![]() |
![]() |
![]() |
![]() |
#172 |
Sep 2009
2·33·43 Posts |
![]()
@Ray Chandler, would you mind moving to slightly larger numbers? My script has reached 1519 digits and I've seen it try to process some numbers you had just submitted certificates for. It would avoid the bad case of us both generating certificates for the same number at the same time.
|
![]() |
![]() |
![]() |
#173 |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
D2D16 Posts |
![]()
Currently the primes (2^42737+1)/3 and (2*10^19153+691)/9 have no certificates in factordb, and their status are still "PRP" in factordb, however, both of them are in fact proven primes, see http://www.lix.polytechnique.fr/Labo.../myprimes.html, but when I download their certificates (the original link of certificates of (2^42737+1)/3 was broken, clink this new link to download, and for the other number (2*10^19153+691)/9, click this link to download) and upload them to factordb, factordb says "not PRIMO certificates" and neither certificates can be uploaded to factordb.
|
![]() |
![]() |
![]() |
#174 | |
"Ed Hall"
Dec 2009
Adirondack Mtns
119616 Posts |
![]() Quote:
Code:
[PRIMO - Primality Certificate] Version=4.3.0 - LX64 WebSite=http://www.ellipsa.eu/ Format=4 ID=B3F5C051930D8 Created=Feb-26-2019 11:45:39 PM TestCount=321 Status=Candidate certified prime [Comments] Put here any comment... [Running Times (Wall-Clock)] 1stPhase=6709s 2ndPhase=1902s Total=8611s [Running Times (Processes)] 1stPhase=24918s 2ndPhase=7447s Total=32365s [Candidate] . . . |
|
![]() |
![]() |
![]() |
#175 | |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
3,373 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#176 | |
Sep 2002
Database er0rr
23×179 Posts |
![]() Quote:
![]() gunzip the .gz files. Then zip the .certif up to .zip. No need to rename anything Last fiddled with by paulunderwood on 2022-02-19 at 04:25 |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Primo Browser? | PawnProver44 | Information & Answers | 14 | 2016-04-09 05:49 |
Primo Verifier... | WraithX | Software | 15 | 2013-09-10 07:24 |
Fixup Old Primo Certificate? | wblipp | FactorDB | 1 | 2012-05-28 03:16 |
PRIMO 3.0.7 | Cybertronic | Five or Bust - The Dual Sierpinski Problem | 17 | 2009-08-13 20:42 |
primo question | fivemack | Math | 35 | 2009-04-28 15:03 |