20190202, 16:41  #12 
Sep 2009
1,753 Posts 
Considering run times you would be better off running ECM. The P1 approach would be a lot slower. But it's useful to prove the oracle wrong if a lot of ECM work hasn't found a factor (it's possible but unlikely for 20 times as much ECM as would be expected to find a factor to miss it, while P1 with suitable limits etc would never miss unless there's a hardware error).
Chris 
20190203, 01:23  #13  
Aug 2006
2·2,927 Posts 
Quote:


20190210, 10:04  #14 
Mar 2017
1E_{16} Posts 
As always there are tradeoffs. But this was a really interesting idea and the idea really is interesting and clever.. just not super practical. Still, that's how we learn. Thanks very much for the reference!

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
OpenCL GPU P1 Factoring and ECM Factoring  xx005fs  GPU Computing  3  20181027 14:49 
Magnitude 5.6 Earthquake in Silicon Valley  ewmayer  Science & Technology  66  20080731 15:30 
P1 factoring != "Mersenne numbers to factor"?  James Heinrich  Marin's Mersennearies  8  20040517 11:09 
Shortest time to complete a 2^67 trial factor (no factor)  dsouza123  Software  12  20030821 18:38 
Factoring from the factor1  jocelynl  Math  12  20030627 01:24 