Who has plans for the line 2943 c156? I am running polynomial selection at the moment and plan on doing so for a few more days.

If RSALS would sieve, I could do algebra (or will gladly let someone else).

3200@43e6 on the c156

RSALS can sieve :smile:

[QUOTE=debrouxl;293663]RSALS can sieve :smile:[/QUOTE]

Thanks. Here's a poly:
[code][color=blue]# sieve with ggnfs lasieve4 I14e on alg side from Q=12M to 49.5M[/color]
# est ~55M raw relations (avg. 0.086 sec/rel C2D @ 3.4GHz)
# aq4788:2943
n: 218909223885666869467311520012547339294062441912642861948747184830527408065636553579251477283477638565472368743661538325937286866657581868811660982301968233
# norm 4.628442e-15 alpha -7.892707 e 2.744e-12 rroots 5
skew: 15409389.32
c0: -1013432049428242406537026371565205308192
c1: 1420765786655284705857591489345212
c2: -70009776955997053722575651
c3: -32270700208011528806
c4: 171461663772
c5: 17640
Y0: -1654828637058123157197560170569
Y1: 133813950406458731
rlim: 24000000
alim: 24000000
lpbr: 29
lpba: 29
mfbr: 58
mfba: 58
rlambda: 2.5
alambda: 2.5
[/code]
I trial-sieved four polys with score from 2.728e-12 to 2.801e-12.

Has the number survived enough ECM work ? :smile:

Did anyone accidentally throw 17800 11e7 curves at the c156? Don't be shy! ;-)

I'll run them.
yoyo

t55 on a poor little C156 ? :surprised

I queued "C156_4788_2943" to RSALS today.

[QUOTE=Batalov;294109]Did anyone accidentally throw 17800 11e7 curves at the c156?[/QUOTE]
No but I ran 500 curves @ B1=8e7, B2=9.7e11

[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."

So for the current C109 at i2958, how many curves at what bounds would get us up to t36 (or so)?

It should be shot straight down. Chased with a beer.

Well, yes, say, t36 is simply 890 1e6 curves (ie a "t35") and optionally another 100 of 3e6 to make it to t36 and then 6 CPU-hrs on GNFS and on to the next iteration.

Next, for the c125, one would want the 2400 3e6s and some 11e6 curves

Well, I originally had no idea where you got the numbers from, but as I was reading YAFU's docfile, it said to see the GMP-ECM README for more details. After some fuss (gedit couldn't guess the character encoding for README, but it could for README.lib, stupid thing) I found a table. I'm guessing that's the "goto" reference for different t's and what curves/bounds to use?

You can also do
[CODE]echo 43144365336006471456390066354433525606788804425777803602784525134520707531477166398288695986225151664288960876332879535559137048007 | ecm -v 3e6
[/CODE]
and it will report the needed curves for every level

The c131 is ready for gnfs?

I made a fuzzy :smile:

[code]#!/bin/bash
# A script to print the bounds/curves of ECM necessary for a given size number.
# No argument prints the whole table.
# If arg > 65, then it assumes you entered the size of number, and prints the
# relevant lines of the table.
# Else if arg >= 20, then it assumes you entered the desired t value directly,
# and prints the relevant information.
# Else the arg is an error, print usage message. Arg == "-h" also produces
# usage message.

file=$HOME/yafu/ecm.conf
# Location of data table
# Line 2 has t20 data, line 3 has t25 data, etc.

function print_t_data {

let n=$(( $((t-10)) / 5 ))
# Convert from t-value to which line of ecm.conf needs to be printed
# Line 2 has t20, line 3 has t25, etc., so t=5n+10
# The /5 is integer division, so n is an int

echo
more +1 $file | head -n 1
more +$n $file | head -n 2
echo
# Something of a hack. 'more +N file' starts printing at the Nth line,
# and 'head -n N' prints N lines of the file, so the above prints
# the first line of the file, followed by 2 lines of $file starting
# at the $n'th line.
}

if [ -z "$1" ]; then
echo; cat $file; echo;
exit 0
elif [ "$1" = "-h" ]; then
echo "Usage: $0 [size of number|desired t-level]"
echo "If arg >65, assume size of number, else if arg >=20, assume"
echo "desired t-level."
exit 0
elif [ $1 -gt 65 ]; then

