The things we are describing should be done from the DOS command line, or Windows PowerShell, not from within the yafu interpreter. Double clicking on the .exe and working that way only enables the most general configuration. Using -plan and -pretest requires running from the command line.

I forget offhand the best way to launch cmd.exe or the powershell in win7 - google should know how. Once you get a command windows open, navigate to where you put yafu and try the commands there.

[QUOTE=cgy606;288836]I tried exactly what you did. Here is my window:



02/09/12 21:11:40 v1.30 @ COMPUTERBOX, System/Build Info:
Using GMP-ECM 6.3, Powered by GMP 5.0.1
detected Intel(R) Core(TM) i3-2330M CPU @ 2.20GHz
detected L1 = 32768 bytes, L2 = 3145728 bytes, CL = 64 bytes
measured cpu frequency ~= 2183.231400

===============================================================
======= Welcome to YAFU (Yet Another Factoring Utility) =======
======= [EMAIL="bbuhrow@gmail.com"]bbuhrow@gmail.com[/EMAIL] =======
======= Type help at any time, or quit to quit =======
===============================================================
cached 78498 primes. pmax = 999983


>> yafu factor(50!+3) -plan none

unrecognized token: yafufactor
>>[/QUOTE]
Oh!!! You are trying to use it from inside of the interpreter, why don't you say so???

So, double click on yafu, and after you see the story with "welcome to yafu" bla bla and the ">>" prompter, then type

factor(50!+3)

and press enter.

To have yafu skip the ecm, you have to previously edit the yafu.ini file and insert the line "plan=none" into it, anywhere. All commands given inside of the interpreter will use the settings in the ini file, unless otherwise specified. From inside of the interpreter you can not use the switches. Read that fsking doc file!

[CODE]

02/10/12 11:19:16 v1.30 @ [COLOR=Red]BLA-BLA-BLA[/COLOR], System/Build Info:
Using GMP-ECM 6.4-rc1, Powered by MPIR 2.5.0
detected [COLOR=Red]BLA BLA[/COLOR]
detected [COLOR=Red]BLA BLA[/COLOR]
measured cpu frequency ~= [COLOR=Red]BLA BLA[/COLOR]

===============================================================
======= Welcome to YAFU (Yet Another Factoring Utility) =======
======= bbuhrow@gmail.com =======
======= Type help at any time, or quit to quit =======
===============================================================
cached 78498 primes. pmax = 999983


>> factor(50!+3)

factoring 30414093201713378043612608166064768844377641568960512000000000003
using pretesting plan: normal [COLOR=Red]<<<here I did not edit my ini file just for you, so it is still using the normal plan[/COLOR]
using tune info for qs/gnfs crossover

div: primes less than 10000
pp1: starting B1 = 20K, B2 = gmp-ecm default on C62
Total factoring time = 0.0781 seconds


***factors found***

P1 = 3
P3 = 131
PRP9 = 248108011
PRP54 = 311918788190947222874292940890105533706586811384340161

ans = 1

>>

[/CODE]

[QUOTE=bsquared;288825]Read docfile.txt that came with the distribution. You want to use the -pretest_ratio and -pretest switches.[/QUOTE]

Hi,

I am using the pretest_ratio function as given in the doc file. Say if I wanted to run factor() without siqs/nfs using ecm upto t15, the command would be:

yafu.exe "factor(num)" -v -plan custom -pretest -pretest_ratio t15

I tried that is this is my output window:



C:\Users\Chris\Documents\yafu-1.30>yafu-64k-x64.exe "factor(156!+3)" -v -plan custom -pretest -pretest_ratio t15


02/10/12 15:26:55 v1.30 @ COMPUTERBOX, System/Build Info:
Using GMP-ECM 6.3, Powered by GMP 5.0.1
detected Intel(R) Core(TM) i3-2330M CPU @ 2.20GHz
detected L1 = 32768 bytes, L2 = 3145728 bytes, CL = 64 bytes
measured cpu frequency ~= 2192.556300

===============================================================
======= Welcome to YAFU (Yet Another Factoring Utility) =======
======= [email]bbuhrow@gmail.com[/email] =======
======= Type help at any time, or quit to quit =======
===============================================================
cached 78498 primes. pmax = 999983


