Author 
Message 

Hi,
[Edit: Updated goal at the end]
2020 is near its end and it was a astonishing year for Primegrid, with a lot of new records, new applications, new staff, new....
Talking about statistics, what can we expect or wish for next year?
With LLR2 application, we almost double the computation power, say 80%.
Looking at the 2020 current results (even if Nov+Dec were already on LLR2 and Dec not finished):
++++
  MP#  
 ++++++++++++ Total 
  Jan  Feb  Mar  Apr  May  Jun  Jul  Aug  Sep  Oct  Nov  Dec  
+++++++++++++++
 Total  14  44  12  9  17  6  8  8  8  17  16  2  161 
+++++++++++++++
161 + 80% = 289 MP. Rounded to 300 (+11)
Primegrid current total of MP is 566. 566 + 289 = 855 MP (rounded to 900, +45)
I suggest first goal of 300 MP for 2021. Challenging? Irrealist?
Second one, a global MP for PG about 900 MP. That implies a target of 345 MP for 2021... Ouch... That's a real challange. :)
To beat 2020 record is not a challenge for 2021. With the new application, it should be easy.
About secondary challenge for 2021:
2020  Found 2 primes in ESP, TRP, PSP or SOB projects: Found only 1. We can keep this one for 2021
We can add one for 321/27/121. The 2 that were found in 2020 were new one since 8 years or 3 years..... We can expect one more or add a challenging goal of 2.
No prime for Primorial or Factorial for years now. But they are PSA projects. Add one for challenge.
CUL/WOO project: One?
G20, we don't find one this year (yet) but already found 2, one by year. We can set a global challenge for G20/21/...: 2
To resume:
 Found 300 MP
 Reach the 900 Mega Primes overall (> 345 MP!!)
 Found 2 primes in ESP, TRP, PSP or SOB projects
 Found 2 primes in 27, 121 or 321 projects
 Found 1 primes in Cullen or Woodall projects
 Found 1 prime in Primorial or Factorial projects
 Found 2 primes for G20 or higher projects
What do you think? Step too high?
Do you have other proposals?
[Live updating goals for 2021]
 Find 500 MP
 Reach the 1000 Mega Primes overall (> 434 MP)
 Find 2 primes in TRP project
 Find 1 prime in 27, 121 or 321 projects
 Find 1 prime in Cullen or Woodall projects
 Find 1 prime in Primorial or Factorial projects
 Find 2 primes for G20 or higher projects
 Find 1 Fermat Divisor
 Find a croreprime or a hebdoprime (10 MP)
 Find 100 PPSMEGA
 Find 100 GFN17
 Reach 2,000,000 Workunits completed (Pending)
____________
Badge Score: 2*2 + 9*5 + 4*6 + 3*7 + 2*8 + 1*9 = 119 



I like your ideas:
 Found 300 MP
 Reach the 900 Mega Primes overall (> 345 MP!!)
 Found 2 primes in ESP, TRP, PSP or SOB projects
 Found 2 primes in 27, 121 or 321 projects
 Found 1 primes in Cullen or Woodall projects
 Found 1 prime in Primorial or Factorial projects
 Found 2 primes for G20 or higher projects
But I think, that we maybe should have it look like this:
 Find 300 MP
 Reach the 900 Mega Primes overall (> 345 MP!!)
 Find 2 primes in TRP project *
 Find 1 prime in 27, 121 or 321 projects **
 Find 1 prime in Cullen or Woodall projects
 Find 1 prime in Primorial or Factorial projects
 Find 2 primes for G20 or higher projects
* The reason behind this, is that we need to sieve ALL base 2 conjectures together, in the future, so to increase speed and efficiency of that sieve, we need to put a much higher focus on TRP, compared to ESP, PSP and SoB. 2 primes is not unachieveable, since TRP is the most primelikely conjecture  but it will require a 14 day challenge and some users putting their focus on TRP during TourDePrimes :)
** Lowered, due to being unattainable. 2 primes in total for these 3 low prime producing projects, simply is to optimistic. The users may prove me wrong, but 1 seems more realistical (even though it may also fail to be achieved).
Maybe add this goal:
 Reach 2,000,000 Workunits completed on TRP (May in itself, resolve the "Find 2 primes in TRP project" goal)
