![]() |
+1600@43e6 (total 2000 here), and counting...
|
I injected 18000 curves @110M, should soon be visible on the stats page. As soon as the first curves return.
yoyo |
I've started polynomial selection.
|
+1000@43e6 (total 3000 here), and counting...
|
+1000@43e6 (total 4000 here), and counting...
|
+1000@43e6 (total 5000 here), and counting...
That's over 7000 showing in the thread, so far, but I'll let my ECM keep running until jrk posts a polynomial. Then I can see if my relations scripts are now correct. |
Yoyo have done over 12500 curves @ 110.000.000
[URL="http://factorization.ath.cx/sequences.php?se=1&eff=2&aq=4788&action=last20&fr=0&to=100"]C165_4788_i5144[/URL] (B1 = 110000000, 12515 / 18000 curves) |
The C129 at iteration 5151 is ready for NFS.
|
Well, I'd like to whittle down my ignorance a little more, if possible...
I have the following polynomial for the current c129: [code] # norm 2.687898e-12 alpha -7.317079 e 1.065e-10 rroots 3 skew: 473579.03 c0: -27988440920005007752835908970188 c1: 36194624374531631102222182 c2: 2390917326532765272777 c3: -11161597941910483 c4: -11576524265 c5: 6600 Y0: -9803487406814689417760025 Y1: 20246307534533 [/code]Where (how) do I get (create) the other values? I thought I had a link to a thread that explained the procedure, but alas, I can't find it.:sad: Nor, can I find one via the search terms I tried... All my prior work was done by letting jrk, Aliqueit and factmsieve.py do the "thinking" part. But, I really need to learn some more of the actual steps, if possible. A steer toward the right thread would be appreciated. Then I'll crack the c129 as my homework... |
I've coded some stuff years ago into the factMsieve.pl so I use it (or else I would have forgotten);
you put the initial poly (add n: of course, and [B]type: gnfs[/B]), into a file, say, t.poly, and run factMsieve.pl t and kill it soon. Then copy the auto-generated parameters from the .job file (below, [B]in bold[/B]) to the poly to get something like this: [CODE][B]n: 597647818789865479070164232377390690874759339620592468154446562002337248831301293863065913519522870900965788830826787436105784791[/B] [B]type: gnfs[/B] # norm 2.687898e-12 alpha -7.317079 e 1.065e-10 rroots 3 skew: 473579.03 c0: -27988440920005007752835908970188 c1: 36194624374531631102222182 c2: 2390917326532765272777 c3: -11161597941910483 c4: -11576524265 c5: 6600 Y0: -9803487406814689417760025 Y1: 20246307534533 [B]rlim: 6800000[/B] [B]alim: 6800000[/B] [B]lpbr: 28[/B] [B]lpba: 28[/B] [B]mfbr: 55[/B] [B]mfba: 55[/B] [B]rlambda: 2.5[/B] [B]alambda: 2.5[/B][/CODE] (one last touch up is: because t.job file will have one of the lims lowered, reset both a/rlim values to the larger of the two). This is the simplest recipe without any variations. If the number is larger than this one, you can spend some time changing each parameter, and use some canned tricks like the 3LP trick, or the lopsided lpb (e.g. 29 and 30) for some quartics, etc etc etc. If the number is small, any time spent refining will be hardly compensated by simply shooting away the poly to a few computers with separate chosen ranges (controlled by [I]-f[/I] and [I]-c[/I]), and then, as usual, collecting all relations together, (optionally, [I]remdups[/I]), and then [I]msieve -nc[/I]. |
Excellent! Thank you.
All worked as explained and my machines are sieving along rather well. I actually caught your unedited post and went off and achieved the same results as shown, before returning to find the rest. I think I'll work with this level for now before delving in any deeper. I have some scripts running all the machines for either ECM or sieving at the moment, but I'm looking at building a script to run the poly selection on all of them at once, too. Thanks again... |
| All times are UTC. The time now is 23:12. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.