[QUOTE=swellman;449772]Go Ed Go!![/QUOTE]
Thank you for the encouragement, but I seem to have run into a snag.

Is there something odd about this number?

My main machine won't find any poly candidates, while my GPU machine found several (a few are well within the expected e range) and two other machines found very few via CPU. msieve will not use any of the candidates to build a factor base file and If I try to use any of the found polys to manually build a file, I get total failure. Using factmsieve.py, I get the following message:
[code]
-> Warning: evaluated polynomial value polyval is negative or zero.
-> This is at least a little strange.
[/code]I have checked and believe all machines are working with the correct number.

I have done a copy-paste error with the candidate number, and also used a previously-factored-in folder to start a new factorization to generate errors like these.
Likely the list of possible causes is longer, but here are two.

[QUOTE=VBCurtis;449780]I have done a copy-paste error with the candidate number, and also used a previously-factored-in folder to start a new factorization to generate errors like these.
Likely the list of possible causes is longer, but here are two.[/QUOTE]
The composite was retrieved by my script directly from the db and sent to the other machines via scp file instructions.

But, even more mysterious (to me, at least) is that I awoke this morning to find that msieve has come up with a factor base file with an e score higher than the maximum expected, and the candidate file is still completely empty - 0 bytes! I do know that the score can be higher than the range, but why is the .p file totally empty? Christmas present? Thank you.

Anyway, my machines are chugging along collecting relations. Let's see how I do later on.

[code]
p60 factor: 778983799251925067749988907448612224901724816566338455417777
p95 factor: 47651265082463051449863280299244921776503425650816805776525784432691490641923911756299020602067
[/code]

I did t50 (7200@43e6) on c184.

+10320@11e7
Will run some curves at higher level.

Good news!

After ~3600 curves @26e7:

[CODE]Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=3680290865
Step 1 took 1828233ms
Step 2 took 216960ms
********** Factor found in step 2: 1960372912835241324700834233217713721697204364462017
Found probable prime factor of 52 digits: 1960372912835241324700834233217713721697204364462017
Composite cofactor 2171634204025220730370813114955298804770481738025093321188078976321349216277579906295554214874946759435480172848439190796333395188247 has 133 digits
[/CODE]
Remaining cofactor easily cracked by GNFS

[CODE]prp66 = 880853868943931884341032861511818255750134793346334101690276486707
prp67 = 2465373974719352232904803511851701446591808130682247995344748718221
[/CODE]

i2167 - ECM strikes again with P52, this time after only ~4500@43e6

[CODE]Using B1=43000000, B2=240490660426, polynomial Dickson(12), sigma=3460810614
Step 1 took 252343ms
Step 2 took 65591ms
********** Factor found in step 2: 1757486674143491701965624882297422480376831535489009
Found probable prime factor of 52 digits: 1757486674143491701965624882297422480376831535489009
Probable prime cofactor <...> has 120 digits
[/CODE]

i2168, now only P50 :smile:
[CODE]Using B1=43000000, B2=240490660426, polynomial Dickson(12), sigma=3715686294
Step 1 took 266553ms
Step 2 took 70360ms
********** Factor found in step 2: 19596314928507126606239149438895564775744906349871
Found probable prime factor of 50 digits: 19596314928507126606239149438895564775744906349871
Probable prime cofactor <...> has 138 digits
[/CODE]

C195 @ i2180
I've completed ECM to t55 level (18k@11e7) and yoyo almost completed 20k@26e7 and 10k@85e7. Is it enough and we can go to GNFS ?

[QUOTE=unconnected;458873]C195 @ i2180
I've completed ECM to t55 level (18k@11e7) and yoyo almost completed 20k@26e7 and 10k@85e7. Is it enough and we can go to GNFS ?[/QUOTE]

Bayesian tool recommends the following: [CODE]3400 curves with B1 = 2.9e9[/CODE]