[QUOTE=Syd;276617]Thank you Andi47 for your PN, and sorry for not fixing it.

I'm currently working through the bugs.
Just fixed the yafu-permissions, sequences and so on should be correct again. Same for the certificate upload. Tell me if I'm wrong here!

Next is the parser (can be confused with the "%", modulo operator).

I have to keep the limits for primality proofs, factorials and so on as there is not enough capacity to process larger numbers.[/QUOTE]
My primo certificates are still unwanted. Is that something to do with your last statement about primality proof limits? Or, is it possibly something on my end? I'll try some fresh ones later. Perhaps my earlier ones are actually sitting somewhere in mix.

My factor submissions for aliquot sequences (elf file versions) were and are working fine.

Thanks for all...

I tried a couple "fresh from the tap" PRPs and no acceptance of their certificates.:sad:

The answer came back almost too fast to have checked anything. It was always taking a few seconds to reply for all the ones that it accepted a few days ago... Then again, this was only a couple...

Thanks for all...

[QUOTE=EdH;276704]I tried a couple "fresh from the tap" PRPs and no acceptance of their certificates.:sad:
[/QUOTE]

What numbers are these certificates for? I just did a few, no problems there.

I tried "Report factors" again.

[CODE]Input number is (443^773-1)/((443-1)*15461*10732516723811) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=2283375865
Step 1 took 858ms
Step 2 took 655ms
Input number is (863^691-1)/((863-1)) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=2069146307
Step 1 took 952ms
********** Factor found in step 1: 295264301
Found probable prime factor of 9 digits: 295264301
Composite cofactor ((863^691-1)/((863-1)))/295264301 has 2018 digits
Input number is (251^857-1)/((251-1)*92557*209188559*755419330738843) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=1740060370
Step 1 took 952ms
Step 2 took 655ms
Input number is (617^733-1)/((617-1)*67073899*500729893) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=3670830607
Step 1 took 936ms
Step 2 took 624ms
Input number is (727^709-1)/((727-1)) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=4254320057
Step 1 took 1014ms
********** Factor found in step 1: 1434089063327
Found probable prime factor of 13 digits: 1434089063327
Composite cofactor ((727^709-1)/((727-1)))/1434089063327 has 2014 digits
Input number is (409^787-1)/((409-1)*22037*92867*31585459*3886432657) (2027 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=153522771
Step 1 took 998ms
Step 2 took 640ms[/CODE]Doesn't matter if I choose GMP-ECM or auto. It returns "0 factors found..." in a fraction of a second.

[QUOTE=Syd;276744]What numbers are these certificates for? I just did a few, no problems there.[/QUOTE]
Everything is fine today. I believe last night's trouble was self-induced. I think I was sending the original zips back to the db, instead of my certificates. (I had changed the sort order in my file manager.) Sorry! :redface:

Thanks for all! I'll try to hide for a while...

[QUOTE=lorgix;276753]I tried "Report factors" again.

[CODE]Input number is (443^773-1)/((443-1)*15461*10732516723811) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=2283375865
Step 1 took 858ms
Step 2 took 655ms
Input number is (863^691-1)/((863-1)) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=2069146307
Step 1 took 952ms
********** Factor found in step 1: 295264301
Found probable prime factor of 9 digits: 295264301
Composite cofactor ((863^691-1)/((863-1)))/295264301 has 2018 digits
Input number is (251^857-1)/((251-1)*92557*209188559*755419330738843) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=1740060370
Step 1 took 952ms
Step 2 took 655ms
Input number is (617^733-1)/((617-1)*67073899*500729893) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=3670830607
Step 1 took 936ms
Step 2 took 624ms
Input number is (727^709-1)/((727-1)) (2026 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=4254320057
Step 1 took 1014ms
********** Factor found in step 1: 1434089063327
Found probable prime factor of 13 digits: 1434089063327
Composite cofactor ((727^709-1)/((727-1)))/1434089063327 has 2014 digits
Input number is (409^787-1)/((409-1)*22037*92867*31585459*3886432657) (2027 digits)
Using B1=20000, B2=2678412, polynomial x^1, x0=153522771
Step 1 took 998ms
Step 2 took 640ms[/CODE]Doesn't matter if I choose GMP-ECM or auto. It returns "0 factors found..." in a fraction of a second.[/QUOTE]

OK, I can report factors of smaller numbers. But not the above. How come?

Just a little question/observation on the FactorDB website...
I've been going to Status->Composite numbers without known factors
and factoring several hundred small composites. One of the things that seems like a waste of time (to me, not necessarily others :) ) is the sheer quantity of composites ending in 5 (obviously containing a super small factor). I was wondering if there was any way/desire to set up a worker to possibly continuously sieve the database to some arbitrary number, say 1000000, in order to get rid of small factors. If anyone is interested in pointing out/creating a script to do this, I'll dedicate my small rig?
Thanks!

[QUOTE=c10ck3r;279083]Just a little question/observation on the FactorDB website...
I've been going to Status->Composite numbers without known factors
and factoring several hundred small composites. One of the things that seems like a waste of time (to me, not necessarily others :) ) is the sheer quantity of composites ending in 5 (obviously containing a super small factor). I was wondering if there was any way/desire to set up a worker to possibly continuously sieve the database to some arbitrary number, say 1000000, in order to get rid of small factors. If anyone is interested in pointing out/creating a script to do this, I'll dedicate my small rig?
Thanks![/QUOTE]Do you do Perl? There are several worker scripts posted in this thread (maybe we should consolidate these?) The latest is [URL="http://www.mersenneforum.org/showpost.php?p=269936&postcount=1201"]here[/URL].

Latest version is this:
[url]http://www.mersenneforum.org/showpost.php?p=270964&postcount=1225[/url]
yoyo

[QUOTE=yoyo;279118]Latest version is this:
[url]http://www.mersenneforum.org/showpost.php?p=270964&postcount=1225[/url]
yoyo[/QUOTE]Ooops....sorry, I was searching backwards and started at the top of the page. Soneone probably [I]should[/I] consolidate the various scripts.

La lengua perl
 

[QUOTE=schickel;279115]Do you do Perl? There are several worker scripts posted in this thread (maybe we should consolidate these?) The latest is [URL="http://www.mersenneforum.org/showpost.php?p=269936&postcount=1201"]here[/URL].[/QUOTE]

Alas, I do not speak this Pearl of yours. (JK) In all reality, I have heard of it but not yet studied into programming. I will download the Perl interpreter script when I return to my abode, but want to ask a (dumb) question first. Can I just copy and paste/retype your script into the interpreter, or are there variables that I will need to change to get it started (ie insert web addresses or sieve limits)? Thanks in advance!