mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2017-03-10, 21:45   #1
Uncle Lumpy
 
Mar 2017

3·5 Posts
Default Force 1st time primality test with mprime

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
Uncle Lumpy is offline   Reply With Quote
Old 2017-03-10, 23:03   #2
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

17·457 Posts
Default

Anything interesting in prime.log?
Prime95 is online now   Reply With Quote
Old 2017-03-10, 23:28   #3
Mark Rose
 
Mark Rose's Avatar
 
"/X\(‘-‘)/X\"
Jan 2013

293410 Posts
Default

Quote:
Originally Posted by Uncle Lumpy View Post
Any thoughts as to what's happening?
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.
Mark Rose is offline   Reply With Quote
Old 2017-03-10, 23:32   #4
Uncle Lumpy
 
Mar 2017

3×5 Posts
Default

Quote:
Originally Posted by Mark Rose View Post
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.
That's a really good question. I'm guessing they have not completed a double check in the past year. So after they complete the double check, they'll start doing LL tests? One of the machines has already downloaded a second exponent to double check...

Thanks for the info! I'll look into the assignment rules.

Best,
Lumpy
Uncle Lumpy is offline   Reply With Quote
Old 2017-03-10, 23:37   #5
Uncle Lumpy
 
Mar 2017

3×5 Posts
Default

Quote:
Originally Posted by Prime95 View Post
Anything interesting in prime.log?
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
Uncle Lumpy is offline   Reply With Quote
Old 2017-03-11, 03:27   #6
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

Cool feature, you learn things every day!
CRGreathouse is offline   Reply With Quote
Reply

Thread Tools


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

All times are UTC. The time now is 05:05.


Thu Jan 20 05:05:39 UTC 2022 up 180 days, 23:34, 0 users, load averages: 2.31, 1.73, 1.56

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