20200120, 20:41  #34  
If I May
"Chris Halsall"
Sep 2002
Barbados
10011111011100_{2} Posts 
Quote:
Not sure if this could be easily implemented in a wider deployment scenario. Probably better to figure out how to talk to the API with untrusted code. Perhaps limit any database deltas possible to be solely the last contact date  no security exposure, and would solve your problem more gracefully. 

20200121, 17:19  #35  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
7·877 Posts 
Quote:
I would like to be able to interface the script to PrimeNet eventually, and make it available to others to use, including with precompiled executables (which I have working now for my own local distribution for test to multiple systems some of which do not have perl installed). It sounds like the PrimeNet API is not currently well suited to gpu support or to untrustedapp support. Both EWMayer and Preda have grappled with it and turned back. Last fiddled with by kriesel on 20200121 at 17:49 

20200126, 07:31  #36  
"CharlesgubOB"
Jul 2009
Germany
2×313 Posts 
Quote:
88041853 

20200724, 15:01  #37 
Sep 2002
Database er0rr
2^{2}×997 Posts 
Ben is doing over 10x the first time tests of Curtis "Chuck Norris" Cooper atm

20200724, 15:16  #38  
If I May
"Chris Halsall"
Sep 2002
Barbados
2^{2}·2,551 Posts 
Quote:


20200724, 15:49  #39  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
6139_{10} Posts 
Quote:
We could be in a barren stretch of the number line. The presumed Poisson distribution has already had ratios of successive exponents of Mersenne primes of ~4:1.. Even the mean expectation, of ~1.47:1 on exponent, implies ~121M, or tens of millions of exponent range to go. A 4:1 puts us near 100Mdigit range. GIMPS has had a very lucky run. Play long enough, and the house wins. The best conjectures indicate there are about 6 more Mersenne primes to find in the range below p=10^{9}, which under reasonable assumptions will take generations to fully firsttime test. Last fiddled with by kriesel on 20200724 at 15:52 

20200724, 15:52  #40 
If I May
"Chris Halsall"
Sep 2002
Barbados
2^{2}·2,551 Posts 

20200724, 16:01  #41  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
7·877 Posts 
Quote:
The work to primality test up to a given exponent p from 2 is with the best available algorithms, around p^{3} to p^{3.1}. That eats up powers of 2 or ten on throughput quite readily. LL/LLDC phaseout and PRP DC replacement with the much more economical proof and verification provides nearly 2:1. There are some small gains possible in TF and P1. (For a while I'd post such pessimistic comments, and shortly seem to be shown wrong by a new prime find. No such luck lately.) I wonder how long Ben will continue what is probably a massive financial donation to the cause. Last fiddled with by kriesel on 20200724 at 16:05 

20200724, 16:04  #42 
"Ben Delo"
Oct 2019
Hong Kong
8_{16} Posts 
At my current rate I predict a 1020% chance per year of finding a MP.

20200724, 16:23  #43 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
10258_{10} Posts 
There may be no more Mp's to be had. So it is possible that he hasn't helped at all.

20200724, 17:00  #44  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
7×877 Posts 
Quote:
Contrast with the LenstraPomeranceWagstaff conjecture. Last fiddled with by kriesel on 20200724 at 17:17 
