PRIVATE GFN SERVER

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

Why PRIVATE GFN SERVER?

This is a PRIVATE SERVER to coordinate distribution of some mathematical work on Generalized Fermat numbers (GFN).

Goal

The server is open for everybody, but some BOINC experience is recommended because there is no help, no support, no forum and no badges.

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)