www.pgnfs.org
"The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. [...]
The dignity of the science itself seems to require that every possible means be explored for the solution of a problem so elegant and so celebrated."
 Carl Friedrich Gauss (1777-1855)
Navigation


Valid HTML 4.0!

Valid CSS!
Results

Here is some of the results obtained with pGNFS.

When the code has been optimized further and the last few quirks have been solved I will give some more details of the results and by time make user submissions possible.

Numbers factored with pGNFS:

  • The 10 digit number: 2352854039
    into factors: 56003 42013
  • The 20 digit number: 8229944909131434961
    into factors: 3497856121 2352854041
  • The 40 digit number: 982301348481615682763349336546115836409
    into factors: 20989897656489026809 46798767890987654401
  • Currently a 60 digit number is in the sieving step...
News
Updated: 07-12-2005
  • Detailed plan for further development is in progress.
  • Defense of thesis was successfully held on December 2nd. Slides here (in danish).
  • Handed in thesis.
  • Uploaded pGNFS-0.3.
  • Finished thesis.
  • Uploaded source.