mersenneforum.org  

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

Reply
 
Thread Tools
Old 2021-11-19, 15:53   #12
Viliam Furik
 
Viliam Furik's Avatar
 
"Viliam Furík"
Jul 2018
Martin, Slovakia

5×149 Posts
Default

Quote:
Originally Posted by tuckerkao View Post
It depends on the available memories of the user's PC. Many larger factors require the bounds to be up to 2^14 or greater which can be out of reach by many models. ECM has the higher chance to find such the useful factors, but require many curves to be run before able to find 1.
You do realize, that 2^14 = 16384, right? We are talking about B2 size, which is usually in the range of millions and more.
Viliam Furik is offline   Reply With Quote
Old 2021-11-19, 16:04   #13
kruoli
 
kruoli's Avatar
 
"Oliver"
Sep 2017
Porta Westfalica, DE

2·5·83 Posts
Default

You should be able to manually convert the Prime95 save file into a GMP-ECM save state. IIRC, there should be a How-To on this somewhere on this forum (by kriesel?). I have done this for the old save file format at least once successfully. GMP-ECM with OpenMP will be much more performant for stage 2 and multiple cores.

Last fiddled with by kruoli on 2021-11-19 at 16:41 Reason: Added "manually".
kruoli is offline   Reply With Quote
Old 2021-11-19, 16:59   #14
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

5,153 Posts
Default

Quote:
Originally Posted by Miszka View Post
I made several attempts to determine the value of B2 to complete my task.
Only B2=B1=40000000000 was successful.
In this experimental way I found out that for small Mersenne numbers the P-1 method is not a good method.
No. You found out what George already told you: Prime95 is not the right software for small Mersennes and large bounds.
VBCurtis is offline   Reply With Quote
Old 2021-11-19, 18:14   #15
nordi
 
Dec 2016

103 Posts
Default

Quote:
Originally Posted by kruoli View Post
You should be able to manually convert the Prime95 save file into a GMP-ECM save state. IIRC, there should be a How-To on this somewhere on this forum (by kriesel?)
I know there's instructions for doing this with ECM, but didn't know it would be possible for P-1. It sounds really interesting, but all I could find from Kriesel was this which does not mention gmp-ecm. Any clues?
nordi is offline   Reply With Quote
Old 2021-11-19, 18:45   #16
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

2×53×13 Posts
Default

Quote:
Originally Posted by Viliam Furik View Post
You do realize, that 2^14 = 16384, right? We are talking about B2 size, which is usually in the range of millions and more.
I think he meant 1014.
ATH is offline   Reply With Quote
Old 2021-11-19, 20:02   #17
kruoli
 
kruoli's Avatar
 
"Oliver"
Sep 2017
Porta Westfalica, DE

11001111102 Posts
Default

Quote:
Originally Posted by nordi View Post
I know there's instructions for doing this with ECM, but didn't know it would be possible for P-1. It sounds really interesting, but all I could find from Kriesel was this which does not mention gmp-ecm. Any clues?
You may be right, there might be no such post. Maybe it was from GP2. But at least I am sure that it works. I did some testing. This worked for me (curly brackets indicate that something needs to be replaced):
  1. Run Prime95/mprime with Pminus1=1,2,{exponent},-1,{B1},0.
  2. Now, a save file exists m{zero padded exponent}.
  3. Open the file in a Hex Editor.
    1. Remove the first 88 bytes.
    2. Reverse all bytes.
    3. Copy the hexadecimal representation.
    4. Remove leading zeros.
    5. Convert this to lower case.
  4. Create a new file with this content:
    Code:
    METHOD=P-1; B1={B1}; N=2^{exponent}-1; X=0x{modified hex data from the last step}; CHECKSUM=0; PROGRAM=; Y=0x0; X0=0x3; Y0=0x0; WHO=; TIME=;
  5. Execute ecm -resume {file name from the previous step} {B1}-{B1} {wanted B2}. It will state something like
    Code:
    GMP-ECM 7.0.4 [configured with GMP 6.2.1, --enable-asm-redc] [ECM]
    Resume file line has bad checksum 0, expected 729905639
  6. Modify the file you created to use the checksum GMP-ECM expected.
  7. Repeat the same command again. Now it will run.

