returning ((4^302)+(3^302)) C181 due to other projects....
ran 333 on alpertron applet.

[QUOTE=R.D. Silverman;91922][QUOTE=R.D. Silverman;91383]

Here is 3,2,362+ C163 = p46.p54.p63

p46 = 2943738339276883838644077668041196839130316253
p54 = 713515117343543807310922849320558702166243866059956093
p60 = 176447012199512786447525233139026989421691889704811565290317317


I have started 3,2,367+

[QUOTE][/QUOTE]

Here is 3,2,367+ C131 = p51.p80

p51 = 446665344739686835336810996977681105993145984996853

p80 = 17105363156600987606871540941050710229807782508078177056460501295502885463411451

I have started 3,2,367-.

[QUOTE=FactorEyes;92593]
Interesting: out of 31 matrix dependencies, ggnfs split the two factors only three times. Don't get me wrong: I'm always grateful to find a 76-digit factor, no matter how many sqrt's it takes. This may mean that I need to upgrade to the latest snapshot of ggnfs.
[/QUOTE]

Upgrading won't help. There's a bug somewhere in the ggnfs sqrt code that no one has been able to track down. For certain polynomials, the code tends to fail quite often However, it succeeds often enough that out of 31 dependencies, at least one usually leads to a successful factorization. There have been times, however, that I have had to remove a few relations, generate and solve a new matrix, then rerun sqrt to get a successful factorization.

Greg

[QUOTE=xilman;88224]New tables have just been uploaded to my web site. There are now 52 composites left in these tables.

When the total falls below 30, I'll extend some of the other tables.

Paul[/QUOTE]Another update has just been posted. We're now down to 45 composites, so not too much work to be done before the IGG crowd get another opportunity.

Now that ggnfs is available and relatively easy to use, I'm somewhat surprised that more folk don't try their hand at SNFS factorizations. Most of the remaining 45 composites can be factored fairly quickly on a single machine.


Paul

[QUOTE=frmky;92955]Upgrading won't help. There's a bug somewhere ... However, it succeeds often enough that out of 31 dependencies, at least one usually leads to a successful factorization...
Greg[/QUOTE]Thanks for the background. These homogeneous Cunningham numbers may be particularly good at triggering that bug. It took 11 tries to split off a factor.
[CODE]4^281-3^281 C146
SNFS difficulty: 173 digits.
Divisors found:
r1=3681940853418377790000258551188130005606470664309152607094353 (pp61)
r2=3440774800407804675215612293663424238854332935219643377813080760531277279991539402979 (pp85)
[/CODE]

I am currently sieving 4^317-3^317.

[QUOTE=FactorEyes;93259]Thanks for the background. These homogeneous Cunningham numbers may be particularly good at triggering that bug. It took 11 tries to split off a factor.
[CODE]4^281-3^281 C146
SNFS difficulty: 173 digits.
Divisors found:
r1=3681940853418377790000258551188130005606470664309152607094353 (pp61)
r2=3440774800407804675215612293663424238854332935219643377813080760531277279991539402979 (pp85)
[/CODE]

I am currently sieving 4^317-3^317.[/QUOTE]

Nice!

I am about 80% done with 3,2,367- and have also sieved 3,2,391- and
3,2,389-. Final processing is waiting for 5,329- to finish.

3,2,367-
 

[QUOTE=R.D. Silverman;93260]Nice!

I am about 80% done with 3,2,367- and have also sieved 3,2,391- and
3,2,389-. Final processing is waiting for 5,329- to finish.[/QUOTE]

Here is 3,2,367- C158 = p53.p106


p53 = 11468061648767389961810278714362839597063580215873693

p106 = 7932554170312596575677248266765400080645487011559655744017434988468577440297419465897623324569305008997597

I have started 3,2,373-.

3,2,383+
 

[QUOTE=R.D. Silverman;93457]Here is 3,2,367- C158 = p53.p106


p53 = 11468061648767389961810278714362839597063580215873693

p106 = 7932554170312596575677248266765400080645487011559655744017434988468577440297419465897623324569305008997597

I have started 3,2,373-.[/QUOTE]


3,2,373- just finished sieving. Here is 3,2,383+ C176 = p72.p104

420309843470461103841356949579496052781447685995859248427121290159409287
94321545003645897737099779861928940347466472354786850093126868741080456930916819343306352143394350526309

3,2,391-
 

[QUOTE=R.D. Silverman;93941]3,2,373- just finished sieving. Here is 3,2,383+ C176 = p72.p104

420309843470461103841356949579496052781447685995859248427121290159409287
94321545003645897737099779861928940347466472354786850093126868741080456930916819343306352143394350526309[/QUOTE]


Here is 3,2,391- C161 = p74.p88

10708733219885279460805322702589854471144699086577087334337096270456910327
5813097521255636863578252372045960185515797796862391737721893570785832352267508200015359

The linear algebra for 3,2,373- is in progress. I have started sieving 3,2,379-.

3,2,373-
 

[QUOTE=R.D. Silverman;94047]Here is 3,2,391- C161 = p74.p88

10708733219885279460805322702589854471144699086577087334337096270456910327
5813097521255636863578252372045960185515797796862391737721893570785832352267508200015359

The linear algebra for 3,2,373- is in progress. I have started sieving 3,2,379-.[/QUOTE]


Here is 3,2,373- C160 = p74.p86

17930874581302156437936976273189304875314986785059413493455913842763120911
58230217053551403185963414936450914063417072730225874879739731277309932175124354621827

An extraordinary coincidence! The last 3 factorizations that I did
all had penultimate factors of 74 digits!!!!:surprised :surprised

[QUOTE=R.D. Silverman;94079]An extraordinary coincidence! The last 3 factorizations that I did all had penultimate factors of 74 digits!!!!:surprised :surprised[/QUOTE][B]Not[/B] ECM misses.

I have no idea how much ECM time has been put into these, but a glance through the tables at Paul's page doesn't show a lot of factors yet pulled between 40 and 46 digits. I'm expecting to hit some 40-something factors here as this continues.