Go Back > Factoring Projects > Factoring

Thread Tools
Old 2021-04-07, 16:29   #23
charybdis's Avatar
Apr 2020

379 Posts

Originally Posted by Unitome View Post
Also just for any newbies who read this someday, I tested YAFU and GGNFS and GGNFS is much faster than YAFU for numbers that GGNFS can factor. Roughly 40% faster on 100 digit numbers.
This might be related to the issue described in this thread where yafu can sometimes spend way too long on polynomial selection.

(and even without that issue, I think yafu spends too long on poly selection anyway, I often see 20% of total NFS time spent on polyselect)

Last fiddled with by charybdis on 2021-04-07 at 16:33
charybdis is offline   Reply With Quote
Old 2021-04-07, 17:45   #24
Just call me Henry
henryzz's Avatar
Sep 2007
Cambridge (GMT/BST)

588610 Posts

Originally Posted by chris2be8 View Post
I think pol5 was written as part of ggnfs. But you would be better off using msieve for polynomial selection today. In fact all you need is the lattice sievers, msieve and a current driver script ( or The rest of ggnfs is only of historical interest now.

Chris suggests pol5 also came from ``T. Kleinjung and/or Jens Franke''

This was used alongside msieve cpu polynomial selection as part of large searches for a number of years similar to how both msieve-gpu and CADO polyselect are used today.
henryzz is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
factoring 2ⁿ-2 equivalent to factoring 2ⁿ-1(I think) baih Miscellaneous Math 9 2020-09-21 07:11
OpenCL GPU P-1 Factoring and ECM Factoring xx005fs GPU Computing 3 2018-10-27 14:49

All times are UTC. The time now is 03:56.

Fri Aug 6 03:56:41 UTC 2021 up 13 days, 22:25, 1 user, load averages: 2.52, 2.36, 2.40

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.