mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > And now for something completely different

Reply
 
Thread Tools
Old 2020-07-05, 19:25   #12
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

106A16 Posts
Default

Quote:
Originally Posted by ryanp View Post
I decided to fire up certification of M78737 with Primo, using 64 processes. Hopefully no one else is already running this!

The machine it's running on is a 3Ghz, 36-core/72-thread system. Anyone have a rough sense of how long this should take?

(Addendum: it would be great if Primo was open-source... I'd love to understand more about these "stk4321" processes it spawns. If I could farm these out to a cluster and then feed the results back in, presumably this could go a lot faster).
2-3 weeks, maybe a month.

Last fiddled with by paulunderwood on 2020-07-05 at 19:34
paulunderwood is offline   Reply With Quote
Old 2020-08-07, 22:40   #13
Gelly
 
Gelly's Avatar
 
May 2020

47 Posts
Talking

Quote:
Originally Posted by Gelly View Post

I'll reserve 10^25333-2*10^5182-3 (PRP25333) because it looks silly and it'll force myself into 9th on ECPP.
It's done! Precise count is 3934149s (45.5 days), although I had another decent power outage that had it not working for about a day. Seems like it saved the time stats correctly, though! Uploaded on FactorDB - though, it seems like it's having a hard time starting processing on it, so it's currently not there. Not worried, though - I'm sure it'll make it to processing eventually.

Quote:
Originally Posted by paulunderwood View Post
You might want to certify some top20 Mersnne co-factors. The available ones are here.
Probably more appropriate than silly-lookin PRPs. Since Ryan's got M78737, I will do the certification of M84211 (PRP25291). Good size, leaves the gap for M82939, in case anyone wants to cert a slightly smaller PRP, and I also just like how M84211 visually looks.
Gelly is offline   Reply With Quote
Old 2020-08-08, 00:06   #14
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

2·11·191 Posts
Default

Quote:
Originally Posted by Gelly View Post
It's done! Precise count is 3934149s (45.5 days), although I had another decent power outage that had it not working for about a day. Seems like it saved the time stats correctly, though! Uploaded on FactorDB - though, it seems like it's having a hard time starting processing on it, so it's currently not there. Not worried, though - I'm sure it'll make it to processing eventually.



Probably more appropriate than silly-lookin PRPs. Since Ryan's got M78737, I will do the certification of M84211 (PRP25291). Good size, leaves the gap for M82939, in case anyone wants to cert a slightly smaller PRP, and I also just like how M84211 visually looks.

Go to https://primes.utm.edu/bios/ and create a new prover account based on a "c" code for Primo if you don't already have one. Then you can submit your newly certified prime under the new code with the comment: ECPP, like this:

10^25333-2*10^5182-3 ECPP

For Mersenne cofactors the comment should be: Mersenne cofactor, ECPP

Also use sendspace or similar to send Marcel Martin a download link for the certificate and you will get a listing on his top20 Primo proofs page.

Congrats!
paulunderwood is offline   Reply With Quote
Old 2020-08-27, 13:57   #15
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

9,973 Posts
Default

Quote:
Originally Posted by Gelly View Post
and I also just like how M84211 visually looks.
Yeah, pretty huh? Lots of 1 in binary...
LaurV is offline   Reply With Quote
Old 2020-09-22, 19:19   #16
ryanp
 
ryanp's Avatar
 
Jun 2012
Boulder, CO

6168 Posts
Default

Quote:
Originally Posted by ryanp View Post
I decided to fire up certification of M78737 with Primo, using 64 processes. Hopefully no one else is already running this!
An update: the machine running this certification had to be restarted, and I forgot to fire up the job again. Running it again now, with 36 workers. It's currently at "Bits: 78188/78577" in phase 1.
ryanp is offline   Reply With Quote
Old 2020-09-25, 12:17   #17
Gelly
 
Gelly's Avatar
 
May 2020

47 Posts
Default

Quote:
Originally Posted by Gelly View Post
Since Ryan's got M78737, I will do the certification of M84211 (PRP25291). Good size, leaves the gap for M82939, in case anyone wants to cert a slightly smaller PRP, and I also just like how M84211 visually looks.
Done! 4132590s (47.8 days). Once Marcel puts it up and I submit to Prime Pages, it should be the largest Mersenne Cofactor proven prime by a fair bit.

For the time being, since I want to wait on my incoming Thermosyphon as a sweet threadripper cooler, I'll not do another reservation for a while yet.
Gelly is offline   Reply With Quote
Old 2020-09-25, 12:49   #18
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

10000011010102 Posts
Default

Quote:
Originally Posted by Gelly View Post
Done! 4132590s (47.8 days). Once Marcel puts it up and I submit to Prime Pages, it should be the largest Mersenne Cofactor proven prime by a fair bit.

For the time being, since I want to wait on my incoming Thermosyphon as a sweet threadripper cooler, I'll not do another reservation for a while yet.
Congrats for the proof of the M84211 cofactor.

Last fiddled with by paulunderwood on 2020-09-25 at 12:50
paulunderwood is offline   Reply With Quote
Old 2020-09-28, 03:57   #19
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

2·11·191 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
Congrats for the proof of the M84211 cofactor.
It is up.
paulunderwood is offline   Reply With Quote
Old 2020-10-08, 21:29   #20
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

1101011110002 Posts
Default

Suggest these probable primes for the "proven" Sierpinski/Riesel conjectures, if the primality of these probable primes were proven, then these Sierpinski/Riesel conjectures would be completely proven.

S73: (14*73^21369+1)/3 (may be too large)
S105: (191*105^5045+1)/8
S256: (11*256^5702+1)/3

R7: (197*7^181761-1)/2 and (367*7^15118-1)/6 (may be too large)
R73: (79*73^9339-1)/6
R91: (27*91^5048-1)/2
R100: (133*100^5496-1)/33
R107: (3*107^4900-1)/2

Last fiddled with by sweety439 on 2020-10-08 at 21:31
sweety439 is offline   Reply With Quote
Old 2020-11-01, 17:58   #21
Gelly
 
Gelly's Avatar
 
May 2020

47 Posts
Default

Someone mentioned to me another list that is outdated in terms of compute power is the Unique Primes list, so I'll be proving Phi(79710,10) (PRP21248)
Gelly is offline   Reply With Quote
Old 2020-11-02, 00:22   #22
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

65708 Posts
Default

Quote:
Originally Posted by Gelly View Post
Someone mentioned to me another list that is outdated in terms of compute power is the Unique Primes list, so I'll be proving Phi(79710,10) (PRP21248)
There is a much smaller PRP factor of Phi(n,10), (10^6881-1)/(10^983-1)/49141059632832877096172610809992897380296624365337454176129, see https://stdkmd.net/nrr/repunit/prpfactors.htm
sweety439 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
15*2^n-1, n>1M Reservation Thread Kosmaj Riesel Prime Search 707 2021-11-20 19:13
Where on Earth can I download FastECPP? How fast is it compared with Primo? Stargate38 Miscellaneous Math 5 2021-11-16 17:33
5*2^n-1 Reservation Thread VBCurtis Riesel Prime Search 679 2021-10-09 17:33
Octoproth Reservation Thread Greenbank Octoproth Search 2 2007-12-26 09:58
Dodecaproth Reservation Thread Greenbank Octoproth Search 30 2006-02-09 00:33

All times are UTC. The time now is 03:41.


Tue Jun 28 03:41:55 UTC 2022 up 75 days, 1:43, 1 user, load averages: 1.69, 1.56, 1.37

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.

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