![]() |
![]() |
#89 |
May 2018
2·11·13 Posts |
![]()
Wow! Another record already? That is amazing. Congratulations!
|
![]() |
![]() |
![]() |
#90 | |
Einyen
Dec 2003
Denmark
65678 Posts |
![]() Quote:
Code:
29*479909#/9699690-3531714+0 is 2-PRP! (1377.0026s+0.2389s) 29*479909#/9699690-3531714+0 is 31-PRP! (1406.6504s+0.2672s) 29*479909#/9699690-3531714+0 is 61-PRP! (1324.6448s+0.3519s) 29*479909#/9699690-3531714+0 is 89-PRP! (1351.6884s+0.1892s) 29*479909#/9699690-3531714+0 is 107-PRP! (1337.2569s+0.2194s) 29*479909#/9699690-3531714+0 is 127-PRP! (1295.6427s+0.2666s) 29*479909#/9699690-3531714+0 is Lucas PRP! (5028.9635s+0.3283s) 29*479909#/9699690-3531714+7186572 is 2-PRP! (1398.9850s+0.2509s) 29*479909#/9699690-3531714+7186572 is 31-PRP! (1325.3246s+0.2589s) 29*479909#/9699690-3531714+7186572 is 61-PRP! (1257.9103s+0.2403s) 29*479909#/9699690-3531714+7186572 is 89-PRP! (1253.9708s+0.2486s) 29*479909#/9699690-3531714+7186572 is 107-PRP! (1253.6129s+0.1967s) 29*479909#/9699690-3531714+7186572 is 127-PRP! (1316.4862s+0.3536s) 29*479909#/9699690-3531714+7186572 is Lucas PRP! (6843.9628s+0.2712s) Sorry, I'm not going to double check this gap just after finishing the other one. In the future I think it would be beneficial to start the sieving longer time before you want to use all the cores on the PRP tests and then let sieving run longer. Each PRP test takes 10-20 min on 1 core depending on the CPU, and I'm pretty sure sieving finds more than 6 factors per hour after 1e12, it is probably beneficial to 2e12 or even longer. Since the sieving is single threaded it is just a matter of starting it on 1 core like 1-2 weeks before you want to use lots of cores for all the PRP tests. Last fiddled with by ATH on 2022-04-17 at 18:19 |
|
![]() |
![]() |
![]() |
#91 |
Jun 2003
Suva, Fiji
7FA16 Posts |
![]()
I'm in Australia at present, awaiting my partners work visa application for Fiji. I'll be in Fiji for 2 years. I won't have my 16 core machine sadly, it would not cope with the heat and humidity. I'm hoping my old 8 core will, but it needs to be shipped, and won't be with me for a couple of months at a minimum.
|
![]() |
![]() |
![]() |
#92 |
Jan 2018
6E16 Posts |
![]() |
![]() |
![]() |
![]() |
#93 | |
Jan 2018
2·5·11 Posts |
![]() Quote:
I did sieve multiple gaps before I started PRP-ing them. After that I PRP-d 6 different gaps for 2 weeks and the ones that did not had any end points found, I searched seperately later, among this one. I did not sieve the interval further because of the dimininishing returns, i.e. the number of composites found decreased fairly fast already, not sure how much sieving till 2*10^12 would save ... After 70*10^10 the number of (new) composites that is found is around 0,0006% (6/1.000.000th) of the total candidates. Say 162 candidates for the primes between 69-70 * 10^10, in an interval of 25.306.551 candidates for a primorial of the first 42.000 primes. So extending the presieving till 10^12 is already a bit superfluous imho, doubling that till 2*10^12 seems excessive at the moment, but if (big if!) I will do another mega gap search I will keep this in mind. This record can be improved very easily if : a. there is a bignum library for the GPU b. a gpu is used for sieving and PRP-ing. If for instance the speed of a GPU core is half that of a cpu core, the number of available cores (1.000 - 10.000+) makes that job so much easier ... Note I still have not been able to get the GPU to run a gap search, I installed the necessairy programs under Ubuntu, but for the life of me I do not know how to tell the gapsearch program where they can be found ... |
|
![]() |
![]() |
![]() |
#94 | |
Jan 2018
6E16 Posts |
![]() Quote:
Forgive me the question, but I am curious: How did your mega gap turn out? Still running? Kind regards Michiel |
|
![]() |
![]() |
![]() |
#95 |
Dec 2008
you know...around...
23·109 Posts |
![]()
I could donate some cycles for PRPing (four OpenPFGW instances, each can check one number in about 13 minutes, ballpark).
Provided that someone else can do the sieving part. Or is a list of divisors > 10^10 (say) available, so I can sieve for the small factors myself and then take the numbers from that list? |
![]() |
![]() |
![]() |
#96 | |
Jun 2003
Suva, Fiji
2×1,021 Posts |
![]() Quote:
I'm only checking this forum about once a week at the mo. Too much going on! |
|
![]() |
![]() |
![]() |
#97 | |
Jun 2003
Suva, Fiji
2·1,021 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#98 | |
Jan 2018
11011102 Posts |
![]() Quote:
Kind regards Michiel |
|
![]() |
![]() |
![]() |
#99 | |
Jan 2018
2·5·11 Posts |
![]() Quote:
Maybe we can work out a smarter way? Doeing a sample check? I think the -a1 option of Pfgw also saves the outcome of a PRP, not sure, but maybe than we can spread the effort? Open for suggestions Kind regards Michiel |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Prime counting function records | D. B. Staple | Computer Science & Computational Number Theory | 50 | 2020-12-16 07:24 |
records for primes | 3.14159 | Information & Answers | 8 | 2018-12-09 00:08 |
Records for complete factorisation | Brian-E | Math | 25 | 2009-12-16 21:40 |
gmp-ecm records page question | yqiang | GMP-ECM | 6 | 2007-05-18 12:23 |
Records in January | wblipp | ElevenSmooth | 10 | 2004-03-22 01:26 |