20200907, 21:29  #3 
"Mark"
Apr 2003
Between here and the
2^{2}×3×523 Posts 
proth20 can only be used for k*2^n+1. In other words b = 2 and c = +1. Hopefully Yves will extend that to other bases and c = 1 in the near future.
My experience is that it is slower than pfgw, but I haven't run it with many different values of n to see how it scales as n increases. 
20200907, 21:45  #4  
Jul 2003
wear a mask
2×5×157 Posts 
Quote:


20200908, 09:45  #5 
Dec 2011
After milion nines:)
2612_{8} Posts 
It has no sense to compare PFGW and Proth: one is run under GPU and another is run under CPU.
Proth 2.0 has very nice performance Table of limits ( when program go to next step) Red is exponent on k*2^n+1 2^17 [ 688,094  1,376,221] 2^18 [ 1,376,222  2,752,477] PPSE (1.5M) 2^19 [ 2,752,478  5,504,989] PPS (2.8M) 2^20 [ 5,504,990  10,485,716] DIV (5.5M) 2^21 [10,485,717  20,971,486] ESP (14.1M), 321 (15.5M), Cullen (17.7M) 2^22 [20,971,487  39,845,845] PSP (22.1M), SOB (32.5M) 2^23 [39,845,846  79,691,743] 2^24 [79,691,744  99,999,999] Last fiddled with by pepi37 on 20200908 at 09:47 
20200908, 20:31  #6  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
3·1,951 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Proth primes  ET_  Proth Prime Search  9  20201002 07:11 
Proth 2.0  pepi37  Software  10  20200906 17:26 
Proth Number  sparrow  Factoring  2  20200405 03:14 
Proth's Theorem  ATH  Math  9  20110215 19:09 
64bit proth sieve possible???  VJS  Software  0  20050527 17:32 