20200629, 13:20  #353  
Random Account
Aug 2009
U.S.A.
3^{2}·137 Posts 
Quote:
Quote:


20200630, 15:42  #354 
Jul 2018
Martin, Slovakia
1000011_{2} Posts 
Hello, I would like to test primes for k=20020913 (my birthday date ). Could somebody please guide me to how far sieve, and what program to use? I have Radeon VII, RTX 2080Ti, and Ryzen 9 3900X available for testing. I would also like to ask if there is any difference between searching in k=20020913 and k=2002913?
In case there isn't a difference, I reserve the k=20020913, and the other one is for the future me. 
20200630, 16:15  #355 
"Curtis"
Feb 2005
Riverside, CA
4,211 Posts 
I suggest you make a short project out of n=1 to n=400k to find small primes, and then decide how large an 'n' you want to set up a sieve for.
For the small primes, srsieve or newpgen to create the sieve file, then sr1sieve because it's faster than the other two. One generally sieves until the average time to find a factor is equal to the LLR time for a candidate 70% of the way from nmin to nmax; in this example, that would be at n=280k. The reason I don't give a sieve depth number is that the proper depth depends quite a bit on how many candidates remain in the sieve, which is a way of saying the weight of the kvalue. Different k's have different patterns of small factors that eliminate a bunch of candidates, so some k's need sieve depths an order of magnitude larger than others. LLR is the primalitytesting program; there is a version for GPU, but it's best described as alphaversion quality. Rogue has srsieve2 package of programs, some of which are GPUenabled; peruse that thread (or wait for someone who knows more than I do here) to see if you can sieve on GPU and test LLR on CPU. Large sieve ranges are more efficient than small ones; after you run to 300k or 400k for the first sieve and test all those candidates, I'd make a second sieve that covers any range you are likely to ever test 400k to 4M isn't crazy, but that's coreyears of searching; 400k to 2M could be completed in a few months. The second k will yield different primes, so "saving" that for futureyou makes sense. Happy hunting! 
20200630, 18:54  #356 
Jul 2018
Martin, Slovakia
103_{8} Posts 
First prime, before any tests!
BTW, before any tests, I found 20020913*2^121 to be prime. I simply calculated the value and used an online tool (https://primes.utm.edu/curios/includes/primetest.php) to find out whether it is prime.

20200701, 08:58  #357  
"Alexander"
Nov 2008
The Alamo City
477_{8} Posts 
Quote:


20200701, 19:06  #358 
Jul 2018
Martin, Slovakia
67 Posts 
I meant the GPUs for LLR testing. Is there a program for GPU testing, not sieving? Especially if it had properties as gpuOwl, it would be really fast on Radeon VII.

20200701, 19:13  #359  
Sep 2002
Database er0rr
2^{2}×19×43 Posts 
Quote:
I asked Yves Gallot about Proth on GPUs, downloaded and compiled the source and it was equal to 4 CPU cores, whereas Mersenne is like 40 cores 

20200701, 23:28  #360 
Random Account
Aug 2009
U.S.A.
3^{2}·137 Posts 

20200702, 09:18  #361  
"Alexander"
Nov 2008
The Alamo City
11·29 Posts 
Quote:
Quote:


20200702, 12:33  #362 
Mar 2007
Estonia
86_{16} Posts 
llrCUDA works, I have been running one for months. But it's slow, much slower than a CPU in the same class .
I am getting 1.1ms per iteration on n=3.8M on a 1080TI While the same n is getting 0.271 ms per iteration on 5 threads and 0.7ms on 1 thread on an i76700K Last fiddled with by kuratkull on 20200702 at 12:39 
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 