Friday, 5 October 2007

222-digit SNFS completed with msieve

From the following link (by Greg Childers):
http://mersenneforum.org/showthread.php?p=115322#post115322
"The NFSNet factorization of 5^317-1 (SNFS difficulty of 222 digits) has been completed with msieve."
"...the runtime was just over 6 days"
Apparently this represents a real advance in speed of processing over the established suite for postprocessing large NFS sieve jobs. Thanks Jason (Papadopoulos)!

Thursday, 4 October 2007

Msieve 1.28

New version of msieve (by Jason Papadopoulos) now available.
Download from:
http://www.boo.net/~jasonp/qs.html

Mersennewiki

...also, there is the Mersennewiki, which has a factorization section at:
http://mersennewiki.org/index.php/Factorization

Wednesday, 3 October 2007

mersenneforum

I'd just like to draw people's attention to the 'factoring' section of the mersenneforum (at the following link) - it has certainly made very interesting reading for me at times in the past...
http://mersenneforum.org/forumdisplay.php?f=19

Tuesday, 2 October 2007

Msieve v1.27

New version of msieve (by Jason Papadopoulos) now available.
Download from:
http://www.boo.net/~jasonp/qs.html
Announcement at:
http://mersenneforum.org/showthread.php?p=115491#post115491

Monday, 1 October 2007

Fermat number factorizations

Speaking of Fermat number factorization - this page:
http://www.prothsearch.net/fermat.html
lists the current state-of-play.
Note that only F5-F11 have been completely factored. The smallest Fermat number with no known factors is F14, and the smallest Fermat number whose compositeness (ie factorizability) has not been proven is F33.
[for additional/preparatory reference - Wikipedia article on Fermat numbers: http://en.wikipedia.org/wiki/Fermat_number]

Factorization of tenth Fermat number in 1995

From Richard Brent's page:
http://wwwmaths.anu.edu.au/~brent/pub/pub161.html
"We describe the complete factorization of the tenth Fermat number F10 by the elliptic curve method (ECM). The tenth Fermat number is a product of four prime factors with 8, 10, 40 and 252 decimal digits. The 40-digit factor was found after about 140 Mflop-years of computation"