mersenneforum.org  

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

Reply
 
Thread Tools
Old 2021-11-25, 01:25   #947
chalsall
If I May
 
chalsall's Avatar
 
"Chris Halsall"
Sep 2002
Barbados

2·5,021 Posts
Default

Quote:
Originally Posted by gLauss View Post
Unfortunately, axn poached that list of P-1 on at least one exponent 5547953. So I will stop working on any exponents for now, please "unreserve" everything.
Sorry about that (although I wasn't involved).

Please know we tend to work rather fast 'round these here parts...
chalsall is offline   Reply With Quote
Old 2021-11-25, 02:32   #948
masser
 
masser's Avatar
 
Jul 2003
Behind BB

3×587 Posts
Default

Quote:
Originally Posted by gLauss View Post
Unfortunately, axn poached that list of P-1 on at least one exponent 5547953. So I will stop working on any exponents for now, please "unreserve" everything. I probably work to irregularly and am not contributing much anyway with my laptop - so I will work on whatever I like, but only on ranges where there has been no progress for at least some time and make sure to report my results timely.
Careful with that p word there. We actually blundered into axn's range a little recklessly. It was gracious of him to accept that you would be working in that range after I picked those candidates for you. There's a chance he had already completed a few of the assignments by the time I came up with that list.

It's going to become more difficult to avoid toe-stepping as the number of available ranges and the amount of work for a given work type decreases. We should all continue to avoid others ranges and communicate our intentions. We should also be prepared for occasional accidents too. Let's be kind and have fun.
masser is offline   Reply With Quote
Old 2021-11-25, 03:39   #949
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

7×691 Posts
Default

Quote:
Originally Posted by gLauss View Post
Unfortunately, axn poached that list of P-1 on at least one exponent 5547953. So I will stop working on any exponents for now, please "unreserve" everything. I probably work to irregularly and am not contributing much anyway with my laptop - so I will work on whatever I like, but only on ranges where there has been no progress for at least some time and make sure to report my results timely.
Sorry that happened.
However, you will notice that in post 842 (5 few hours after masser gave you the 5.5 list) that I did indicate that axn was working on 5.5 and 5.6 range and offered you some in the 6.5 range.

That range is still open if you choose to try again.
Thanks
Wayne
petrw1 is online now   Reply With Quote
Old 2021-11-25, 03:41   #950
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

12E516 Posts
Default

Quote:
Originally Posted by masser View Post
It's going to become more difficult to avoid toe-stepping as the number of available ranges and the amount of work for a given work type decreases. We should all continue to avoid others ranges and communicate our intentions. We should also be prepared for occasional accidents too. Let's be kind and have fun.
I'm going to look into expanding the list in Post #1 of this thread to include all active ranges....that it may be a little harder to keep accurate as I have noticed some transient work over the years.
petrw1 is online now   Reply With Quote
Old 2021-11-25, 04:16   #951
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

11101111111012 Posts
Default

For giggles, I tried P-1 on M80071, B1=200M It appears that the code that caps B2 at 999*B1 needs to change.
B2 = 76 billion in under 2 minutes!

Code:
[Work thread Nov 24 22:56] M80071 stage 1 complete. 798217228 transforms. Total time: 3795.041 sec.
[Work thread Nov 24 22:56] Conversion of stage 1 result complete. 5 transforms, 1 modular inverse. Time: 0.004 sec.
[Work thread Nov 24 22:56] Switching to FMA3 FFT length 5K using large pages
[Work thread Nov 24 22:56] With trial factoring done to 2^85, optimal B2 is 293*B1 = 58600000000.
[Work thread Nov 24 22:56] Using 6791MB of memory.  D: 270270, 25920x142152 polynomial multiplication.
[Work thread Nov 24 22:56] Stage 2 init complete. 998106 transforms. Time: 31.144 sec.
[Work thread Nov 24 22:58] M80071 stage 2 complete. 2815495 transforms. Total time: 101.937 sec.
[Work thread Nov 24 22:58] Stage 2 GCD complete. Time: 0.003 sec.
[Work thread Nov 24 22:58] M80071 completed P-1, B1=200000000, B2=76673707110, Wi8: E437AD7F
I'm going to try a few more and see if I can find a new factor.
Prime95 is offline   Reply With Quote
Old 2021-11-25, 05:47   #952
Luminescence
 
Oct 2021
Germany

13 Posts
Default

Quote:
Originally Posted by Prime95 View Post
For giggles, I tried P-1 on M80071, B1=200M It appears that the code that caps B2 at 999*B1 needs to change.
B2 = 76 billion in under 2 minutes!

Code:
[Work thread Nov 24 22:56] M80071 stage 1 complete. 798217228 transforms. Total time: 3795.041 sec.
[Work thread Nov 24 22:56] Conversion of stage 1 result complete. 5 transforms, 1 modular inverse. Time: 0.004 sec.
[Work thread Nov 24 22:56] Switching to FMA3 FFT length 5K using large pages
[Work thread Nov 24 22:56] With trial factoring done to 2^85, optimal B2 is 293*B1 = 58600000000.
[Work thread Nov 24 22:56] Using 6791MB of memory.  D: 270270, 25920x142152 polynomial multiplication.
[Work thread Nov 24 22:56] Stage 2 init complete. 998106 transforms. Time: 31.144 sec.
[Work thread Nov 24 22:58] M80071 stage 2 complete. 2815495 transforms. Total time: 101.937 sec.
[Work thread Nov 24 22:58] Stage 2 GCD complete. Time: 0.003 sec.
[Work thread Nov 24 22:58] M80071 completed P-1, B1=200000000, B2=76673707110, Wi8: E437AD7F
I'm going to try a few more and see if I can find a new factor.
Holy smokes, that’s a massive boost to P-1. You guys are some truly brilliant minds.

Luminescence is online now   Reply With Quote
Old 2021-11-25, 06:14   #953
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

10010111001012 Posts
Default

[QUOTE=Prime95;593832]For giggles, I tried P-1 on M80071, B1=200M It appears that the code that caps B2 at 999*B1 needs to change.
B2 = 76 billion in under 2 minutes!

Code:
...
[Work thread Nov 24 22:56] With trial factoring done to 2^85, optimal B2 is 293*B1 = 58600000000.
...
Why would it say 2^85.
Does this have something to do with how much ECM has been done?

And...with Stage 2 being so much faster and supported larger values for B2 ... might there be a chance to use it to find more factors of the smallest unfactored? Maybe those under 20,000?

Last fiddled with by petrw1 on 2021-11-25 at 06:21 Reason: And...
petrw1 is online now   Reply With Quote
Old 2021-11-25, 06:31   #954
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

32·853 Posts
Default

Quote:
Originally Posted by petrw1 View Post
Why would it say 2^85. Does this have something to do with how much ECM has been done?
Yes. That was just my complete-shot-in-the-dark guess as to ECM's equivalent TF.

I upped B1 to 250M, fixed the 999x cap. B2 = 4.45 trillion in an hour and a half.

Code:
[Work thread Nov 24 23:42] Conversion of stage 1 result complete. 5 transforms, 1 modular inverse. Time: 0.004 sec.
[Work thread Nov 24 23:42] Switching to FMA3 FFT length 5K using large pages
[Work thread Nov 24 23:42] With trial factoring done to 2^90, optimal B2 is 17811*B1 = 4452750000000.
[Work thread Nov 24 23:42] If no prior P-1, chance of a new factor is 6.43%
[Work thread Nov 24 23:42] Using 6791MB of memory.  D: 330330, 31680x136392 polynomial multiplication.
[Work thread Nov 24 23:42] Stage 2 init complete. 1225472 transforms. Time: 37.495 sec.
[Work thread Nov 25 01:17] M80071 stage 2 complete. 145791133 transforms. Total time: 5680.476 sec.
[Work thread Nov 25 01:17] Round off: 0.048828125
[Work thread Nov 25 01:17] Stage 2 GCD complete. Time: 0.003 sec.
[Work thread Nov 25 01:17] M80071 completed P-1, B1=250000000, B2=4459674999780, Wi8: 6A0ECD7D
Quote:
And...with Stage 2 being so much faster and supported larger values for B2 ... might there be a chance to use it to find more factors of the smallest unfactored? Maybe those under 20,000?
Expos under approx 40000 already benefited from GMP-ECM's generous stage 2. I guess there's a better chance for new factors on expos from 50K to 1M. We'll see.
Prime95 is offline   Reply With Quote
Old 2021-11-25, 11:36   #955
Zhangrc
 
"University student"
May 2021
Beijing, China

2·32·7 Posts
Default

Quote:
Originally Posted by Prime95 View Post
With trial factoring done to 2^90, optimal B2 is 17811*B1 = 4452750000000.
M80071 completed P-1, B1=250000000, B2=4459674999780
With T-level being 30.598, you can assume no factor below 2^102 (30.598/0.301).
Why is the B2 value below inconsistent with the value above?
Also, can Prime95 itself guess the estimated T-level when it's offline?

More problems:
How much can wavefront (107-116M) P-1 benefit from v30.8? what bounds does it use?
Does the larger FFT used in stage 2 hurt throughput? Is it larger than necessary?
Can the new algorithm be implemented in ECM and PP1 too?

Last fiddled with by Zhangrc on 2021-11-25 at 11:49
Zhangrc is offline   Reply With Quote
Old 2021-11-25, 11:48   #956
axn
 
axn's Avatar
 
Jun 2003

517910 Posts
Default

Quote:
Originally Posted by gLauss View Post
Unfortunately, axn poached that list of P-1 on at least one exponent 5547953.
Quote:
Originally Posted by masser View Post
Careful with that p word there. We actually blundered into axn's range a little recklessly.
Quote:
Originally Posted by axn View Post
Please feel free to crunch them. When I get to these sub ranges, I will be sure to exclude them from my list.
Unfortunately, in this case, the blunder was all mine. My dumbass totally forgot that I was supposed to skip those. Sorry! :-(

From the project's perspective, 5.5 is complete, so I'm no longer doing any other work there. I, unfortunately, did all those in the 5.54xxxx range. 5.55xxxx is untouched, but, again, they're not needed from project's perspective.

Once again, my sincere apologies -- you did nothing wrong.
axn is offline   Reply With Quote
Old 2021-11-25, 15:37   #957
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

32×853 Posts
Default

Quote:
Originally Posted by Zhangrc View Post
Why is the B2 value below inconsistent with the value above?
The new stage 2 selects a D value (330330 in this case) and then does batches of D values with a single polynomial multiplication. The new code completes the full batch that is larger than the target B2.

Quote:
Also, can Prime95 itself guess the estimated T-level when it's offline?
No.

Quote:
How much can wavefront (107-116M) P-1 benefit from v30.8? what bounds does it use?
Does the larger FFT used in stage 2 hurt throughput? Is it larger than necessary?
Can the new algorithm be implemented in ECM and PP1 too?
Sadly, wavefront P-1 will not benefit much. There are only 200 or so temporaries available if given 16GB RAM.
The larger FFT will hurt stage 2 throughput. More study is required to see if prime95 is switching to a larger FFT sooner than necessary. The new algorithm can be implemented for P+1 and ECM with some difficulty. Reading papers by Montgomery / Silverman / Kruppa / Zimmermann is no easy matter!

Last fiddled with by Prime95 on 2021-11-25 at 15:38
Prime95 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Thinking of Joining GPU to 72 jschwar313 GPU to 72 3 2016-01-31 00:50
Thinking about lasieve5 Batalov Factoring 6 2011-12-27 22:40
Thinking about buying a panda jasong jasong 1 2008-11-11 09:43
Loud thinking on irregular primes devarajkandadai Math 4 2007-07-25 03:01
Question on unfactored numbers... WraithX GMP-ECM 1 2006-03-19 22:16

All times are UTC. The time now is 06:24.


Tue Nov 30 06:24:52 UTC 2021 up 130 days, 53 mins, 0 users, load averages: 0.73, 0.88, 0.94

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