[QUOTE=chris2be8;377666]@wblipp, how much ECM has been run against the numbers in the file?[/QUOTE]
I don't know. I keep track of efforts I have coordinated and efforts that others have reported, but many people only report factors. My guess is that the new numbers in this file have received 25 digits of ECM. 
I'm running 25 on all of them all now (about half way) and I found 3 factors (1 already reported up this thread)
other ones: 1505893^411 = 631312498141563763842298013 * P221 82261^611 = 101707141303420306836415487 * C263 
I've finished the last batch:
[code] 38567^291 6739325819303823602294660774883269220141268711 (p46) 38498058421054258874435038543432197902077994916821748409444234569500686694477134471 (p83) 33941^311 174209371464586847880434235488895109 (p36) 47938042284958488894859083574716738629089289594854352783968655899610955995803126150515140899661060359 (p101) 40277^291 1055285147311431578516068688395652243969011 (p43) 828400166379886598099687387689941051694271985442552454817969363121689371729950912591351 (p87) 35401^311 58215167521166310742885466200082202351188180820493564049531 (p59) 507506978304142573450644326597888537792840673696381907723298228591308608866501 (p78) [/code] Now reserving: 40823^291 41039^291 41299^291 41647^291 41687^291 42187^291 43117^291 Chris 
Looks like I need to redo that one then.
[code] [FONT=Verdana][SIZE=2]73136069^171[/SIZE][/FONT] 71193625354530777338943229003598390590886648325321493323379139 (p62) 9411627195096928090944418750057124221141068994690144093751626619 (p64)[/code] 
Results so far: [code]
40823^291 9659741938880353881445498679856997286847726874298594062062347443 (p64) 131941916990553874734529834386424709736662629471628421857129999947 (p66) 41039^291 4914016933575896739791192953684327670954310675056886129238418843 (p64) 300665423342895972656281624970861684919406892006796587790894575987 (p66) 41299^291 4288427583283029615540506132615316747799449870614616084221891 (p61) 411168126566423552513984752894729285709953476548743376874771682631011 (p69) [/code] And reserving a few more: 218387532812321544515750591865303049^41 35363^311 43951^291 82595917^171 They are likely to take a bit longer so should last until tomorrow. Chris 
[QUOTE=chris2be8;377751]
And reserving a few more: 218387532812321544515750591865303049^41 <snip>. They are likely to take a bit longer so should last until tomorrow. Chris[/QUOTE] Since a^41 = (a^2+1)*(a+1)*(a1), I factored it using pari within seconds: [CODE]? factor(2183875328123215445157505918653030491) [2 3] [3 3] [41 1] [80527 1] [306230690887690988105341429 1] ? factor(218387532812321544515750591865303049+1) [2 1] [5 2] [41333 1] [904177459 1] [116871127441087696163 1] ? factor(218387532812321544515750591865303049^2+1) [2 1] [1093 1] [127301 1] [2836788737 1] [60415269503488924135507662649838474088626965300722961 1] [/CODE] :showoff: 
I'll reserve
[CODE]27997^371 (C161) 911656503792821^131 (C180)[/CODE] which I believe are the highest weight but under C200 in size. 
27997^371
[CODE]prp61: 1166957977456798584642860771780293799210410233423245212729481 prp101: 10689913670029843972399108100790696500316856621289375788268644056443626864520729866753215014064379061[/CODE] It appears 911656503792821^131 has been removed from the file. I guess it is no longer needed because of other factorizations. I'll take these over the next week and just dump them into FDB unless an interesting set appears. [CODE]28229^371 28307^371 28603^371 28711^371 28909^371[/CODE] 
[QUOTE=paulunderwood;377757]Since a^41 = (a^2+1)*(a+1)*(a1), I factored it using pari within seconds:
[CODE]? factor(2183875328123215445157505918653030491) [2 3] [3 3] [41 1] [80527 1] [306230690887690988105341429 1] ? factor(218387532812321544515750591865303049+1) [2 1] [5 2] [41333 1] [904177459 1] [116871127441087696163 1] ? factor(218387532812321544515750591865303049^2+1) [2 1] [1093 1] [127301 1] [2836788737 1] [60415269503488924135507662649838474088626965300722961 1] [/CODE]:showoff:[/QUOTE] Sorry, I meant to reserve 218387532812321544515750591865303049^51. I've now factored it: 6803184261358457851448274877254058070311351 (p43) 547653214020076962887840445464876880666505346327419093500820478232887828831148774116732638141 (p93) And the rest I had reserved are done and in factordb. Although 41687^291 and 82595917^171 were already done before I started them (my scripts check just before staring work on a number). I'll now reserve: 36269^311 45233^291 21270133^191 37189^311 46559^291 46643^291 46819^291 46919^291 Chris 
[QUOTE=RichD;377772] It appears 911656503792821^131 has been removed from the file. I guess it is no longer needed because of other factorizations.
[/QUOTE] (911656503792821^131)/911656503792820 is partly factored in factordb. One factor is enough so it doesn't need finishing. Chris 
[QUOTE=chris2be8;377782](911656503792821^131)/911656503792820 is partly factored in factordb. One factor is enough so it doesn't need finishing.[/QUOTE]
Ah yes, I see that. I pulled the list of numbers late on July 9 for review. The factor was reported the morning of the 10th. I was ready to start the number the evening of the 10th and it was gone. Thanks. 
All the ones I had reserved are done, but a majority were already done before I started work on them. So I'll reserve:
3158844086932134865267303^71 185322901^171 37889^311 37963^311 375816169^171 40095967^191 46988659^191 34271719^191 38459^311 38557^311 Which should be enough to ensure I don't run out of work again since I've checked they are not done now. And I found the following are done now: 33999967^191 677783^231 Chris 
12689^311
[code]21811928065345205220094873093353993841814724054735092403329 (p59) 21909425439810598799488237334876734020198650554043780350459 (p59)[/code]Very close factors. Has any come up with a formula for ranking the numbers based on difficulty of factorization and weight? Currently using weight/(exp(log10(num)^0.53)) 
Reserving 1601^471

