[QUOTE=Batalov;294109]Did anyone accidentally throw 17800 11e7 curves at the c156? Don't be shy! ;-)[/QUOTE]
Nearly done and nothing found :(
[url]http://www.rechenkraft.net/yoyo/y_status_ecm.php[/url]
There are more curves needed?
yoyo

Nope, the t55 you ran on yoyo@home has raised the bar significantly above the usual level for a C156 :smile:

GPU-based ECM stage 1 is slowly making the "2/7 of GNFS difficulty, 2/9 of SNFS difficulty" rules of thumb for ECM work obsolete, but you're not using that (yet) on yoyo@home.

Postprocessing in on, ETA for LA is 25 hours.

The good news is the sequence is still alive.
The bad news is [SPOILER]none so far! ...Ooops. Spoke too soon. There was a tiny earthquake, @3.3, tiny, but right here. Well. Almost.[/SPOILER].
Iteration 2953, c127. Will do in 6 hrs.

[QUOTE=Batalov;294779]The good news is the sequence is still alive.
The bad news is ....[/QUOTE]Urk....you scared me for a second there; I thought maybe you broke the downdriver again.....

c149 in i2954. (t35 only scanned)
I am switching back to Lucas/Fib "regular scheduled programming".

c153 now

[QUOTE=Batalov;294867]c153 now[/QUOTE]
I have started poly selection, just in case.

[QUOTE=jrk;294886]I have started poly selection, just in case.[/QUOTE]

I started ecm curves for 43M and afterwards for 110M.

[QUOTE=yoyo;294888]I started ecm curves for 43M and afterwards for 110M.[/QUOTE]

And found a factor ;)

Out of a lack of better places to put this...

Can some explain (or link me to an explanation of) how much ECM to throw at a given composite before NFS/QS? Meaning, what exactly does the "txx" mean, and how do I decide what B1 to use based on size of n and current t-depth?

I tried Googling it, but didn't find much. (I do understand that ECM finds factors probabilistically, and that txx says something about the probability of having found a yy-digit factor, but I have no idea of size-of-factor relates to bounds or to txx.)

The conventional wisdom for GNFS numbers is: do the expected number of curves to find a factor of 1/3 the size of the number. For a 150-digit input, that meant do enough curves for a 50-digit factor, which people abbreviate as "t50" or "p50 test."

Note that the 1/3 rule is not a result of an analysis of the algorithms; in fact, when you look at the complexity functions of ECM and NFS, there can't be a simple such constant. It's just a rule of thumb that, for numbers of the size we usually factor, is usually "close enough."