[QUOTE=Batalov;379353]Haven't seen this warning before. :rolleyes:
And maybe will never see again.

It has more than 2 million digits.[/QUOTE]

:bow:

Incredibly awesome!

Beautiful! Congrats Serge!

Thanks! Additional thanks to Dmitry "unconnected" Domanov who drove this base to 600k previously.

The proof code is new (credit to RPS files is due), but here's the direct link now:
37·2[SUP]6660841[/SUP]-1 ([URL="http://primes.utm.edu/primes/page.php?id=118270"]2,005,115 digits[/URL])

Congratulation Batalov. This means that base 1024 is now a 1 k remaining base. Did you know that you could see such a warning again, if you decide to prime k=29 for base 1024? :wink:

May I suggest that someone creates a MegaPrime list either here as a sub thread or as a subpage on the CRUS website... anyone who will be able to do such a list? :smile:

Take care

Kenneth

Brilliant find! Congratulations to Serge!

:groupwave:

[QUOTE=Batalov;379363]Thanks! Additional thanks to Dmitry "unconnected" Domanov who drove this base to 600k previously.

The proof code is new (credit to RPS files is due), but here's the direct link now:
37·2[SUP]6660841[/SUP]-1 ([URL="http://primes.utm.edu/primes/page.php?id=118270"]2,005,115 digits[/URL])[/QUOTE]

OUTSTANDING!! Way to go Serge! Also thank you to Dimtry for previous searching and for helping with the proof. It's interesting that it turned out to be just over 2M digits.

On an exciting side note, CRUS has now moved ahead of PSP into 5th place on the project scores list. Great work everyone!

:party::bounce wave::bow wave::groupwave::joe o::george:

[QUOTE=Batalov;379363]The proof code is new (credit to RPS files is due), but here's the direct link now:
37·2[SUP]6660841[/SUP]-1 ([URL="http://primes.utm.edu/primes/page.php?id=118270"]2,005,115 digits[/URL])[/QUOTE]

Congratulations on such a large find and a top 25 to boot. Job well done!

I noticed that this new proof code does not list the sieve effort, although it does list the sieve programs. This is not unique as there are hundreds of other primes that share the same phenomenon. What makes this submission different is that it credits a project for simply providing the file from the sieve effort. I'm interested to learn the reasoning for this decision. Shouldn't it only list CRUS?

[QUOTE=jmblazek;379657]... I'm interested to learn the reasoning for this decision. Shouldn't it only list CRUS?[/QUOTE]
"Ask not what your project can do for you, ask what you can do for your project," I think.

[URL="http://primes.utm.edu/bios/code.php?code=L426"]Cruelty[/URL], [URL="http://primes.utm.edu/bios/code.php?code=L3345"]unconnected[/URL], [URL="http://primes.utm.edu/bios/code.php?code=L1959"]amphoria[/URL], [URL="http://primes.utm.edu/bios/code.php?code=L2484"]Thomas11[/URL], and many others also apparently received [B]nothing[/B] from RPS (as you suggest), but they include it in their proof-code, don't they?

Why? Maybe for the same reason, maybe not. Why not ask them to remove RPS from their proof-codes just as well -- and hear their answers?

When Rieselprime will advance with k=29 and k=37, they will be able to use [URL="http://mersenneforum.org/showpost.php?p=368825&postcount=1777"]this data[/URL] and [URL="http://mersenneforum.org/showpost.php?p=379230&postcount=1837"]this data[/URL] to save a significant fraction of work.
On all powers of 2, CRUS and RPS have an overlap and a synergy; work is not done twice.

As for sieving, [URL="http://mersenneforum.org/showthread.php?t=19170"]based on my previous experience[/URL] with k=41 and k=243, I did sieve to the optimal depth and it was a fraction of total time.
Additional savings from using the 21P sieve file were an even smaller fraction.
The good news is that the sieve file seems fine now.

"...of course, that's just my opinion. I could be wrong." (c)

My apologies. I was not aware that you personally sieved that k. From your post it appeared that credit was being given to RPS for the file. So, if it's not for their sieve file, why still credit RPS? Is it because they "manage" k=37?

2172*117^180355+1 is prime

4k's left for S117.

I will post an update in a couple of weeks when I get to a round n.

Finally found a big one. From port 1400:

84363*2^2222321+1 is prime!

This is >50% larger than any prime that I have ever found. :bounce:

I just so happened to see this pop up on my main desktop machine. It has been proven prime but hasn't yet been reported to the server because it looks like it is checking to see if it is a GF factor of anything. It appears like that will take a couple of hours. I'm not exactly sure how that works.