sz=$1
# Argument is digits in number to be factored

let t=$((sz/3))
# Apply the 1/3 rule

echo; echo "You need to ECM up to approximately t$t."

print_t_data

exit 0

elif [ $1 -ge 20 ]; then

t=$1
# Assume argument is desired t-level

print_t_data

exit 0

else
# Arg is too small or NaN
echo "Bad argument!"
$0 -h
exit 1
# Calls itself with the -h switch to print usage
fi[/code]
[code]bill@Gravemind:~/yafu∰∂ cat ecm.conf
t B1 standard curves Brent-Suyama curves
20 11e3 74 74
25 5e4 221 214
30 25e4 453 430
35 1e6 984 904
40 3e6 2541 2350
45 11e6 4949 4480
50 43e6 8266 7553
55 11e7 20158 17769
60 26e7 47173 42017
65 85e7 77666 69408
bill@Gravemind:~/yafu∰∂[/code]
In use:
[code]bill@Gravemind:~∰∂ ecm 149

You need to ECM up to approximately t49.

t B1 standard curves Brent-Suyama curves
45 11e6 4949 4480
50 43e6 8266 7553

bill@Gravemind:~∰∂ ecm 131

You need to ECM up to approximately t43.

t B1 standard curves Brent-Suyama curves
40 3e6 2541 2350
45 11e6 4949 4480

bill@Gravemind:~∰∂ ecm 32

t B1 standard curves Brent-Suyama curves
30 25e4 453 430
35 1e6 984 904

bill@Gravemind:~∰∂ ecm 5
Bad argument!
Usage: /home/bill/bin/ecm [size of number|desired t-level]
If arg >65, assume size of number, else if arg >=20, assume
desired t-level.
bill@Gravemind:~∰∂ ecm -h
Usage: /home/bill/bin/ecm [size of number|desired t-level]
If arg >65, assume size of number, else if arg >=20, assume
desired t-level.
bill@Gravemind:~∰∂[/code]

