Certificate : For all indents and purposes

[schickel]

Originally Posted by pakaran

This week, on two occasions, I've seen numbers already proven when I uploaded them. Once, I had been running only a few hours before submitting them. If anyone else is working in the smaller numbers, I'd appreciate knowing to avoid duplication of effort. In the mean time, I'm going back to non-Primo tasks.

Sorry, that was probably me. I think I might have read your previous message to mean that you were continuing up in size (from 1k digits). I was taking a break from running NFS jobs and have been running Primo until I decide what I want to do next for real.

I've just been grabbing a couple of hundred from the download page and running them overnight. It doesn't finish by the morning; I just upload what's finished before I leave for the day. The last couple of uploads have been in the ~1500 digit range, so if you start above that I won't clash with you. I think Primo loads the numbers in order when you do a multi-select, so you could also skip the first ~200 numbers to get to open waters.

[MisterBitcoin]

I´m taking some numbers under 800dd now.

[pakaran]

That's fine, both of you. The misunderstanding is reasonable. After uploading, I was sometimes in the habit of restarting, so that the smallest numbers didn't hang out on the list for too long.

I'll start a run beginning with 1501 dd now.

[MisterBitcoin]

Originally Posted by pakaran

That's fine, both of you. The misunderstanding is reasonable. After uploading, I was sometimes in the habit of restarting, so that the smallest numbers didn't hang out on the list for too long.

I'll start a run beginning with 1501 dd now.

I´m now running 59*3^8972+(3^8972-1)/2 from sweety´s PRP search. That is 4238dd, should be far enough from Edwin´s work on 3000dd->4000dd.
I´ll than move on and take any prp´s under 1000dd.

[MisterBitcoin]

Originally Posted by MisterBitcoin

I´m now running 59*3^8972+(3^8972-1)/2 from sweety´s PRP search. That is 4238dd, should be far enough from Edwin´s work on 3000dd->4000dd.
I´ll than move on and take any prp´s under 1000dd.

Almost done. Extending to 14xx dd.
Should be ~90 canidates.

[MisterBitcoin]

Uff. Got about 3500 new PRPs. All of them can be proved by N+1, but I prefer using primo.
It´s a bit faster.
Will take some time to catch up.

[axn]

Originally Posted by MisterBitcoin

Uff. Got about 3500 new PRPs. All of them can be proved by N+1, but I prefer using primo.
It´s a bit faster.
Will take some time to catch up.

Why? A simple script can loop thru these and ask factordb to do the N+1 test. Save your cycles for something useful

[EdH]

Originally Posted by axn

Why? A simple script can loop thru these and ask factordb to do the N+1 test. Save your cycles for something useful

When I look at any of the PRPs, they seem to already have N+/-1 tests underway, but very little progress shown. Is there something else to do?

If you could elaborate a bit, I have a Raspberry Pi sitting idle ATM, that could do just that. I have absolutely no knowledge of how to invoke N+/-1 within the db. If you can tell me what to send, I'll try to write a script. I may need more help later.

OTOH, I'll move my lower bound down to 2500 dd tomorrow if I don't read of any opposition.

[chris2be8]

I'm already running a script to prove them by N+1.

The limit is that I keep hitting "You have reached your hourly limit of 750 seconds CPU-time." So I've just added a few delays to the script to keep that from happening.

So just leave it to me.

Chris

[axn]

Originally Posted by EdH

If you could elaborate a bit, I have a Raspberry Pi sitting idle ATM, that could do just that. I have absolutely no knowledge of how to invoke N+/-1 within the db. If you can tell me what to send, I'll try to write a script. I may need more help later.

You need to make two GETs

First one is http://www.factordb.com/index.php?id=<factordbid>&open=prime

This simulates the opening of "Primality proving" section of the number and will also do the preliminary factoring of N+1 and enable the proof button

The next one is http://www.factordb.com/index.php?id=<factordbid>&open=prime&np1=Proof

This simulates the clicking of the N+1 "Proof" button. You'll probably want to parse the output of the first call to look for the following tag <input type="submit" name="np1" value="Proof"> before making the second call.

Of course, chris2be8 is on the case, so you can coordinate with him.

[EdH]

Originally Posted by chris2be8

I'm already running a script to prove them by N+1.

The limit is that I keep hitting "You have reached your hourly limit of 750 seconds CPU-time." So I've just added a few delays to the script to keep that from happening.

So just leave it to me.

Chris

This is enough to keep me from putting in any serious effort. My primo script system of machines is based on being able to communicate with the db in a timely manner. Any failures have to be manually fixed.

Originally Posted by axn

You need to make two GETs
...
Of course, chris2be8 is on the case, so you can coordinate with him.

Thanks, I will experiment a little with this, but only to learn about it. I won't be running anything heavily, for the aforementioned reason.