Just my thoughts :) 


Scott BrownVolunteer moderator Project administrator Volunteer tester Project scientist
Send message
Joined: 17 Oct 05 Posts: 2165 ID: 1178 Credit: 8,777,295,508 RAC: 0

I think you might add find 1 Fermat Divisor as a goal. Improbable, but not impossible as we continue to push the DIV project with LLR2.



Dave Send message
Joined: 13 Feb 12 Posts: 2829 ID: 130544 Credit: 954,747,840 RAC: 0

I will be doing WW for as long as possible whilst also bringing LLRs up to their next million levels. Interjected by challenges of course. TdP I dunno yet. 


Yves GallotVolunteer developer Project scientist Send message
Joined: 19 Aug 12 Posts: 644 ID: 164101 Credit: 305,010,093 RAC: 0

A 10 Mega prime is THE goal for 2021!!! SOB or GFN21 (or better!).
In 2021, more than 1000 megaprimes will be known, there is no doubt about that: a mega is not a challenge anymore.
The first 10M was found in 2008, it is now time to get down to serious work ;o) 



...
In 2021, more than 1000 megaprimes will be known, there is no doubt about that: a mega is not a challenge anymore.
...
Indeed.
Even I got one, ha.
____________
"Accidit in puncto, quod non contingit in anno."
Something that does not occur in a year may, perchance, happen in a moment. 


PDWSend message
Joined: 14 Nov 14 Posts: 16 ID: 373199 Credit: 1,583,824,290 RAC: 0

In 2021, more than 1000 megaprimes will be known, there is no doubt about that: a mega is not a challenge anymore.
Really ?
Having got the smallest megaprime I was aiming for an even smaller one in 2021 ! 



 Reach the 900 Mega Primes overall (> 345 MP!!)
Maybe we can round this one up to 365 mega primes overall? (average of 1 mega prime / day) 



A 10 Mega prime is THE goal for 2021!!! SOB or GFN21 (or better!).
In 2021, more than 1000 megaprimes will be known, there is no doubt about that: a mega is not a challenge anymore.
The first 10M was found in 2008, it is now time to get down to serious work ;o)
We need to decide if a 10'000'000digit prime is to be called a croreprime or a hebdoprime. /JeppeSN 



A 10 Mega prime is THE goal for 2021!!! SOB or GFN21 (or better!).
In 2021, more than 1000 megaprimes will be known, there is no doubt about that: a mega is not a challenge anymore.
The first 10M was found in 2008, it is now time to get down to serious work ;o)
We need to decide if a 10'000'000digit prime is to be called a croreprime or a hebdoprime. /JeppeSN
You have my vote for hebdoprime. I love metric and I love obsolete terms, so this one ticks both boxes :) 


Yves GallotVolunteer developer Project scientist Send message
Joined: 19 Aug 12 Posts: 644 ID: 164101 Credit: 305,010,093 RAC: 0

We need to decide if a 10'000'000digit prime is to be called a croreprime or a hebdoprime. /JeppeSN
In French, hebdo means weekly... a weekly prime :o(
I like crore, it's important to remember that there are different numbering systems.



robishVolunteer moderator Volunteer tester
Send message
Joined: 7 Jan 12 Posts: 1774 ID: 126266 Credit: 5,066,569,935 RAC: 0

New term "Hardcrore" ;)
or "really difficult to get, really big prime" :P
____________
My lucky numbers 1059094^{1048576}+1 and 224584605939537911+81292139*23#*n for n=0..26 


GDBSend message
Joined: 15 Nov 11 Posts: 240 ID: 119185 Credit: 2,577,314,587 RAC: 0

How about 10MdP for 10 Million digit Prime?
____________




