[QUOTE=xilman;500064]I have notified the service provider that the site is down. I have also informed Jon of this.

The ECM server is running on my own hardware at 83.217.167.177:8195. The GCW server is the same address but port 8194.[/QUOTE]It is allegedly back up but this machine can't resolve the address. Perhaps wait a while for the DNS to settle down again.

[QUOTE=xilman;500095]It is allegedly back up but this machine can't resolve the address. Perhaps wait a while for the DNS to settle down again.[/QUOTE]
Cunningham Numbers site and Homogeneous Cunningham Numbers site both working again.

Here are some updates worth mentioning:

- Below are all the factors reported to me since the last update (Oct 10). There are now 1547 composites remaining.

- Tom's reservation service is now up and running. You can find it at: [url]http://www.chiark.greenend.org.uk/ucgi/~twomack/homcun.pl[/url]. More details on this in a future post, but feel free to poke around and/or reserve any composites you want to factor. As you can see there, there is quite a bit of low-hanging fruit (e.g. SNFS difficulties under 200).

- This information has not yet made it into the tables on the web site. I'm waiting to hear back from Paul as to when he can take my updated files and deploy them. Until then, Tom's reservation page and the ECMnet server have all the latest information.

[code]
6-5 381 C193 86198852596292657674352430980856290403081253334681517373. P137 R Silverman ECM 2018-10-10
6-5 325 C117 105052756629474761504459819315210668209731983652844399101. P61 S Batalov GNFS 2018-10-10
11+2 265 C131 767284030176677976251245248312291358373195027345435491. P78 S Batalov GNFS 2018-10-11
8+5 590M C169 28144536536482334004313112574502673367263574101. P123 J Becker ECM 2018-10-12
9+2 542M C179 72995594499149625817852302916422349888567111009. P132 J Becker ECM 2018-10-13
11+9 583M C224 106901807849444589064842765077830102787830259878127. P174 J Becker ECM 2018-10-14
6-5 335 C166 9431816877694611620207192553200012860423397403307511. P114 R Silverman ECM 2018-10-15
5+2 374 C147 1297330187210613614320130104276754648993171918201. P98 R Silverman ECM 2018-10-17
5+2 950L C161 87620277582822539003390484227169623894184601. P117 J Becker ECM 2018-10-18
7+6 1050M C172 1157132376910495590241901222504969940265417932849601. C121 J Becker ECM 2018-10-24
10+3 990L C177 30133061896420567554037066729064895563951220961. P131 J Becker ECM 2018-10-26
9+8 646L C184 171115215187805387729188307697251529400005637789. C137 J Becker ECM 2018-10-26
3+2 526 C193 671926902820163553275747311736085200385142203590483809488330220078375891713361. P116 NFS@Home & J Becker SNFS 2018-10-26
10+9 670M C263 698274058929336761749151783428826498722527359766361. C212 J Becker ECM 2018-10-28
3+2 1662L C219 7292387323741464688980604852385571974601437802469. P170 J Becker ECM 2018-10-28
7-3 1197L C210 48249009674252065318494300845426540243431156812259. P160 J Becker ECM 2018-10-29
5-3 389 C145 4254151438250439648396880703932170970327173661. P100 R Silverman ECM 2018-10-31
5-3 383 C154 14754455262377121895335124382622114214917823453205319357173. P96 R Silverman ECM 2018-10-31
5+3 391 C187 368807806314874707569364862584335957288948153611. P139 R Silverman ECM 2018-11-01
3+2 527 C190 381000165207690347577070511282719642157050269507403063637. P133 NFS@Home & C Pinho SNFS 2018-11-05
6-5 329 C211 32036562696701297527952639076533482457201026132093971803532779712425699520997864862993. P126 NFS@Home & C Pinho SNFS 2018-11-05
6+5 329 C199 40199450228560975503643787457636796478962551898541442542959493671239070475035511023638476371418557. P102 NFS@Home & J Becker SNFS 2018-11-05
3+2 619 C262 2042465421463061582386055708171676724032643754551. P214 J Becker ECM 2018-11-06
9+8 566M C213 520584522433950914383579819210495863918913745321. P165 J Becker ECM 2018-11-06
7-2 355 C158 405290690296013431075874576067286715550749679591722998911581. P98 NFS@Home & C Pinho GNFS 2018-11-10
6+5 323 C189 631059426787460036894484544815736584470905675036957. C138 NFS@Home & J Becker SNFS 2018-11-12
6+5 323 C138 5772806439605430668830242834225940531783310466747964294458539. P77 NFS@Home & J Becker SNFS 2018-11-12
9+2 574M C193 2222392571792426140138361907456692194133356406676991716801221529996646731293. P117 NFS@Home & C Pinho SNFS 2018-11-12
7+6 1050M C121 32442341100602223986144077691539534344797616491399119201. P66 S Batalov GNFS 2018-11-13
11-10 265 C136 2281019814850446280881872373108418066489724896159381. P84 T Womack GNFS 2018-11-13
12-7 777L C210 3044641743550564634150644770948633625202279380906077588499. P152 NFS@Home & J Becker SNFS 2018-11-14
3+2 550 C136 1174163502243537656307114510464638659070890027748033095301. P79 T Womack GNFS 2018-11-14
12-7 777M C216 2173490914033698117909626211813396151412899143869915957685439798949749590670711. P137 NFS@Home & J Becker SNFS 2018-11-15
9+2 287 C204 59996443383924339027669995780168895688405667. C161 Yoyo@home ECM 2018-11-15
9+8 287 C184 272661113526502460688637041779076948162009482179. P136 Yoyo@home ECM 2018-11-15
4+3 1179L C203 715433041421105627223775398549184729718985257093479787338188872762052088954856311556960791. P113 NFS@Home & C Pinho SNFS 2018-11-16
4+3 1173M C212 551375027273505430749200270744263962361469206729944917335777. P152 NFS@Home & C Pinho SNFS 2018-11-17
5+2 376 C246 145542444691600029016816860796119511712357187473. P199 J Becker ECM 2018-11-19
5-4 1095M C203 82551403895424203655707847276862452505465775067959234247162620620595761337671. P126 T Womack SNFS 2018-11-19
3+2 530 C173 2136533179196653468783331310112856701697091641625870721. P119 J Becker SNFS 2018-11-20
6+5 326 C233 201876472275208323528744072655721315962389745852800012581755291547561429831366446787470644830333. P138 NFS@Home & J Becker SNFS 2018-11-21
5+2 403 C235 16788569707714564574808225060357073309315220663761. C185 J Becker ECM 2018-11-21
9-5 575L C207 6177069816151176552764745285498047221373042701. P161 Yoyo@home ECM 2018-11-22
5+2 392 C201 1093956080260195901872639863078714211041123296126817557787500754540784794301610586230544060001. P108 NFS@Home & C Pinho SNFS 2018-11-22
5-4 1055M C202 71240413945828962851243126939374208813127780881. P155 J Becker ECM 2018-11-24
9-7 287 C200 17167693308831649680487604900560679215070388484464121. P148 Yoyo@home ECM 2018-11-26
[/code]

