![]() |
|
|
#1 |
|
Mar 2017
2·7 Posts |
Hi...first time poster.
![]() I've been running Prime95/mprime for a long, long time (since we had to contact George directly to check out exponents to test). I just noticed that I have 2 machines which simply will not do a 1st time primality check--both machines default to double checking. They are both 2-year old quad core Xeon machines so I would think they'd still be fast enough to do first time testing. They default to double checking even if I set mprime "type of work to get" to 100. Any thoughts as to what's happening? Thanks, Lumpy |
|
|
|
|
|
#2 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
1D6D16 Posts |
Anything interesting in prime.log?
|
|
|
|
|
|
#3 |
|
"/X\(‘-‘)/X\"
Jan 2013
293010 Posts |
Have they completed a double check in the last year? That's the default is to perform one double check per year to find out quickly if a machine is working incorrectly -- both to notify the user and for the project to double check machine's work ahead of time. Since newly registered machines haven't done a double check, that's the first assignment they get.
You can change the setting under Assignment Rules if you don't want to do those double checks. |
|
|
|
|
|
#4 | |
|
Mar 2017
2·7 Posts |
Quote:
Thanks for the info! I'll look into the assignment rules. Best, Lumpy |
|
|
|
|
|
|
#5 |
|
Mar 2017
E16 Posts |
Oooops! Thanks for the heads up, George. I guess I should have looked at the log before posting since it says right in there that it's doing a double-check for the "yearly hardware check."
Still learning after 21 years of working with GIMPS, Lumpy |
|
|
|
|
|
#6 |
|
Aug 2006
3×1,993 Posts |
Cool feature, you learn things every day!
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Modifying the Lucas Lehmer Primality Test into a fast test of nothing | Trilo | Miscellaneous Math | 25 | 2018-03-11 23:20 |
| How do first-time and double-check primality tests work? | ChemicalCat59 | Information & Answers | 9 | 2017-03-23 11:14 |
| AKS Primality Test | Guilherme | Math | 2 | 2004-11-26 05:29 |
| A primality test for Fermat numbers faster than Pépin's test ? | T.Rex | Math | 0 | 2004-10-26 21:37 |
| AKS - A polynomial-time algorithm for testing primality. | Maybeso | Math | 11 | 2002-11-20 23:39 |