We need to decide if a 10'000'000digit prime is to be called a croreprime or a hebdoprime. /JeppeSN
In French, hebdo means weekly... a weekly prime :o(
I like crore, it's important to remember that there are different numbering systems.
Both senses of "hebdo" are derived from a Greek word meaning seventh. A weekly magazine is a magazine that comes out every seventh day. And the number 10,000,000 (written as 1,00,00,000 in South Asia) is the seventh power of ten.
Search for croreprimes (hebdoprimes). Where are PrimeGrid's? ;)
/JeppeSN 



First Post updated according to your comments
To reach the goal of 1000 MP overall, with current status, that means we need to find 434 new MP next year (minus December findings).
So I've rounded the overall goal to 500 new MP for next year :)
____________
Badge Score: 2*2 + 9*5 + 4*6 + 3*7 + 2*8 + 1*9 = 119 



Maybe add this goal:
 Reach 2,000,000 Workunits completed on TRP (May in itself, resolve the "Find 2 primes in TRP project" goal)
Just my thoughts :)
I've added it to the list, but I don't know where to get this information :)
[Edit] I think I found it. The 'Total' 'Complete' info in the TRP sub project page.
____________
Badge Score: 2*2 + 9*5 + 4*6 + 3*7 + 2*8 + 1*9 = 119 



Add:
 Find 100 PPSMEGA
 Find 100 GFN17
____________
Badge Score: 2*2 + 9*5 + 4*6 + 3*7 + 2*8 + 1*9 = 119 


BurVolunteer tester
Send message
Joined: 25 Feb 20 Posts: 332 ID: 1241833 Credit: 22,611,276 RAC: 0

All good goals, I especially root for those three:
 Find 1 prime in Cullen or Woodall projects
 Find 1 prime in Primorial or Factorial projects
 Find 1 Fermat Divisor
Only 9000 WUs left in Factorial prime search until 279999! +1 and last prime was around 208000!, so I'm pessimistic anything will turn up before the project stops. Would be nice to have the largest factorial back to PG though.
Cullen is overdue though. Largest known one is from 11.5 years ago with n ~ 6 million, now we've reached 20 million. Almost 14 million composite numbers in a row...
And Fermat divisors are just a very nice thing to me. Fermat would probably never have imagined that 400 years later people would use machines to compute divisors of Fermat numbers.
____________
Primes: 1281979 & 12+8+1979 & 1+2+8+1+9+7+9 & 1^2+2^2+8^2+1^2+9^2+7^2+9^2 & 12*8+19*79 & 12^81979 & 1281979 + 4 (cousin prime) 


rogueVolunteer developer
Send message
Joined: 8 Sep 07 Posts: 1218 ID: 12001 Credit: 18,565,548 RAC: 0

Only 9000 WUs left in Factorial prime search until 279999! +1 and last prime was around 208000!, so I'm pessimistic anything will turn up before the project stops. Would be nice to have the largest factorial back to PG though.
For factorial/primorial I believe that they were sieved to much higher n than what is loaded into the server.
Since these are not BOINC projects, the question will be whether or not PRPNet can handle large numbers of users trying to get work at the same time. I think it will be okay as long as there are not more than a few connections per second, but since it is PRPNet and not BOINC, I would not expect as much participation.
I suspect that neither of these projects is sieved deeply enough. mfsieve and psieve now have AVX code (up to 2^52) which was a nice performance boost. No AVX2 code yet (as I don't have an AVX2 cpu to test on). I think that mfsievecl (with OpenCL support) will be faster than mfsieve (with AVX), but I haven't compared the speed. 


RafaelVolunteer tester
Send message
Joined: 22 Oct 14 Posts: 885 ID: 370496 Credit: 334,085,845 RAC: 0

Goals for 2021:
Break DO servers in the middle of a challenge (again).
Find a CUL / Woo Prime.
Find the first GFN21 prime.
Bring back GFN Manual Sieve, this time as Boinc Project.
Have the second user achieve the Shut Up! badge :) 



Only one, the rest better cancel: push SoB forward up to sieve files runout.
____________



robishVolunteer moderator Volunteer tester
Send message
Joined: 7 Jan 12 Posts: 1774 ID: 126266 Credit: 5,066,569,935 RAC: 0