(I didn't want to have to go through the bloat of installing gmp-ecm, since yafu runs the ecm just fine -- and besides, my scripting was out of practice :smile:)

[QUOTE=Batalov;294919]
The c131 is ready for gnfs?[/QUOTE]Well nobody has reported ECM on it, I don't think.

I'd run 1/4 of t45. If two more people do the same, it will be ready.

...Running gnfs now. Give it 10 hours.

That means you started the GNFS, but still want someone to run some ECM?

I'll start on 1200 curves at 11e6 then.

[QUOTE=Dubslow;294938]That means you started the GNFS, but still want someone to run some ECM?

I'll start on 1200 curves at 11e6 then.[/QUOTE]Actually, check the original post time and the "last edit" times and you'll see that he posted about the ECM, then came back an hour later and mentioned the GGNFS job.

[SIZE="1"]You can still run the ECM, but it would be pretty much pointless.....[/SIZE]

Did 2k@11M.

I went to the gym and didn't know if I'd come back to the comp before tomorrow, so it was easier to fire and forget (and the poly was decent - 8.4e-11). There is a chance of course that someone cracks it - I'll be up for another hour maybe; I'll kill the gnfs if so.

[QUOTE=schickel;294943]Actually, check the original post time and the "last edit" times and you'll see that he posted about the ECM, then came back an hour later and mentioned the GGNFS job.

[SIZE="1"]You can still run the ECM, but it would be pretty much pointless.....[/SIZE][/QUOTE]

I did check, and they were only 15 minutes apart. (22:41 OP time to 22:56 edit, local.) On the other hand, I'm only getting ~100 curves/hour, and I'll certainly be asleep before they finish (even if I put all cores to ECM) so I think I'll stop them. 108@11e6 total.

[QUOTE=Dubslow;294947]I did check, and they were only 15 minutes apart. (22:41 OP time to 22:56 edit, local.) On the other hand, I'm only getting ~100 curves/hour, and I'll certainly be asleep before they finish (even if I put all cores to ECM) so I think I'll stop them. 108@11e6 total.[/QUOTE]Ooops, you're right, only 15 minutes. I guess I had a spot of lysdexia there when I first posted..... Anyway, as Batalov said, he'll have the composite cracked overnight, or you could get a lucky strike if you leave your cores running overnight, so it works out either way.

At some point in the future, yoyo, you'll probably want to add a program for GPU-based (CUDA) ECM stage 1: GPU-based ECM stage 1 is still a bit experimental, but it can easily be faster than CPU-based ECM stage 1 :smile:

Done. Next is c122, will do too.

Found 191405798636855843004221761290694956491

Edit: Doing curves at 11M on i2967 c147
Edit: started 2k@44M Edit: done

320 @ B1=3e6 run about one hour ago on the C147, no factors.

We would need 7000 43e6 and a poly.
I started some 43e6s.

[QUOTE=Batalov;295005]We would need 7000 43e6 and a poly.
I started some 43e6s.[/QUOTE]

I'll pitch in 1500 or so.

[QUOTE=Batalov;295005]We would need 7000 43e6 and a poly.[/QUOTE]
I'll do a poly.

I got 2000 43e6 curves so far.

[code][color=blue]# sieve with ggnfs lasieve4 I14e on alg side from Q=7M to 27M[/color]
# est ~29M raw relations (avg. 0.076 sec/rel C2D @ 3.4GHz)
# aq4788:2967
n: 567746316848227719111860052856667016141850239422163555754828515183571870488144523015718273810311420088795603432504527683259281602401200098277168889
# norm 3.480086e-14 alpha -7.514387 e 8.937e-12 rroots 3
skew: 891138.51
c0: -60850644996746054783095313237136821
c1: -501129049682078747856998866287
c2: 1622606630412589648404364
c3: 2854893119141293902
c4: -1419913202228
c5: 322920
Y0: -17742382838270665370902251942
Y1: 3238487805878041
rlim: 14000000
alim: 14000000
lpbr: 28
lpba: 28
mfbr: 56
mfba: 56
rlambda: 2.5
alambda: 2.5
[/code]

Does one of the usual suspects want to make a unilateral sieve, or should RSALS do that ? :smile:

RSALS [B][I]is[/I][/B] the usual suspect. :razz:

I've got 5000 curves, someone else most probably 2000+, so it is ready.

[QUOTE=Batalov;295076]RSALS [B][I]is[/I][/B] the usual suspect. :razz:

I've got 5000 curves, someone else most probably 2000+, so it is ready.[/QUOTE]

My 1500@43M will be done in about an hour. Edit: akruppa said 2K@44M, so it's definitely ready.

RSALS seldom does GNFS tasks below difficulty 150 :smile:
But RSALS does 27-bit & 28-bit LPs OddPerfect tasks of SNFS difficulty ~200, which are easier than a 28-bit LPs GNFS 147 task.

The near-repdigit 59999_224 (which I chose as a filler because it had received t50) is nearing the required number of WUs, so I'll queue "C147_4788_2967".

In case nobody has started sieving yet, here's a better poly than the one posted earlier:

[code][color=blue]# sieve with ggnfs lasieve4 I14e on alg side from Q=7M to 25M[/color]
# est ~29M raw relations (avg. 0.069 sec/rel C2D @ 3.4GHz)
# aq4788:2967
n: 567746316848227719111860052856667016141850239422163555754828515183571870488144523015718273810311420088795603432504527683259281602401200098277168889
# norm 3.658417e-14 alpha -7.739071 e 9.173e-12 rroots 5
skew: 1692435.46
c0: -1011761843316650267032663410594736755
c1: 4822816458434702709822089389425
c2: 887308433598247688843281
c3: -3979221641144418025
c4: -481482558614
c5: 477360
Y0: -16408227355075677213713241658
Y1: 922520874798967
rlim: 14000000
alim: 14000000
lpbr: 28
lpba: 28
mfbr: 56
mfba: 56
rlambda: 2.5
alambda: 2.5

[/code]

Just queued 7M-27M (2000 WUs) using this new poly; more than 1500 WUs for 59999_224 will be distributed before WUs for C147_4788_2967.

It will be really fast. I estimated that it would take a week on a quad (similar to e.g. Lucas(1162)) but a week seemed a bit too long. Let's do it in a day - half a day of RSALS sieving and half a day of matrix (I can pick up).

I ran 700 110e6 curves too. Let's wait till the morning in Europe to see the rsals site up.

From the first 1Gb of gzipped rels:
Found 13947579 unique, 1461947 duplicate.
Looks ok for tomorrow (when the second 1Gb will be sieved).

ETA 6 hrs.

...so close on the t50.

No particularly small factors on the C148. Ran yafu's factor() up to (not including) B1=1e6, then I stopped it for proper ECM.

Starting 500c @ 43M.

11e6 is done. I have 800 of 43e6s, and we'll need some more and a poly and the circle spins again.

[QUOTE=Batalov;295357]11e6 is done. I have 800 of 43e6s, and we'll need some more and a poly and the circle spins again.[/QUOTE]True, but the good thing righ tnow is the downdriver is still alive.

And if you look at the slope, it looks nice and steep still.....in fact, to get much steeper, we would need a couple of lines to factor as 2 * [TEX]p[/TEX], but I shudder to think of what could happen then.....

[QUOTE=schickel;295363]True, but the good thing righ tnow is the downdriver is still alive.

And if you look at the slope, it looks nice and steep still.....in fact, to get much steeper, we would need a couple of lines to factor as 2 * [TEX]p[/TEX], but I shudder to think of what could happen then.....[/QUOTE]

The only thing which I would prefer over 2^1*3^0*... would be 2^0*3^0*... :wink:

would that be bad? we would haev to find another sequence....

[QUOTE=firejuggler;295389]would that be bad? we would haev to find another sequence....[/QUOTE]That [I]would[/I] mean finding another sequence, but it would also be good, since the 2 disapearing means that the parity has flipped and there is probably a quick (very) termination in the offing.

That would set the bar almost unbearably high, though, in terms of a record to break. The highest sequence terminated so far was [URL="http://factordb.com/aliquot.php?type=1&aq=921232&big=1"]921232[/URL], with a max height of 127 digits....very nice extreme ski slope-style finish to that one.

I see. You would prefer that it drop to around 1M before going up again?

I'm running poly selection on line 2968.

I have a raw poly with 8.079e-12:
[CODE]# norm 3.040993e-14 alpha -8.695524 e 8.079e-12 rroots 3
skew: 17037119.78
c0: -233604520796377704517742605390238324160
c1: -100608549191218862407256856948168
c2: -28411607816936368074938894
c3: -3499091303190109585
c4: 167235429052
c5: 756
Y0: -82569070740492951856116142199
Y1: 2528842373881907
[/CODE]

Here's another poly with Murphy=8.702e-12:
[code][color=blue]# sieve with ggnfs lasieve4 I14e on alg side from Q=7M to 26.5M[/color]
# est ~29M raw relations (avg. 0.073 sec/rel C2D @ 3.4GHz)
# aq4788:2968
n: 2901427496531126932639137570733764567154363493488725447618931456921289899532150462227507091080986296697887849811911080911699389211293401117366922879
# norm 3.308923e-14 alpha -7.684938 e 8.702e-12 rroots 5
skew: 1747235.30
c0: 284458236924058524332508604536609825
c1: 3568209986038099775080055048948
c2: 4155153429785771566461909
c3: -2518588749056401782
c4: -1043665541956
c5: 298200
Y0: -24981650660011224403799863808
Y1: 25826128680664607
rlim: 14000000
alim: 14000000
lpbr: 28
lpba: 28
mfbr: 56
mfba: 56
rlambda: 2.5
alambda: 2.5
[/code]

It's good to queue at RSALS, I guess.
I have 5000 43e6 curves and 120 110e6s.

Oops.
[CODE]Input number is 2901427496531126932639137570733764567154363493488725447618931456921289899532150462227507091080986296697887849811911080911699389211293401117366922879 (148 digits)
Using B1=110000000, B2=776278396540, polynomial Dickson(30), sigma=3026907363
Step 1 took 382668ms
Step 2 took 122660ms
********** Factor found in step 2: 2687210366475282566041791827478627115964912605604341
Found probable prime factor of 52 digits: 2687210366475282566041791827478627115964912605604341
Probable prime cofactor has 97 digits
[/CODE]

Looks like a c138 in i2976; will do all 11e6s. After that need a poly and a healthy volunteer.

prp42 = 878237210920426389334709220701939431729043 (curve 3 stg2 B1=110000000 sigma=2047491439)

Doing 2k@3M on c115, about half-way through now. With other people's ECM we probably have enough to start sieving. Anyone?
Edit: I started sieving. Not sure how long it will take on my 4 core AMD. If someone can beat me to the factors, go ahead!
Edit: after 2h of sieving I have about 20% of the required relations, so I'd expect factors sometime tomorrow morning CET.
Edit: Linear algebra.

[QUOTE=RobertS;295478]prp42 = 878237210920426389334709220701939431729043 (curve 3 stg2 B1=110000000 sigma=2047491439)[/QUOTE]
I found a factor backwards:
[CODE]Input number is 615702158817819760635542653883150512010483735718746530528638875762563875897339594880206348757497840624461200980780941403301027294015276423 (138 digits)
Using B1=11000000, B2=35133391030, polynomial Dickson(12), sigma=976691395
Step 1 took 35955ms
Step 2 took 16073ms
********** Factor found in step 2: 76435544876663975291311170483388222168221881928179
Found probable prime factor of 50 digits: 76435544876663975291311170483388222168221881928179
Composite cofactor 805518113086... has 88 digits[/CODE]

[QUOTE=akruppa;295482]Doing 2k@3M on c115, about half-way through now. With other people's ECM we probably have enough to start sieving. Anyone?
Edit: I started sieving. Not sure how long it will take on my 4 core AMD. If someone can beat me to the factors, go ahead!
Edit: after 2h of sieving I have about 20% of the required relations, so I'd expect factors sometime tomorrow morning CET.[/QUOTE]

400 6e6, starting 200 11e6

Done, faster than expected.

Need 11e6 on the c147 (i2983). Déjà vu.


There are some nasty combinations (like 2*5^2*7) that drive "up" even within the downdriver. But basically I agree. (Violently.)

[QUOTE=Batalov;295515]Déjà vu.[/QUOTE]

If we keep the down-driver, it will be the last time.

2300 11e6 here. We probably need 2000 more and 2000 of 43e6s and a poly.

[QUOTE=Batalov;295533]2300 11e6 here. We probably need 2000 more and 2000 of 43e6s and a poly.[/QUOTE]

I'm at 370 of 500, I can run another 500 overnight.

[QUOTE=Batalov;295533]2300 11e6 here. We probably need 2000 more and 2000 of 43e6s and a poly.[/QUOTE]I just started some at 43e6; I'll keep running overnight (or until my c132 finishes post :smile:)

[QUOTE=Batalov;295533]and a poly. [/QUOTE]
I'm running poly search on line 2983 now.

[QUOTE=Dubslow;295534]I'm at 370 of 500, I can run another 500 overnight.[/QUOTE]

I'll change that to 500@12e6 complete, and will run 1000 overnight.

[QUOTE=jrk;295537]I'm running poly search on line 2983 now.[/QUOTE]

Here's a poly:
[code][color=blue]# sieve with ggnfs lasieve4 I14e on alg side from Q=5M to 22.5M[/color]
# est ~29M raw relations (avg. 0.063 sec/rel C2D @ 3.4GHz)
# aq4788:2983
n: 128236571983283087685376816426090967554725160845750810128017354651872698637493353543329115107501913693140721901566194007043518285262679369756115991
# norm 4.025738e-14 alpha -5.567896 e 9.844e-12 rroots 5
skew: 591197.68
c0: -1509702409716199090660959803133177
c1: 67097151288186994359736593005
c2: 26844951386037144094529
c3: -444998789097341277
c4: -87574632264
c5: 449328
Y0: -12333595058177773992648111502
Y1: 1396624418326843
rlim: 12000000
alim: 12000000
lpbr: 28
lpba: 28
mfbr: 56
mfba: 56
rlambda: 2.5
alambda: 2.5
[/code]

Would RSALS be interested in sieving this?

Yeah, if it has received enough ECM :smile:

I'm in the process of running 2k@44M, currently at about 1500. Edit: done.

Which means that I'll be able queue the number tonight (otherwise RSALS will starve, anyway) :smile:
(the reason for starvation is not that I don't have any number from OddPerfect, it's that I haven't yet spent time to pre-process several of them for RSALS consumption...)

I have +1800, too.

[QUOTE=Dubslow;295538]I'll change that to 500@12e6 complete, and will run 1000 overnight.[/QUOTE]

A total of 1500@12e6 for me, NF.

[QUOTE=akruppa;295577]I'm in the process of running 2k@44M, currently at about 1500.[/QUOTE]

[QUOTE=Batalov;295587]I have +1800, too.[/QUOTE]

[QUOTE=Dubslow;295602]A total of 1500@12e6 for me, NF.[/QUOTE]And I'm headed toward 700@43M.

[QUOTE=debrouxl;295582]Which means that I'll be able queue the number tonight (otherwise RSALS will starve, anyway) :smile:[/QUOTE]

As of this writing, it appears all WUs have been sent out on RSALS grid and 2/3 have already been returned. Do we have a post-processing volunteer?

I was waiting for it to reach 1.7Gb where it usually levels off and there will be quite enough rels. But if someone wants to finish, then sure!

It looks like you are the first to step up, so go for it.

Now, don't fall asleep on us. :smile:

Aye-aye, sir, right away, sir. :max:

"I've got 99 miles of track I wanna lay back,
I'm gonna lay them by the light of the moon...
I'm gonna lay them by the light of the moon.

John Henry said to his captain
You know a man ain't nothing but a man,
I'm betting right now, you won't beat me down,
I'm gonna die with my hammer in my hand...
I'm gonna die with my hammer in my hand."

You know, without Stargaze38's help M1061 would probably never get finished! But thank god, he's now got Greg's lazy ass straight and he will not let him slack on us. That job will be done! You know what I mean? Where would we all be without makesurers?!

Just take it easy, man. :smile:

Thanks for the credit with M1061, but please watch your language. I hate swearing, especially the A word!

It is a stubborn animal that needs periodically be reminded of the right way to go? Did you mean something else?

[QUOTE=Batalov;295787]
You know, without Stargaze38's help M1061 would probably never get finished! But thank god, he's now got Greg's lazy a$$ straight and he will not let him slack on us. That job will be done! You know what I mean? Where would we all be without makesurers?!

Just take it easy, man. :smile:[/QUOTE]
Hey, what's the rush? :sleep:

C147 is done. [strike]C105 is in i2985, will do. ...C114...C100...[/strike]
C144 needs a pile-up?

[strike][QUOTE=Batalov;295953]
...C114...[/QUOTE]Starting 1Kc@3e6[/strike]

[code]
GMP-ECM 6.3 [configured with GMP 5.0.1 and --enable-asm-redc] [P-1]
Input number is 2526520801261671348864562418744372924258134999153073392949978254733635070218853508737224945301717587 (100 digits)
Using B1=1000000000, B2=205702371522480, polynomial x^1, x0=2236133407
Step 1 took 158427ms
Step 2 took 79844ms
********** Factor found in step 2: 299975051953247831497084679750542304539951
Found probable prime factor of 42 digits: 299975051953247831497084679750542304539951
Probable prime cofactor 8422436415330427262861781708253736428813827603477768209437 has 58 digits
[/code]

Edit: started running 2k@44M on the c144.

Factored.
[code]bill@Gravemind:~/yafu∰∂ yafu "ecm(105240158647998453410223196004709613292520439814268453156653286227762636761534225183283047448569809491128108477157888341493678681079199167094787,500)" -B1ecm 43000000


ecm: 105/500 curves on C144 input, at B1 = 43M, B2 = gmp-ecm default


***factors found***

PRP44 = 24609245398104813491916174488151251688220111

***co-factor***
PRP100 = 4276448015594298555448569734386142072433206564347544476705420849837762828375698956197813497639723917

ans = 4276448015594298555448569734386142072433206564347544476705420849837762828375698956197813497639723917[/code]

Neat. As luck has it. (I had 3800 11e6s on it already ATM.)
Now a little one? [strike]C116?[/strike] C113? :-)