[QUOTE=debrouxl;434747]Jon: yup, it would be great if you could generate polys for the 4 last of these 6 numbers.[/QUOTE]

Done and attached.

The 14e and 15e queues are both empty. Who has the ability to fill them?

[QUOTE=jyb;434950]The 14e and 15e queues are both empty. Who has the ability to fill them?[/QUOTE]

14e: Lionel, Tom, Paul, Greg
15e: Lionel, Tom, Greg

The current issue is transient, but it further highlights the dire need for greater automation of the process...
Greg is going to provide me the files for the management infrastructure soon, so that I can work on it; but he's insanely busy at the moment.

I have started working on the procedure to unify the two databases behind the 14e and 15e queue management, and improving the unified database, so that a unified management interface can be made out of the currently duplicated ones.
Some tasks can be done through MySQL functions (I'm learning a bit in the process), which is what I did so far, while others are best left to PHP.
I have imported the '2012 RSALS code and the '2016 NFS@Home code into a private Github repository, and my changes on top of that. A friend and team-mate from the TI community will try to spend some time on the code to help me :smile:

SNFS polynomial for this one is interesting

P223+1 = 2 * C223

P223 = (26010319^31-1)/26010318

26010319 = (612067^3-1)/(612066*3*4801)

I think the best polynomial is
26010319*x^6+26010317 with x=26010319^5

But perhaps some clever person will find something better.

Presumably you mean P223+1=2*C223...?

Some quartics that are ready, including the penalty for quartics.

[URL="http://factordb.com/index.php?id=1100000000826052151"]181^115-1[/URL]
[URL="http://factordb.com/index.php?id=1100000000438450336"]3237350394808285103075641617594465564146206546711^5-1[/URL]
[URL="http://factordb.com/index.php?id=1100000000438459211"]3633300011821322527883441762063547117079391973569^5-1[/URL]
[URL="http://factordb.com/index.php?id=1100000000685534268"]18864198964623859882837445679850969284402949066171^5-1[/URL]
[URL="http://factordb.com/index.php?id=1100000000438450698"]24772285175707806384099574440402334706455060939751^5-1[/URL]
[URL="http://factordb.com/index.php?id=1100000000685449085"]2164375781978715114102841584382563299103035038465117^5-1[/URL]
[URL="http://factordb.com/index.php?id=1100000000685461387"]37424900799714233724027045150234142768618867083668617^5-1[/URL]
[URL="http://factordb.com/index.php?id=1100000000438461901"]1435130102620557966393278537760156017252441420078670131^5-1[/URL]

and a 15e sized sextic
[URL="http://factordb.com/index.php?id=1100000000206247932"]70841^53-1[/URL]

[QUOTE=wblipp;435176]SNFS polynomial for this one is interesting

P223+1 = 2 * C233

P223 = (26010319^31-1)/26010318

26010319 = (612067^3-1)/(612066*3*4801)

I think the best polynomial is
26010319*x^6+26010317 with x=26010319^5

But perhaps some clever person will find something better.[/QUOTE]

[QUOTE=Dubslow;435177]Presumably you mean P223+1=2*C223...?[/QUOTE]

Still says C233 :razz:

Trial-sieving 70841^53-1 and pushed to 15e

C188_132_125 has terrible yield: after sieving most of the 20M-120M range, the recommended ending Q is currently 1487M, which is [i]way[/i] too high.
32-bit LPs are usually alright for 15e on a number of that size, but qlim = alim = 26800000 is an order of magnitude too low. I failed to detect that when pasting the ready-made polynomial. I guess we should terminate sieving for that number, and create a new entry with the fixed polynomial ?