Yes, after reading your letter, I went to find the algorithm for selecting Si and Wi in Montgomery's paper. I found that you are right. the output of this...
Hi, I've had these come up so often with the XYYXF numbers, especially when using 4th degree polys, that I consider them par for the course now. Pruning 1% of...
Hmmm...good point. During the failures that I usually deal with, a few runs of sqrt don't output a time, a few take just a few seconds, but most of them take...
... The sqrt runs that take the usual amount of time, and that actually end up with Beta^2 equal to the rational square root ^2, those failures are expected...
I have noticed that while pol51opt normally uses only a few MB of RAM, there are occasions when it finds a large number of good polynomials in a range that...
I noticed some more potential problems having to do with 64-bit 'a' values. First, the use of mpz_import in misc.c assumes that the s64 to be converted is in...
Jason Papadopoulos
jasonp@...
Jul 2, 2005 8:13 pm
1321
How do you do? I want to receive mpi-matsolve practical source code for linux clusters. Best Regards. Hanc...
Hi Hanc, I have a student working on it right now. It should be completed by the end of the summer, possibly sooner. As soon as it is complete and working, it...
... Funny you should mention that. I've just moved the CVS version of GGNFS to use the types and format specifiers in stdint.h and inttypes.h. This lets us...
Hello Everyone, Is there anyone, who's performing some large factorization now? (Something near 120 digits for GNFS, or 160 for SNFS or more). If yes - please...
Hello, Anton. I am at work on a 127 digit GNFS. Cheers, Jeff Olbrys ... __________________________________________________ Do You Yahoo!? Tired of spam?...
And I'm working on a c125 with gnfs. Bouk. ... __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam...
Hello Tyler, Saturday, July 23, 2005, 6:14:53 PM, you wrote: TC> I'm working on a 125 with GNFS Recently, I've written the on-disk cycle-counting code. This...
Hello Anton, I'm happy to test anything that can come along in windows binaries. here's the problem: I'm currently running all the k2 binaries because they are...
Hello, I am new member of this group. I am also interested in large factorization. The question is Is any method other than GNFS acceptable to the RSA for...
... Currently there is no other method for performing large factorizations. For generic RSA modulus general NFS is best choice. However, there are other good...
This will fix the PRI and SCN functions for MSVC. on line 32: #include <inttypes.h> replace that with #if defined (_MSC_VER) #include <basetsd.h> #define...
... Hi Joe. Thanks for the fixes. I'd be happy to patch the CVS sources, but not having a Visual C installation I have no way of testing them. There are a...
Hello everybody! Recently I've done a 6th degreee poly factorization with ggnfs. I noticed scanning old messages there was some discussion about that in the...
Hi, please take a short look at this (completed) factorization. Wasn't it too slow (on this fast machine)? Were the parameters correct? Should the matrix be so...
Hi Washuu. 137 hours for a C122 general NFS factorization sounds about right. I have done a C126 in 227 hours and a C121 using the older polyselect in 202...
If your P4 has hyperthreading (don't all the new ones have hyperthreading?), enable it and run a seperate sieving process on each virtual CPU. This should ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