Goal for 2021
Find the first GFN21 prime.
Also was goal for 2018, 2019 and 2020, but its gotta happen sometime ;)
Over 30% the way there so .....any day now Ã°Å¸â„¢Æ’
____________
My lucky numbers 1059094^{1048576}+1 and 224584605939537911+81292139*23#*n for n=0..26 



I think some of the posted goals will require some extended Challenges to get enough work done to get to the goals, otherwise too many people will haphazardly crunch for something they like or what fits their own needs at the time. 


rogueVolunteer developer
Send message
Joined: 8 Sep 07 Posts: 1218 ID: 12001 Credit: 18,565,548 RAC: 0

Complete search for Wieferich search to 2^64. This will require updated software. 



Bring back GFN Manual Sieve, this time as Boinc Project.
Well then it's not manual anymore... :P
____________
SHSID Electronics Group
SHSIDElectronicsGroup@outlook.com
GFN14: 50103906^16384+1
Proth "SoB": 44243*2^440969+1



Michael GoetzVolunteer moderator Project administrator
Send message
Joined: 21 Jan 10 Posts: 13513 ID: 53948 Credit: 236,960,660 RAC: 0

Bring back GFN Manual Sieve, this time as Boinc Project.
Well then it's not manual anymore... :P
Also, any discussion of GFN sieving (or LLR sieving) needs to be done in the context of fast proof checking and the fact that at some point we'll no longer be running GFN double check tasks. That cuts the optimal sieving point in half, and therefore cuts not only the Genefer time in half, but the sieving time in half too.
Bottom line is if we didn't need sieving before, we certainly don't now.
____________
My lucky number is 75898^{524288}+1 


RafaelVolunteer tester
Send message
Joined: 22 Oct 14 Posts: 885 ID: 370496 Credit: 334,085,845 RAC: 0

Bring back GFN Manual Sieve, this time as Boinc Project.
Well then it's not manual anymore... :P
Also, any discussion of GFN sieving (or LLR sieving) needs to be done in the context of fast proof checking and the fact that at some point we'll no longer be running GFN double check tasks. That cuts the optimal sieving point in half, and therefore cuts not only the Genefer time in half, but the sieving time in half too.
Bottom line is if we didn't need sieving before, we certainly don't now.
I was under the impression that GFN23 was nowhere near close to optimal, if we ever got to need it for DYFL, and was only really closed as a result of manual sieve being closed in general. 


Michael GoetzVolunteer moderator Project administrator
Send message
Joined: 21 Jan 10 Posts: 13513 ID: 53948 Credit: 236,960,660 RAC: 0

Bring back GFN Manual Sieve, this time as Boinc Project.
Well then it's not manual anymore... :P
Also, any discussion of GFN sieving (or LLR sieving) needs to be done in the context of fast proof checking and the fact that at some point we'll no longer be running GFN double check tasks. That cuts the optimal sieving point in half, and therefore cuts not only the Genefer time in half, but the sieving time in half too.
Bottom line is if we didn't need sieving before, we certainly don't now.
I was under the impression that GFN23 was nowhere near close to optimal, if we ever got to need it for DYFL, and was only really closed as a result of manual sieve being closed in general.
We've hardly done any GFN 23 sieving, but to get started, you don't need to be "optimal". The way sieving works, you find most of the factors you're ever going to find in the first week or even the first hour of sieving.
So while it may not be optimal, it's definitely usable.
____________
My lucky number is 75898^{524288}+1 


BurVolunteer tester
Send message
Joined: 25 Feb 20 Posts: 332 ID: 1241833 Credit: 22,611,276 RAC: 0

