20211125, 01:25  #947  
If I May
"Chris Halsall"
Sep 2002
Barbados
2·5,021 Posts 
Quote:
Please know we tend to work rather fast 'round these here parts... 

20211125, 02:32  #948  
Jul 2003
Behind BB
3×587 Posts 
Quote:
It's going to become more difficult to avoid toestepping 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. 

20211125, 03:39  #949  
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
7×691 Posts 
Quote:
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 

20211125, 03:41  #950  
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
12E5_{16} Posts 
Quote:


20211125, 04:16  #951 
P90 years forever!
Aug 2002
Yeehaw, FL
1110111111101_{2} Posts 
For giggles, I tried P1 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 P1, B1=200000000, B2=76673707110, Wi8: E437AD7F 
20211125, 05:47  #952  
Oct 2021
Germany
13 Posts 
Quote:


20211125, 06:14  #953 
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
1001011100101_{2} Posts 
[QUOTE=Prime95;593832]For giggles, I tried P1 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. ... 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 20211125 at 06:21 Reason: And... 
20211125, 06:31  #954  
P90 years forever!
Aug 2002
Yeehaw, FL
3^{2}·853 Posts 
Quote:
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 P1, 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 P1, B1=250000000, B2=4459674999780, Wi8: 6A0ECD7D Quote:


20211125, 11:36  #955  
"University student"
May 2021
Beijing, China
2·3^{2}·7 Posts 
Quote:
Why is the B2 value below inconsistent with the value above? Also, can Prime95 itself guess the estimated Tlevel when it's offline? More problems: How much can wavefront (107116M) P1 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 20211125 at 11:49 

20211125, 11:48  #956  
Jun 2003
5179_{10} Posts 
Quote:
Quote:
Quote:
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. 

20211125, 15:37  #957  
P90 years forever!
Aug 2002
Yeehaw, FL
3^{2}×853 Posts 
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:
Quote:
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 20211125 at 15:38 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Thinking of Joining GPU to 72  jschwar313  GPU to 72  3  20160131 00:50 
Thinking about lasieve5  Batalov  Factoring  6  20111227 22:40 
Thinking about buying a panda  jasong  jasong  1  20081111 09:43 
Loud thinking on irregular primes  devarajkandadai  Math  4  20070725 03:01 
Question on unfactored numbers...  WraithX  GMPECM  1  20060319 22:16 