OddPerfect enthusiasts & others: ECM help needed!

[R.D. Silverman]

Originally Posted by Batalov

Do trolls build bridges?

fee fie foe foo

[Jeff Gilchrist]

I will run a some curves for you. Some benchmark info on a Core2 Xeon with this number on a Linux 64bit system.

GMP-ECM 6.2.3 [powered by GMP 4.3.0] [ECM]
Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=679768835
Step 1 took 4600030ms
Step 2 took 879332ms

GMP-ECM 6.3 [configured with GMP 5.0.1 and --enable-asm-redc] [ECM]
Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=4274582256
Step 1 took 4506844ms
Step 2 took 894422ms

GMP-ECM 6.3 [configured with MPIR 2.1.1 and --enable-asm-redc] [ECM]
Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=3873338469
Step 1 took 4578511ms
Step 2 took 940473ms

[R.D. Silverman]

Originally Posted by Jeff Gilchrist

I will run a some curves for you. Some benchmark info on a Core2 Xeon with this number on a Linux 64bit system.

GMP-ECM 6.2.3 [powered by GMP 4.3.0] [ECM]
Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=679768835
Step 1 took 4600030ms
Step 2 took 879332ms

GMP-ECM 6.3 [configured with GMP 5.0.1 and --enable-asm-redc] [ECM]
Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=4274582256
Step 1 took 4506844ms
Step 2 took 894422ms

GMP-ECM 6.3 [configured with MPIR 2.1.1 and --enable-asm-redc] [ECM]
Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=3873338469
Step 1 took 4578511ms
Step 2 took 940473ms

This is sub-optimal. One should spend as much time in step 2 as in step 1.
I suggest increasing B2.

[axn]

Originally Posted by R.D. Silverman

This is sub-optimal. One should spend as much time in step 2 as in step 1.
I suggest increasing B2.

Isn't that analysis based on the assumption that time for stage 2 is proportional to B2? (I vaguely recall seeing something like that, having only skimmed thru your paper).

[wblipp]

Originally Posted by wblipp

Next week I'll be back in the US and will change the OddPerfect Most Wanted ECM server to hand out only this number.

oddperfect.no-ip.com:8201

Now in operation.

I am also updating curve counts in the first post and integrating all except bdodson's in the server.

[frmky]

Minor correction... That should be oddperfect.no-ip.com:8201 And thanks!

fixed. Thanks.

[Jeff Gilchrist]

Originally Posted by em99010pepe

My timings:

Machine 1 - Core i5 750@3.7GHz

My Core2 Q9550 @ 3.2GHz isn't far off from your i5 considering yours is overclocked a lot more:

Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=2613054812
Step 1 took 2903381ms
Step 2 took 732534ms

Jeff.

[firejuggler]

GMP-ECM 6.3-rc3 [configured with GMP 5.0.1] [ECM]
Input number is (3^607-1)/2 (290 digits)
Using MODMULN
Using B1=260000000, B2=3079973376496, polynomial Dickson(30), sigma=296568008
dF=362880, k=2, d=3993990, d2=17, i0=49
Expected number of curves to find a factor of n digits:
35 40 45 50 55 60 65 70 75 80
23 83 336 1526 7676 42206 251394 1609787 1.1e+007 8e+007
Step 1 took 14294063ms
Estimated memory usage: 2683M
Initializing tables of differences for F took 49547ms
Computing roots of F took 360937ms

crashed there, not enough memory, Core 2 duo E6300, 1.8GHz
half a curve?

[10metreh]

Originally Posted by firejuggler

crashed there, not enough memory, Core 2 duo E6300, 1.8GHz
half a curve?

Just step 1 is very unlikely to find a factor, so it doesn't mean much.

[firejuggler]

no worry, i was just kidding.
i'll try again on a better computer.

[em99010pepe]

Originally Posted by Jeff Gilchrist

My Core2 Q9550 @ 3.2GHz isn't far off from your i5 considering yours is overclocked a lot more:

Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=2613054812
Step 1 took 2903381ms
Step 2 took 732534ms

Jeff.

My timings were when running all four cores at the same time but as I said once the core i5 is not as fast as people think. Compared to my Q6600@2.8 GHz is only ~30% faster...