Thanks,

--cache=off changed nothing, but increasing my wait time to four minutes (after successfully trying 911484) worked. I've subsequently changed the time to five minutes. I guess I should have tried that first.:sad:

My question is why does this take so long to simply retrieve an .elf?

My thought is that it must be that the db is flagged to do some processing of the number before releasing the .elf. I know the db will build an entire new .elf for a new number inquiry. Maybe it also checks the last composite before releasing the .elf...

I've noticed that factordb has lots of workers doing Trial factoring + PRP-checking, but none checking numbers with status unknown. And the latter are building up.

Chris

When are you ever going to add support for submitting LL Test results to the DB? I want the prime proof for M43112609 to be added. I'm tired of it saying "Unknown" on a 4-year old discovery. Same goes with all other primes over M1398269.

[QUOTE=Stargate38;312435]When are you ever going to add support for submitting LL Test results to the DB? I want the prime proof for M43112609 to be added. I'm tired of it saying "Unknown" on a 4-year old discovery. Same goes with all other primes over M1398269.[/QUOTE]

[QUOTE=Sir David Attenborough]
And here we see a wild boar asking for something in his boarish manner. There is a much nicer way to ask for what he wants. Let's see if he can find it![/QUOTE]

-Sir David Attenborough

ECM Helper
 

It appears a lot of new numbers have recently been added to the composite queue. What it be worthwhile to run the ECM helpers again?

[QUOTE=RichD;313267]It appears a lot of new numbers have recently been added to the composite queue. What it be worthwhile to run the ECM helpers again?[/QUOTE]
If you mean the ecm script I wrote, then try it and see how many factors you find. If you find a reasonable number of factors then run it for a bit.

[QUOTE=henryzz;313269]If you mean the ecm script I wrote, then try it and see how many factors you find. If you find a reasonable number of factors then run it for a bit.[/QUOTE]

Yes. I couldn't seem to locate it.

I was hoping a mod (or super mod) could put all the helper tools into a toolbox someplace. Or at least the links to all the fun tools...

(With over 300,000 messages, ECM is too common of a word to search on.)

[QUOTE=RichD;313278](With over 300,000 messages, ECM is too common of a word to search on.)[/QUOTE]

Scroll this thread up... post #1402 then.

Question about reporting ECM/P-1/P+1 factors
 

I have a question regarding reporting of factors found by ecm/p-1/p+1,
why do I always get an error message saying "calculated group order ... is not within B1/B2 bounds (B1=..., B2=...). Please check your results!" but when I reenter the exact same B1, B2 and sigma
values it gets accepted without error?

[QUOTE=YuL;314474]I have a question regarding reporting of factors found by ecm/p-1/p+1,
why do I always get an error message saying "calculated group order ... is not within B1/B2 bounds (B1=..., B2=...). Please check your results!" but when I reenter the exact same B1, B2 and sigma
values it gets accepted without error?[/QUOTE]

My thought is this happens because it has to calculate the group order first, and then it has to factor it to know if the B1/B2 bounds are correct. I think that sometimes it hasn't fully factored the group order before checking if the group order falls within the B1/B2 bounds. One time I had to manually factor the group order in order to get it to accept the correct B1/B2 bounds. I'm not sure how easy or hard this would be for Syd to fix, but I've definitely seen it too.

Someone is putting currently a huge mass of 35-digit numbers into the FactorDB, 40000 and increasing fastly!

Seems not a work of Syd (like recalculating the DB or something) because those numbers are like 12463930921794164511955239573357543, differing in only the last 6 digits.

PS: 55k numbers seems max so far.

PPS: Original numbers seems 69 digits: P35 (=12463930921794164511955239573041747) * C35 (like 12463930921794164511955239573347337) so P35*(P35+n)