Search for prime Gaussian-Mersenne norms (and G-M-cofactors) - Page 10

Cruelty · 2014-03-31, 08:31

WOW!!! Congratulations!

Thomas11 · 2014-03-31, 15:20

Congratulations!

Quote:

Originally Posted by Batalov

Fancy that, an 11-PRP... where did this come from? ;-)

Seems to be a great day for finding million digits 11-PRPs and k=11 Riesel primes!

Cruelty · 2014-03-31, 21:54

Original thread developed over time here.
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

Batalov · 2014-03-31, 23:05

(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 Proth Prime Search 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.)

Citrix · 2014-04-01, 17:37

http://www.mersenneforum.org/forumdisplay.php?f=80 might be a good place for this thread?

Cruelty · 2014-04-02, 10:18

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

Kosmaj · 2014-04-02, 11:49

We are proud that one of our members started the GM search and will be happy to keep hosting the thread on our forum!

Batalov · 2014-04-02, 16:54

Well, to be fair, Mike Oakes started it actually, and Iskra continued; then Borys (Cruelty) carried on...

Batalov · 2014-04-04, 01:17

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^2p+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 will need it.

Batalov · 2014-04-04, 04:09

I've changed two kernels - this should be enough to run trial factoring up to 64-bit 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.

Cruelty · 2014-04-04, 09:27

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

BTW: Should we update current status in the first post in this thread or publish status updates as new posts? What do you think?

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
New PC dedicated to Mersenne Prime Search	Taiy	Hardware	12	2018-01-02 15:54
Gaussian integers- use of norms	devarajkandadai	Number Theory Discussion Group	11	2017-10-28 20:58
Low clock speeds on Mersenne Prime search	Ammonia	Hardware	2	2016-01-21 17:46
Testing Mersenne cofactors for primality?	CRGreathouse	Computer Science & Computational Number Theory	18	2013-06-08 19:12
Can I specify the range to search the Mersenne Prime?	Unregistered	Information & Answers	22	2012-03-20 11:38

2014-03-31, 08:31	#100
Cruelty May 2005 2³×7×29 Posts	WOW!!! Congratulations!

2014-03-31, 23:05	#103
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 10010100011001₂ Posts	(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 Proth Prime Search 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.)

2014-04-01, 17:37	#104
Citrix Jun 2003 1582₁₀ Posts	http://www.mersenneforum.org/forumdisplay.php?f=80 might be a good place for this thread?

2014-04-02, 10:18	#105
Cruelty May 2005 2³×7×29 Posts	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

2014-04-02, 11:49	#106
Kosmaj Nov 2003 2·1,811 Posts	We are proud that one of our members started the GM search and will be happy to keep hosting the thread on our forum!

2014-04-02, 16:54	#107
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 22431₈ Posts	Well, to be fair, Mike Oakes started it actually, and Iskra continued; then Borys (Cruelty) carried on...

2014-04-04, 01:17	#108
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 9,497 Posts	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^2p+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 will need it.