>> factoring 7471062926282894447083809372938315446595021122486916791549350290289479275330995892068648153667982343291532355620806075620192368713669359591165017388036661745378108672252417960853105977546
19259343815926673638047312709851500780194770609766400000000000000000000000000000000000003
using pretesting plan: custom
custom pretest ratio is: 0.31
no tune info: using qs/gnfs crossover of 95 digits

div: primes less than 10000
div: found prime factor = 3
div: found prime factor = 379
fmt: 1000000 iterations
rho: x^2 + 3, starting 1000 iterations on C273
rho: x^2 + 2, starting 1000 iterations on C273
rho: found prp5 factor = 28817
rho: x^2 + 2, starting 1000 iterations on C269
rho: found prp5 factor = 78079
rho: x^2 + 2, starting 1000 iterations on C264
rho: found prp6 factor = 179939
rho: x^2 + 2, starting 1000 iterations on C259
rho: x^2 + 1, starting 1000 iterations on C259
pp1: starting B1 = 20K, B2 = gmp-ecm default on C259
pp1: found prp12 factor = 778015120511
pm1: starting B1 = 100K, B2 = gmp-ecm default on C247
***** setting target pretesting digits to 76.00
***** sum: have completed work to t0.00
***** work done at B1=2000: 0 curves, max work = 30 curves
***** 30 more curves at B1=2000 needed to get to t76.00
ecm: 30/30 curves on C247 input, at B1 = 2K, B2 = gmp-ecm default
***** setting target pretesting digits to 76.00
***** t15: 1.00
***** t20: 0.04
***** sum: have completed work to t15.18
***** work done at B1=11000: 0 curves, max work = 74 curves
***** 74 more curves at B1=11000 needed to get to t76.00
ecm: 43/74 curves on C247 input, at B1 = 11K, B2 = gmp-ecm default
ecm: found prp20 factor = 40459139945305454467

***** setting target pretesting digits to 69.85
***** t15: 4.67
***** t20: 0.63
***** t25: 0.03
***** sum: have completed work to t18.15
***** work done at B1=11000: 44 curves, max work = 74 curves
***** 30 more curves at B1=11000 needed to get to t69.85
ecm: 30/30 curves on C227 input, at B1 = 11K, B2 = gmp-ecm default
***** setting target pretesting digits to 69.85
***** t15: 7.17
***** t20: 1.04
***** t25: 0.05
***** sum: have completed work to t20.24
***** work done at B1=50000: 0 curves, max work = 214 curves
***** 214 more curves at B1=50000 needed to get to t69.85
ecm: 214/214 curves on C227 input, at B1 = 50K, B2 = gmp-ecm default
pp1: starting B1 = 1250K, B2 = gmp-ecm default on C227
pp1: starting B1 = 1250K, B2 = gmp-ecm default on C227
pp1: starting B1 = 1250K, B2 = gmp-ecm default on C227
pm1: starting B1 = 2500K, B2 = gmp-ecm default on C227
***** setting target pretesting digits to 69.85
***** t15: 37.74
***** t20: 11.23
***** t25: 1.05
***** t30: 0.07
***** sum: have completed work to t25.33
***** work done at B1=250000: 0 curves, max work = 430 curves
***** 430 more curves at B1=250000 needed to get to t69.85
ecm: 54/430 curves on C227 input, at B1 = 250K, B2 = gmp-ecm default



It is not running properly, it is using a pretest ratio of .31 and hence running upto t69.85 on the latest factor. What am I doing wrong?

However, if I use this command:

C:\Users\Chris\Documents\yafu-1.30>yafu-64k-x64.exe "factor(156!+3)" -v -plan custom -pretest -pretest_ratio .1

Then it will test until t_level=pretest_ratio*input_digit_size, in this case the last factor would be tested to a t_level of t22.7. If another say, 22 digit factor were found and we were left with a C202, then it would stop because the new t_level would be t20.2. What I would like is to is to set t_level directly, not the pretest_ratio. Is this possible? That way, regardless of the input digit size I would know that I have tested this number such that with probability e(-1) I have missed a factor that is smaller then the t_level.

[QUOTE=cgy606;288952] That way, regardless of the input digit size I would know that I have tested this number such that with probability e(-1) I have missed a factor that is smaller then the t_level.[/QUOTE]

If that is all you want to do, you don't need to use factor(). Just call ecm() directly with the t-level's worth of curves you want to run. :unsure:

