William Stein wrote: > * w hart: quadratic sieve update (SAGE's qsieve command): > "It is MUCH faster, > especially for large factorizations, on account > of having implemented the > large prime variant. it will factor an 81 digit > number in < 20 minutes. > On the Athlon it is the fastest generally > available implementation of the > quadratic sieve in the world for certain sized > factorizations, and > only slightly behind at other sizes." > Another example: n = > next_prime(2^110)*next_prime(2^120) has these > times on 32-bit 2Ghz linux: qsieve (107s), PARI > (223s), Magma 2.13 (336s).
Whoops, sorry, I've given you some wrong info William. That should have read well under 30 minutes. Also, unfortunately Jason P didn't take my Athlon improvements lying down. He's released a new version of msieve which again beats my sieve comprehensively on the Athlon. Work continues... At any rate, we are still miles ahead of LiDIA, MAGMA and Pari, etc. I also forgot to mention, the tuning parameters for the Athlon are currently commented out in QS.cpp. The tuning that is currently activated is for sage.math, i.e. 2.2GHz Opteron. Sorry about that. It appears I never got around to updating the makefile to take the architecture into account. Actually, if there is anyone who knows a lot about makefiles, I could really use a hand with this. C I know. makefile language I do not. Bill. --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
