[QUOTE=lorgix;287896]
How about adding a t10? 8 curves with B1=300.[/QUOTE]

Factors of this size will be found with Rho. Or B1=2k. I don't see the benefit...

[QUOTE=bsquared;287898]Factors of this size will be found with Rho. Or B1=2k. I don't see the benefit...[/QUOTE]
I sometimes use YAFU for larger numbers. But I see your point.

(Zimmermann's site suggests 86 curves.)

[QUOTE=lorgix;287901]I sometimes use YAFU for larger numbers. But I see your point.

(Zimmermann's site suggests 86 curves.)[/QUOTE]

Oh... so you're saying that you think it should be 21 and 86. I thought you were saying it should be 30 and 74 but were seeing 21 and 86. Sorry for the confusion.

I simply used the values in the GMP-ECM readme. Maybe there are better ones, but those are pretty widely used.

Prime shows as composite... again
 

[CODE]factoring 2066809060293594502103849545478264524914933826700865348303408714875309981355815974587243977
using pretesting plan: normal
div: primes less than 10000
fmt: 1000000 iterations
rho: x^2 + 3, starting 14159 iterations on C84
rho: x^2 + 2, starting 14159 iterations on C84
rho: x^2 + 2, starting 14159 iterations on C78
rho: x^2 + 2, starting 14159 iterations on C71
rho: x^2 + 1, starting 14159 iterations on C71
pp1: starting B1 = 20K, B2 = gmp-ecm default on C71
starting SIQS on c49: 826446280991735537272727272727355371900826446281
==== sieving in progress ( 2 threads): 1232 relations needed ====
==== Press ctrl-c to abort and save state ====

SIQS elapsed time = 0.1890 seconds.
Composite result found, starting re-factorization
factoring 38288061726736113812243
using pretesting plan: normal
div: primes less than 10000
fmt: 1000000 iterations
rho: x^2 + 3, starting 1000 iterations on C23
rho: x^2 + 2, starting 1000 iterations on C23
rho: x^2 + 1, starting 1000 iterations on C23
Total factoring time = 0.0290 seconds
Total factoring time = 0.8360 seconds

***factors found***
P4 = 911
P5 = 9091
P7 = 909091
P8 = 8675309
C31 = 909090909090909090909090909091
PRP19 = 909090909090909091
PRP13 = 4198862272127
PRP11 = 9118675309
ans = 1[/CODE]

It should say "PRP31 = 909090909090909090909090909091
", not "C31 = 909090909090909090909090909091
"

Here's another one, but it gets it wrong on the 13 digit prime.
[CODE]factoring 261515254669748254303313193168061307531695538289751240410225894424691531947255523
using pretesting plan: normal
div: primes less than 10000
fmt: 1000000 iterations
rho: x^2 + 3, starting 14159 iterations on C77
rho: x^2 + 2, starting 14159 iterations on C77
rho: x^2 + 2, starting 14159 iterations on C71
rho: x^2 + 1, starting 14159 iterations on C71
pp1: starting B1 = 20K, B2 = gmp-ecm default on C71
pm1: starting B1 = 100K, B2 = gmp-ecm default on C61
Composite result found, starting re-factorization
factoring 826446280991735537272727272727355371900826446281
using pretesting plan: normal

starting SIQS on c49: 826446280991735537272727272727355371900826446281
==== sieving in progress ( 2 threads): 1232 relations needed ====
==== Press ctrl-c to abort and save state ====

SIQS elapsed time = 0.1530 seconds.
Total factoring time = 0.1650 seconds
Total factoring time = 0.8460 seconds

***factors found***
P5 = 9091
P7 = 909091
PRP11 = 9118675309
C13 = 4198862272127
PRP31 = 909090909090909090909090909091
PRP19 = 909090909090909091
[/CODE]
This time, it says "C13 = 4198862272127" instead of "PRP13 = 4198862272127". What's going on here? I've tried restarting Yafu, but it didn't help. Last time I had this problem was with M127 and an older version of yafu. Why does this keep happening? :huh:

I take it this is with version 1.30, right?

[QUOTE=Stargate38;288283]
What's going on here? I've tried restarting Yafu, but it didn't help. Last time I had this problem was with M127 and an older version of yafu. Why does this keep happening? :huh: [/QUOTE]

I suppose it's because it's not coded perfectly. I barely have enough time to write the code in the first place, let alone test it thoroughly. You should consider every release a beta release. Thanks for the report.

- ben.

I have version 1.29. I'll try 1.30 and see if it works right.

[QUOTE=Stargate38;288291]I have version 1.29. I'll try 1.30 and see if it works right.[/QUOTE]

I made an effort to fix this problem in 1.30, so hopefully that will do it. Let me know...

Now it does it on the 18 digit prime factor of 10^443-1. It says "C18 = 417961168013595649". Maybe it's a bug in the PRP Test. It doesn't try to factor it, unlike earlier. With M127, the old version showed it as C39 and tried to factor it, resulting in an error, but 1.30 simply shows it as PRP39. It seems to be the PRP test that's buggy. The isprime function doesn't have this bug though, which is strange. :huh:

[QUOTE=c10ck3r;285663]Hey, I have another (potentially stupid) question about yafu. I've been running yafu on a C114 for the past two days to no avail. It has done the TFing, ECM (through the point where it assigned 1 curve of B1=1 Billion (American numerology)), pp1, pm1, and rho=x^2 + 1,2,3. It now has switched to SIQS after saying "WARNING: could not find .\gnfs-lasieve4I13e.exe, reverting to siqs!", and has been running Bpoly to 4096 several times and once to 8192.
My question is: How long/how many times is this expected to go on. I'm using a P4 3.2GHz cpu to run it and its doing about 4.5 rels/sec. Thanks in advance![/QUOTE]

Hi,

I am new here and have recently downloaded YAFU 1.30. I am currently factoring 99!+1 using the factor() function. It ran all curves until it found a factor on curve 1680 with B1=3M of:

prp40 = 4639987070654210193824486852510861647843 (curve 1680 stg2 B1=3000000 sigma=1812833683 thread=0)

Then it began factoring the c111. I got this message:

scheduler: switching to sieve method
WARNING: could not find .\gnfs-lasieve4I13e.exe, reverting to siqs!
starting SIQS on c111: 100161219072059308916765798561813692699230227716372774239075663896586176799506913321511399248905585401871428823
random seeds: 14744477, 1073972731

Can somebody tell me why the gnfs is not working and how to fix it. I have been told that nfs is much faster then siqs on number of this size. Thank you,

[QUOTE=Stargate38;288298]Now it does it on the 18 digit prime factor of 10^443-1. It says "C18 = 417961168013595649". Maybe it's a bug in the PRP Test. It doesn't try to factor it, unlike earlier. With M127, the old version showed it as C39 and tried to factor it, resulting in an error, but 1.30 simply shows it as PRP39. It seems to be the PRP test that's buggy. The isprime function doesn't have this bug though, which is strange. :huh:[/QUOTE]

It's not a bug in the isprime function - isprime simply calls GMP's mpz_probab_prime_p function, which I highly doubt is buggy. Much more likely is that the prime/composite tag is getting lost amid recursive factor() calls. Even though I know exactly where to look, this bug has proven hard to find and fix. As busy as I am right now, I don't think it will be fixed soon. Fortunately, this only happens when a composite factor is found in factor(), i.e., when you see this message:

[CODE]Composite result found, starting re-factorization
[/CODE]

[QUOTE=cgy606;288431]Then it began factoring the c111. I got this message:

scheduler: switching to sieve method
WARNING: could not find .\gnfs-lasieve4I13e.exe, reverting to siqs!
starting SIQS on c111: 100161219072059308916765798561813692699230227716372774239075663896586176799506913321511399248905585401871428823
random seeds: 14744477, 1073972731

Can somebody tell me why the gnfs is not working and how to fix it. I have been told that nfs is much faster then siqs on number of this size. Thank you,[/QUOTE]

I know this has been answered before, but I can't find it. This thread is getting huge.

Get the ggnfs binaries from [URL="http://sites.google.com/site/bbuhrow/lasieve4_64.7z?attredirects=0"]here [/URL](on linux) or [URL="http://gilchrist.ca/jeff/factoring/index.html"]here [/URL](windows) and then add a line to the yafu.ini file indicating where you put them on your filesystem.

for example:
[CODE]ggnfs_dir=c:\stuff\ggnfs_bin\[/CODE]