PRIVATE GFN SERVER

PRIVATE GFN SERVER is a volunteer computing project researching numbers of the form <math>a^{2^{ \overset{n} {}}} \!\!+ b^{2^{ \overset{n} {}}}</math> with a, b any coprime integers, a > b > 0 - Generalized Fermat numbers.

Why PRIVATE GFN SERVER?

• why this topic/object of study?

Goal

• summarize the objectives and challenges which the project addresses, before jumping into details

Methods

• always including "why BOINC"?
• impactful final statement

Project team / Sponsors

'stream' with help of PrimeGrid community.

Scientific results

Projects Statistic (active)

• GFN-12/13/14 primes per project
• LLR2/PRST tests (all LLR2/PRST projects)
• Factorial / Primorial Sieve

Projects Statistic (archived)

• GFN-11 First MEGA prime search
• GFN-12 First MEGA prime search
• GFN-13 First MEGA prime search
• GFN-14 First MEGA prime search
• GFN-15 First MEGA prime search
• GFN-16 First MEGA prime search
• GFN-12 Prime Search - Final statistic (0-2000M)
• GFN-13 Prime Search - Final statistic (0-400M)
• GFN-13 Consecutive Primes Hunt
• GFN-14 Prime Search - Final statistic (0-400M)
• GFN-14 Consecutive Primes Hunt Part 1 (22M-65M)
• GFN-14 Consecutive Primes Hunt Part 2 (65M-400M)