For factorial/primorial I believe that they were sieved to much higher n than what is loaded into the server.
I always assumed that was the sieve depth, all the better if not.
Since these are not BOINC projects, the question will be whether or not PRPNet can handle large numbers of users trying to get work at the same time. I think it will be okay as long as there are not more than a few connections per second, but since it is PRPNet and not BOINC, I would not expect as much participation.
I don't think many users know or care about these goals. And if it involves setting up PRPnet, even less will want to participate. Factorials are around 10^1 300 000 now, which makes the prime probability of one of them approximately 1:280 000. Not taking into account that the probability is ever decreasing with increasing n, another one should appear before we reach n = 300 000 (as we check both + and ). At the current rate this means a couple of years though...
I suspect that neither of these projects is sieved deeply enough. mfsieve and psieve now have AVX code (up to 2^52) which was a nice performance boost. No AVX2 code yet (as I don't have an AVX2 cpu to test on). I think that mfsievecl (with OpenCL support) will be faster than mfsieve (with AVX), but I haven't compared the speed.
The "up to 2^52" means prime factors up to limit can be used? And do you know up to which n and which p the factorials/primorials have been sieved? I think I asked that before, but have a hazy recollection of nobody knowing for sure.
I would like to try if mfsievecl works well beyond current ranges. Do you have win64 binaries? On the other hand, maybe it should stay at PSA, so the WW subproject gets all the GPU power... ;)
____________
Primes: 1281979 & 12+8+1979 & 1+2+8+1+9+7+9 & 1^2+2^2+8^2+1^2+9^2+7^2+9^2 & 12*8+19*79 & 12^81979 & 1281979 + 4 (cousin prime) 


rogueVolunteer developer
Send message
Joined: 8 Sep 07 Posts: 1218 ID: 12001 Credit: 18,565,548 RAC: 0

You can find the mtsieve source and all Windows binaries using the framework here: https://sourceforge.net/projects/mtsieve/ 


BurVolunteer tester
Send message
Joined: 25 Feb 20 Posts: 332 ID: 1241833 Credit: 22,611,276 RAC: 0

I was searching for mfsieve, didn't know it was part of mtsieve, thanks.
The prime limit of 2^52 is probably the reason why sieving came to an end.
Sorry for OT...
____________
Primes: 1281979 & 12+8+1979 & 1+2+8+1+9+7+9 & 1^2+2^2+8^2+1^2+9^2+7^2+9^2 & 12*8+19*79 & 12^81979 & 1281979 + 4 (cousin prime) 


rogueVolunteer developer
Send message
Joined: 8 Sep 07 Posts: 1218 ID: 12001 Credit: 18,565,548 RAC: 0

I was searching for mfsieve, didn't know it was part of mtsieve, thanks.
The prime limit of 2^52 is probably the reason why sieving came to an end.
Sorry for OT...
It shouldn't be too hard to support up to 2^62, although AVX code cannot be used between 2^52 and 2^62. 



I was searching for mfsieve, didn't know it was part of mtsieve, thanks.
The prime limit of 2^52 is probably the reason why sieving came to an end.
Sorry for OT...
It shouldn't be too hard to support up to 2^62, although AVX code cannot be used between 2^52 and 2^62.
This has me quite curious.
Please, explain more!
____________
Eating more cheese on Thursdays. 


Yves GallotVolunteer developer Project scientist Send message
Joined: 19 Aug 12 Posts: 644 ID: 164101 Credit: 305,010,093 RAC: 0

It shouldn't be too hard to support up to 2^62, although AVX code cannot be used between 2^52 and 2^62.
This has me quite curious.
Please, explain more!
AVX2 instruction set has no 64bit multiplication. Four 64bit integers can be added or subtracted but the multiplication is 32x32 => 64.
For this reason, basic 64bit integer instructions are faster. If four primes are tested simultaneouly, the latency of the MUL operation (34 cycles) can be hidden and the throughput is 1 cycle.
The best algorithm for sieving is Montgomery modular multiplication. The modular multiplication of two numbers for any p < 2^64 is calculated with 3 multiplications, 1 subtraction and 1 conditional addition. The theoretical speed limit of the modular multiplication of two 64bit integers is 3 cycles because the subtraction and conditional addition can be executed in parallel on another unit of the core. It's difficult to achieve because of the small number of registers of x64 but with hyperthreading, we are close to the limit. 



