20200228, 05:39  #430  
Random Account
"Norman D. Powell"
Aug 2009
Indiana, USA.
2^{4}×3^{2}×13 Posts 
Quote:
It took me about ten minutes to write a short program to split sieves into work files of equal sizes for each machine. I was careful to make sure it did not skip anything in the source. It begins reading from the top and alternates writing each entry to one of two output files. The top line from the input is written first to both outputs since it contains needed information for LLR. The work load is very balanced as they both finish running LLR within a short period of time. Nash tables: Using a looping batch process, I have generated a series of tables. It took some doing to get rid of all the extra spaces in each line. They are CSV format which can be imported into a spreadsheet to be sorted. 

20200228, 12:42  #431  
Sep 2006
The Netherlands
1011000000_{2} Posts 
Quote:
Myself i had reserved here k=32767 Will find a few more at later time. Much larger than this. Hopefully not too much time from now. Yes i want search a couple of low weights at same time there, because for my gpgpu proggie i wrote half a dozen of them can be sieved at same time on the gpu. The small primes p smaller than 64 bits (63 bits in length and shorter  though for 64 bits i intend make a special kernel) get generated then fed to gpu where i wrote some code to sieve for Nvidia GPU's. The slowest thing is the thing i didn't write  generating the small primes on the CPU. Though i did write a siever for cpu it's not ready production usage and it's single core and not using SSE2 (let alone AVX) versus what's there on the net is with SSE2 (SSSE on my oldie Xeons) and such great optimizations. After that LLR. Maybe i should revive my siever for cpu there and optimize it to feed faster small primes than a perfect siever there. 

20200228, 15:03  #432  
Random Account
"Norman D. Powell"
Aug 2009
Indiana, USA.
2^{4}·3^{2}·13 Posts 
Quote:
My Nash tables exclude any Nash value < 1,000. The tables currently go up to k = 924,000. They are divided into blocks averaging 65K bytes per file. If there is anything you would like to have, I can send it along. I have a GTX 1080 in my i7 system which has not been used for anything in months. It would be nice to apply it to this project area. No GPU application program exists yet that I am aware of. Something similar to LLR would be nice. 

20200228, 15:48  #433 
"Curtis"
Feb 2005
Riverside, CA
4672_{10} Posts 
Using the primegrid sieve is a massive speed improvement; I'd stick to k under 10,000 because of that alone. Lots and lots of k's are searched to something less than a million; extending that work is a far better idea than trying so hard to find a k that nobody has yet worked on.
CUDALLR exists; you can find a thread about it, including source to download. It's not bugfree, but it works at least for some systems and some cards. I believe the largest k it supports is much smaller than that of regular LLR; or perhaps it was that the speed penalty for large k was much worse than that of regular LLR. Don't expect much support if you do try it hardly anyone uses it. 
20200228, 20:07  #434  
Sep 2006
The Netherlands
2^{6}×11 Posts 
Quote:
I wrote that gpgpu code myself in CUDA in 2016  it's not ready for production yet as lacked priority to finish it. GTX1080 is similar to some hundreds of cores newpgen there. I've got a Titan Z here  also has some punch in DP. The FFT implementation mine only exists on a cpu right now and for gpu only on paper. Sieving on gpu would be finished first with several kernels. In all cases i go for throughput rather than latency. So running several tests at same time  to use all calculation power of the gpu rather than try to do 1 exponent as fast as possible. Means effectively a single exponent (or a bunch) runs (run) within a single SIMD and has a very limited number of warps working at the same time for it. So it's total different approach from what Nvidia releases. edit: and it might not work for mersenne at all as those transforms are so huge that with that many exponents you would eat too much memory from the GPU's device RAM. Last fiddled with by diep on 20200228 at 20:10 

20200228, 23:53  #435 
Random Account
"Norman D. Powell"
Aug 2009
Indiana, USA.
2^{4}×3^{2}×13 Posts 
I restarted the process on my laptop. It is up to 1.5million now. I believe I should probably stop. Send me a private message with an email address and if you have a preference of which areas are of interest, or you are welcome to the entire lot.

20200229, 15:06  #437 
Feb 2003
2^{2}·3^{2}·53 Posts 
The attached file contains 322220 k (up to 100M) with Nash weight less or equal to 250.

20200301, 00:37  #438 
Random Account
"Norman D. Powell"
Aug 2009
Indiana, USA.
11101010000_{2} Posts 

20200301, 02:43  #439  
"Alexander"
Nov 2008
The Alamo City
111101101_{2} Posts 
Quote:
Last fiddled with by Happy5214 on 20200301 at 02:44 

20200302, 13:18  #440 
Random Account
"Norman D. Powell"
Aug 2009
Indiana, USA.
2^{4}×3^{2}×13 Posts 
98475*2^6067591 is prime! (182658 decimal digits)
k = 98475, n tested to 610,000. Continuing. No further until April. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
16e Post Processing Progress  pinhodecarlos  NFS@Home  8  20181128 13:45 
Sieving with powers of small primes in the Small Prime variation of the Quadratic Sieve  mickfrancis  Factoring  2  20160506 08:13 
Sierpinski/Riesel Base 5: Post Primes Here  robert44444uk  Sierpinski/Riesel Base 5  358  20081208 16:28 
Small Primes  Housemouse  Math  2  20080604 05:23 
POST PRIMES you've found here, and name or prover code  TTn  15k Search  415  20060302 21:17 