[CODE]prp51 factor: 388506058643583355437271607661833307213566452269017
prp77 factor: 32036182249699730203082985730853613751522637113555017710745413833553416908691
[/CODE]

Now a c171

[code]193180597261434437130723427223452983749001196443861486431050101233095959046579376056784397572419692971642911818089261513816572456073452501892312801518858596361529181158803[/code]

[QUOTE=jrk;206046]Now a c171

[code]193180597261434437130723427223452983749001196443861486431050101233095959046579376056784397572419692971642911818089261513816572456073452501892312801518858596361529181158803[/code][/QUOTE]


This will need *lots* of ECM. My guess is somewhat more than t55, i.e. ~17700 @ 110e6 and a couple of curves at 260e6?

If this 171 digit number had been prime, the aliquot sequence would have acquired
the downdriver now, right?

@frmky (Greg): How many systems did you make use of
in order to find out that p53 factor by using ECM,
crack that c106 within half an hour
crack that c128 within 5 hours of time

Only 13 more iterations count for sequence 314718 to reach (hit) 9000 iterations is being left over!
that is remaining actually...

[QUOTE=Raman;206050]
@frmky (Greg): How many systems did you make use of
in order to find out that p53 factor by using ECM,
crack that c106 within half an hour
crack that c128 within 5 hours of time
[/QUOTE]
Eight 2.4GHz Core 2 Quads, totaling 32 cores.

[QUOTE=Raman;206050]If this 171 digit number had been prime, the aliquot sequence would have acquired
the downdriver now, right?[/QUOTE]

No, the prime would have to be of the form 4n+1. This c171 is of the form 4n+3.

Assuming the c171 splits into two factors, there is a 1/2 chance that it will split into primes of the form 8n+1 and 8n+3, losing the 2^3, and a 1/2 chance that it will split into primes of the form 8n+5 and 8n+7, keeping the 2^3. The good news is that it can't pick up a 3, but that wouldn't really matter if it got 2^4 * 31...

[QUOTE=frmky;206052]Eight 2.4GHz Core 2 Quads, totaling 32 cores.[/QUOTE]

I guess you also distributed the poly search between these cores? Do you use a script for doing this?

Edit:

[QUOTE=10metreh;206054]No, the prime would have to be of the form 4n+1. This c171 is of the form 4n+3.

Assuming the c171 splits into two factors, there is a 1/2 chance that it will split into primes of the form 8n+1 and 8n+3, losing the 2^3, and a 1/2 chance that it will split into primes of the form 8n+5 and 8n+7, keeping the 2^3. The good news is that it can't pick up a 3, but that wouldn't really matter if it got 2^4 * 31...[/QUOTE]

Don't jinx it! *knocking on wood*

btw: is there any chance to get the downdriver if the 2³ is lost?

[QUOTE=Andi47;206055]I guess you also distributed the poly search between these cores? Do you use a script for doing this?
[/QUOTE]
In this case, no. But the ggnfs distribution includes scripts (search_a5) to distribute the poly search if you use pol5. To distribute msieve polsel, I just run in different directories and concatanate the .p files.

i would think cpu time is better spent doing like ecm since gpus are faster at poly's I will do p-1 if no one else is.

[QUOTE=Joshua2;206058]I will do p-1 if no one else is.[/QUOTE]

To which bounds?

can you please save stage 1 (at the best done with the [COLOR="Blue"]-chkpnt filename[/COLOR] option) and post it, just in case if we want to increase the bounds later, that we don't need to re-do stage 1?


Edit2: 59@11e6, no factor

I'm running 2000@11e7 over the weekend. (raman: 60 hours Fri morning - Mon morning / 15 CPU-minutes per curve * 8 CPUs)