![]() |
WOW!!! Congratulations!
:groupwave: |
Congratulations!
[QUOTE=Batalov;370026]Fancy that, an 11-PRP... where did this come from? ;-) [/QUOTE] Seems to be a great day for finding million digits [B]11[/B]-PRPs and [URL="http://primes.utm.edu/primes/page.php?id=117523"]k=[B]11[/B] Riesel primes[/URL]! :wink: |
Search for prime Gaussian-Mersenne norms (and G-M-cofactors)
Original thread developed over time [URL="http://www.mersenneforum.org/showthread.php?t=8765"]here[/URL].
This topic is only about GMs (primes) and GQs (PRPs). Latest reservation status: [code]till 600k - completed by Jean Penné (GQ-only effort) 600k - 700k - completed by Cruelty (GQ-only effort) 700k - GM36 - completed by Thomas11 (GQ-only effort, 1 GQ found) GM36 - 1.95M - completed by Cruelty (2 GMs + 5 GQs found) 1.95M - 2M - reserved by Cruelty (currently @ 1.98M) 2M - 3.5M - completed by Batalov (1 GQ found) 3.5M - 3.85M - reserved by Citrix (prefactored to 55 bits) 3.85M - 4.3M - completed by Batalov 4.3M - 4.7M - reserved by Batalov (1GQ found so far) 3.85M - 5M - pre-factored till 55 bits by Citrix GM37-40M - pre-factored till 48 bits by Cruelty[/code] |
(in parentheses:
This sort of bothered me from the very beginning - because of the 'misclassification' it was hard to even find this thread, back then. These are Proth, not Riesel primes. However, there is no [I]Proth Prime Search[/I] subforum. They also don't fit the aging prothsearch.net site [even if as 'other projects']. So I guess, this is just as good a place as any.) |
[url]http://www.mersenneforum.org/forumdisplay.php?f=80[/url] might be a good place for this thread?
|
What about new primes? To which project will you assign them should you find any? I have reported GM38 as RPS prime, and since for the past couple of years nobody cared much about GMs I would stick with RPS :tu:
|
We are proud that one of our members started the GM search and will be happy to keep hosting the thread on our forum! :geek:
|
Well, to be fair, Mike Oakes started it actually, and Iskra continued; then Borys (Cruelty) carried on...
|
I am practically done with the 4.3-4.7M range and will continue to 5.1M.
I am in the process of adapting mfaktc into a "gmqfaktc" (searching for factors of 2[SUP]2p[/SUP]+1 on a GPU, and then parsing them into GM and GQ factors on the host CPU). Then we could sieve up to 64-65 bits depth. It is not very fast but once we pass ~5M, we [I]will [/I]need it. |
1 Attachment(s)
I've changed two kernels - this should be enough to run trial factoring [U]up to 64-bit[/U] and roughly hacked some code and a few self-tests. All previously found factors validate (with 32-bit LLR, too). Prototyped on linux.
The patch is attached. Needs TLC for Windows. |
Latest reservation status:
[code]till 600k - completed by Jean Penné (GQ-only effort)
600k - 700k - completed by Cruelty (GQ-only effort) 700k - GM36 - completed by Thomas11 (GQ-only effort, 1 GQ found) GM36 - 1.95M - completed by Cruelty (2 GMs + 5 GQs found) 1.95M - 2M - reserved by Cruelty (currently @ 1.98M) 2M - 3.5M - completed by Batalov (1 GQ found) 3.5M - 3.85M - reserved by Citrix (prefactored to 55 bits) 3.85M - 4.3M - completed by Batalov 4.3M - 4.7M - completed by Batalov (1GQ found) 4.7M - 5.1M - reserved by Batalov 3.85M - 5M - pre-factored till 55 bits by Citrix GM37-40M - pre-factored till 48 bits by Cruelty[/code]BTW: Should we update current status in the first post in this thread or publish status updates as new posts? What do you think? :smile: |
| All times are UTC. The time now is 01:08. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.