20210317, 15:15  #573  
"James Heinrich"
May 2004
exNorthern Ontario
110100100010_{2} Posts 
Quote:
Is there some simple translation to estimate probability of an undiscovered factor of <digits> length? Is it interesting to extend the calculation/display lower/higher than 20/65 digits, and/or at smaller steps than 5 digits? If so all I would need is an updated data table. 

20210317, 19:14  #574  
"Seth"
Apr 2019
273_{10} Posts 
Quote:
table doesn't show when no ECM table doesn't show large digits when no (or few) curves have been complete table seems to correctly counts curves Few notes: * Huge "Complete" numbers look a little silly but I don't have a suggestion on better UI. * You could add a "Probability of missed (smaller) factor", the probability is (1  1/curve_count) ^ curve_count which can be transformed to math.exp(curve_count * math.log(1  1/curve_count)) or approximated by (1/e)^(complete) Quote:
The code I presented is a good starting spot. I suspect it's under estimating progress for larger digits by 1030% (a guess) this is fine for me (as I just wanted a ballpark of progress) but if someone did want to improve they should take LaurV's suggestion and implement something that's aware of B2 instead of extending my/your current code. 

20210317, 20:24  #575 
"Viliam FurÃk"
Jul 2018
Martin, Slovakia
2×3×7×11 Posts 
A fellow Slovak GIMPSer Anton Repko asked me to post his program, so here it is.

20210317, 20:55  #576  
"James Heinrich"
May 2004
exNorthern Ontario
2×41^{2} Posts 
Quote:
The approximated third option seems (in my ignorant opinion) to produce "reasonable" numbers. In each of the first two versions is it supposed to be the same "curve_count" used twice, or should one be the "expected" curves? I've added the approximated value to the live server. 

20210317, 21:06  #577  
"Seth"
Apr 2019
3·7·13 Posts 
Quote:
(1  1/needed_curves) ^ curves_complete Last fiddled with by SethTro on 20210317 at 21:07 

20210328, 22:26  #578  
"James Heinrich"
May 2004
exNorthern Ontario
2·41^{2} Posts 
Quote:
Quote:


20210330, 01:38  #579 
"James Heinrich"
May 2004
exNorthern Ontario
110100100010_{2} Posts 
There is a known issue with the nightly sync, will be processed when data is available.

20210330, 13:58  #580 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2×5×587 Posts 

20210330, 14:26  #581 
"James Heinrich"
May 2004
exNorthern Ontario
2×41^{2} Posts 

20210331, 15:06  #582 
"James Heinrich"
May 2004
exNorthern Ontario
2·41^{2} Posts 

20210331, 21:40  #583 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2·5·587 Posts 
Yafu has a function that tells it how many txx have been run. The number of digits (xx) which provides a value of 1 can be found using https://en.wikipedia.org/wiki/Bisection_method. This is also known as a binary search although strictly speaking that is for sets.
For example, if you know it is between t35 and t36 you would check if t35.5 has been completed. This restricts the search space to either t35 to t35.5 or t35.5 to t36. This can be repeated until you have the precision you want. The only assumptions are that the function must be continuous and monotone increasing or decreasing. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Small inconsistencies between mersenne.org and mersenne.ca factor databases  GP2  mersenne.ca  44  20160619 19:29 
mersenne.ca (ex mersennearies.sili.net)  LaurV  mersenne.ca  8  20131125 21:01 
GaussianMersenne & EisensteinMersenne primes  siegert81  Math  2  20110919 17:36 
Mersenne Wiki: Improving the mersenne primes web site by FOSS methods  optim  PrimeNet  13  20040709 13:51 