Here's my perl script to check if a number is already factored in factordb. It looks for a line starting "factordb:" in the .poly file but could be changed to look for "n:". It's designed to check the formula (eg (2^991-1)/78945505870961648506458478330106863) instead of the number, but should work for the number as well.

Note it assumes a partly factored number still needs doing. Which may not be what you want.

I wrote it for factoring small fry in factordb. So if it can't tell if a number is factored the script calling it will carry on and factor the number anyway instead of waiting for however long it takes my internet connection to recover. Which may not be right for you (eg you could set it to only return 0 if the composite is not factored in factordb).

Chris

C175_123_73
 

Took 144 hours.

[URL]http://factordb.com/index.php?id=1000000000044692147[/URL]

[code]
p78=148030136836578392573445157748686875476242323524525116518896267302054062983687
p97=6756288475437006432114398746733370988802019067235144679198316059490781793241229514919921089571609
[/code]

Taking GC_9_259.

Taking GC_3_509

Factors GC_3_509
 

[B]GC_3_509[/B]
[code]prp58 factor: 5341283783128650868375856394834814895241448794418216600189
prp127 factor: 5500577881449545197196263558172602044889978535073603872418811437886462850493757827882071005629356406368996806596049023198966329[/code]
13.2M matrix (target_density=110), 111h total on a 3770k.

GC_8_272
 

Reserving [B]GC_8_272 [/B]for post-processing.

GC_9_259 splits evenly as:

[CODE]prp105 factor: 465434798421001079389014495594636781378991665664030258108598201107521727301152582026862845098556969136383
prp105 factor: 530211154514393668181769282873284771544463915571672422370639034588059948499675536056699842645696618296729[/CODE]

This took about 153.5 hours with 8 threads.

[QUOTE=wombatman;387150]GC_9_259 splits evenly as:

[CODE]prp105 factor: 465434798421001079389014495594636781378991665664030258108598201107521727301152582026862845098556969136383
prp105 factor: 530211154514393668181769282873284771544463915571672422370639034588059948499675536056699842645696618296729[/CODE]

This took about 153.5 hours with 8 threads.[/QUOTE]
Brilliant!

Right? It's definitely my largest pair to do that, and I'm pretty sure it's the first time I've had it happen.

Edit: Taking GC_5_341 and GC_9_250.

Both numbers should be ready in ~96 hours.

Factors GC_8_272 reserving L1289
 

[B]GC_8_272[/B]
[code]prp79 factor: 8822246185825472339392557994536527131340785862387177875895629018032075570987311
prp158 factor: 14954762103623002194185907415734709806542409423370289708400232938618545302733108525051048800939327689608740114587078339336536951179558995851574686242883075353
[/code]
9.7M matrix with target_density=120, total time 57.5h on a 3770k

Reserving: [B]L1289[/B]