[QUOTE=bsquared;289097]If that is all you want to do, you don't need to use factor(). Just call ecm() directly with the t-level's worth of curves you want to run. :unsure:[/QUOTE]

Ok cool, so if I wanted to run up to t35 (which would be up to 904 curves of B1=1M), so would I enter(30+74+214+430+904=1652)

ecm(number,1652)

or something like this:

ecm(number,904) -B1ecm 1000000

Will it run all curves at B1=1M or will it go through the staging (B1=2K then B1=11K ...) until x curves have been finished at -B1ecm?

Just out of curiosity, what is the difference between running all curves up to B1=1M (Meaning 30 curves at B1=2K, 74 at B1=11K .... 904 at B1=1M) and simply running 904 curves at B1=1M (Not running the subsequent lower staging). Is it just that if you suspect that there might be say a 15 or 20 digit factor, the staging method will find it faster then starting at a high bound and searching(Which in principal should still have the same probability of missing of factor with y-digits as if all the previous stages were ran)?

Another quick question on nfs. I am currently trying to push my computer a little harder and factor 100!+3 on the remaining c127 which I am sure has no factor smaller then p35? I have a i3-2330M duo core processor at 2.2GHz and am running yafu with 3 threads. Here is a sample readout:

found poly: # norm 2.142917e-012 alpha -5.427436 e 9.024e-011 rroots 3
found poly: # norm 2.178229e-012 alpha -5.451724 e 9.084e-011 rroots 3
found poly: # norm 2.178229e-012 alpha -5.451724 e 9.084e-011 rroots 3
found poly: # norm 2.142917e-012 alpha -5.427436 e 9.024e-011 rroots 3
best poly:
# norm 3.914108e-012 alpha -6.443946 e 1.293e-010 rroots 5
n: 6125008134212459906123352530790285908284977375793307455074295230687312693872606775121049675050791941759371327836039451992923641
skew: 793727.89
c0: 11086696664696866967563109790105
c1: 246584476399930617080847459
c2: -2161728965457818242471
c3: 1412568101131219
c4: 2932998476
c5: 612
Y0: -6310604787723673632080792
Y1: 1014626493881
nfs: commencing algebraic side lattice sieving over range: 2930000 - 3010000
nfs: commencing algebraic side lattice sieving over range: 2850000 - 2930000
nfs: commencing algebraic side lattice sieving over range: 3010000 - 3090000
Warning: lowering FB_bound to 2849999.
Warning: lowering FB_bound to 2929999.
Warning: lowering FB_bound to 3009999.
total yield: 250989, q=2930003 (0.03783 sec/rel)
total yield: 256599, q=3010001 (0.03808 sec/rel)
total yield: 258280, q=3090011 (0.03792 sec/rel)
found 765868 relations, need at least 7171675, continuing with sieving ...
.....
nfs: commencing algebraic side lattice sieving over range: 4690000 - 4770000
nfs: commencing algebraic side lattice sieving over range: 4530000 - 4610000
nfs: commencing algebraic side lattice sieving over range: 4610000 - 4690000
Warning: lowering FB_bound to 4529999.
Warning: lowering FB_bound to 4689999.
Warning: lowering FB_bound to 4609999.
total yield: 253525, q=4770011 (0.03594 sec/rel)
total yield: 255047, q=4610003 (0.03577 sec/rel)
total yield: 255266, q=4690001 (0.03574 sec/rel)
found 6134043 relations, need at least 7171675, continuing with sieving ...
nfs: commencing algebraic side lattice sieving over range: 4930000 - 5010000
nfs: commencing algebraic side lattice sieving over range: 4850000 - 4930000
nfs: commencing algebraic side lattice sieving over range: 4770000 - 4850000
Warning: lowering FB_bound to 4849999.
Warning: lowering FB_bound to 4929999.
Warning: lowering FB_bound to 4769999.
total yield: 252226, q=5010013 (0.03553 sec/rel)
total yield: 253390, q=4850009 (0.03542 sec/rel)
total yield: 253347, q=4930001 (0.03552 sec/rel)
found 6893006 relations, need at least 7171675, continuing with sieving ...
nfs: commencing algebraic side lattice sieving over range: 5170000 - 5250000
nfs: commencing algebraic side lattice sieving over range: 5010000 - 5090000
nfs: commencing algebraic side lattice sieving over range: 5090000 - 5170000
Warning: lowering FB_bound to 5169999.
Warning: lowering FB_bound to 5009999.
Warning: lowering FB_bound to 5089999.
total yield: 249972, q=5250029 (0.03590 sec/rel)
total yield: 253501, q=5090003 (0.03571 sec/rel)
total yield: 253636, q=5170001 (0.03581 sec/rel)
found 7650115 relations, need at least 7171675, proceeding with filtering ...
nfs: commencing msieve filtering
6125008134212459906123352530790285908284977375793307455074295230687312693872606775121049675050791941759371327836039451992923641

