20220522, 13:48  #111 
Sep 2002
Database er0rr
2^{2}·1,063 Posts 
I should revise this figure down a lot. On 64 cores, it took 20 months for Primo to certify R49081. Call it 600 days. It would take Primo (86453/49081)^4 times as long i.e. 5776 days. Now FastECPP is twice as fast and my GWNUM hack will be 4 times as fast still at that bit level. So 722 days. On 16 times as many cores (i.e 1024 cores) that would only be ~45 days to certify R86453.
If no one is going to pick up R86453, I'd like to reserve it for myself for certification Last fiddled with by paulunderwood on 20220522 at 19:41 
20220522, 21:49  #112  
Jun 2015
Vallejo, CA/.
19·59 Posts 
Quote:
...and tell me is a 100,000 digit PRP EVEN theoretically possible with the present software/hardware. 

20220522, 21:57  #113  
Sep 2002
Database er0rr
2^{2}·1,063 Posts 
Quote:


20220523, 11:01  #114  
Jun 2012
Boulder, CO
409 Posts 
Quote:
Could your call to mpz_probab_prime_p() in the if block be replaced by mpz_millerrabin as R. Gerbicz suggested? Quote:


20220523, 11:35  #115  
Sep 2002
Database er0rr
2^{2}·1,063 Posts 
Quote:
I don't know the probabilities of MR compared to BPSW  but Robert's point about superfluous trial division is valid. I leave the configure option for Andreas to implement. I tried compiling the code for gw_num.c inside lib/nt.c but got errors about things like SQLite and fPIC and other things  it is beyond my skills. Last fiddled with by paulunderwood on 20220523 at 11:38 

20220523, 18:37  #116 
Sep 2002
Database er0rr
2^{2}·1,063 Posts 
Which CM/FastECPP are you all using? We had a long time on Step [1] with a 13k digit PRP with 0.4.1dev and reverted the install back to 0.4.0. Were we impatient?
Last fiddled with by paulunderwood on 20220523 at 18:41 
20220523, 23:25  #117 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
10011010101101_{2} Posts 
0.4.1dev works well. (Specifically cm0.4.1dev41c4bce )
Latest news, UTM was updated with the new proof root code change called "E*"; and CM was changed to a 'program'. 
20220524, 03:29  #118 
Jul 2003
So Cal
3·811 Posts 

20220524, 05:20  #119 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,901 Posts 
I recently built a rather involved package for R (it is called leafcutter, if anyone is interested); so for it, I'd built ...well  everything. Because many of its prereqs (if I count them now, it's dozens, which in turn built hundreds; but half a dozen failed) were development tools (if they weren't you can use R's own internal tools, like for python one uses pip), so I needed aclocal, autoconf, latest pkgconfig, too... but also many things that I'd had but were not good enough for all those tools. (some tools built graphs of intermediate results, and they were using whatever they preferred,  for example libjpeg, which I think the last time I built maybe in 2006). Some tools needed CXX14, some were dated 1999; some said "you have libblah, but you have to rebuild it with fPIC"...
Of these, building aclocal, autoconf, libtool were the easiest  from source, and then you own them. For building CM, only 4 packages were needed; once you have ac* tools, they all are a breeze to build. I ended up having several pythons (for various packages; what is good for a Russian is death for a German, some say  same for tools), several R's (some packages in BioConductor are abandoneware, so R 3.8 doesn't build them; so you need 3.6, 3.3, 3.0), several perl's even, several gcc's. Madness! Once you do those, building anything is peanuts. 
20220524, 22:27  #121  
Sep 2002
Database er0rr
2^{2}×1,063 Posts 
Quote:
The number is numbpart(140593907). On the Intel cluster it takes an inordinate amount of time with 0.4.1dev3865637+GWNUM to do Step [1]. On the Intel cluster: Code:
Size [0]: 43850 bits Time for discriminant 48625528: 271949.5 (15256.3) largest prime of d: 868313 largest prime of h: 31 discriminants: 23.3 (23.3) 36813 qroot: 251653.6 (12125.1) 3319702 Cornacchia: 12635.2 (667.7) 12238 trial div: 7632.3 (380.7) 11623 is_prime: 5.1 (2059.5)  Size [1]: 43818 bits ^C real 847m52.780s user 11357m49.201s sys 542m47.063s Code:
 Size [1]: 43808 bits Time for discriminant 52151523: 5649.9 (138.0) largest prime of d: 283 largest prime of h: 2 discriminants: 4.3 (4.3) 189 qroot: 2546.1 (54.8) 420610 Cornacchia: 5361.0 (86.8) 5166 trial div: 5862.6 (97.3) 1134 is_prime: 0.4 (105.3) Last fiddled with by paulunderwood on 20220524 at 23:05 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
For which types of primes is GPU primality test software available?  bur  GPU Computing  6  20200828 06:20 
Fastest software for Mersenne primality test?  JonathanM  Information & Answers  25  20200616 02:47 
APRCL as primality proof  f1pokerspeed  FactorDB  14  20140109 21:06 
Proof of Primality Test for Fermat Numbers  princeps  Math  15  20120402 21:49 
PRIMALITY PROOF for Wagstaff numbers!  AntonVrba  Math  96  20090225 10:37 