All my prior numbers are posted to FDB.
I'll start on a run of C180s of the form sigma(p^42) where p is 2294325033, for starters. Then review the list again when I complete these. 
I'm using SNFS to factor them. For these numbers the SNFS difficulty is about the same as the size of the number so the time to factor a number roughly doubles with each 9 digits so I use weight/(2^(log10(N)/9)/(2^(125/9)) for number N (assumes a SNFS 125 takes 1 hour).
For GNFS which doubles run time with every 5 digits I use weight/(2^(log10(N)/5)/(2^(95/9)) (GNFS 95 digits takes about 1 hour). It varies a lot with how good the SNFS poly is. The last lot I reserved included several with large coefficients which are taking longer than I expected so I'll only reserve a few today: 38651^311 38747^311 38821^311 39239^311 Chris 
1601^471
[code]4312796245582097108801049765728562995527734834300469027711 (p58) 622191470805542235675326249649631845597548225962421280317364575236386533765998456167797 (p87)[/code] 
1087^1571 = 15603239973862165138751331798701 * C443

And reserving:
39397^311 39541^311 40009^311 40357^311 40471^311 53906527^191 (this will take a bit longer than the rest). I should have a bit more CPU power available in a few days. Chris 
46988659^191 = 2267326240166408291806969405639859 * 549997749236774479211178635514522990365479394880307096264670960472916567984035628506754737467384244779279

1056727759668446657737531689896173611471587199309466994626527602651461730413^31 = 76805267218989262802547935557555097239 * 372795465356263078064128324255470402193834202817439245688215468313430075380038793917310234174033817685044465623

My systems sieving 6277^611 might be able to build a matrix tomorrow, at which point the helpers will switch to this project. So I need to reserve enough work to keep 12 cores busy (I've only been using 1 core until now).
So reserving: 43037^311 41641^311 41761^311 41897^311 42443^311 42557^311 42148087^191 4530191914446791781372518069571728639^51 9329404024783^131 NB: 30781801^191 is already factored. Chris 
[QUOTE=chris2be8;377802] I'll reserve:
... 46988659^191 [/QUOTE] [QUOTE=Wick;377998]46988659^191 = 2267326240166408291806969405639859 * 549997749236774479211178635514522990365479394880307096264670960472916567984035628506754737467384244779279[/QUOTE] I was half way through sieving 46988659^191 when I saw your post... Chris PS. When did you add it to factordb? The More Information tab says 8 July, but my script checked when it started work early this morning, which does not make sense. And how did you find it? ECM or SNFS? 
[B]Wick[/B] has been running ECM as posted [URL="http://mersenneforum.org/showpost.php?p=377731&postcount=99"]here[/URL] but I'll let him speak for himself.

Ow sorry, I missed your post. Otherwise I wouldn't have added it to factordb. I will check better next time.
I found it running ECM (T30) yesterday (Sunday). I have finished the 25 level and started the 30 level on all of them. Should take more than a week. I'm over the 180 digit level now, so I should not impact your reservations again. [code]3559658579428190261018961079^71 = 1713876748006326958592394657438191 * 1187054022121797325336828637350719242895848231967674803207599687416076292910698652129066866686832021346701863710327343955770110794871 1527527388004837^131 = 30241613782184528635873736867 * C154[/code] 
25321^431 = 4271379263073375109092176547304087 * C152

After further checking the only way I can see it happening was that the check to see if it was already factored failed (possibly because of a network glitch). If you find any more add them to factordb as soon as you can, that reduces the change of wasted work.
Chris 
On a happier note I've built a matrix for 6277^611 so the helpers are working happily through my reservations. So I need to reserve quite a few more numbers:
109110349^191 1189387657^171 293703391^191 31224301^191 42751^311 46159539174597156966133201834608296633^51 51230677^191 770181871^171 8147025617233^131 That's quite a lot but it's better to reserve a bit more than I need than to run out of work. And I found the following is already factored: 4221169^231 Chris 
[code]23011^471 = 13644762184699663208593529265877 * 32665217509637930225294679227793755079283484529881563391851148978621259868305281947471926803509106916850582723201614876222042599892521513801703585420644442944382375562241[/code]

I've finished most of the last list so reserving:
107971^311 25787683250831153710787881^71 2651741^231 268783^291 98761261^191 Chris 
The last lot are nearly finished so reserving:
12024699453359^131 155001523^191 156984193^191 184831^311 350786533^191 51530332404961^131 Chris 
6277^611 should finish soon so the system doing the matrix will start work here. So I need to reserve some more numbers:
10280527^231 173836939^191 2258809636908258935793067979843200406206687^51 29201^371 29983^371 30403^371 30449^371 310969^291 348657541^191 360277339^191 461038471^191 775706053^191 And I found that 3559658579428190261018961079^71 was already factored: Chris 
[code]537331^431 = 215698024027835910660433491177203 * 21692734922853718999754857593622777893335784567800859905314467941836198355855510364426388567177781877834463531881848401379466319511715463821913604544882755426739801625389730028879666219074506749018567144694911
15233^591 = 256154283125548472084309404456937 * 1559848896038399590827389926610333935303206952001317249915259046876684382045730730324561528533750127026777543273969093409539789677917730809341680217571362000894024803798141947656122280357890526585496609257282819[/code] 
And reserving some more:
10721967961^171 10845996631^171 15746737^231 160938752580680150194028960005697374003700881^51 1746260351115271992394304384754806543076539^51 235113335833451^131 30629717273^171 32237^371 32297^371 32371^371 32569^371 32801^371 386611^311 603439591^191 91694358591772841^111 978282007^191 And I found 85318934966894586152510050649084702260054417^51 is already factored. Chris 
I will be out of town for an extended weekend, so I'll take a few that have a higher weight to keep things moving while I'm gone.
8743879^311 1301^711 20431^471 20641^471 
[CODE]11239^671 = 266755309038488448802005787881812881 * 8355104228588178744812139363064737722701198127875780360621920230433471529074691280831511124373255750866959674287077449758739152431215933863540582338858913029721675606594545560358892750737973171078734346781443682625265950413465142601[/CODE]

I've found that my script to generate .polys doesn't always calculate the SNFS difficulty correctly. So I reserved more than I needed in my last post and I'm still working through them.
But I'm not sure how long they will last so I'll reserve a few more to make sure I don't suddenly run out of work. 235113335833451^131 32933^371 32983^371 32987^371 Chris 
[CODE]6329^731 = 5892956408768964535259592861037529 * 843067378664747498643804335408139114252467839132618336306298143170803700721579068606221236294857330981473361127614902276390924419192136571357451969606433107456619290323206696413131844763280954735664510670152550347410159925376322655607754449[/CODE]

I think I've fixed by script to calculate SNFS difficulty correctly. So have a better idea which order to do them in.
Reserving a few more: 1153^591 2076727601557346605912564984382862784850214619^51 2332124592321101^131 25261^431 30761539^231 591565811466254381^111 7470322239018277792723967541307^71 And found: (32801^371)/32800 is already factored (32983^371)/32982 is already factored Chris 
And reserving:
1461601^311 1931^611 25903^431 26111^431 34212847^231 Chris 
[CODE]191561^591 = 8361044803894046402128863456438443 * 282848093697818743968402988315741936805428709784816906102475016928967068238955100430406600849675784897654494771294316208244725096554947711681279810450323362735066348622870277519417837385214508126585533084416315278568134513623696310260871297161040427019021024521786567083033[/CODE]

Reserving 2 more:
26701^431 727^671 Chris 
[CODE]2868724432919^291 = 32381471193319265921625757649 * C321[/CODE]

Reserving:
4634428357056524094275270112238036268732742651439283929441^51 This will take a few times as long as the last few numbers. Which are already taking about 1 day each. Chris 
[CODE]4271^1031 = 61193736336534606694499914150843 * 336830190562948348365099656296988858447607556106466901320024319506040041292742998520414094102746999564087376889195382491153008896058990737112250215554530583647927997391511060465779929483480681897139142428172554434254280332647520007127984017322724672524932736806725737958518618786323841967722645759194432338092331814906861318049345467956291[/CODE]

The last set is wrapping up. I'll take one more.
172391941^231 
[QUOTE=chris2be8;379045]Reserving:
4634428357056524094275270112238036268732742651439283929441^51 This will take a few times as long as the last few numbers. Which are already taking about 1 day each. Chris[/QUOTE] I'm stopping work on this. I forgot to adjust difficulty for it being a quartic, and it not only looks as if it would take 23 months to sieve, but then need more memory to build the matrix than I have. Reserving as replacements: 130574968614389381^131 26801^431 Chris 
[QUOTE=chris2be8;379283]4634428357056524094275270112238036268732742651439283929441^51
I'm stopping work on this. I forgot to adjust difficulty for it being a quartic[/QUOTE] Perhaps something clever can be done because this is Phi_5(Phi_17(4019)). 
I've had a more pleasant surprise with the speed 26801^431 is sieving, so need to reserve some more work:
27191^431 3155094881^191 Chris 
Those two are going nicely so reserving:
27701^431 27739^431 27743^431 Chris 
[CODE]189297309425981^291 = 73133265720190711292633336137 * C371[/CODE]

I'll take two more but they may not get started right away.
20113^471 20183^471 
Reserving one more for each system:
1609669^311 244367^371 479^731 Chris 
Reserving:
2027^611 Chris 
And now I'm onto the big jobs where I only run 1 at a time on all 3 systems. And they still take a few days each.
Reserving: 12613^531 Chris 
Reserving:
53921073...57^31 (C136) 13025531...73^31 (C156) 
[URL="http://factordb.com/index.php?query=%2812059023^311%29%2F12059022"](12059023^311)/12059022[/URL] factor found by yoyo@home.

The last number is nearly done so reserving:
13007^531 Chris 
@RichD: What are the full numbers?

[QUOTE=Stargate38;380259]@RichD: What are the full numbers?[/QUOTE]
If you must know, the complete line from the RoadBlock file follows  for the C156. [CODE]1302553142076113315256404750037035967003078415878349115941834423642604678206873 2 565548229310785146625442107442750828817869994945559128027684605053797910614326428563005019565405694440266120284119765774978864442996175822113480583754215001 12617[/CODE] The FDB entry is [URL="http://factordb.com/index.php?id=1100000000690936034"]here[/URL]. It should complete in a couple days. This is my last outstanding number before I take a short break. 
Now reserving:
13043^531 Chris 
Lots of delays, but the T30 on everything in the list is done. No more factors found.

Next reservation:
13147^531 Chris 
[CODE]
55501^431 = 2048087842232867770850859969843802187 * 8898016136247481767281200002180538199676899514510643682682590084789651717598924078520523706792132174079687583383625560924697645243486383093338452035826193302243789[/CODE] 
[CODE]24407^471 = 1433191401410585618876688719884441643 * C166[/CODE]

13043^531 gave a 4 way split:
r1=53034649976618978314837727353750861140013 (pp41) r2=9102657715296113406968238492891515755014196975903921 (pp52) r3=147816997954930223462865311123856226038796906958401442683 (pp57) r4=140026651584779991337326424022476411288720578224172631861692353239 (pp66) This probably should have had more ECM run against it. But I didn't know how much had been run. Chris 
True. But looking on the other side, the finding of the p41 by ECM would not have helped NFS. It would still be an SNFS job with the same difficultly.

Finding the P41 by ECM would be enough to bypass the roadblock, so it would not need fully factoring.
I'l reserve 7643^591 for ECM to t50, to be followed by SNFS if that doesn't find anything. Chris 
[CODE]17033^531 = 319391252920161429560547697830623021848733 * 33330520337724660774026719117185864816084423298503770977448713371276795862990739368941333958579469564572049892835902778824236910135478940052210949429612763456195776438992014984777[/CODE]

I won't have finished ECM'ing 7643^591 when 13147^531 starts LA (I'm using a GPU and 1 core for ECM so it takes a while). So I'll reserve some small fry to do while ECM finishes:
21407^471 60259^431 61799548199^171 Chris 
Reserving one more for ECM, to be followed by SNFS if that fails:
3251^611 Chris 
[CODE]13331^591 = 80755497159734947485059693840546839 * C205[/CODE]

[url]http://www.lirmm.fr/~ochem/opn/i_51_2000_101.txt[/url]
This file is the intersection of the composites encountered in the proof of the bounds \Omega(N) >= 2\omega(N)+51, N > 10^2000, and \omega(N) >= 101. So if you get a factor, it helps for all 3 proofs. Also, as we branch on the smallest prime for omega(N) >= 101 and on the largest prime for N > 10^2000, a composite in the file is likely to derive from a prime that is the only available prime at some point of the execution of the algorithm. So these composites are bottlenecks. The amount of ECM varies from "maybe not so much" to "a lot, really" for 6115909044841454629^171. 
[QUOTE=chris2be8;382401]Reserving one more for ECM, to be followed by SNFS if that fails:
3251^611 Chris[/QUOTE] It won't need SNFS: [code] ********** Factor found in step 2: 9937677757664476852904593531609640792365970218237 Found probable prime factor of 49 digits: 9937677757664476852904593531609640792365970218237 Probable prime cofactor 4933435390111026832796658137713158696690314285678621089166487442937825189905611449855687999637684794906443696039349871186136410748647635964240864254651 has 151 digits [/code] Chris 
[QUOTE=Pascal Ochem;382790] The amount of ECM varies from "maybe not so much" to "a lot, really" for 6115909044841454629^171.[/QUOTE]
What is the lowest amount of ECM any will have had? Should we start at T30, T35, T40 or higher to look for factors? Chris 
You can start at T40. And thank you for the factors you already obtained.

I've reached the point in mwrb2000.txt where the next most cost effective number would be 6115909044841454629^171 or 11^3111 (depends how fast 6115909044841454629^171 would be as an octic). They are both out of my range so I'll stop there.
It would still be worth running ECM against the rest of it, there is probably some low hanging fruit waiting to be found. Chris 
[CODE]6853807^291 = 112590938436045242392801854371922664426393 * C151[/CODE]

[CODE]22787^471 = 4543639013539669426613291598225427127 * 62549558218207738524332749889176473882724629210639329124410765199872180435689083679828086455715730270805552655974310311001299087407579824443318458077069317807742131[/CODE]

[CODE]598303^371 = 141564506618597953495404322578758873 * 173425382715900890478296318934217175388753709373685646269492132615005032816072482289330396161230911051852245406229724365723342162440733310274475448137984220934029716303[/CODE]

[CODE]9341^711 = 536321054561868323964339088560393553 * P243[/CODE]

[CODE]3256411^471 = 123990551845517800255308540638002993 * P265[/CODE]

[CODE]7123981^311 = 43768759531924424825804343483003280027079 * P165[/CODE]

The Brent tables numbers are getting a bit slow now, so I'll take a break doing some easier numbers from i_51_2000_101.txt (ECM first, then SNFS if necessary).
Reserving: 5336717^311 86353^431 Chris 
86353^431 won't need SNFS:
[code] Resuming ECM residue saved by chris@4core with GMPECM 7.0dev on Wed Nov 12 17:43:04 2014 Input number is 217299428303605750964143552796283167605200189138133468679725819860114113284236626937891491226949996388687364085089660351113758620972097016957505118361336117843690313385542307 (174 digits) Using B1=1100000011000000, B2=35133391030, polynomial Dickson(12), sigma=3:1015838297 Step 1 took 0ms Step 2 took 9880ms ********** Factor found in step 2: 1637372497455859450293267396543566542531415101042697 Found probable prime factor of 52 digits: 1637372497455859450293267396543566542531415101042697 Probable prime cofactor 132712274477093288121747769682453224834821397665155641925536387218142707430499259969666227538455978469807950639694262317131 has 123 digits [/code] So reserving 2 more for ECM, then SNFS if necessary: 128493601339^171 3234152111453204401^131 Chris 
3234152111453204401^131 is partly factored: [code]
********** Factor found in step 2: 1652853993138597196148058279397800605185523 Found probable prime factor of 43 digits: 1652853993138597196148058279397800605185523 Composite cofactor 935095082010579037215732687663189797754745332333490467692099728082350935058700921649503756074918673994545632848959840194 336432094815758798024873569494141367 has 156 digits [/code] @Pascal, is it worth factoring the cofactor? And reserving: 6115909044841454629^131 Chris 
Thank you for handling these hard and wanted composites.
Yes, it is worth factoring the cofactor. Would GNFS be faster than SNFS now ? If not, how much running time do we gain thanks to this P43 ? 
SNFS is probably still faster, so I'll finish ECM and do it with SNFS if necessary.
The factor will speed up ECM on the remainder, but won't speed up SNFS significantly. Chris 
(128493601339^171)/128493601338 is done: [code]
prp65 factor: 34452638008244778981611333120697531502847222390102198059245165043 prp114 factor: 160280814865071785713452537694471065748660900049568848854977810227742276800252185006681533636600380338627173664667 [/code] Now sieving (5336717^311)/42350787022542390712689528236. Chris 
(5336717^311)/42350787022542390712689528236 is done: [code]
prp63 factor: 265757700716518315850245798632257963583805397294027009361810899 prp118 factor: 3119981568449506273767247469134777989749255822139409689159653216937820237303657893389473330479238708807367772544854913 [/code] And reserving (7176374761323733117^131)/13488856228255048616579328765896916. Chris 
(6115909044841454629^131)/352625800020101435113013608945794799575273464851733420016735756574904617374301788 is done [code]
prp77 factor: 98032313856360812464739694865971799861951618042241462008523949351124607075129 prp87 factor: 484517978060191660318684960762814128615809937449558312148763677097077107846769392460819 [/code] And reserving: 7816625987881598827^131 Chris 
[CODE]117656719^291 = 193925751646462933809254981045844228023 * C188[/CODE]

3234152111453204401^131 is done: [code]
prp59 factor: 12582105433726376609212083893660523985810701754852931846027 prp98 factor: 74319444145178872415750706381034169605423538882654440470606425492506923698250271424960278678332421 [/code] And reserving: 934415109937^191 This is a GNFS target, so I need to allow time for ECM and polynomial selection while sieving the last 2 I reserved. Chris 
[CODE]9649^591 = 4746980744948075499977678970467027341733 * C192[/CODE]

(7176374761323733117^131)/13488856228255048616579328765896916 is done: [code]
prp62 factor: 33361389287744985352217348102256042577200267681785354296654357 prp150 factor: 297541246673966638694148025432818669364929342091130649003579425046426137772769375412849387029018683151840070257202299286679664873673026876022237309603 [/code] And reserving: (480393499^231)/451957020657813395732158958213463532216698390966 It's a GNFS job, so needs time for ECM and poly selection before I start sieving. Chris 
(7816625987881598827^131)/986513625958661359343795597311637518863702 factors as: [code]
prp57 factor: 568413422666928798266534126647852031245114898639482592909 prp147 factor: 725243600983997234940704346420128315487964795513697997197696102064439756270723452637390862874011058719737888447219828043575449192302890042717120387 [/code] Poly selection for 480393499^231 probably won't complete before I've finished sieving 934415109937^191 so I'll have to pick something else to do while poly selection continues. Chris 
Reserving 10378063^371 to do by GNFS (after ECM).
This is the last number in i_51_2000_101.txt that's in my range. Chris 
All times are UTC. The time now is 19:36. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2021, Jelsoft Enterprises Ltd.