commencing relation filtering
estimated available RAM is 4043.9 MB
commencing duplicate removal, pass 1
found 887069 hash collisions in 7650115 relations
added 62074 free relations
commencing duplicate removal, pass 2
found 615240 duplicates and 7096949 unique relations
memory use: 26.6 MB
reading ideals above 100000
commencing singleton removal, initial pass
memory use: 188.3 MB
reading all ideals from disk
memory use: 258.7 MB
keeping 9714524 ideals with weight <= 200, target excess is 37051
commencing in-memory singleton removal
begin with 7096949 relations and 9714524 unique ideals
reduce to 108 relations and 0 ideals in 9 passes
max relations containing the same ideal: 0
nfs: commencing algebraic side lattice sieving over range: 5410000 - 5490000
nfs: commencing algebraic side lattice sieving over range: 5330000 - 5410000
nfs: commencing algebraic side lattice sieving over range: 5250000 - 5330000
Warning: lowering FB_bound to 5329999.
Warning: lowering FB_bound to 5249999.
Warning: lowering FB_bound to 5409999.
total yield: 246903, q=5330023 (0.03614 sec/rel)
total yield: 249570, q=5410007 (0.03613 sec/rel)
total yield: 249595, q=5490011 (0.03623 sec/rel)
found 8396183 relations, need at least 7171675, proceeding with filtering ...
nfs: commencing msieve filtering
6125008134212459906123352530790285908284977375793307455074295230687312693872606775121049675050791941759371327836039451992923641

commencing relation filtering
estimated available RAM is 4043.9 MB
commencing duplicate removal, pass 1
found 1043797 hash collisions in 8458257 relations
added 265 free relations
commencing duplicate removal, pass 2
found 721658 duplicates and 7736864 unique relations
memory use: 41.3 MB
reading ideals above 100000
commencing singleton removal, initial pass
memory use: 188.3 MB
reading all ideals from disk
memory use: 282.3 MB
keeping 10096319 ideals with weight <= 200, target excess is 40457
commencing in-memory singleton removal
begin with 7736864 relations and 10096319 unique ideals
reduce to 120 relations and 0 ideals in 12 passes
max relations containing the same ideal: 0
nfs: commencing algebraic side lattice sieving over range: 5570000 - 5650000
nfs: commencing algebraic side lattice sieving over range: 5490000 - 5570000
nfs: commencing algebraic side lattice sieving over range: 5650000 - 5730000
Warning: lowering FB_bound to 5649999.
Warning: lowering FB_bound to 5569999.
Warning: lowering FB_bound to 5489999.
total yield: 240481, q=5650009 (0.03658 sec/rel)
total yield: 247609, q=5730007 (0.03641 sec/rel)
total yield: 250162, q=5570003 (0.03620 sec/rel)
found 9134435 relations, need at least 7171675, proceeding with filtering ...
nfs: commencing msieve filtering
6125008134212459906123352530790285908284977375793307455074295230687312693872606775121049675050791941759371327836039451992923641

commencing relation filtering
estimated available RAM is 4043.9 MB
commencing duplicate removal, pass 1
found 1200557 hash collisions in 9196774 relations
added 245 free relations
commencing duplicate removal, pass 2
found 832220 duplicates and 8364799 unique relations
memory use: 41.3 MB
reading ideals above 100000
commencing singleton removal, initial pass
memory use: 344.5 MB
reading all ideals from disk
memory use: 305.4 MB
keeping 10438604 ideals with weight <= 200, target excess is 43909
commencing in-memory singleton removal
begin with 8364799 relations and 10438604 unique ideals
reduce to 132 relations and 0 ideals in 19 passes
max relations containing the same ideal: 0
nfs: commencing algebraic side lattice sieving over range: 5890000 - 5970000
nfs: commencing algebraic side lattice sieving over range: 5730000 - 5810000
nfs: commencing algebraic side lattice sieving over range: 5810000 - 5890000
total yield: 43787, q=5744701 (0.03691 sec/rel)