I have not tested with known factors, but I guess we could work something out from here.
kruoli is offline   Reply With Quote
Old 2021-11-19, 20:25   #18
Miszka
 
Miszka's Avatar
 
May 2013
Poland

2×3×17 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
No. You found out what George already told you: Prime95 is not the right software for small Mersennes and large bounds.
Maybe I misspoke, but I understood it as you wrote.
Miszka is offline   Reply With Quote
Old 2021-11-19, 20:51   #19
Viliam Furik
 
Viliam Furik's Avatar
 
"Viliam Furík"
Jul 2018
Martin, Slovakia

5·149 Posts
Default

Quote:
Originally Posted by ATH View Post
I think he meant 1014.
Yes, probably. But it's not what he wrote.
Viliam Furik is offline   Reply With Quote
Old 2021-11-19, 20:52   #20
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

2×3×5×7×29 Posts
Default

Quote:
Originally Posted by nordi View Post
all I could find from Kriesel was this which does not mention gmp-ecm.
Thanks for doing your homework first. (Not everyone does.) I've updated that page considerably since your post. I knew of no way to move P-1 work in progress among applications without giving up all the ground previously gained. (And I've searched, and looked at writing a translator or two.)

Recently kruoli previously posted about a manual method for prime95 P-1 -> gmp-ecm.

What I was looking for was CUDAPm1 -> anything reliable. If someone knows of a way, please contact me by PM or post it here.


edit: There's a maintained list of some P-1 self test candidates with known factors scattered across a wide range of exponents and therefore many fft lengths here
"(Not everyone does.)" was about certain folks who start a new thread asking a question that's easily answered by looking in the program documentation, or reference info, or with a quick forum or web search. And who continue to do so after repeatedly drawing flak from both ordinary users and moderators. And often it's the same few who don't bother to do enough independent thinking or testing. Not related to the previous posters in this thread.

Last fiddled with by kriesel on 2021-11-19 at 21:15
kriesel is online now   Reply With Quote
Old 2021-11-19, 20:59   #21
kruoli
 
kruoli's Avatar
 
"Oliver"
Sep 2017
Porta Westfalica, DE

11001111102 Posts
Default

Quote:
Originally Posted by kriesel View Post
(Not everyone does.)
It is really hard to search for posts regarding P-1 because the forum search does not accept "P-1" as a keyword. I looked at your blog site map, there was no mention. But that does not mean such a post does not exist. So I did a reasonable amount of "homework".

Last fiddled with by kruoli on 2021-11-19 at 21:27 Reason: Redacted per kriesel's edit.
kruoli is offline   Reply With Quote
Old 2021-11-19, 21:19   #22
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

2·3·5·7·29 Posts
Default

Quote:
Originally Posted by tuckerkao View Post
Many larger factors require the bounds to be up to 2^14 or greater
214=16384, which is a rather small bound for most exponents. Perhaps you meant 1014?
kriesel is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Unexpected from AMD M344587487 Hardware 18 2018-08-08 15:17
Unexpected Factor apocalypse PrimeNet 6 2015-03-15 19:31
Unexpected jackpot fivemack Factoring 6 2010-11-10 19:34
Aliquot Termination Question - Largest Prime? EdH Aliquot Sequences 6 2010-04-06 00:12
A new termination below 100k 10metreh Aliquot Sequences 0 2010-03-11 18:24

All times are UTC. The time now is 02:28.


Tue Jan 18 02:28:14 UTC 2022 up 178 days, 20:57, 0 users, load averages: 0.80, 1.07, 1.19

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.

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