News
06122023
New factor found on Doublemersennes!!!
Phil Moore run Woltman's Prime95 software using the ECM option, and discovered that
ECM found a factor in curve #1, stage #2
Sigma=1539737887565536, B1=11000000, B2=1100000000.
M524287 has a factor: 4565880376922810768406683467841114102689
Phil did a probable prime test on the cofactor (157,677 decimal digits) which came back, as expected, as composite:
M524287/known_factors is not prime. RES64: AC1DA9BA4D9F1B8E. We4: 75DE95DD,00000000
Known factors used for PRP test were:
62914441,
5746991873407,
2106734551102073202633922471,
824271579602877114508714150039,
65997004087015989956123720407169,
4565880376922810768406683467841114102689
Cogratulation Phil!!!

13122013
The Deep Sieving subproject updated its
tables.
Each double Mersennes from MM34 to MM48 has its K presieved. Every K under 2,000,000 has been tested.

27102013
Aketilander posted the first primality test for a factor of MM48!

09092013
Serge Batalov found a titanic prime of more than 909,000 digits while chasing for factors of double Mersenne numbers.

07092013
Serge Batalov donated a new powerful PARI script to presieve large groups of Ks faster.
Thank you Serge!

06092013
Project DoubleMersennes started gathering the lists of prime factors found while testing double Mesennes possible factors.

05092013
LaurV extended the limit of K with status unknown for many double Mersenne numbers.

03092013
Serge Batalov scrolled down MM34 and MM35; Deep sieving project starts its chase for Top 5000 primes.

05022013
48th Mersenne prime number discovered!On January 25th at 23:30:26 UTC, the largest known prime number,
2^{57,885,161}1,
was discovered on Great Internet Mersenne Prime Search (GIMPS) volunteer Curtis Cooper's computer.
The new prime number, 2 multiplied by itself 57,885,161 times, less one, has 17,425,170 digits.

13122012
New release of mmff!George Woltman released
mmff v0.27.
 Bug in testing 187bit factors of MM127 fixed.
 lm makefile bug fixed
 With Batalov's help, the next set of 32 n values in k*2^n+1 Fermat factor testing is available (N<175)
As always previous savefiles wiln not work with 0.27 unless the nocheck argument is used.

25102012
Tony Forbes worked on MM(34) and MM(35) in 2005.
He sieved all k < 500,000 up to 20,000,000,000.
His work has been recorded and is ready to appear on Doublemersennes.org. Thank yoy Tony!

03102012
A
logo contest to embellish the logo of our project has been launched in the appropriate thread of MersenneForum.

03102012
Today a new "
News" page has been added to the site

01102012
A bug in the
number_format() function of PHP has been corrected.

29092012
Released
mmff version 0.26.
 MM31 is now supported.
 The "missing k" range output bug is probably fixed.

25092012
mmff_gfn, a software to search for GFN based on mmff kernel is under development.
Thank you
Serge Batalov!

24092012
Released
mmff version 0.25.
 The problem reported with autoselect GPUSievePrimes is fixed.
 The "exponentiation failure" bug where a tested k value is too small for the bitlevel being worked on is fixed.
 Exponentiation failures from testing k values that are too large should be fixed.
 The funny %g outputs are gone.
 Removed parts of mfaktc code.

24092012
A
new subproject has started.
We are searching for the biggest prime number that will not be a Mersenne number, trying to find a prime factor that divides MM47.
The name of the project is still unknown... Any ideas?

23092012
Although composite,
MM31 has been added to the list of the exponents searched by the project.

23092012
A new
Factors found page has been added to the site.