As can be seen, sieving has found more relations then the amount originally needed. Yet it is still trying to find more. Why? I tried reading the ggnfs documentation but it doesn't explain this. With my computer, in this environment (2.2GHz, 3 threads and 4GB ram), how long should it take to finished sieving, perform the linear algebra, and sqrt to completely factor this number? Thank you,

[QUOTE=cgy606;289180]Another quick question on nfs. I am currently trying to push my computer a little harder and factor 100!+3 on the remaining c127 which I am sure has no factor smaller then p35? I have a i3-2330M duo core processor at 2.2GHz and am running yafu with 3 threads. Here is a sample readout:

found poly: # norm 2.142917e-012 alpha -5.427436 e 9.024e-011 rroots 3
found poly: # norm 2.178229e-012 alpha -5.451724 e 9.084e-011 rroots 3
found poly: # norm 2.178229e-012 alpha -5.451724 e 9.084e-011 rroots 3
found poly: # norm 2.142917e-012 alpha -5.427436 e 9.024e-011 rroots 3
best poly:
# norm 3.914108e-012 alpha -6.443946 e 1.293e-010 rroots 5
n: 6125008134212459906123352530790285908284977375793307455074295230687312693872606775121049675050791941759371327836039451992923641
skew: 793727.89
c0: 11086696664696866967563109790105
c1: 246584476399930617080847459
c2: -2161728965457818242471
c3: 1412568101131219
c4: 2932998476
c5: 612
Y0: -6310604787723673632080792
Y1: 1014626493881
nfs: commencing algebraic side lattice sieving over range: 2930000 - 3010000
nfs: commencing algebraic side lattice sieving over range: 2850000 - 2930000
nfs: commencing algebraic side lattice sieving over range: 3010000 - 3090000
Warning: lowering FB_bound to 2849999.
Warning: lowering FB_bound to 2929999.
Warning: lowering FB_bound to 3009999.
total yield: 250989, q=2930003 (0.03783 sec/rel)
total yield: 256599, q=3010001 (0.03808 sec/rel)
total yield: 258280, q=3090011 (0.03792 sec/rel)
found 765868 relations, need at least 7171675, continuing with sieving ...
.....
nfs: commencing algebraic side lattice sieving over range: 4690000 - 4770000
nfs: commencing algebraic side lattice sieving over range: 4530000 - 4610000
nfs: commencing algebraic side lattice sieving over range: 4610000 - 4690000
Warning: lowering FB_bound to 4529999.
Warning: lowering FB_bound to 4689999.
Warning: lowering FB_bound to 4609999.
total yield: 253525, q=4770011 (0.03594 sec/rel)
total yield: 255047, q=4610003 (0.03577 sec/rel)
total yield: 255266, q=4690001 (0.03574 sec/rel)
found 6134043 relations, need at least 7171675, continuing with sieving ...
nfs: commencing algebraic side lattice sieving over range: 4930000 - 5010000
nfs: commencing algebraic side lattice sieving over range: 4850000 - 4930000
nfs: commencing algebraic side lattice sieving over range: 4770000 - 4850000
Warning: lowering FB_bound to 4849999.
Warning: lowering FB_bound to 4929999.
Warning: lowering FB_bound to 4769999.
total yield: 252226, q=5010013 (0.03553 sec/rel)
total yield: 253390, q=4850009 (0.03542 sec/rel)
total yield: 253347, q=4930001 (0.03552 sec/rel)
found 6893006 relations, need at least 7171675, continuing with sieving ...
nfs: commencing algebraic side lattice sieving over range: 5170000 - 5250000
nfs: commencing algebraic side lattice sieving over range: 5010000 - 5090000
nfs: commencing algebraic side lattice sieving over range: 5090000 - 5170000
Warning: lowering FB_bound to 5169999.
Warning: lowering FB_bound to 5009999.
Warning: lowering FB_bound to 5089999.
total yield: 249972, q=5250029 (0.03590 sec/rel)
total yield: 253501, q=5090003 (0.03571 sec/rel)
total yield: 253636, q=5170001 (0.03581 sec/rel)
found 7650115 relations, need at least 7171675, proceeding with filtering ...
nfs: commencing msieve filtering
6125008134212459906123352530790285908284977375793307455074295230687312693872606775121049675050791941759371327836039451992923641

