20201127, 02:06  #386 
"Alexander"
Nov 2008
The Alamo City
2^{2}×149 Posts 
If you're willing to put in the work finding the FFT jumps (fun detective work IMO) and periteration times (not as fun; you may not want to run full tests the whole way like I did up to 512K), you can plug them into LLRTools (https://www.mersenneforum.org/showpo...2&postcount=35) and let that spit out the average test time for any range.

20201127, 02:25  #387 
Sep 2006
The Netherlands
2^{6}·11 Posts 
Happy  you sure you can't do better with a stick in the sand than that?

20201127, 07:19  #388 
"Alexander"
Nov 2008
The Alamo City
2^{2}·149 Posts 
I could write a script to automate finding those FFT jumps? (It would help me immensely too.) Pick a language. I'm good at most common ones. :)
To be honest, I'm not sure who I was supposed to be answering. I thought I was coming up with a solution for your removal rate dilemma, if that hasn't already even been solved. My postsperpage count (19) is such that I don't have the post you replied to on this page anymore. 
20201127, 08:20  #389 
Mar 2006
Germany
2·3·13·37 Posts 
@diep
I've created the Riesel k=32767 in the Wiki and reserved it for you (including tested to n=50k). I've also updated the k=89 reservation. If you got any further results for k=32767 please fill them in. 
20201127, 10:02  #390 
Sep 2006
The Netherlands
2^{6}×11 Posts 
Kar, c'est bon!
You can be sure i will report it if there is a new one above n=1569 :) Please note for the few who might not know: testspeed of LLR with larger k's is a lot slower than small k's. k = 89 and k=69 here tests roughly factor 2 faster than k=32767, under the same conditions. At the CPU's with many cores here what matters most is that LLR FFTsize stays within combined L3 cachesize : #cores * L3_cache_a_core I do not know details yet the FFTsize seems dependant upon which kfactor you use. (so if you know the FFT size for that specific kfactor and nsize in units multiply it with 16 bytes  because the size is in doubles and you need 1 double which has t he information and 1 to write new information to, and a double is 64 bits so that's 8 bytes and you need 2 of that makes 16 bytes. The blabla from manufacturers that you can add up the L2 and L1 cachesize to it seems utter blabla from the manufacturers to me by the way yet that's not relevant here  just L3 cachesize matters there in that comparision  except if you do not have a L3 cache then L2 cache size matters. So to say it technical the algorithm doesn't seem to work insitu regrettably) Last fiddled with by diep on 20201127 at 10:12 
20201127, 23:32  #391 
"Alexander"
Nov 2008
The Alamo City
2^{2}×149 Posts 
According to that LLRTools tool I linked, to go from the max n for k=1 of a given FFT length (which I'll call \(n_m\)) to the max n for any k for that same FFT length (which I'll call \(n_k\)), the formula is .

20201128, 07:33  #392 
"Alexander"
Nov 2008
The Alamo City
254_{16} Posts 
Here is the promised script. It's a little slow, and I haven't tested it on Windows (I don't currently have access to a Windows box), but it's completely automated once started. It uses a binary search (which it prints out) to find the minimum n for every FFT length below a given limit (provided on the command line; you can give the exact number or a "K" or "M" suffixed one like LLR prints out; the actual length doesn't have to be present on that platform). It dynamically finds the relevant FFT lengths for that platform through the search. Create a "temp" subfolder as a working directory for it to dump all of the temp files (it creates a ton of them). It uses the CLI version of LLR (assuming its name is "llr" in the current directory). Let me know if anyone finds this useful.

20201130, 20:45  #393  
Sep 2006
The Netherlands
1300_{8} Posts 
Quote:
What do i type on the command line? something like this? python happy.py 32767 5800000 

20201201, 07:04  #394 
Jun 2020
2^{3} Posts 
k=2805
Releasing k=8847 and reserving k=2805.

20201201, 08:23  #395  
"Alexander"
Nov 2008
The Alamo City
2^{2}×149 Posts 
Quote:
You have the arguments flipped. The max FFT length (not the max n) is the first one, since it's the only required one. The k you choose for the optional second argument shouldn't change the result significantly unless it starts zeropadding the FFTs (high 6digits), and I chose k=100005 to avoid zeropadding while still shortening the timing tests (since the n's will be lower). n=5.8M is at the 480k FFT length for your k on my Core 2 Quad, and the Xeon won't be too much different, if at all, so run it to that or 512k. Something like "python3 happy.py 480K". I've attached another script that reads in the generated maxlen.txt and converts the max n's (which are adjusted in the file to match Mersenne values) for any chosen k. They should closely match the test results from the verbose printouts of the first script. It's called using "python3 fftlen.py k". 

20201202, 09:05  #396 
"Alexander"
Nov 2008
The Alamo City
1001010100_{2} Posts 
I posted those two scripts (renamed to generate_maxlen.py and adjusted_fftlen.py) and a few others to a new GitHub repo: https://github.com/happy5214/rpsscripts. I'll post updates there. You'll need the fftlen.py library module for both scripts. I plan on adding a new argument interface to generate_maxlen.py to allow you to specify a max n instead of a max FFT length, and also to specify verbosity via a flag instead of by editing the code.
Last fiddled with by Happy5214 on 20201202 at 09:06 Reason: Library module needed. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Best Work for Finding Primes  Unregistered  Information & Answers  9  20120624 13:50 
Which settings to choose for best work?  jmb1982  Software  2  20090407 09:33 
Help test 210885  Find a new top 5000 prime!  SlashDude  Riesel Prime Search  121  20080103 08:47 
Help test 2995125705  Find a new top 5000 prime!  SlashDude  Riesel Prime Search  538  20070508 01:42 
The fastest way to a top5000 prime?  lsoule  15k Search  13  20050919 20:24 