[QUOTE=jyb;500966]Here are some updates worth mentioning:
...
- This information has not yet made it into the tables on the web site. I'm waiting to hear back from Paul as to when he can take my updated files and deploy them. Until then, Tom's reservation page and the ECMnet server have all the latest information][/QUOTE]

<sigh>
I'll see what I can do. Unfortunately I'm in La Palma and the systems which need updating are in Cambridge, 2900km away.

[QUOTE=xilman;500972]<sigh>
I'll see what I can do. Unfortunately I'm in La Palma and the systems which need updating are in Cambridge, 2900km away.[/QUOTE]Easier than I feared, though it was a little fiddly.

[QUOTE=xilman;500974]Easier than I feared, though it was a little fiddly.[/QUOTE]

This will need another update. The last set of our shared files is now well out of date. Please see my last email to you, Paul.

[QUOTE=xilman;500972]<sigh>
I'll see what I can do. Unfortunately I'm in La Palma and the systems which need updating are in Cambridge, 2900km away.[/QUOTE]

I’ll be in Cambridge this Thursday...lol

[QUOTE=jyb;500978]This will need another update. The last set of our shared files is now well out of date. Please see my last email to you, Paul.[/QUOTE]<sigh>
I'll see what I can do.

As promised, here is some additional information about the reservation service.

- For those new to the page, for each composite either its raw digit count (GNFS difficulty) or its SNFS difficulty will be highlighted in green. This is intended to indicate which NFS variant is the best choice. It uses the guideline that if the digit count is less than 0.69 * SNFS difficulty, then GNFS is the better choice. There are modifications that people sometimes make to this guideline, so YMMV, but that's what the reservation page uses. But see below for more about polynomial degrees.

- If you wish to sort by SNFS difficulty instead of the default of GNFS difficulty, you can click on the SNFS column header.

- Beware of SNFS difficulties which reflect polynomials that must be quartics. E.g. the composite for 7-5,305 is 147 digits and has a nominal SNFS difficulty of 206.2. Using the .69 guideline, the page shows that SNFS is the better choice. However, the SNFS polynomial for this number must be a quartic, and quartics sieve very badly for numbers at this size. A GNFS-147 job will almost certainly end up being easier than using SNFS for this one.

- When there are multiple choices of polynomial leading to different SNFS difficulties, the page shows the lowest nominal difficulty, even though this might not actually be the best choice. E.g. 11-8,245 shows an SNFS difficulty of 204.1, but that assumes a quartic polynomial. There is a sextic polynomial that can be used instead, with an SNFS difficulty of 218.7. Despite the higher number, this would be a much better choice for this number. Or consider 11+7,245, also with an SNFS difficulty of 204.1. The .69 rule suggests that SNFS is the better choice for this 146-digit composite, but it would be a quartic. There is a sextic instead, with a difficulty of 218.7. While that would be better than using the quartic, the .69 rule applied to this latter value shows that GNFS is actually the best choice of all for this number.

