[Fri Dec 24 01:23:30 2004]
M1061 completed 50 ECM curves, B1=44000000, B2=4290000000

Thomas
:coffee:

[Wed Dec 29 08:08:08 2004]
M1061 completed 30 ECM curves, B1=44000000, B2=4290000000

And that concludes the search at that level, since all the required 19300 curves has been run! ( [url]http://www.mersenne.org/ecmm.htm[/url] )

I have emailed George, and I will drink a beer in celebration later today :)

Good work, everybody!
:bounce:

So what should we do next ?
I think we should have two main options, for those wishing to go deep, continue on M1061, at B1=110000000, and for those wanting to start on a new number I would support Bob's suggestion for M815, where we could make fast progress.

Thomas
:coffee:

Time for a small summary again, I think.

Last summary:
179 of 22000 curves. (message #124).
Since then :
[CODE]
username: curves mult B2 Message no Line total:
xyzzy 243 1 680270182898 #126 243
geoff 200 0.61 52e9 #137 122
wolf 5 0.35 4290000000 #138 1,75
geoff 300 0.61 52e9 #152 183
total this period 550

grand total :
729 of 22000 curves done.
[/CODE]

[QUOTE=thomasn]I think we should have two main options, for those wishing to go deep, continue on M1061, at B1=110000000, and for those wanting to start on a new number I would support Bob's suggestion for M815, where we could make fast progress.[/QUOTE]I've started a thread for M815... I plan to work both, alternating them every few days...

[url]http://www.mersenneforum.org/showthread.php?p=47253[/url]

67 curves using B1=110000000 & B2=680270182898...

[QUOTE=Xyzzy]I've started a thread for M815... I plan to work both, alternating them every few days...

[url]http://www.mersenneforum.org/showthread.php?p=47253[/url][/QUOTE]

Way to go!
I will probably also alternate a bit between the two, but I belive I will focus mostly on M815.

Thomas
:coffee:
PS: Xyxxy : I have done stage 1 of 10 curves (M1061 B1=110000000), can I mail them to you so you can do stage 2 with gmp-ecm ? (This is a test mostly, to make sure that I set the correct settings when doing stage1 only with mprime).

[QUOTE=thomasn]PS: Xyxxy : I have done stage 1 of 10 curves (M1061 B1=110000000), can I mail them to you so you can do stage 2 with gmp-ecm ? (This is a test mostly, to make sure that I set the correct settings when doing stage1 only with mprime).[/QUOTE]Great! Mail them to michael.vangATgmailDOTcom and I'll try them...

Will you be able to keep score for M815?

[QUOTE=Xyzzy]Great! Mail them to michael.vangATgmailDOTcom and I'll try them...

Will you be able to keep score for M815?[/QUOTE]

Curves mailed.
I can keep score for M815 if people want me to :smile:

Thomas
:coffee:

[QUOTE=thomasn]Curves mailed.[/QUOTE]It seems to be doing the whole thing instead of just stage 2...

Here is the command used:

[code]nohup time nice -19 ecm -v -resume 2,1061-.in 11e7 >> 2,1061-.out &[/code]
Here is what was in the 2,1061-.in file:

[code]N=0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF; QX=0x6FB4125AF8521B9960266E91BFDD5BEBB8DE5657F7E163AF119C5062161F633FA08EFE817D56B5876A9A5EBBEEF6F01BF7F47AB0C5A38EF806A67B7EF49D3AF29F8E732B29F4A206A7E421B637FD09E8F062247EED03D617646FFF875ED07258F4F156EC8E6309780EC01C69CA5FD2841223821B804C3606BA76592DE83D0DB14010EC227; SIGMA=2805313712670170
[/code]
And here is the output:

[code]GMP-ECM 5.0.3 [powered by GMP 4.1.4] [ECM]
Resuming ECM residue saved with Prime95
Input number is 24707306311927565716857342128774085333197833223161879682238935306082805123046306993647507776054336486228891340858985829027076261887914242781617846672453431386903982455635542158748401823985988322905245077938567513252198179128990807936780194781391547404884040101606295111368825026273254703636026307207764436438929167613951 (320 digits)
Using special division for factor of 2^1061-1
Using B1=110000000, B2=680270182898, polynomial Dickson(30), sigma=2805313712670170
a=18929846977575053359473098090849328681539411736741079621646854888626087910563788000371957020777947799837188786298652437617543826010775894895386092448058901018308862696889039642412284795300780281087446239439930011010030451534345595576915614182634141384987280802125440283539006538979697982535691289051943218803779876945050
starting point: x=5390410635561920574660198242213442980892177988703789496442960074806235056881380113602972887339621898883595592757464251613277622651991350327485310902204994529050032407558786734553320389161733473611942962972010028917564717178398641378680292414139902929945842731520003913390714137343029918394060858756654588351293917413927
Step 1 took 2047984ms
x=14819593413203465254639151551193379793041172785668595338901484873353633547035883043563169815903192354003277765724946043618350210827062840087434574668638271915000692073562979124100147081922045026976920583964018953822296870928240953121420974513873120879738575070901592454721596736062085678259754928676300455873350847248797
B2'=680404621260 k=5 b2=136059211470 d=1193010 dF=114048
Initializing table of differences for F took 386ms
Computing roots of F took 80295ms and 35790120 muls
Building F from its roots took 95862ms and 22728269 muls
Computing 1/F took 114445ms and 26364566 muls
Initializing table of differences for G took 1773ms
Computing roots of G took 56927ms and 20528640 muls
Building G from its roots took 94610ms and 22728269 muls
Computing roots of G took 57340ms and 20528640 muls
Building G from its roots took 94531ms and 22728269 muls
Computing G * H took 62561ms and 15607529 muls
Reducing G * H mod F took 122988ms and 31215055 muls
Computing roots of G took 57786ms and 20528640 muls
Building G from its roots took 95988ms and 22728269 muls
Computing G * H took 63548ms and 15607529 muls
Reducing G * H mod F took 124589ms and 31215055 muls
Computing roots of G took 58159ms and 20528640 muls
Building G from its roots took 96489ms and 22728269 muls
Computing G * H took 63632ms and 15607529 muls
Reducing G * H mod F took 124281ms and 31215055 muls
Computing roots of G took 57873ms and 20528640 muls
Building G from its roots took 94968ms and 22728269 muls
Computing G * H took 62419ms and 15607529 muls
Reducing G * H mod F took 122877ms and 31215055 muls
Computing polyeval(F,G) took 527806ms and 139537404 muls
Step 2 took 2332856ms for 627995240 muls
Command exited with non-zero status 1
4380.84user 3.82system 2:28:46elapsed 49%CPU (0avgtext+0avgdata 0maxresident)k
0inputs+0outputs (6531major+226949minor)pagefaults 0swaps[/code]

The saved residue lines produced by Prime95 do not contain info on the B1 value used, so gmp-ecm has no way of knowing that or how far stage 1 has been done already. The solution is the set B1=1 and the explicit stage 2 range for gmp-ecm, i.e.

ecm -v -resume 2,1061-.in 1 11e7-680270182898

where 680270182898 is the default B2 gmp-ecm would choose for B1=11e7. You can replace it by whatever value you want the effective B2 for this run to be.

Alex

I belive that the command line should not be
nohup time nice -19 ecm -v -resume 2,1061-.in 11e7 >> 2,1061-.out &
but
nohup time nice -19 ecm -v -resume 2,1061-.in 1 110000000-680270182898 >> 2,1061-.out &

The first number after the filename (1) signals that B1 should be 1 and can be skipped, the next one the range for B2.

I think that should work.

Thomas.
:coffee: