How many candidates have been sieved already? PRPnet says up to 280000 for factorials and 3200000 for primorials. It'll probably be half a year or more until this is reached for both projects. Or are there more candidates sieved but not prepared as tasks yet?

If not, what will be done when the limit is reached? Unless the project is abandoned sieving will be required. rogue said it's possible to modify mfsieve to work with P < 2^62 instead of the current 2^52 limit.

Are there any plans yet?
____________
1281979 * 2^485014 + 1 is prime ... no further hits up to: n = 5,700,000

How many candidates have been sieved already? PRPnet says up to 280000 for factorials and 3200000 for primorials. It'll probably be half a year or more until this is reached for both projects. Or are there more candidates sieved but not prepared as tasks yet?

If not, what will be done when the limit is reached? Unless the project is abandoned sieving will be required. rogue said it's possible to modify mfsieve to work with P < 2^62 instead of the current 2^52 limit.

Are there any plans yet?

I've just checked the sieve files: factorial is sieved to 7T and n=1M while primorial is sieved to 10T and n=10M. We're set for a while.

How many candidates have been sieved already? PRPnet says up to 280000 for factorials and 3200000 for primorials. It'll probably be half a year or more until this is reached for both projects. Or are there more candidates sieved but not prepared as tasks yet?

If not, what will be done when the limit is reached? Unless the project is abandoned sieving will be required. rogue said it's possible to modify mfsieve to work with P < 2^62 instead of the current 2^52 limit.

Are there any plans yet?

I've just checked the sieve files: factorial is sieved to 7T and n=1M while primorial is sieved to 10T and n=10M. We're set for a while.

Yves and I are looking into speed bumps for factorial sieving. Stay tuned.

Yves and I are looking into speed bumps for factorial sieving. Stay tuned.

Intriguing. Any hints on what to expect?

Okay, I have some preliminary numbers for mfsieve. On the CPU, the speed of the new code compared to AVX is a wash, but I have noticed that the AVX code sometimes misses factors. Note that it doesn't mean that found factors are invalid, just that some of the expected factors are not found.

The big boost is on the GPU. I discovered that mfsievecl hasn't worked in a long time. It just crashes. I actually don't know the last time it worked correctly. The version I am testing now works. It is about 28x faster than the CPU on my laptop. Specifically speaking comparing an Intel i7-8850H to an NVIDIA Quadro P3200. I haven't run any tests on other systems at this time.

Anyways I estimate a range of 1e9 to complete (up to n=1e7) in about 50 hours on this laptop.

That's an impressive boost.
____________
1281979 * 2^485014 + 1 is prime ... no further hits up to: n = 5,700,000

I think that I have worked through the bugs. I hadn't realized that the PRPNet project is testing to n=1e6, not n=1e7. I just ran a test with -p10001e9 -P10002e9 -n2e5 -N1e6 and it completed in around 30 minutes. This means that my GPU should be able to test a range of close to 5e10 in about 24 hours.

I estimate that at 1e13 that one candidate will be removed every 40 minutes, which is much faster than a PRP test. I don't know how deeply this project has been sieved.

Since sieving factorials/primorials quickly to large n seems to be possible now, would it be a good idea to move FPS/PPS to boinc?

Maybe in combination with a switch to multithreaded pfgw since the numbers are now at a size that at least on my computers memory begins to limit speed. Throughout is still higher when running single-threaded but efficiency drops strongly.
____________
1281979 * 2^485014 + 1 is prime ... no further hits up to: n = 5,700,000