I'm running SNFS on a number of difficulty 146. The minFF is 255382. The number of relation-sets reported grew up to 238195. However, after the next set of...
Hello, I'm new to ggnfs. I have Celeron 1200MHz, 512MB RAM, Linux. Having compiled ggnfs I read the docs and factored a small composite (around 75 digits) with...
Hello, Dmitri! ... You definitely should use more recent version. 0.77.x seems to be pretty stable. Also for larger factorizations I advie you to use Thorsten...
First of all, thanks for quick reply, Andrei. ... I've downloaded & compiled it now. Is it safe to continue the factorization with new version right now? ... ...
Sounds like the code to eliminate heavy relations sets massacred your relations. I suspect that the factor base limit was a bit too small, but that's just a...
... It's included with ggnfs 0.77.1. Now that you've done so much sieving, I wouldn't restart. But with new factorizations, the Perl script will run the...
I compiled gmp-ecm for AMD Opteron with this patch and it's 2.8x faster than the vanilla x86 installation (on a 150 digit number at B1=3M)! Does the sieve part...
Hello Dmitri, Wednesday, June 1, 2005, 9:47:16 PM, you wrote: DG> my question: why it is so slow? The answers are: 1. Your PC is too slow. Celereon 1200 seems...
For those not aware, the default script-selected parameters for GGNFS assume a polynomial of degree 5 for middling to large factorizations (GNFS > ~97 digits,...
I have a run that seemed to go ok. However, at the end the sqrt phase did not find any factors. Each time sqrt ran, it found 1 and n as factors and finally...
... I have seen such behavior when I tried to factor a prime number. During factorization everything was as it usually is. Please, check that it is really...
Hello, Dmitri! ... This happens from time to time. You should first try to rebuild matrix from processed relations, then solve it and rerun sqrts. If that...
... The whole story: I was factoring some not large number (less than 100 digits). I decided to start with ECM. It quickly found a 10-digit prime factor and...
What worked for me was to re-run matbuild with a different seed. My attempts to remove some relations with procrels -prune created an odd-exponent problem in...
Hello everybody! I'm new to ggnfs and I'm currently running through the manual to test it out. I'm testing it on a c90 of which I know the two primefactors...
Hello, Bouk! ... e1 = 1e9 is too large for that tiny number. For numbers in c90-c100 range c5 will usually be somewhere below 2e6. For determining actual e1...
... Thank you, Andrei! Yes, I've seen them. I also found out I can use a perlscript when being lazy ... Just one question: If I have a special number with a...
Hi, ... factors how do I ... Use your favorite factorization techniques (trial division, Pollard Rho, P+/-1, ECM) to try to weed out factors smaller than about...
... Thanks Greg! I'm currently trying to crack a snfsnumber of 149 digits with no know factors up to p40. So there was no need for that yet. What would be the...
... Just: n: composite. The PERL script will reconstruct the full number and estimate its size. This size is displayed as SNFS-difficulty and is used by the...
... Thanks! Very useful. ... The number I'm trying to crack is a generalized lucasnumber. That is in it self a slight problem as I can only use a 4th degree...
... Yes, in the beginning of the ggnfs.txt file looks like :minimum number of FF's: <633787> The number of needed FF:s is calculated from alim/rlim with a...
... I used the perlscript and this is the beginning of my file (bar the poly) [06/04 17:59:20] RFBsize: 114155 (upto 1499977) [06/04 17:59:20] AFBsize: 114145...
... Excellent result! There also was another C200, factored into P95*P105 by Don Leclair: http://xyyxf.at.tut.by/news.html#0 (see 27th of March) but GGNFS was...
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.