Is it related to the fact that the doubleprecision floatingpoint format uses 52 bits (out of 64) for its mantissa component? /JeppeSN 


Yves GallotVolunteer developer Project scientist Send message
Joined: 19 Aug 12 Posts: 644 ID: 164101 Credit: 305,010,093 RAC: 0

Is it related to the fact that the doubleprecision floatingpoint format uses 52 bits (out of 64) for its mantissa component? /JeppeSN
Yes. x mod p = x  p * [x/p]. With FP64, p_inv = 1.0/p can be precomputed and x mod p = x  p * [x * p_inv]. This is a FP implementation of Barrett reduction.
AVX instruction set can test four primes simultaneouly. 


rogueVolunteer developer
Send message
Joined: 8 Sep 07 Posts: 1218 ID: 12001 Credit: 18,565,548 RAC: 0

I can modify the main loop (which is in asm) to use extended floating point, (which is x86 only) to support sieving p up to 2^62. 


rogueVolunteer developer
Send message
Joined: 8 Sep 07 Posts: 1218 ID: 12001 Credit: 18,565,548 RAC: 0

I can modify the main loop (which is in asm) to use extended floating point, (which is x86 only) to support sieving p up to 2^62.
Actually I do have extended floating point code, but am not using it, probably because mmx is faster, but the mmx code is only used for p < maxn.
As I think about this, there is an optimization to save on some mulmods. I'll think about that some more. 



We've hardly done any GFN 23 sieving, but to get started, you don't need to be "optimal". The way sieving works, you find most of the factors you're ever going to find in the first week or even the first hour of sieving.
So while it may not be optimal, it's definitely usable.
S out of curoisity is there a GFN24 thru GFN100 etc set of numbers to crunch at some point in the future? I'm not asking for a time frame just IF there are possible prime numbers that fit into those categories too. 


Yves GallotVolunteer developer Project scientist Send message
Joined: 19 Aug 12 Posts: 644 ID: 164101 Credit: 305,010,093 RAC: 0

S out of curoisity is there a GFN24 thru GFN100 etc set of numbers to crunch at some point in the future? I'm not asking for a time frame just IF there are possible prime numbers that fit into those categories too.
Technically speaking, these GFN exponents can be sieved. But the size of the remaining candidates grows quickly and the primality test of these numbers can't yet be computed in a reasonable amount of time.
Because of rapid advances in hardware technology, it's unnecessary to sieve a range that will be tested in 10 or 20 years' time.
GFN22 > 25M digits
GFN23 > 50M digits
GFN24 > 100M digits
GFN25 > 250M digits
GFN26 > 500M digits
GFN27 > 1000M digits 


BurVolunteer tester
Send message
Joined: 25 Feb 20 Posts: 332 ID: 1241833 Credit: 22,611,276 RAC: 0

I can modify the main loop (which is in asm) to use extended floating point, (which is x86 only) to support sieving p up to 2^62. That sounds good. We'd have to find out though, how big the current pools is. Does it end where PRPnet currently says it does, ot is there a reserve of unprepared candidates.
Especially if fact/primorials will ever be moved to PG more sieving would be required.
Since this is really offtopic, I opened a new thread: PSA forum
____________
Primes: 1281979 & 12+8+1979 & 1+2+8+1+9+7+9 & 1^2+2^2+8^2+1^2+9^2+7^2+9^2 & 12*8+19*79 & 12^81979 & 1281979 + 4 (cousin prime) 



S out of curoisity is there a GFN24 thru GFN100 etc set of numbers to crunch at some point in the future? I'm not asking for a time frame just IF there are possible prime numbers that fit into those categories too.
Technically speaking, these GFN exponents can be sieved. But the size of the remaining candidates grows quickly and the primality test of these numbers can't yet be computed in a reasonable amount of time.
Because of rapid advances in hardware technology, it's unnecessary to sieve a range that will be tested in 10 or 20 years' time.
GFN22 > 25M digits
GFN23 > 50M digits
GFN24 > 100M digits
GFN25 > 250M digits
GFN26 > 500M digits
GFN27 > 1000M digits
Thank you 

