CADO-NFS and GGNFS sieving
 

I read [URL="http://www.mersenneforum.org/showthread.php?t=20418"]this post[/URL], and It is mentioned there that: [QUOTE]CADO-NFS has state of the art poly select and sieving code[/QUOTE]but when I compare the running time(specially sieving time) of GGNFS and CADO-NFS for a particular n, CADO-NFS is always taking more time. Can anybody explain me why? If it is having highly sophisticated technique of sieving, then it should take less time, but it is not.

Thanks in advance.

Elapsed time for small projects is one way to measure "state of the art", but not the only one. CADO can handle large factorizations that GGNFS cannot; that's an advancement in state of the art, don't you think?