commencing relation filtering
estimated available RAM is 4043.9 MB
commencing duplicate removal, pass 1
found 887069 hash collisions in 7650115 relations
added 62074 free relations
commencing duplicate removal, pass 2
found 615240 duplicates and 7096949 unique relations
memory use: 26.6 MB
reading ideals above 100000
commencing singleton removal, initial pass
memory use: 188.3 MB
reading all ideals from disk
memory use: 258.7 MB
keeping 9714524 ideals with weight <= 200, target excess is 37051
commencing in-memory singleton removal
begin with 7096949 relations and 9714524 unique ideals
reduce to 108 relations and 0 ideals in 9 passes
max relations containing the same ideal: 0
nfs: commencing algebraic side lattice sieving over range: 5410000 - 5490000
nfs: commencing algebraic side lattice sieving over range: 5330000 - 5410000
nfs: commencing algebraic side lattice sieving over range: 5250000 - 5330000
Warning: lowering FB_bound to 5329999.
Warning: lowering FB_bound to 5249999.
Warning: lowering FB_bound to 5409999.
total yield: 246903, q=5330023 (0.03614 sec/rel)
total yield: 249570, q=5410007 (0.03613 sec/rel)
total yield: 249595, q=5490011 (0.03623 sec/rel)
found 8396183 relations, need at least 7171675, proceeding with filtering ...
nfs: commencing msieve filtering
6125008134212459906123352530790285908284977375793307455074295230687312693872606775121049675050791941759371327836039451992923641

commencing relation filtering
estimated available RAM is 4043.9 MB
commencing duplicate removal, pass 1
found 1043797 hash collisions in 8458257 relations
added 265 free relations
commencing duplicate removal, pass 2
found 721658 duplicates and 7736864 unique relations
memory use: 41.3 MB
reading ideals above 100000
commencing singleton removal, initial pass
memory use: 188.3 MB
reading all ideals from disk
memory use: 282.3 MB
keeping 10096319 ideals with weight <= 200, target excess is 40457
commencing in-memory singleton removal
begin with 7736864 relations and 10096319 unique ideals
reduce to 120 relations and 0 ideals in 12 passes
max relations containing the same ideal: 0
nfs: commencing algebraic side lattice sieving over range: 5570000 - 5650000
nfs: commencing algebraic side lattice sieving over range: 5490000 - 5570000
nfs: commencing algebraic side lattice sieving over range: 5650000 - 5730000
Warning: lowering FB_bound to 5649999.
Warning: lowering FB_bound to 5569999.
Warning: lowering FB_bound to 5489999.
total yield: 240481, q=5650009 (0.03658 sec/rel)
total yield: 247609, q=5730007 (0.03641 sec/rel)
total yield: 250162, q=5570003 (0.03620 sec/rel)
found 9134435 relations, need at least 7171675, proceeding with filtering ...
nfs: commencing msieve filtering
6125008134212459906123352530790285908284977375793307455074295230687312693872606775121049675050791941759371327836039451992923641

commencing relation filtering
estimated available RAM is 4043.9 MB
commencing duplicate removal, pass 1
found 1200557 hash collisions in 9196774 relations
added 245 free relations
commencing duplicate removal, pass 2
found 832220 duplicates and 8364799 unique relations
memory use: 41.3 MB
reading ideals above 100000
commencing singleton removal, initial pass
memory use: 344.5 MB
reading all ideals from disk
memory use: 305.4 MB
keeping 10438604 ideals with weight <= 200, target excess is 43909
commencing in-memory singleton removal
begin with 8364799 relations and 10438604 unique ideals
reduce to 132 relations and 0 ideals in 19 passes
max relations containing the same ideal: 0
nfs: commencing algebraic side lattice sieving over range: 5890000 - 5970000
nfs: commencing algebraic side lattice sieving over range: 5730000 - 5810000
nfs: commencing algebraic side lattice sieving over range: 5810000 - 5890000
total yield: 43787, q=5744701 (0.03691 sec/rel)


As can be seen, sieving has found more relations then the amount originally needed. Yet it is still trying to find more. Why? I tried reading the ggnfs documentation but it doesn't explain this. With my computer, in this environment (2.2GHz, 3 threads and 4GB ram), how long should it take to finished sieving, perform the linear algebra, and sqrt to completely factor this number? Thank you,[/QUOTE]
7171675 is only a guess. It is often a very poor guess. If you look around the forum you will find many places with estimates.

