[QUOTE=henryzz;246372]715*2^965837-1
Considering the amount of BSODs(finally solved all were driver related from 3 diffferent drivers) I have had lately it is nice to know my pc is stable enough to find primes. This is also my record prime by quite some way(2^850 previously)[/QUOTE]


That's not exactly what we want to see here...someone "wondering" whether his machine is stable enough to search for primes. :smile:

Regardless, congrats, David, on a nice big prime.

One more thing: Your proof code did not have NPLB in it. Can you create a new one that has NPLB in it and have Prof. Caldwell move the prime over to it? Thanks.


Gary

[QUOTE=gd_barnes;246383]That's not exactly what we want to see here...someone "wondering" whether his machine is stable enough to search for primes. :smile:

Regardless, congrats, David, on a nice big prime.

One more thing: Your proof code did not have NPLB in it. Can you create a new one that has NPLB in it and have Prof. Caldwell move the prime over to it? Thanks.


Gary[/QUOTE]
Just to clarify: driver-related BSODs (as henryzz's turned out to be) have no bearing on the stability of the CPU as it affects prime searches. Assuming his CPU is otherwise stable, there should be no problem.

603*2^981619-1 is prime

[QUOTE=gd_barnes;246383]One more thing: Your proof code did not have NPLB in it. Can you create a new one that has NPLB in it and have Prof. Caldwell move the prime over to it? Thanks.


Gary[/QUOTE]
I will get it changed. :smile: The problems were occuring while hibernating most of the time. There wouldn't have been a faulty savefile created as the shutdown wasn't expected.

393*2^1297402-1 is prime (390560 digits)

[QUOTE=henryzz;246592]I will get it changed. :smile: The problems were occuring while hibernating most of the time. There wouldn't have been a faulty savefile created as the shutdown wasn't expected.[/QUOTE]
How long does it usually take him to reply or fix? I messaged him through the website.

[QUOTE=henryzz;247205]How long does it usually take him to reply or fix? I messaged him through the website.[/QUOTE]
Usually he responds pretty quickly; he might have missed your note. I'd send him another one. While you're at it, though, you'll want to ask him to fix these other proof codes I just spotted:

-[url=http://primes.utm.edu/bios/code.php?code=L620]L620[/url] (Stevens, NPLB, LLR) should have Srsieve in it as well
-[url=http://primes.utm.edu/bios/code.php?code=L641]L641[/url] (Stevens, Rieselprime, LLR) doesn't have a sieve program in it either--presumably Srsieve?

Not meaning to nitpick--may as well kill two (er, three) birds with one stone. :smile:

[QUOTE=henryzz;247205]How long does it usually take him to reply or fix? I messaged him through the website.[/QUOTE]

I usually personally Email him. He almost always responds in less than a day.

[QUOTE=gd_barnes;247344]I usually personally Email him. He almost always responds in less than a day.[/QUOTE]
I believe the website sends an email to his address, so the end result would be the same. In my experience, I've gotten responses from him pretty quickly using that form too.

[QUOTE=henryzz;247205]How long does it usually take him to reply or fix? I messaged him through the website.[/QUOTE]

What is going on with the 715*2^965837-1 prime ?

Now the prime shows found by Dennis Schreiber and is credited to PrimeGrid. David, can you please check with Prof. Caldwell again?

Keep in mind that you need to create a brand new proof code and request that Prof. Caldwell transfer the prime to it. He will not want to add software or projects to an already existing proof code.

Thank you.

765*2^987829-1 (297370 digits)