mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Aliquot Sequences (https://www.mersenneforum.org/forumdisplay.php?f=90)
-   -   Reserved for MF - Sequence 4788 (https://www.mersenneforum.org/showthread.php?t=11615)

EdH 2013-02-25 14:43

+1213@43e6 (total: 8213)

I'll move up to 11e7

yoyo 2013-02-25 16:13

9500@11e7 done so far, and counting:
[url]http://www.rechenkraft.net/yoyo//y_status_ecm.php[/url]

schickel 2013-02-25 16:21

[QUOTE=EdH;330931]+1213@43e6 (total: 8213)

I'll move up to 11e7[/QUOTE]Plus 300 more from me.

EdH 2013-02-25 23:28

With the power of yoyo@home, is it even worth anything for me to run 11e7 curves? I'm only a little over 250 right now and one of my machines even refuses to do stage 2:
[code]
-> ___________________________________________________________________
-> | Running ecm.py, a Python driver for distributing GMP-ECM work |
-> | on a single machine. It is Copyright, 2012, David Cleaver and |
-> | is a conversion of factmsieve.py that is Copyright, 2010, Brian |
-> | Gladman. Version 0.10 (Python 2.6 or later) 30th Sep 2012. |
-> |_________________________________________________________________|

-> Number(s) to factor:
-> 17285154910805941577069464828335617544658066950627644021728302169526833018711670895092479561808160256160945139573800969912234390238908363042669550995167201537635764747005337 (173 digits)
->=============================================================================
-> Working on number: 172851549108059415...537635764747005337 (173 digits)
-> Currently working on: job0137.txt
-> Starting 1 instance of GMP-ECM...
-> ./ecm -c 100 110000000 < job0137.txt > job0137_t00.txt

GMP-ECM 6.4.3 [configured with GMP 5.0.2] [ECM]
Using B1=110000000, B2=776278396540, polynomial Dickson(30), 1 thread
Done 0/100; avg s/curve: stg1 4432s, stg2 n/a s; runtime: 4772s

-> *** Error: unexpected return value: -9
[/code]

Batalov 2013-02-25 23:42

[QUOTE=EdH;331011]With the power of yoyo@home, is it even worth anything for me to run 11e7 curves? [/QUOTE]
Not really. Even if you would like to find a record factor, the conditional probability of success of any curve is dropping down to zero as I am typing... (Conditional on that yoyo@home already ran 10^4 curves at this moment and didn't find a factor.)

yoyo 2013-02-26 15:09

Will be 18000 curves @ 11e7 enough or is there more needed?
yoyo

Dubslow 2013-02-26 17:57

You could always ECM at a t80 level and go for a record ECM factorization :razz:

EdH 2013-02-26 20:23

[QUOTE=Dubslow;331108]You could always ECM at a t80 level and go for a record ECM factorization :razz:[/QUOTE]
The trouble for me is that as I increase B1, more and more machines fall by the wayside. At 43e7 more than half tell me to get lost. And, I just can't see my attention span lasting for that long anyway...

Andi47 2013-02-26 21:54

[QUOTE=yoyo;331087]Will be 18000 curves @ 11e7 enough or is there more needed?
yoyo[/QUOTE]

If my estimation is correct (i.e. if I have no mistakes in my tables), ~2*t55 = 2*18k = 36k curves @11e7 are are needed for a c173.

Edit: I just see that you have queued 42k@26e7. This might be a bit of trying for record factorization, but why not...

yoyo 2013-03-03 19:05

No factor found so far with 40k curves @26e7.
yoyo

Ralf Recker 2013-03-10 08:47

Nothing
 
[CODE]GMP-ECM 7.0-dev [configured with GMP 5.1.1, --enable-asm-redc, --enable-assert, --enable-openmp] [P-1]
Input number is 17285154910805941577069464828335617544658066950627644021728302169526833018711670895092479561808160256160945139573800969912234390238908363042669550995167201537635764747005337 (173 digits)
Using B1=100000000000, B2=484004602750364712, polynomial x^1, x0=4104192314
Step 1 took 24940729ms
Step 2 took 40735246ms[/CODE]


All times are UTC. The time now is 23:11.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.