- The SNFS difficulties shown assume that the polynomial degree will be 4, 5 or 6. This has some noteworthy consequences:[INDENT]
- Some Aurifeuillian composites cannot be described by a polynomial of appropriate degree. Their difficulty therefore reflects the whole original number, rather than the Aurifeuillian split, which means it will be at least twice as big as the actual composite. So SNFS will never be appropriate for such numbers. E.g. 11+2,506M (indeed, all 11+2,LM's) has a form with 21 terms and is therefore described most naturally by a degree-20 polynomial. This can be converted to a degree-10 polynomial with the standard degree-halving trick, but that's still not appropriate for NFS. So its difficulty is shown as 479, which is what you would get if you didn't use the Aurifeuillian split at all.

- It is possible to sieve with octic polynomials, though like quartics, they do not sieve very well. But the page doesn't reflect this possibility. E.g. consider 5+2,930M, a 169-digit composite with a nominal difficulty of 260.0, and that's for a quartic. No wonder the page shows GNFS as best. However, it is possible to use an octic polynomial with this number, and that would drop its SNFS difficulty to 174.5. That sounds downright easy! I have no experience sieving with octics, so I don't know whether it actually [I]is[/I] easy. But it's probably worth experimenting with. Or consider 6+5,930M, which has no SNFS polynomial at all of "appropriate" degree. But we can make an octic polynomial for it, and the nominal difficulty would be a mere 195.8.
[/INDENT]
- If you are using SNFS with a non-Aurifeuillian composite, the easiest way to generate a polynomial is to run the phi program, which can be found [URL="https://mersenneforum.org/showthread.php?p=372732#post372732"]here[/URL]. Make sure you pass -deg6 when appropriate (e.g. when the exponent is divisible by 3 and not 5, or when it is divisible by 35) to avoid using a quartic when that's not necessary.

- Making SNFS polynomials for Aurifeuillian composites can be tricky. Some day I might get around to modifying phi to do that automatically, but in the meantime there is a fair amount of knowledge needed to get it right if you're doing it by hand. The list of Aurifeuillian polynomials given [URL="http://www.leyland.vispa.com/numth/factorization/anbn/aurif_polys.txt"]here[/URL] is invaluable. But feel free to post here if you're having trouble and someone can help.

[QUOTE=jyb;501186]
- It is possible to sieve with octic polynomials, though like quartics, they do not sieve very well. But the page doesn't reflect this possibility. E.g. consider 5+2,930M, a 169-digit composite with a nominal difficulty of 260.0, and that's for a quartic. No wonder the page shows GNFS as best. However, it is possible to use an octic polynomial with this number, and that would drop its SNFS difficulty to 174.5. That sounds downright easy! I have no experience sieving with octics, so I don't know whether it actually [I]is[/I] easy. But it's probably worth experimenting with. Or consider 6+5,930M, which has no SNFS polynomial at all of "appropriate" degree. But we can make an octic polynomial for it, and the nominal difficulty would be a mere 195.8.[/QUOTE]

I'd like to try an octic job. I haven't paid attention to this project previously, but I'd like to try factoring 5+2,930M with this octic-SNFS-175. I followed the link to the tables, and find "C169" for 930M.
Could you direct me to the input number and the octic poly? I'm happy to determine parameters myself.
EDIT: I found the input via the reservations page. I suppose I should try this "phi" program before demanding a polynomial.... Perhaps you'll supply it before I try out the program.

[QUOTE=VBCurtis;501201]I'd like to try an octic job. I haven't paid attention to this project previously, but I'd like to try factoring 5+2,930M with this octic-SNFS-175. I followed the link to the tables, and find "C169" for 930M.
Could you direct me to the input number and the octic poly? I'm happy to determine parameters myself.
EDIT: I found the input via the reservations page. I suppose I should try this "phi" program before demanding a polynomial.... Perhaps you'll supply it before I try out the program.[/QUOTE]

The phi program doesn't work for Aurifeuillian numbers. Or rather, it would just give you a polynomial that represents the whole composite, without accounting for the Aurifeuillian split, so it would have a way bigger difficulty than the polynomial you really want.

In this particular case, finding the polynomial means dividing the algebraic form of the number by its algebraic factor, which is 5+2,310M. The resulting number has a form that makes a natural degree-16 polynomial, which we can then use the standard degree-halving trick to turn into an octic. In ggnfs format, it looks like this:
[code]
n: 2213045317189420362284287841604460494073938628689991709159989079957175660742453322128913564693987316569360328272688680541910460490186834747980629812525909764598507091381
skew: 1.58114
c8: 16
c7: -80
c6: -120
c5: 1200
c4: -1200
c3: -3500
c2: 8000
c1: -5000
c0: 625
Y1: 2000000000000000
Y0: -4656612873079540061773
[/code]
Does that give you what you need?