mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Proth Prime Search

Reply
 
Thread Tools
Old 2008-05-31, 17:56   #23
Cruelty
 
Cruelty's Avatar
 
May 2005

2·809 Posts
Default

1.29-1.3M complete, reserving 1.3-1.31M
Cruelty is offline   Reply With Quote
Old 2008-06-24, 05:51   #24
Cruelty
 
Cruelty's Avatar
 
May 2005

31228 Posts
Default

1.3-1.31M complete, reserving 1.31-1.32M
There was an FFT jump near 1.305M from 128k to 192k - iteration times increased ~52%. Currently it takes ~4220 sec. to test single candidate using 3GHz Core2 CPU.

Last fiddled with by Cruelty on 2008-06-24 at 05:55
Cruelty is offline   Reply With Quote
Old 2008-07-21, 17:52   #25
Cruelty
 
Cruelty's Avatar
 
May 2005

2·809 Posts
Default

1.31-1.32M complete, reserving 1.32-1.33M
Cruelty is offline   Reply With Quote
Old 2008-08-17, 20:41   #26
Cruelty
 
Cruelty's Avatar
 
May 2005

31228 Posts
Default

1.32-1.33M complete, reserving 1.33-1.34M
Cruelty is offline   Reply With Quote
Old 2008-09-20, 22:19   #27
Cruelty
 
Cruelty's Avatar
 
May 2005

110010100102 Posts
Default

1.33-1.34M complete, reserving 1.34-1.35M
Cruelty is offline   Reply With Quote
Old 2008-10-08, 05:09   #28
Cruelty
 
Cruelty's Avatar
 
May 2005

161810 Posts
Default

(2^1347781-2^673891+1)/5 is 3-PRP! (12586.4712s+0.0013s)

I have verified it with PFGW @ base=3, and right now I am running additional tests at other bases
Cruelty is offline   Reply With Quote
Old 2008-10-08, 12:48   #29
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

362210 Posts
Default

That's the new PRP record, isn't it??

You really had a happy night! A prime with almost 2M bits and the new PRP record
Kosmaj is offline   Reply With Quote
Old 2008-10-10, 20:07   #30
Cruelty
 
Cruelty's Avatar
 
May 2005

161810 Posts
Default

The new PRP record has 405722 digits
Quote:
(2^1347781-2^673891+1)/5 is 3-PRP, originally found using LLR ver.3.7.1 for Windows (no factor till 2^51).
This is a Fermat PRP at base 3, 5, 7, 11, 13, 17, 101, 137 - confirmed with PFGW ver.1.2.0 for Windows.
Additionally using the following command with PFGW:
pfgw -l -tc -a1 -q(2^1347781-2^673891+1)/5
I've received the following result:
Primality testing (2^1347781-2^673891+1)/5 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Running N-1 test using base 3
Running N+1 test using discriminant 7, base 2+sqrt(7)
Calling N-1 BLS with factored part 0.03% and helper 0.00% (0.08% proof)
(2^1347781-2^673891+1)/5 is Fermat and Lucas PRP! (104628.5231s+0.0022s)
Cruelty is offline   Reply With Quote
Old 2008-10-12, 20:48   #31
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default

1.34-1.35M complete, reserving 1.35-1.36M
Cruelty is offline   Reply With Quote
Old 2008-11-08, 17:48   #32
Cruelty
 
Cruelty's Avatar
 
May 2005

161810 Posts
Default

1.35-1.36M complete, reserving 1.36-1.37M
Cruelty is offline   Reply With Quote
Old 2008-12-05, 20:19   #33
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default

1.36-1.37M complete, reserving 1.37-1.38M
Cruelty is offline   Reply With Quote
Reply

Thread Tools


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

All times are UTC. The time now is 17:58.

Sat Aug 8 17:58:55 UTC 2020 up 22 days, 13:45, 2 users, load averages: 1.54, 1.69, 1.69

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.