110 more curves at B1=26e7, B2=2716922571100

feeling a bit lonely here....

BTW: According to the curves in the DB, we currently have approx. 38.1% of t55. (I guess we will need a bit more than full t55, please correct me if I'm wrong.)

Sorry for the neophyte questions, but I'm not quite sure my GMP-ECM is functioning correctly. I tried to run some ECM on the c170 (2 curves, twice) and had the following results. I'm curious if something is wrong or the output I received is correct. It seems to be displaying a lot of 0ms timings and even claims to "expect" be able to find a 65 digit factor in 0ms at the end.?? I grabbed the values firejuggler shows in the db for B1 and B2. If I'm going to run more curves, what values would be preferred? Is any of this due to limited memory?
[code]
[id@comp ECM]$ gmp-ecm -inp ecmin -savea ecmout -chkpnt ecmchkpnt -c 2 -v -v -maxmem 384 11e6 35133391030
GMP-ECM 6.2.3 [powered by GMP 4.3.1] [ECM]
Running on comp
Input number is 31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499 (170 digits)
Using MODMULN
Using B1=11000000, B2=35133391030, polynomial Dickson(12), sigma=1850961251
dF=32768, k=3, d=324870, d2=11, i0=23
a=23387681639170183308600198584142754270943525532505145783909343241199499742516069833234780268345880494085366867305819401899041039435272273829440110065741979054832502666836
starting point: x=18369923641261736314157777842535887389716475184869660807517730523202415617725288531895835038172335431434992763550487672091229879265502547707886752165792427568664050192593
Expected number of curves to find a factor of n digits:
20 25 30 35 40 45 50 55 60 65
2 7 26 122 681 4480 33652 283939 2655154 2.7e+07
Step 1 took 65380ms
x=9718039536240222908487904190811844998510118974121125585660360442156073256424553647589154230384772885824208021339446288584207961289900405110195487312944712307421225147768
After switch to Weierstrass form, P=(9702706429020531360046406560005746039729317543627180801560778429612135284526592841737061597464247770742995414310886997506288272467536154580043529017872210973634126514679, 19920054830239467199690750512819797921641903166051377452774153771716123824524303016667123687317219436554893842604068867833155989063971980026411834053319610180869006203113)
on curve Y^2 = X^3 + 30595411613108539100205734208917865529374742808519510546496011837784500119291899921554564909292579171367971546882040194303985695013435916300338065409932471924420263465063 * X + b
Using 40 small primes for NTT
Estimated memory usage: 111M
Initializing tables of differences for F took 0ms
Computing roots of F took 0ms
Building F from its roots took 0ms
Computing 1/F took 0ms
Initializing table of differences for G took 0ms
Computing roots of G took 0ms
Building G from its roots took 0ms
Computing roots of G took 0ms
Building G from its roots took 0ms
Computing G * H took 0ms
Reducing G * H mod F took 0ms
Computing roots of G took 0ms
Building G from its roots took 0ms
Computing G * H took 0ms
Reducing G * H mod F took 0ms
Computing polyeval(F,G) took 0ms
Computing product of all F(g_i) took 0ms
Product of G(f_i) = 25203911247316000581766189028902104589661237329347104964862257287870197886075806286789006038929693327584834965999005029637781608538033813247029043550598060608539353573697
Step 2 took 0ms
Expected time to find a factor of n digits:
20 25 30 35 40 45 50 55 60 65
2.68m 7.53m 28.22m 2.21h 12.37h 3.39d 25.47d 214.86d 5.50y 56.19y
Using MODMULN
Using B1=11000000, B2=11000000-35133391030, polynomial Dickson(12), sigma=2292345453
dF=32768, k=3, d=324870, d2=11, i0=23
a=24498269769533427425636932204678936786391941258458950422921421215068022230341612907245516264260086457661927254152447223668840919161817584983311788105002802817107760957221
starting point: x=2310230163871960726850307073698863926650255464005214411665126706602204562443389284912230591341672776270299965360317484935115225716492298923502847484717721191107466843874
Expected number of curves to find a factor of n digits:
20 25 30 35 40 45 50 55 60 65
2 7 26 122 681 4480 33652 283939 2655154 2.7e+07
Step 1 took 0ms
x=30309401938730556835058834435257803487431886548999932944710990125612722541637421244907132964719559713230891991156918798112750718045333760783364826959007697418533004171276
After switch to Weierstrass form, P=(9784980626054809504604168847968388117850242716872797835212981511622085480533201894878342225008351542653702179168430148332762566404253170639334224605791831754467213872929, 21828098106914272179570986593954318985737517327022882508976331803296291914339743011936302625066622575467184348094124649369118202915444730335904541299743312744025255382428)
on curve Y^2 = X^3 + 14243146034623987242138422279944799657258967283192186584158170552547712707773486079466208903054109295205580795018624658467127172628904299280870160482692046230087661705063 * X + b
Using 40 small primes for NTT
Estimated memory usage: 111M
Initializing tables of differences for F took 0ms
Computing roots of F took 0ms
Building F from its roots took 0ms
Computing 1/F took 0ms
Initializing table of differences for G took 0ms
Computing roots of G took 0ms
Building G from its roots took 0ms
Computing roots of G took 0ms
Building G from its roots took 0ms
Computing G * H took 0ms
Reducing G * H mod F took 0ms
Computing roots of G took 0ms
Building G from its roots took 0ms
Computing G * H took 0ms
Reducing G * H mod F took 0ms
Computing polyeval(F,G) took 0ms
Computing product of all F(g_i) took 0ms
Product of G(f_i) = 5734679191674636185135172922258869890647801473945397152665772116784045885056568924722436745152215317967705731257095209395241327143734980111604790080227331702812627875904
Step 2 took 0ms
Expected time to find a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0ms 0ms 0ms 0ms 0ms 0ms 0ms 0ms 0ms 0ms
[id@comp ECM]$
[/code]I ran it twice with similar results and the following was written to the ecmout file:
[code]
METHOD=ECM; SIGMA=3682911017; B1=11000000; N=31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499; X=0x19263391e3043b4c1cdbc8027653138e2077b6052fb20350a813bd0fecf0c6694457fe3fb53d94db3960d4f6eca6707b0ba2e77ad4eb5f255a41472f69f8efdeaf57a05d2b457; CHECKSUM=182017100; PROGRAM=GMP-ECM 6.2.3; WHO=id@comp; TIME=Thu Sep 9 16:11:58 2010;
METHOD=ECM; SIGMA=4045761181; B1=11000000; N=31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499; X=0x24977dc924bfcedf18c9fc67fad2580fcba787c12563bc86f35e3cedeb8d7309d24ea4a63a72d0a055053da27a022a5daec3c7aa15fea3f047cacdfeda3031992f56f71f7537a; CHECKSUM=1968037982; PROGRAM=GMP-ECM 6.2.3; WHO=id@comp; TIME=Thu Sep 9 16:23:22 2010;
METHOD=ECM; SIGMA=1850961251; B1=11000000; N=31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499; X=0x29334b2d064e838be75a12f037fea925e70bee83af09c9ae8da631d5904dc58dd1da583d6face45fc7a65aba9729b2fe9d9aa4cf1a84da5d940dddaca3a239ea7061f6fbfdd78; CHECKSUM=756406638; PROGRAM=GMP-ECM 6.2.3; WHO=id@comp; TIME=Thu Sep 9 16:38:12 2010;
METHOD=ECM; SIGMA=2292345453; B1=11000000; N=31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499; X=0x807fbf0b3b2c6405582e3b01929f2a1e868173ce43e44e2c7a72f3150ba531a248b431d3e9062edf2b1131234803540f619820c06457696e23da4bbe1f011f69288699698d80c; CHECKSUM=261971995; PROGRAM=GMP-ECM 6.2.3; WHO=id@comp; TIME=Thu Sep 9 16:49:53 2010;
[/code]Would the above be what should be sent to the db, or is there something in error?

Update:

A different machine works quite differently, displaying believable values for all the ms.

Still, what values would you prefer I use to run some curves, and how many would be good? (1.8GHz, 1GB, Ubuntu 10.04)

You can fit a B1=11e7, default B2 curve in 1GB. This is the optimal bounds for 55 digit factors. On 1.8GHz it'll take about 20 minutes per curve.

[QUOTE=jrk;229248]You can fit a B1=11e7, default B2 curve in 1GB. This is the optimal bounds for 55 digit factors. On 1.8GHz it'll take about 20 minutes per curve.[/QUOTE]

too bad that's ram and not hard drive room I think as I have about 442.61 GB free if my computer would let me write to my main drive and all portables.

Oh and did I mention I've actually looked up what Aliquot sequences are lol.

[QUOTE=science_man_88;229274]too bad that's ram and not hard drive room I think as I have about 442.61 GB free if my computer would let me write to my main drive and all portables.

Oh and did I mention I've actually looked up what Aliquot sequences are lol.[/QUOTE]

you can force ecm.exe to use a smaller amount of RAM (stage 2 will take longer, and probably a smaller B2 will be used - this is OK, just post the B2 of your curves here when you report them.):

example:

[CODE]ecm -nn -c 100 -maxmem 400 <inputfile.txt 11e7 >>outputfile.out
[/CODE]

explanation:

-nn: run at lowest priority (so that other activities like winword are not affected)
-c 100: run 100 curves
-maxmem 400: use at maximum 400 MB RAM
11e7: your B1

[QUOTE=Andi47;229183]feeling a bit lonely here....[/QUOTE]
I finished 1000 curves @ B1=11e7, B2=1589211473866

Continuing to run more curves.

(Used -B2scale 2 to make stage2 take a little more time, since I'm running both stages in parallel.)

[QUOTE=jrk;229316]I finished 1000 curves @ B1=11e7, B2=1589211473866

Continuing to run more curves.

(Used -B2scale 2 to make stage2 take a little more time, since I'm running both stages in parallel.)[/QUOTE]

:tu:

can you please run one of this "-B2scale 2" curves with ecm -v -v -v and post the output here, to get an estimation how much of these curves are needed for t55?

This machine will be dedicated to this task, for now, so I invoked ECM with the following (I show about 940MB free.):
[code]
ecm -inp ecmin -savea ecmout2 -chkpnt ecmchkpnt2 -c 100 -maxmem 900 11e7
[/code]This is what I got from two runs yesterday/overnight at 26E7 and 3178559884520:
[code]
METHOD=ECM; SIGMA=2870630484; B1=260000000; N=31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499; X=0x30d886defd5b0bb92aed224bbdbd59472186d81fab7737c741707ff4692a00d7154e945877d1039858c4e93c636a2cbc8739669b08227a1160543664840296d50b690bc8bfc5c; CHECKSUM=4199005317; PROGRAM=GMP-ECM 6.2; WHO=id@comp; TIME=Thu Sep 9 23:43:21 2010;
METHOD=ECM; SIGMA=1888999848; B1=260000000; N=31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499; X=0x3559156ea45d8606d97fc592c801c1b5dac3542e00851a1bcb7c1d0d4754b56e9c5ab7a2c564c1d28ec14b980f147bd60fe678e51b408eec030be859e55be42cdabaf584c2fcd; CHECKSUM=3366166513; PROGRAM=GMP-ECM 6.2; WHO=id@comp; TIME=Fri Sep 10 02:40:44 2010;
METHOD=ECM; SIGMA=923175235; B1=260000000; N=31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499; X=0x9d16e20fc859b12f49a9f830c039035b59a1b01cca20a25254064e5967bbe5880cb3a898176a50cbd387e3c94a13739549ec97589800e7682517f94936983beeffdce9f7294e; CHECKSUM=2622195790; PROGRAM=GMP-ECM 6.2; WHO=id@comp; TIME=Fri Sep 10 12:42:22 2010;
METHOD=ECM; SIGMA=3743831916; B1=260000000; N=31312681856591762976684825948611411853648506930718408786922952694966820760977803934965693400499529851375037912983239126649207012737394067178518887401399185420987310860499; X=0x26a67fe22df3841c400491f13b545d40e88078ed96d68efa54f8a94b4175f781407ab4085000abac6e15f36de216e2dcde2b1835ba19739b29153be84d216ef49315b740709e1; CHECKSUM=3117098619; PROGRAM=GMP-ECM 6.2; WHO=id@comp; TIME=Fri Sep 10 15:38:48 2010;
[/code]Is the above what I would submit to the db? If so, would I just paste it into the "report factors window" as is?

Thanks. I hope I can get this underway. . .

[QUOTE=EdH;229336]This machine will be dedicated to this task, for now, so I invoked ECM with the following (I show about 940MB free.):
[code]
ecm -inp ecmin -savea ecmout2 -chkpnt ecmchkpnt2 -c 100 -maxmem 900 11e7
[/code]This is what I got from two runs yesterday/overnight at 26E7 and 3178559884520:

[snip]

Is the above what I would submit to the db? If so, would I just paste it into the "report factors window" as is?

Thanks. I hope I can get this underway. . .[/QUOTE]
When the program has finished running the 100 curves you asked of it, just report (to the DB and here) that you ran 100 curves at B1=26e7 and B2=3178559884520. To report to the DB, Syd has required that you log in to it first. When you do, you'll see boxes to report your results at the bottom of the work history list for the number.

Would RSALS be interested in sieving this C170? I see they are doing other Aliquot numbers.