20201211, 23:44  #221 
Dec 2011
After milion nines:)
1597_{10} Posts 

20201212, 09:08  #222  
"Sam"
Nov 2016
5×67 Posts 
Quote:
The prime in question does not appear to be totally random? I have actually constructed large random provable primes before (over 100,000 digits), but none of them were large enough size for Top5000 at the time. This was a few years ago though and I had lost interest at some point. I am also wondering how sieving was done. I've made general purpose programs and scripts for my searches in finding random primes, but they are far too slow at half a million digits compared to more advanced programs like srsieve and multisieve which won't support testing arbitrary numbers. Also, PFGW appears to test some numbers faster than others, like Proth or Riesel numbers, so I could only imagine the extensive work done to find this prime. These primes also might be of interest: https://primes.utm.edu/primes/page.php?id=119933 https://primes.utm.edu/primes/page.php?id=119934 Edit: I did not see Paul's post was about a week ago, for some reason, this caught my attention... Last fiddled with by carpetpool on 20201212 at 09:13 

20201212, 12:21  #223 
Dec 2011
After milion nines:)
1,597 Posts 

20201212, 20:39  #224 
"Rashid Naimi"
Oct 2015
Remote to Here/There
100011111110_{2} Posts 
@carpetpool
The prime has taken months of work for different iterations and I have modified the sieving over time. As per faster PRP tests for some numbers than others of the same size, I believe it's a matter of proximity to repeated squaring which these iterations happen to be. The same behavior can be seen in Pari when calculating Mod (b,p)^(p1) which is much faster if p is close to repeated squares which indicates that the routines have the intelligence to figure out the fastest way of calculating an Exponentiation. As for the sieving, I use my own setup which means it is probably quite inefficient. However it has one thing going for it: There is often the raised subject of how deep to sieve and I generally disagree with the replies. IMHO one should sieve indefinitely and simultaneously as PRP testing. I basically take a range and let lose multiple threads at sieving it using both PRPTestthreads and TFsievingthreads. Any candidate in the queue that is knocked out by TF saves days of upcoming PRP tests. I have a ryzen 9 PC dedicated to this sequence and run my routines in a virtual box which I can pause, snapshot and resume at any time. I am currently looking for the next iteration but things have slowed down to a crawl. It appears that PRP tests are about 8 times slower than the last iteration. ETA Good luck with your next Top5k carpetpool. Last fiddled with by a1call on 20201212 at 21:30 
20201214, 07:05  #225  
Aug 2020
79*6581e4;3*2539e3
1131_{8} Posts 
Quote:


20201214, 12:41  #226 
"Rashid Naimi"
Oct 2015
Remote to Here/There
2302_{10} Posts 
Suppose you are testing 10000 candidates with 1M decimal digits each. And each PRP test takes 4 days and you have 10 threads available. Suppose you run PRP tests on 9 of them and trial factoring on the other. In the 1st 4 days anything divisible by small primes will be knocked out by TF. In the next 4 days candidates divisible by larger primes will be knocked out, next 4 days even larger.... Any candidates that are knocked out of the queue at anytime means you don't have to spend 4 days for a PRP test on them.
Last fiddled with by a1call on 20201214 at 13:03 
20201214, 16:07  #227 
"Curtis"
Feb 2005
Riverside, CA
15AE_{16} Posts 
In no way did your explanation answer why sieving is better after the point where a prp test eliminates candidates faster than sieve does. If your sieve eliminates a candidate every 6 days, why do you think you're saving 4 days every time you find a factor?
When sieve is faster, sieve on all 10 threads. When prp is faster, prp on all 10 threads. You way may be convenient for you, but it's not an effort to be efficient. 
20201214, 22:15  #228 
"Rashid Naimi"
Oct 2015
Remote to Here/There
2·1,151 Posts 
Suppose you have 2 available threads.
Suppose there are z candidates to test, none of which are prime. Suppose each PRPTest takes 4 days to complete. Suppose running the 2 TFthreads for 4 days would sieve upto some prime x per thread. Suppose y of the candidates have prime factors greater than x. For the sake of the argument let's ignore the time it takes to run the TFtest on all the candidates. the PRP tests alone will take 4y/2 days.  Now suppose you run 1 of the threads for trialfactoring indefinitely which means the candidates upstream the queue will be sieved deeper and deeper than x. The other thread is used for PRPtests It will take you less than 4y days to PRP test all the candidates because some more of the candidates will be knocked out by TF. How much less days is a factor of how large z is. The larger the z, the deeper the TF, the greater cutdown from 4y days. Since there is no known upper bound for z, there is always a z value feasible where PRP tests will take less than 4y/2. That's my 2 cents and that's how I run my setup, but you are welcome to disagree. 
20201214, 23:41  #229 
"Rashid Naimi"
Oct 2015
Remote to Here/There
4376_{8} Posts 
Couldn't add an ETA.
To make it clearer the 2 scenarios are a bit of apples and oranges comparison. The second scenario sieves less deep in the beginning and more deep towards the end. However its depth has no upper bound unlike the 1st scenario. I hope that makes sense. 
20201215, 01:10  #230 
"Curtis"
Feb 2005
Riverside, CA
2·3·5^{2}·37 Posts 
We understand what you do, so "makes sense" is a pretty low bar. We disagree that it's faster.
Sieve on both threads until it takes longer than 4 days to find a factor. Then prp on both threads. Every candidate is optimally sieved this way, while in your way the first few tests are badly undersieved, and the last few are really badly oversieved. If we both take a range and race on identical hardware, your way comes out slower. But, if you like the triumph of finding a factor, it's just fine to rank speed as not the first priority. Just don't claim it's better! 
20210122, 02:17  #231 
Sep 2002
Database er0rr
2×2,179 Posts 
321
Congrats to Rudi Tapper and PrimeGrid for the prime 3* 2^16819291  1 with 5,063,112 decimal digits and top5000 entrance rank of 21.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Mersenne Primes p which are in a set of twin primes is finite?  carpetpool  Miscellaneous Math  4  20220714 02:29 
Patterns in primes that are primitive roots / Gaps in fullreptend primes  mart_r  Prime Gap Searches  14  20200630 12:42 
Distribution of Mersenne primes before and after couples of primes found  emily  Math  34  20170716 18:44 
Conjecture about Mersenne primes and nonprimes v2  Mickey1  Miscellaneous Math  1  20130530 12:32 
possible primes (real primes & poss.prime products)  troels munkner  Miscellaneous Math  4  20060602 08:35 