[QUOTE=cgy606;289174]Ok cool, so if I wanted to run up to t35 (which would be up to 904 curves of B1=1M), so would I enter(30+74+214+430+904=1652)

ecm(number,1652)

or something like this:

ecm(number,904) -B1ecm 1000000

Will it run all curves at B1=1M or will it go through the staging (B1=2K then B1=11K ...) until x curves have been finished at -B1ecm?

Just out of curiosity, what is the difference between running all curves up to B1=1M (Meaning 30 curves at B1=2K, 74 at B1=11K .... 904 at B1=1M) and simply running 904 curves at B1=1M (Not running the subsequent lower staging). Is it just that if you suspect that there might be say a 15 or 20 digit factor, the staging method will find it faster then starting at a high bound and searching(Which in principal should still have the same probability of missing of factor with y-digits as if all the previous stages were ran)?[/QUOTE]

Correct - running all stages from B1=2K ... up to 1M or more is simply tailored to find smaller factors more quickly, should they exist. It is also to prevent multiple small factors from being found at the same time. For example, if a number had two 15 digit factors and you tried curves at B1=1M, then you stand a chance of finding the C30 composite factor instead of either 15 digit prime factor.

running:
[CODE]ecm(number,904) -B1ecm 1000000[/CODE]
is probably the simplest way to test for factors below t35, with the above caveats. Using -pretest with -pretest_ratio equal to 35/digit_size is another easy way.

[QUOTE=cgy606;289180]
As can be seen, sieving has found more relations then the amount originally needed. Yet it is still trying to find more. Why? I tried reading the ggnfs documentation but it doesn't explain this. With my computer, in this environment (2.2GHz, 3 threads and 4GB ram), how long should it take to finished sieving, perform the linear algebra, and sqrt to completely factor this number? Thank you,[/QUOTE]

The documentation is a little lacking here, but as henryzz said, and as you will find all sorts of other places on this forum, the initial number of relations is a guess. yafu will keep trying until the number is factored. Don't know exactly how long it will take. probably longer than 6-8 hrs. probably less than 2 days.

As noted, the estimate for the number of relations needed is usually off. For a number of this size you'll need in the vicinity of 10 million relations. Based on the post-processing attempts, you're nearly there.[QUOTE=cgy606;289180]keeping 10438604 ideals with weight <= 200, target excess is 43909
commencing in-memory singleton removal
begin with [COLOR="Red"]8364799[/COLOR] relations and [COLOR="Red"]10438604[/COLOR] unique ideals[/QUOTE]Keep an eye on the ratio of relations to ideals. You need more relations than ideals, and the larger the number the more extra you need.[quote]reduce to [COLOR="Red"]132[/COLOR] relations and 0 ideals in 19 passes
max relations containing the same ideal: 0[/quote]As you get closer, more relations will survive the reduction step, until they exceed the ideals that make it....

[QUOTE=bsquared;289205]Correct - running all stages from B1=2K ... up to 1M or more is simply tailored to find smaller factors more quickly, should they exist. It is also to prevent multiple small factors from being found at the same time. For example, if a number had two 15 digit factors and you tried curves at B1=1M, then you stand a chance of finding the C30 composite factor instead of either 15 digit prime factor.

running:
[CODE]ecm(number,904) -B1ecm 1000000[/CODE]
is probably the simplest way to test for factors below t35, with the above caveats. Using -pretest with -pretest_ratio equal to 35/digit_size is another easy way.



The documentation is a little lacking here, but as henryzz said, and as you will find all sorts of other places on this forum, the initial number of relations is a guess. yafu will keep trying until the number is factored. Don't know exactly how long it will take. probably longer than 6-8 hrs. probably less than 2 days.[/QUOTE]

Hi,

I am typing as above the following code:

[CODE]ecm(number,904) -B1ecm 1000000[/CODE]

However, it runs ecm until the firsts factor is found then stops. Is there a way to tell it to run ecm until all curves are done regardless of how many factors it finds (in other words, keep running until it finishes that many curves). I looked at the docfile and then is a flag to tell ecm to find only one factor -one, hence if you do not include this flag it should factor until either the number of curves is done or the factorization is complete. Thank you,