![]() |
![]() |
#2058 |
"Ed Hall"
Dec 2009
Adirondack Mtns
DCC16 Posts |
![]()
+1600@43e6 (total 2000 here), and counting...
|
![]() |
![]() |
![]() |
#2059 |
Oct 2006
Berlin, Germany
11218 Posts |
![]()
I injected 18000 curves @110M, should soon be visible on the stats page. As soon as the first curves return.
yoyo |
![]() |
![]() |
![]() |
#2060 |
May 2008
3·5·73 Posts |
![]()
I've started polynomial selection.
|
![]() |
![]() |
![]() |
#2061 |
"Ed Hall"
Dec 2009
Adirondack Mtns
22×883 Posts |
![]()
+1000@43e6 (total 3000 here), and counting...
|
![]() |
![]() |
![]() |
#2062 |
"Ed Hall"
Dec 2009
Adirondack Mtns
DCC16 Posts |
![]()
+1000@43e6 (total 4000 here), and counting...
|
![]() |
![]() |
![]() |
#2063 |
"Ed Hall"
Dec 2009
Adirondack Mtns
1101110011002 Posts |
![]()
+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. |
![]() |
![]() |
![]() |
#2064 |
Mar 2007
Germany
23·3·11 Posts |
![]()
Yoyo have done over 12500 curves @ 110.000.000
C165_4788_i5144 (B1 = 110000000, 12515 / 18000 curves) |
![]() |
![]() |
![]() |
#2065 |
"Ben"
Feb 2007
D2016 Posts |
![]()
The C129 at iteration 5151 is ready for NFS.
|
![]() |
![]() |
![]() |
#2066 |
"Ed Hall"
Dec 2009
Adirondack Mtns
67148 Posts |
![]()
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 ![]() 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... Last fiddled with by EdH on 2013-02-20 at 03:42 Reason: just because... |
![]() |
![]() |
![]() |
#2067 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
220518 Posts |
![]()
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 type: gnfs), 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, in bold) to the poly to get something like this: Code:
n: 597647818789865479070164232377390690874759339620592468154446562002337248831301293863065913519522870900965788830826787436105784791 type: gnfs # 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 rlim: 6800000 alim: 6800000 lpbr: 28 lpba: 28 mfbr: 55 mfba: 55 rlambda: 2.5 alambda: 2.5 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 -f and -c), and then, as usual, collecting all relations together, (optionally, remdups), and then msieve -nc. Last fiddled with by Batalov on 2013-02-20 at 04:12 Reason: (more verbosity; or else I cannot even understand what I wrote myself) |
![]() |
![]() |
![]() |
#2068 |
"Ed Hall"
Dec 2009
Adirondack Mtns
22×883 Posts |
![]()
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... |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Reserved for MF - Sequence 3366 | RichD | Aliquot Sequences | 463 | 2021-01-02 16:01 |
Primes in n-fibonacci sequence and n-step fibonacci sequence | sweety439 | And now for something completely different | 17 | 2017-06-13 03:49 |
ECM for c166 from 4788:2661 | frmky | Aliquot Sequences | 36 | 2011-04-28 06:27 |
ECM work on 4788:2549.c170 | schickel | Aliquot Sequences | 51 | 2011-01-05 02:32 |
80M to 64 bits ... but not really reserved | petrw1 | Lone Mersenne Hunters | 82 | 2010-01-11 01:57 |