mersenneforum.org  

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

Closed Thread
 
Thread Tools
Old 2021-12-17, 00:50   #45
lisanderke
 
"Lisander Viaene"
Oct 2020
Belgium

109 Posts
Default

I'll post the save files of those exponents that experienced the 100% reporting in this zip archive. If anyone wishes to take a crack at these be my guest . I'm off to bed now.
Attached Files
File Type: zip Potentially fudged save files 30.b5.zip (5.8 KB, 34 views)
lisanderke is offline  
Old 2021-12-17, 01:05   #46
SethTro
 
SethTro's Avatar
 
"Seth"
Apr 2019

47310 Posts
Default

Something I've wanted for a long time and now more than ever I think we need is a repository of P-1 save files.

I have a bit of free time to work on this and I think it has several parts

1. Tool to extract current bounds from a save file [90% done MF post, Code]
2. Some extra code to compare two save files [50% done Code]
3. Webpage with status page & download links [20% done see one_line_status]
- I'm happy to write and maintain this for a year or so but ultimately it would be nice if James was willing to add it to their page.
4. Upload new results page
- Something simple like https://primegaps.cloudygo.com/ that can take a new save file and replace the existing file if better
- Automate George's trick to verify factors are found (increase B1 by 1000 and test that stage 1 factors are found)

If people were interested in helping out I'd like to start collecting all known save files for exponents less than say 1M.
If you have a large number of save files and want to help I'd love to hear from you.
SethTro is offline  
Old 2021-12-17, 01:12   #47
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

3,923 Posts
Default

Quote:
Originally Posted by SethTro View Post
could you make the Factor Probability column on the exponent page a link to the prob calculator with the values of that row filled in?
SLIBRSLIB-Done.
James Heinrich is offline  
Old 2021-12-17, 01:37   #48
nordi
 
Dec 2016

53 Posts
Default

Quote:
Originally Posted by charybdis View Post
M5231 is a good example of a potential huge P-1 factor having already been found by Ryan using ECM.
I would see the positive side here: The fact that this factor was found by ECM shows that no in-depth P-1 was run on this number, and likely other numbers in that range. At least not prior to October 2020, when that factor was discovered.
nordi is offline  
Old 2021-12-17, 06:01   #49
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

22×11×227 Posts
Default

Quote:
Originally Posted by lisanderke View Post
Oh, that did finish the P-1, but it didn't report a factor. Could it be that the save file already knows the 8 factors?
Just in case (because reading this thread is full of surprises, like "oh, he also doesn't know that", "oh, and that too", but surely the attitude is "what is that qualifying for regional/divisional college competition? ...No, I will go straight for the world record" "...Send me to Beijing, right now!")
-->
this is what you are competing against - https://members.loria.fr/PZimmermann...s/Pminus1.html
Stop thinking in bits, like you will find in many vanity threads: "Ah! Look at that factor, it is exceptionally large at 134.47 bits!"
No, 66 digits (or 218 bits) is what you want to beat. Good luck!
Batalov is offline  
Old 2021-12-17, 06:09   #50
SethTro
 
SethTro's Avatar
 
"Seth"
Apr 2019

1110110012 Posts
Default

Quote:
Originally Posted by kruoli View Post
Take the estimated T-Level that is already on your site, then calculate \((\text{T-level})/\log_{10}{2}\). This is your value.
Example: M1277 has an estimated T-Level of 62.878. The analog TF bit level would be 208 or 209 (yes, very high!).
For TF 100% of factors less than 2^67 have been found, and 0% of factors greater than 2^67.
For ECM T-level (say 200 bits) is the point where 50% of factors near that should have been found, at 195 bits maybe 80% should have been found and at 205 maybe 25% have been found.


Spitballing it looks like subtracting one from the log10 T-level converted to a log2 bit level is about the right correction to account for the asymmetry.
Attached Thumbnails
Click image for larger version

Name:	PXL_20211217_060654734.jpg
Views:	46
Size:	118.8 KB
ID:	26245  
SethTro is offline  
Old 2021-12-17, 07:06   #51
kruoli
 
kruoli's Avatar
 
"Oliver"
Sep 2017
Porta Westfalica, DE

1,223 Posts
Default

Quote:
Originally Posted by SethTro View Post
If you have a large number of save files and want to help I'd love to hear from you.
petrw1 and masser gave me tons of files some time ago, but mostly from the <2K project. For these, I was planning something similar to your ideas. But I have not put much work into it yet.
kruoli is offline  
Old 2021-12-17, 07:15   #52
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

601 Posts
Default

Quote:
Instead, further increasing B1 with every round seems like the best option for now.
I'm not sure I got that right, but is the plan to run consecutive P-1 with increasing bounds on the same exponent? Isn't that a waste of the previous runs? Or does round apply to ranges of larger exponents?
bur is offline  
Old 2021-12-17, 07:16   #53
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

341510 Posts
Default

Quote:
Originally Posted by SethTro View Post
If people were interested in helping out I'd like to start collecting all known save files for exponents less than say 1M.
If you have a large number of save files and want to help I'd love to hear from you.
I have quite a few P+1 save files, are those of interest as well?
ATH is offline  
Old 2021-12-17, 07:22   #54
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

22·43·47 Posts
Default

Quote:
Originally Posted by Batalov View Post
Just in case (because reading this thread is full of surprises, like "oh, he also doesn't know that", "oh, and that too", but surely the attitude is "what is that qualifying for regional/divisional college competition? ...No, I will go straight for the world record" ...

66 digits (or 218 bits) is what you want to beat. Good luck!
I think top 3 is quite likely (no I didn't do any calculations to back that up!). If we take all Mersennes below 100K to B1=10^9, B2=10^13 (or better) and consider that we get 5 free digits, that's a lot of chances to get lucky.

Even if a record is not found, any new factors are most welcome. One could even lead to a newly fully factored Mersenne.

IMO, that makes the effort worthwhile.
Prime95 is offline  
Old 2021-12-17, 07:41   #55
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

601 Posts
Default

Quote:
Originally Posted by Batalov View Post
this is what you are competing against - https://members.loria.fr/PZimmermann...s/Pminus1.html
Stop thinking in bits, like you will find in many vanity threads: "Ah! Look at that factor, it is exceptionally large at 134.47 bits!"
No, 66 digits (or 218 bits) is what you want to beat. Good luck!
What's the difference between thinking in log_10 vs log_2? And one might argue that the former website is but a vanity list as well. Just for the big boys with lots of university/company ressources.
bur is offline  
Closed Thread

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sieving freakishly big MMs (was "World record" phone number?) davieddy Operazione Doppi Mersennes 284 2021-10-24 13:53
...merely a question about ECM world record? lukerichards Factoring 29 2019-03-26 16:32
World record sized double-check? Siegmund PrimeNet 6 2016-05-09 22:39
World Record Factorial Prime Found rogue Lounge 8 2012-03-02 16:41
70 billion pixels Budapest (world record) R. Gerbicz Science & Technology 0 2010-07-28 01:50

All times are UTC. The time now is 20:48.


Fri Dec 2 20:48:05 UTC 2022 up 106 days, 18:16, 0 users, load averages: 1.11, 1.10, 1.12

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.

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