3,2,499-
 

3,2,499- is complete. The C205 split as P94.P112:


[CODE]1369729040700107320541290775844555418113044994718485831508503941196143983527779271135210575107
3952461360731070906943608823226034328250077462272168631213095609788231684058059676453023096673961487602802420617
[/CODE]

11,2,217+
 

11,2,217+ c133 splits as p48*p85

[code]771030812501491642965607066225455081059267909587
6195286739455631887993280815759894324634072814398190096403773600632884870059913517701[/code]

Updates posted
 

New tables have been posted to the web and the ECMNET server's database has been updated.

Apologies for the long time since the previous update. I have had sundry personal problems. :sad:

Paul

11,5,236+
 

Meant to post this one earlier but I forgot to.

11,5,236+ c170 finished via this ECM p55:

[code]Input number is 12990834120794064904114039999710060573491287600936999982071201504358762037829119315987111118796851453775943097958217211771817827649554362179259617845761883407301717724641 (170 digits)
Using B1=110000000-110000000, B2=1589211473866, polynomial Dickson(30), sigma=3461054285
Step 1 took 0ms
Step 2 took 176675ms
********** Factor found in step 2: 1890148347176615622542974018412798470069179819400762937
Found probable prime factor of 55 digits: 1890148347176615622542974018412798470069179819400762937
Probable prime cofactor 6872917747540267672675726169894836357820251865275777222309336200394668657293062683643150063734803762233549173519593 has 115 digits
[/code]

another update
 

Another update has been posted, with 15 new factors, leaving 671 composites still to do.

My thanks to Jon Becker who spotted some numbers missing from the server's tables and went on to provide me with the data already formatted ready to add into them.

Paul

[QUOTE=xilman;241598]Another update has been posted, with 15 new factors, leaving 671 composites still to do.

My thanks to Jon Becker who spotted some numbers missing from the server's tables and went on to provide me with the data already formatted ready to add into them.

Paul[/QUOTE]

My work on 2,1870L is about 2/3 done.

My company shuts down from 12/24 until 1/3, so I won't get much done
during that time.

I am undecided about what I will do next. I may go after the 2+ table
with high ECM bounds, but with only ~20 machines do not have much hope
of accomplishing anything.

I may also do the remaining homogeneous numbers with exponent under
200. Another possibility is to run SNFS on some of the smaller unfactored
Fibonacci/Lucas numbers.

The problem that I have with ECM is that I can only run overnight. This
constrains my step 1 limit to be whatever I can do in 12 hours, since
GMP-ECM does not allow one to stop/restart step 1.

[QUOTE=R.D. Silverman;241602]
The problem that I have with ECM is that I can only run overnight. This
constrains my step 1 limit to be whatever I can do in 12 hours, since
GMP-ECM does not allow one to stop/restart step 1.[/QUOTE]

[CODE]
ecm -h
Usage: ecm [options] B1 [[B2min-]B2] < file

...

-save file save residues at end of stage 1 to file
-savea file like -save, appends to existing files
-resume file resume residues from file, reads from stdin if file is "-"
-chkpnt file save periodic checkpoints during stage 1 to file

...
[/CODE]

This doesn't work for you?

[QUOTE=bsquared;241613][CODE]
ecm -h
Usage: ecm [options] B1 [[B2min-]B2] < file

...

-save file save residues at end of stage 1 to file
-savea file like -save, appends to existing files
-resume file resume residues from file, reads from stdin if file is "-"
-chkpnt file save periodic checkpoints during stage 1 to file

...
[/CODE]

This doesn't work for you?[/QUOTE]

This shows how to restart Step 2 by specifying B2min. I asked about
a restart of step 1. How does one similarly specify B1min?

[QUOTE=R.D. Silverman;241615]This shows how to restart Step 2 by specifying B2min. I asked about
a restart of step 1. How does one similarly specify B1min?[/QUOTE]

You don't need to.

Just run, for example:
[CODE]echo "your number here" | ecm -v -save savefile.dat 1000000[/CODE]

Then to extend to B1 = 2e6 simple do:

[CODE]echo "your number here" | ecm -v -resume savefile.dat 2000000[/CODE]

You'll see something like this:
[CODE]GMP-ECM 6.3 [configured with GMP 5.0.1 and --enable-asm-redc] [ECM]
Running on ****
Resuming ECM residue saved by buhrow@****** with GMP-ECM 6.3 on Mon Dec 13 09:45:36 2010
Input number is 1553303516292478972434431257669685410562962830016991957242492897198835922479639127670719679 (91 digits)
Using MODMULN
Using [B][U]B1=1000000-2000000[/U][/B], B2=2853999340, polynomial Dickson(6), sigma=2924911712
[/CODE]

B2 is automatically extended as well. -save and -resume have nothing to do with B2, AFAIK.

[QUOTE=bsquared;241617]You don't need to.

Just run, for example:
[CODE]echo "your number here" | ecm -v -save savefile.dat 1000000[/CODE]

Then to extend to B1 = 2e6 simple do:

[CODE]echo "your number here" | ecm -v -resume savefile.dat 2000000[/CODE]

You'll see something like this:
[CODE]GMP-ECM 6.3 [configured with GMP 5.0.1 and --enable-asm-redc] [ECM]
Running on ****
Resuming ECM residue saved by buhrow@****** with GMP-ECM 6.3 on Mon Dec 13 09:45:36 2010
Input number is 1553303516292478972434431257669685410562962830016991957242492897198835922479639127670719679 (91 digits)
Using MODMULN
Using [B][U]B1=1000000-2000000[/U][/B], B2=2853999340, polynomial Dickson(6), sigma=2924911712
[/CODE]

B2 is automatically extended as well. -save and -resume have nothing to do with B2, AFAIK.[/QUOTE]


Ah. So the last prime that is processed in step 1 must get inserted into the
checkpoint file.

Thanks for the heads up.

[QUOTE=R.D. Silverman;241622]Ah. So the last prime that is processed in step 1 must get inserted into the
checkpoint file.

Thanks for the heads up.[/QUOTE]

Yep. The savefile syntax is pretty straightforward:

[CODE] % cat savefile.dat
METHOD=ECM; SIGMA=2924911712; B1=1000000; N=1553303516292478972434431257669685410562962830016991957242492897198835922479639127670719679; X=0x8d6859b2779fa36046b4595f374d2540ba3e33fe9194f6bc85bd07b118e7d688414183ba845; CHECKSUM=2889863432; PROGRAM=GMP-ECM 6.3; WHO=buhrow@****; TIME=Mon Dec 13 09:45:36 2010;
[/CODE]

N is the input and X is the residue after processing up to B1. The last prime processed is not explicitly stored, just the last completed B1 bound. I'm not sure what happens if the curve is aborted abnormally, such as a forced computer shutdown. maybe the -chkpnt flag would be of some use in that case.