Riesel even (k=14361,19401,20049) at n=1.2M base 2

Riesel odd (k=103947,154317,163503) at n=1.1M base 2 and continuing.

My progress on k=9519 ; New presieved files
 

Hi,

To-day, k = 9519 (Riesel base 2 even n's) is up to n = 1892296 no prime, continuing..

Also, I updated the 18 active files on [url]http://jpenne.free.fr/ConjRus/[/url]

They are now presieved up to 30T

Regards,
Jean

As stated in the "come join us" thread, I have added the Riesel base 2 1st conjecture and Sierp base 2 2nd conjecture even k's testing to this thread and am now testing the 3 remaining Sierp 2nd conjecture even k's. To make it official:

Sierp base 2 even k's 88996, 90646, and 101746 are at n=120K; no primes since n=100K; continuing to n=1M.

Sierp base 2 even k's 88996, 90646, and 101746 are at n=250K; nothing to report; continuing to n=1M.

I've also doublechecked all 78557<k<271129 to n=250K. No problems found. I may or may not continue this doublecheck to n=500K.

Sierp base 2 even k's 88996, 90646, and 101746 are at n=400K; nothing to report; continuing to n=1M.

I also decided to continue doublechecking all 78557<k<271129 to n=500K and am doing that in conjunction with the above 3 k's. No problems have been found to n=400K. For n>500K, I will continue with only the 3 even k's.

88996*2^408600+1 is prime

This finally eliminates one of the Sierp base 2 even k's. 2 still remain.

Sierp base 2 even k's 90646 and 101746 are at n=500K; 1 prime found for k=88996 arleady reported; continuing to n=1M.

I have now completed the doublecheck on the entire 2nd conjecture to n=500K. No problems were found. 33 k's are remaining. No more doublechecking will be done. Things should move quickly now. :-)

Sierp base 2 even k's are at n=600K; nothing to report; continuing.

Sierp base 2 even k's are at n=700K; nothing to report; continuing.

Sierp base 2 even k's are at n=800K; nothing to report; continuing.

Sierp base 2 even k's are at n=900K; nothing to report; continuing to n=1M. ETA is < 2 weeks.

At n=1M, I'd like to make a team drive out of these and the 2 Riesel base 2 even k's for n=1M-2.5M. The Riesel k's were sieved to what the optimum depth was long ago but much efficiency will be gained by sieving all 4 k's together after catching up the Sierp k's.

Releasing 2 even-k values (k=351134 and 478214) at n=1.04M.
Sieve file with ~18000 pairs up to n=2.5M (p=5T) available.

Reserving Riesel even-k k=351134 & 478214 and Sierp even-k 90646 & 101746 for n=1M-2.5M for team drive #6.

Sierp base 2 even k's 90646 & 101746 are complete to n=1M; nothing to report; released to the future team drive mentioned in the last post.

Releasing k=9519 ; Reserving k = 60357
 

Hi,

Riesel even n's :

I tested k = 9519 up to n = 2110696 base 2 ; no prime... I release it for now!

Sierpinski odd n's :

I am reserving again k = 60357 from n = 1049415 base 2

Regards,
Jean

Hi guys,

Kasten has agreed to release his reserved R2 even/odd-n k's, so the only ones we will be leaving out for the next PRPnet mini drive are those already at 2M, plus S2 odd-n k=60357 which Jean Penne reserved just yesterday. Thus we will be testing:

R2 even-n: k=14361, 19401, and 20049 from n=1.2M-2M
R2 odd-n: k=103947, 154317, and 163503 from n=1.1M-2M; 148323 from n=1.203M-2M; and 155877 from n=1.5726M-2M
S2 odd-n: k=53133 from n=1.128M-2M; 84363 from n=1.055M-2M; and 85287 from n=1.6442M-2M

We will be using the sieve files Jean Penne has posted at [URL]http://jpenne.free.fr/ConjRus/[/URL], all of which should be sufficiently well-sieved for this n-range.

Max :smile:

[QUOTE=gd_barnes;243451]Reserving Riesel even-k k=351134 & 478214 and Sierp even-k 90646 & 101746 for n=1M-2.5M for team drive #6.[/QUOTE]

Instead of creating a new drive, the even k's were added to the PRPnet mini drive along with the even-n & odd-n k's.

Sieve files updated ; k=60357 status
 

Hi,

I updated today all the active files in [url]http://jpenne.free.fr/ConjRus/[/url]
They are now sieved up to 50T, and I am stopping the sieve here...

Sierpinski odd n's : k = 60357 is now up to n = 1264731, no prime, continuing...

May I restart k = 84363 now ? I have one CPU available for that...

Regards,
Jean

[QUOTE=Jean Penné;260137]Hi,

I updated today all the active files in [URL]http://jpenne.free.fr/ConjRus/[/URL]
They are now sieved up to 50T, and I am stopping the sieve here...

Sierpinski odd n's : k = 60357 is now up to n = 1264731, no prime, continuing...

May I restart k = 84363 now ? I have one CPU available for that...

Regards,
Jean[/QUOTE]

Jean,

Thanks for the status. As for k=84363, all other k's besides your k=60357 for the Riesel/Sierp odd/even-n conjectures are reserved by our PRPnet mini-drive. We have reached at least n=~1.35M with all of them. It would work best if you set up the PRPnet client on your machine and contributed to the drive. See the PRPnet mini drive for details.

Max,

With the more deeply sieved files for these, I might suggest deleting all candidates n>1.4M from the PRPnet server (excluding the even k's that I sieved) and replacing them with the better sieved files.


Gary

[QUOTE=gd_barnes;260310]With the more deeply sieved files for these, I might suggest deleting all candidates n>1.4M from the PRPnet server (excluding the even k's that I sieved) and replacing them with the better sieved files.[/QUOTE]

That shouldn't be necessary. If Jean can provide Max with the factors (using the format produced by srsieve and its brethren), then he can use the prpadmin tool to remove untested candidates.

[QUOTE=gd_barnes;260310]
Max,

With the more deeply sieved files for these, I might suggest deleting all candidates n>1.4M from the PRPnet server (excluding the even k's that I sieved) and replacing them with the better sieved files.


Gary[/QUOTE]
Okay, I'll do that in a little over a week when my schedule clears up. (Since all the start and end n-levels will be the same this time, it will be a lot easier than the initial loading job; but it will still take a bit of time so I won't be able to do it right away.) At the current processing rate, the n<1.4M work should last until then.
[QUOTE=rogue;260314]That shouldn't be necessary. If Jean can provide Max with the factors (using the format produced by srsieve and its brethren), then he can use the prpadmin tool to remove untested candidates.[/QUOTE]
Hmm...the tricky thing with that is that I'll need to have a master sieve file on hand to match up with the results in later processing. I'm thus going to need to put together a new master sieve file for n=1.4M-2M one way or another, so I may as well just delete the existing candidates and re-load the new file with prpadmin. As mentioned above, this time I will have just one consolidated master file for all k's on n=1.4M-2M, rather than the smattering of individual files I had originally (due to the different testing depths), so that will be the easy part. :smile:

[QUOTE=mdettweiler;260324]Okay, I'll do that in a little over a week when my schedule clears up. (Since all the start and end n-levels will be the same this time, it will be a lot easier than the initial loading job; but it will still take a bit of time so I won't be able to do it right away.) At the current processing rate, the n<1.4M work should last until then.[/QUOTE]


I'd kindly request that you put that on a physical "to do" list please so that it is not forgotten. I'm still waiting on all of the results from the various private/secret severs that I asked for several weeks ago. Can you put that on your list too?

So when is your college graduation ceremony? My son's high school graduation is on May 22nd.

[QUOTE=gd_barnes;260345]I'd kindly request that you put that on a physical "to do" list please so that it is not forgotten. I'm still waiting on all of the results from the various private/secret severs that I asked for several weeks ago. Can you put that on your list too?

So when is your college graduation ceremony? My son's high school graduation is on May 22nd.[/QUOTE]
Yes, all of those items (including this one) are on my hard "to do" list. I will begin going through them as quickly as I can when a few big things are out of the way.

As for the second one, ah, you know my answer whenever you try to guess my profession...remember, I can't talk about it. :razz: (I'm a spy! :cmd:)

:missingteeth:

[QUOTE=mdettweiler;260358]
As for the second one, ah, you know my answer whenever you try to guess my profession...remember, I can't talk about it. :razz: (I'm a spy! :cmd:)

:missingteeth:[/QUOTE]

I didn't ask anything about your profession. I asked when your college graduation is. :smile:

[QUOTE=gd_barnes;260404]I didn't ask anything about your profession. I asked when your college graduation is. :smile:[/QUOTE]
Ah, but what makes you think I have one coming up? :smile:

[size=1]Also, I intended "profession" to include student status as well.[/size]

[QUOTE=mdettweiler;260421]Ah, but what makes you think I have one coming up? :smile:

[SIZE=1]Also, I intended "profession" to include student status as well.[/SIZE][/QUOTE]

Easy peasy.

You've been very busy this time of year the last two years and are excessively (more than usual) busy this year indicating study and work for finals with this being your final/senior year. Also you're planning on moving late summer and are in the market for a new laptop for your new place with little room for such at your current place indicative of living with parents/brother/friends at the moment. Also you're available at odd hours like yours truly indicative of a student, having your own business, retirement, or just simply a slacker who doesn't work much (lol). You don't strike me as a slacker or of near retirement age. The only other reasonable possibility besides being a student is having your own business but other things you've said about your situation (that you might not want me to mention here) all but rule that out.

I think we need to set up a poll: What is Max's current life situation? rofl

:smile:

[QUOTE=gd_barnes;260451]Easy peasy.

You've been very busy this time of year the last two years and are excessively (more than usual) busy this year indicating study and work for finals with this being your final/senior year. Also you're planning on moving late summer and are in the market for a new laptop for your new place with little room for such at your current place indicative of living with parents/brother/friends at the moment. Also you're available at odd hours like yours truly indicative of a student, having your own business, retirement, or just simply a slacker who doesn't work much (lol). You don't strike me as a slacker or of near retirement age. The only other reasonable possibility besides being a student is having your own business but other things you've said about your situation (that you might not want me to mention here) all but rule that out.

I think we need to set up a poll: What is Max's current life situation? rofl

:smile:[/QUOTE]
Right...though I could just as easily be a college professor (tied to the same schedule as students) planning to retire after this semester and move to a retirement home with limited space (hence the laptop). :grin:

Though you did sort of already cover that contingency in the above analysis...

But hey, don't let me stop you from theorizing--it's funny to see what kinds of guesses you've come up with. :smile:

[size=1]P.S.: should this discussion be split off into another thread? I seem to recall we have a place for these kinds of off-topic discussions somewhere...[/size]

[QUOTE=gd_barnes;260310]Jean,

Thanks for the status. As for k=84363, all other k's besides your k=60357 for the Riesel/Sierp odd/even-n conjectures are reserved by our PRPnet mini-drive. We have reached at least n=~1.35M with all of them. It would work best if you set up the PRPnet client on your machine and contributed to the drive. See the PRPnet mini drive for details.

Max,

With the more deeply sieved files for these, I might suggest deleting all candidates n>1.4M from the PRPnet server (excluding the even k's that I sieved) and replacing them with the better sieved files.


Gary[/QUOTE]


Gary,
I agree to release all my reservations (k = 84363 and, even, k = 60357) and contribute to the drive(s), but I cannot find any info to know how to do that, so, would you help me ?

Thank you by advance,
Jean

I moved all of the recent posts that were more related to PRPnet info. and questions to the PRPnet mini drive thread at [URL]http://www.mersenneforum.org/showthread.php?t=12225[/URL].

[QUOTE=Jean Penné;250858]
I tested k = 9519 up to n = 2110696 base 2 ; no prime... I release it for now!
[/QUOTE]

I'd like to pick up this one. Is there any benefit in sieving / testing speed when converting to base 2? The sieve files are base 4.

[QUOTE=Puzzle-Peter;262896]I'd like to pick up this one. Is there any benefit in sieving / testing speed when converting to base 2? The sieve files are base 4.[/QUOTE]
Short answer: testing yes, sieving no. LLR and PFGW both automatically convert to base 2 whenever possible for this reason.

Long answer:
There is a small advantage in testing speed (it used to be a huge advantage, but since about two years ago when PFGW and LLR were upgraded to perform more efficiently on non-base-2 numbers; now other bases are still a little slower than base 2, but not hugely so). There is, however, no difference when sieving; the srsieves handle all bases with equal aplomb, such that sieving n=500K-1M base 4 is identical speed-wise to sieving 1M-2M base 2.

Note that LLR automatically converts numbers with power-of-2 bases to base 2 when testing. That is, if you tell it to test 3*4^1000000-1, it will actually test 3*2^2000000-1. All screen and results file output will give the base 2 number, to avoid ambiguity as to whether the residual should be that of a PRP or LLR test (they are not cross-compatible). I'm pretty sure that PFGW is able to do a similar conversion and take advantage of base 2 speeds; though since it does a PRP test for everything, including base 2, it will produce the same (PRP) residual either way.

If you're using a PRPnet server to run such numbers, the server will handle the numbers in the original base; the client knows how to handle base conversions, so it will give LLR the number in base 2 (this is a little redundant since LLR can do the conversion internally, but it helps to avoid confusion on the client's part by ensuring that LLR gives a result for the same number it was given). The server will then be sent back to the server with the original base. Note that this does introduce a slight ambiguity in that there is nothing on the server end to distinguish that the residuals are LLR, not PRP as would normally be the case for non-base-2 numbers; for this reason, I personally prefer to pre-convert all such numbers to base 2 with a script of my own before loading them into a server. That's what I've done, for instance, with the work currently in port 1300. (In this case those [I]are[/I] actually base 2 numbers, but were sieved in base 4 because that's an easy way to make srsieve include just even or odd n's. For even n's you use the same k in base 4, for odd n's you use 2*k in base 4.)

Thanks!

Jean's last pair was [FONT=monospace][/FONT]9519 1055348 (base 4 as in the sieve file on his page). So - just to make sure - for optimum speed, I discard this pair and all pairs lower than that, multiply all the exponents by 2 and change header to base 2, right?

Reserving to the boredom threshold ;-)

[QUOTE=Puzzle-Peter;262896]I'd like to pick up this one. Is there any benefit in sieving / testing speed when converting to base 2? The sieve files are base 4.[/QUOTE]

Knocking this one out would be nice. It is the only k that I am aware of at CRUS that is remaining for 4 different bases: 2 even-n, 4, 16, & 256.

[QUOTE=Puzzle-Peter;262901]Thanks!

Jean's last pair was [FONT=monospace][/FONT]9519 1055348 (base 4 as in the sieve file on his page). So - just to make sure - for optimum speed, I discard this pair and all pairs lower than that, multiply all the exponents by 2 and change header to base 2, right?

Reserving to the boredom threshold ;-)[/QUOTE]

Good luck with this k !!
Jean

[QUOTE=Puzzle-Peter;262901]Thanks!

Jean's last pair was 9519 1055348 (base 4 as in the sieve file on his page). So - just to make sure - for optimum speed, I discard this pair and all pairs lower than that, multiply all the exponents by 2 and change header to base 2, right?

Reserving to the boredom threshold ;-)[/QUOTE]

That is correct.

Status update
 

9519*2^n-1 has reached n=3M, no primes

Sorry, I forgot to mention that I am continuing k=9519 :smile:

Restarting the sieves!
 

Hi,

If I am not wrong, all n's <= 2M base two have now been tested for this project. So, the corresponding minidrive has been stopped...

Nevertheless, I hope the proving of the four Liskovets-Gallot conjectures has not been abandoned, so I am restarting the sieving of the 14 files for which no prime has yet been found... Presently, they are sieved up to 50 Tera, and will be updated from time to time on this personal page :

[url]http://jpenne.free.fr/ConjRus/[/url]

Please, let me know if it may be useful...

- Note that the option -oRising_n's=1 is available on the development version of LLR 3.8.6, so, you have not to worry about small n's dropped while using an updated sieved file! (indeed, you have then also to set -oLast_Processed_n=<number> the first time).

Best Regards,
Jean

P.S. I am not sure the Liskovets-Gallot page or RPS is up to date, because it still shows reservations for n's < 2M!

[QUOTE=Jean Penné;279568]Nevertheless, I hope the proving of the four Liskovets-Gallot conjectures has not been abandoned, so I am restarting the sieving of the 14 files for which no prime has yet been found... Presently, they are sieved up to 50 Tera, and will be updated from time to time on this personal page :
[/QUOTE]

Jean, I am working on k=9519 and I sieved it much higher than 50T. So don't bother with that one!

Peter

[QUOTE=Jean Penné;279568]I am not sure the Liskovets-Gallot page or RPS is up to date, because it still shows reservations for n's < 2M![/QUOTE]

Karsten,

Can you bring the Liskovets-Gallot page up to date? Thanks.


Gary

[QUOTE=Puzzle-Peter;279592]Jean, I am working on k=9519 and I sieved it much higher than 50T. So don't bother with that one!

Peter[/QUOTE]

Thanks for this info, I will delete it from my sieve!
Jean

[QUOTE=Puzzle-Peter;279592]Jean, I am working on k=9519 and I sieved it much higher than 50T. So don't bother with that one!

Peter[/QUOTE]

I think I better get a clarification for both Jean and me so that nothing gets missed. Are you sieving his entire file higher? I believe his file includes all n<=16.6M or something like that. I ask because he includes the entire file in his sieving.


Gary

[QUOTE=gd_barnes;279687]I think I better get a clarification for both Jean and me so that nothing gets missed. Are you sieving his entire file higher? I believe his file includes all n<=16.6M or something like that. I ask because he includes the entire file in his sieving.


Gary[/QUOTE]

I took the file for k=9519, P=50T from Jean's page and continued sieving it. So it is only this one k I am sieving and testing.

[QUOTE=Puzzle-Peter;279733]I took the file for k=9519, P=50T from Jean's page and continued sieving it. So it is only this one k I am sieving and testing.[/QUOTE]

What I meant is: Are you sieving ALL of k=9519 and not just say...n=2M-5M? It sounds like you are so that is good.

[QUOTE=gd_barnes;279734]What I meant is: Are you sieving ALL of k=9519 and not just say...n=2M-5M? It sounds like you are so that is good.[/QUOTE]

Yes, I am.

[QUOTE=gd_barnes;279595]Karsten, Can you bring the Liskovets-Gallot page up to date? Thanks.
[/QUOTE]

Done.

k=9519, 3M<n<4M tested, no prime.

Continuing to n=5M...

R2, k=9519 tested 4M<n<5M, no prime. Continuing...

[QUOTE]R2, k=9519 tested 4M<n<5M, no prime. Continuing...[/QUOTE]

Obviously a man on a mission. You go guy!!!!!

:batalov:

[QUOTE=MyDogBuster;290340]Obviously a man on a mission. You go guy!!!!!
[/QUOTE]

Well, I do intend to take this to the end of the sieve file if necessary...

[QUOTE=Puzzle-Peter;290471]Well, I do intend to take this to the end of the sieve file if necessary...[/QUOTE]

How many tests are in the range you have reserved?

[QUOTE=rogue;290483]How many tests are in the range you have reserved?[/QUOTE]

~38k candidates left

k=9519 tested 5M to 6M, nothing. Continuing...

I think that before anyone takes on one of these k they should consider sieving with ppsieve. Jean's files are only sieved to 5e13. I think that 1e15 should be attainable with ppsieve.

Gary, could you edit the first post of this thread to list the remaining k for this conjecture and their test limits along with a link to the pre-sieved files for them? I know that one could find this information through the reservation pages, but one has to look at multiple places to collect that information.

[QUOTE=rogue;313766]I think that before anyone takes on one of these k they should consider sieving with ppsieve. Jean's files are only sieved to 5e13. I think that 1e15 should be attainable with ppsieve.

Gary, could you edit the first post of this thread to list the remaining k for this conjecture and their test limits along with a link to the pre-sieved files for them? I know that one could find this information through the reservation pages, but one has to look at multiple places to collect that information.[/QUOTE]

Maybe later next week. I'm out of town now with little time for misc. admin stuff.

I thought ppsieve slowed down in relation to the maximum k. This make it useless unless you are sieving consecutive ks starting very low.
Do you mean withdraw the correct tests from primegrid's base 2 sieve file? AFAIK their files only go upto k=10k.

[QUOTE=henryzz;313824]I thought ppsieve slowed down in relation to the maximum k. This make it useless unless you are sieving consecutive ks starting very low.
Do you mean withdraw the correct tests from primegrid's base 2 sieve file? AFAIK their files only go upto k=10k.[/QUOTE]

I don't know. One would have to compare ppsieve with a single k to srsieve. The problem is that Jean's files are base 4, not base 2. One would have to convert to base 2 before testing with ppsieve.

I took what I could find and put this table together. I included PSP and ESP, which you can remove if desired. If you use this as the first post, you might want to clean up the thread a little.

[code]
sequence search type search limit reservation sieve data
9519*2^n-1 riesel even-n 6,000,000 Puzzle-Peter [url="http://jpenne.free.fr/ConjRus/t17_b4_k9519.npg"]n to 16M, p to 50T[/url]
14361*2^n-1 riesel even-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k14361.npg"]n to 16M, p to 50T[/url]
19401*2^n-1 riesel even-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k19401.npg"]n to 16M, p to 50T[/url]

39687*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k79374.npg"]n to 16M, p to 50T[/url]
103947*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k207894.npg"]n to 16M, p to 50T[/url]
154317*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k344334.npg"]n to 16M, p to 50T[/url]
155877*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k311754.npg"]n to 16M, p to 50T[/url]
163503*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k327006.npg"]n to 16M, p to 50T[/url]

351134*2^n-1 riesel even-k 2,000,000
478214*2^n-1 riesel even-k 2,000,000


23451*2^n+1 sierpinski even-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k23451.npg"]n to 16M, p to 50T[/url]
60849*2^n+1 sierpinski even-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k60849.npg"]n to 16M, p to 50T[/url]

9267*2^n+1 sierpinski odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k18534.npg"]n to 16M, p to 50T[/url]
32247*2^n+1 sierpinski odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k64494.npg"]n to 16M, p to 50T[/url]
53133*2^n+1 sierpinski odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k106266.npg"]n to 16M, p to 50T[/url]
84363*2^n+1 sierpinski odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k168726.npg"]n to 16M, p to 50T[/url]

90646*2^n+1 sierpinski even-k 2,000,000
101746*2^n+1 sierpinski even-k 2,000,000

79309*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
79817*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
152267*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
156511*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
168451*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
222113*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
225931*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
237019*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]

91549*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
94373*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
99739*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
131179*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
161041*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
163187*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
193997*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
198677*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
200749*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
202705*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
209611*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
211195*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
227723*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
229673*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
238411*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
[/code]

Use this [url]http://www.primegrid.com/stats_psp_llr.php[/url]

Not this [url]http://www.primegrid.com/stats_psp_llr.php/[/url]

Lennart

[QUOTE=Lennart;314030]Use this [url]http://www.primegrid.com/stats_psp_llr.php[/url]

Not this [url]http://www.primegrid.com/stats_psp_llr.php/[/url]

Lennart[/QUOTE]

Gary can edit that.

Is something wrong with PRPNet port 13005? It isn't responding.

[QUOTE=rogue;314033]Gary can edit that.

Is something wrong with PRPNet port 13005? It isn't responding.[/QUOTE]

Strange... It is working here...


Lennart

[QUOTE=Lennart;314034]Strange... It is working here...

Lennart[/QUOTE]

Odd. It's working now. It wasn't working when I tried it earlier.

I'll have to look for precise data, but I think I sieved my range to p=500T or even higher.

Presieved files updated
 

Hi,

I updated today my 13 remaining active presieved files ; They are now sieved up to 65T.

Please, let me know if continuing to sieve these files further using sr2sieve is still useful...

Best Regards,
Jean

[QUOTE=Jean Penné;314083]I updated today my 13 remaining active presieved files ; They are now sieved up to 65T.

Please, let me know if continuing to sieve these files further using sr2sieve is still useful...[/QUOTE]

Thanks Jean.

Have you done any testing with ppsieve to see if it is any faster than sr2sieve? Not that ppsieve might not be very fast for the larger k.

PrimeGrid has probably sieved 9519*2^n-1 and 9267*2^n+1 to well over 3T by this time. It might take a while to pull out the k/n combinations with factors, but it would probably save time and nobody would need to sieve them any deeper.

[QUOTE=rogue;314089]Thanks Jean.

Have you done any testing with ppsieve to see if it is any faster than sr2sieve? Not that ppsieve might not be very fast for the larger k.

PrimeGrid has probably sieved 9519*2^n-1 and 9267*2^n+1 to well over 3T by this time. It might take a while to pull out the k/n combinations with factors, but it would probably save time and nobody would need to sieve them any deeper.[/QUOTE]

I did not use ppsieve until now... Is it possible to sieve several k's simultaneously, like with sr2sieve, and, if yes, how to do that?
Also, I am still sieving 9267*2^n+1, but not 9519*2^n-1

Regards,
Jean

[QUOTE=Jean Penné;314153]I did not use ppsieve until now... Is it possible to sieve several k's simultaneously, like with sr2sieve, and, if yes, how to do that?
Also, I am still sieving 9267*2^n+1, but not 9519*2^n-1[/QUOTE]

Yes, you can sieve multiple k's at once, but ppsieve will sieve all odd k between the upper and lower bound of your input file. ppsieve is limited to base 2, so your files would need to be modified to base 2 before running them with ppsieve. You could probably modify ppsieve to only log factors for the k that you care about or just pull them out of the factors file that is created.

I've used a small to base-2 converted abcd-format file of the npg-files (attached) and run ppsieve with:

[code]
ppsieve-x86-windows.exe -p10000G -P10020G -isr_2.abcd -t4 -q -R -ffac.txt
[/code]

-p starting p-value
-P ending p-value
-i input-file
-t4 4 threads
-q quiet
-R Riesel-sieve format
-f factors-file

Needs much mem, so I can't test the whole file.

To convert from base-4 to base-2 use (g)awk:

[code]
gawk "{print $1\" \"$2*2}" all4.txt >all2.txt
[/code]

where all4.txt contains all base-4 pairs in npg-format without the header line.

ppsieve for several k's
 

Hi Mark and Karsten,

Many thanks for your help! Presently, my 4-core Linux machine is totally busy, so I will continue some time with sr2sieve...

Regards,
Jean

From what I have read, I would not recommend ppsieve for sieving the even-k/even-n/odd-n effort. We can use the Primegrid ppsieve files for the two k's < 10000.

[QUOTE=gd_barnes;314185]From what I have read, I would not recommend ppsieve for sieving the even-k/even-n/odd-n effort. We can use the Primegrid ppsieve files for the two k's < 10000.[/QUOTE]

The main challenge is pulling all of the data together to find the remaining n to be tested, but it would be worth the effort and any sieving for those k could be suspended.

[QUOTE=kar_bon;314168]I've used a small to base-2 converted abcd-format file of the npg-files (attached) and run ppsieve with:

[code]
ppsieve-x86-windows.exe -p10000G -P10020G -isr_2.abcd -t4 -q -R -ffac.txt
[/code]

-p starting p-value
-P ending p-value
-i input-file
-t4 4 threads
-q quiet
-R Riesel-sieve format
-f factors-file

Needs much mem, so I can't test the whole file.

To convert from base-4 to base-2 use (g)awk:

[code]
gawk "{print $1\" \"$2*2}" all4.txt >all2.txt
[/code]

where all4.txt contains all base-4 pairs in npg-format without the header line.[/QUOTE]

What sieving rate did you get and on what GPU?

[QUOTE=rogue;314193]The main challenge is pulling all of the data together to find the remaining n to be tested, but it would be worth the effort and any sieving for those k could be suspended.[/QUOTE]

You lost me there. If you can figure out how to pull it all together and sieve it in a more efficient fashion using ppsieve, be my guest. Note that we would only be interested in the even-k, even-n, and odd-n k's (18 k's total). All of the other k's that you showed in your original post that include Prime Sierpinski and Extended Sierpinski k's would not be worked on here.

[QUOTE=gd_barnes;314198]You lost me there. If you can figure out how to pull it all together and sieve it in a more efficient fashion using ppsieve, be my guest. Note that we would only be interested in the even-k, even-n, and odd-n k's (18 k's total). All of the other k's that you showed in your original post that include Prime Sierpinski and Extended Sierpinski k's would not be worked on here.[/QUOTE]

I'm referring only to the k < 10000 in post 234. The factors for n < 9M are available, but one has to grab all of the factor files, then use srfile to eliminate candidates from the abcd file.

Sierpinski even n's
 

Hi,

Please, would you again reserve k=23451 for me ; I want to continue to test it starting now from n=2,000,000 base two.

Thanks by advance and Best Regards,

Jean

[QUOTE=gd_barnes;314185]From what I have read, I would not recommend ppsieve for sieving the even-k/even-n/odd-n effort. We can use the Primegrid ppsieve files for the two k's < 10000.[/QUOTE]
I would like to reserve 9267*2^n+1. Where I can find sieve file from Primegrid for this k?

[QUOTE=unconnected;314806]I would like to reserve 9267*2^n+1. Where I can find sieve file from Primegrid for this k?[/QUOTE]

It isn't quite that easy. You will need to get the abcd file then get all of the factor files. You should start [URL="http://www.primesearchteam.com"]here[/URL], but Lennart might help you achieve your goal faster.

[QUOTE=rogue;314161]Yes, you can sieve multiple k's at once, but ppsieve will sieve all odd k between the upper and lower bound of your input file. ppsieve is limited to base 2, so your files would need to be modified to base 2 before running them with ppsieve. You could probably modify ppsieve to only log factors for the k that you care about or just pull them out of the factors file that is created.[/QUOTE]


I can get the file but it is with all n! not only odd n.

Also need start n end n.

Lennart

[QUOTE=Lennart;314822]I can get the file but it is with all n! not only odd n.

Also need start n end n.[/QUOTE]

I had forgotten that, but that should be easily addressed with an editor.

n from 2M to whatever limit PrimeGrid is sieving. Posting a file here would be fine. I assume that unconnected won't work on it indefinitely. In other words, if someone else decides to extend, they will have a good place to start.

[QUOTE=rogue;314864]I had forgotten that, but that should be easily addressed with an editor.

n from 2M to whatever limit PrimeGrid is sieving. Posting a file here would be fine. I assume that unconnected won't work on it indefinitely. In other words, if someone else decides to extend, they will have a good place to start.[/QUOTE]

I just thought about the search. In PG we search for that k right now. We will stop at 1 030 000 and move to lower k's with higher n's.

I could load that k up to 2M maybe 3M and have it done a bit faster.

Thoughts ?

Lennart


PS: I need a answer today because we will hit 1 030 000 tonight :)

[QUOTE=Lennart;314871]I just thought about the search. In PG we search for that k right now. We will stop at 1 030 000 and move to lower k's with higher n's.

I could load that k up to 2M maybe 3M and have it done a bit faster.

Thoughts ?

Lennart


PS: I need a answer today because we will hit 1 030 000 tonight :)[/QUOTE]

That is a question for Gary.

I would post n=2M-5M whenever is convenient for you.

9267
 

Here is the first

Lennart

I've removed all even-n candidates from sieve file, so only 1101 tests remain.

k=9267 3M-4M

Lennart

I'm not sure I really get this. Does this mean we and PG are both testing the same candidates? Or did PG some sieving on these ranges but no LLR testing?

I am doing 9519*2^n-1 at n~7.5M (leading edge) and I would hate to hear I am duplicating work that has already bben done (or that somebody may duplicate my work).

[QUOTE=Puzzle-Peter;315091]I'm not sure I really get this. Does this mean we and PG are both testing the same candidates? Or did PG some sieving on these ranges but no LLR testing?

I am doing 9519*2^n-1 at n~7.5M (leading edge) and I would hate to hear I am duplicating work that has already bben done (or that somebody may duplicate my work).[/QUOTE]

There is no duplication of work. PrimeGrid is doing an extremely deep sieve for all k's < 10000 base 2 on both the Riesel and Sierp sides. I think they are sieving all n<=6M but may also be doing some n>6M.

As for testing, they are testing all (most) Sierp k<10000 base 2. (They are not testing Riesel.) In the last month, they passed n=1M. So no duplication.

If they are sieving n>6M It's possible that you may be able to benefit somewhat from their sieve if they've sieved that high.

Lennart could probably elaborate more about this.

[QUOTE=Puzzle-Peter;315091]I'm not sure I really get this. Does this mean we and PG are both testing the same candidates? Or did PG some sieving on these ranges but no LLR testing?

I am doing 9519*2^n-1 at n~7.5M (leading edge) and I would hate to hear I am duplicating work that has already bben done (or that somebody may duplicate my work).[/QUOTE]

PrimeGrid intends to test all Proth (+1) numbers for k < 10000. Their leading edge for testing is at about n=1M for the k that this search cares about.

What is key is that since PrimeGrid will be testing those k, they need to sieve them in advance. By using ppsieve and a coordinated effort, they are able to sieve much deeper and faster than any individual at CRUS.

Since PrimeGrid won't get to n=2M anytime soon for k=9267 (+1) and as they are sieving to n=9M (IIRC), we can use their sieve data to save our project from duplicating that work.

As I understand it, PrimeGrid is sieving both Proth and Riesel forms since the cost is minimal to sieve them concurrently. They can then feed their results to NPLB for testing Riesel (-1) numbers for k < 10000. This last statement could be wrong, so I'll leave that to someone else to correct me. If my statement is correct, then their sieve data could be used for k=9519 (-1), thus saving you any effort.

PrimeGrid is sieving both, Riesel and Proth sides from k = 3 to 9999.

Only LLRing the Proth side for k = 1201 to 9999.
(Note: LLR for k=5,7 to n=6M started 2 days ago).

Only some values LLRing on Riesel side: Riesel problem (55 k-values) and k=3.

Sieve files can be found:

rsp = Riesel Sieve Project:
for n = 1M to 4M [url=http://uwin.mine.nu/sieves/rsp/sievefile/]here[/url]
for n = 4M to 10M [url=http://home.comcast.net/~jimb_primegrid/rsp/]here[/url]

pps : Proth Prime Search:
for n = 1M to 4M [url=http://uwin.mine.nu/sieves/ppse/sievefiles/]here[/url]

[QUOTE=kar_bon;315147]PrimeGrid is sieving both, Riesel and Proth sides from k = 3 to 9999.

Only LLRing the Proth side for k = 1201 to 9999.
(Note: LLR for k=5,7 to n=6M started 2 days ago).

Only some values LLRing on Riesel side: Riesel problem (55 k-values) and k=3.

Sieve files can be found:

rsp = Riesel Sieve Project:
for n = 1M to 4M [URL="http://uwin.mine.nu/sieves/rsp/sievefile/"]here[/URL]
for n = 4M to 10M [URL="http://home.comcast.net/~jimb_primegrid/rsp/"]here[/URL]

pps : Proth Prime Search:
for n = 1M to 4M [URL="http://uwin.mine.nu/sieves/ppse/sievefiles/"]here[/URL][/QUOTE]

RSP -3M
RSP 3M-9M

PPS -3M

There are 3 sievefiles when we start in Boinc The first file was 0-3M and now we sieve 3M-6M next will be 6M-9M

We split them up to total of 9 files 1-1M 1M-2M 2M-3M ................................................................8M-9M

We manually sieve them to ¨1-2P before we sieve in Boinc. There we don't use any sievefile. We sieve datless.

6M-9M is now waiting to enter Boinc. It is now at 3.3P.

Lennart

OK, thanks for the clarification. So I could (and will) replace my candidates up to n=9M for k=9519 with the candidates from the PG sieve file. They have sieved much deeper than I did.

Be sure to remove the odd n from the PrimeGrid sieve file for Riesel k=9519.

[QUOTE=rogue;314009]I took what I could find and put this table together. I included PSP and ESP, which you can remove if desired. If you use this as the first post, you might want to clean up the thread a little.

[code]
sequence search type search limit reservation sieve data
9519*2^n-1 riesel even-n 6,000,000 Puzzle-Peter [url="http://jpenne.free.fr/ConjRus/t17_b4_k9519.npg"]n to 16M, p to 50T[/url]
14361*2^n-1 riesel even-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k14361.npg"]n to 16M, p to 50T[/url]
19401*2^n-1 riesel even-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k19401.npg"]n to 16M, p to 50T[/url]

39687*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k79374.npg"]n to 16M, p to 50T[/url]
103947*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k207894.npg"]n to 16M, p to 50T[/url]
154317*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k344334.npg"]n to 16M, p to 50T[/url]
155877*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k311754.npg"]n to 16M, p to 50T[/url]
163503*2^n-1 riesel odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t17_b4_k327006.npg"]n to 16M, p to 50T[/url]

351134*2^n-1 riesel even-k 2,000,000
478214*2^n-1 riesel even-k 2,000,000


23451*2^n+1 sierpinski even-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k23451.npg"]n to 16M, p to 50T[/url]
60849*2^n+1 sierpinski even-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k60849.npg"]n to 16M, p to 50T[/url]

9267*2^n+1 sierpinski odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k18534.npg"]n to 16M, p to 50T[/url]
32247*2^n+1 sierpinski odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k64494.npg"]n to 16M, p to 50T[/url]
53133*2^n+1 sierpinski odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k106266.npg"]n to 16M, p to 50T[/url]
84363*2^n+1 sierpinski odd-n 2,000,000 [url="http://jpenne.free.fr/ConjRus/t16_b4_k168726.npg"]n to 16M, p to 50T[/url]

90646*2^n+1 sierpinski even-k 2,000,000
101746*2^n+1 sierpinski even-k 2,000,000

79309*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
79817*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
152267*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
156511*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
168451*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
222113*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
225931*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]
237019*2^n+1 prime sierpinski 13,750,000 [url="http://primegrid.com/stats_psp_llr.php/"]PrimeGrid's PSP on BOINC[/url]

91549*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
94373*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
99739*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
131179*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
161041*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
163187*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
193997*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
198677*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
200749*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
202705*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
209611*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
211195*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
227723*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
229673*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
238411*2^n+1 extended sierp 2,700,000 [url="http://prpnet.mine.nu:13005/"]PrimeGrid's ESP on PRPNet[/url]
[/code][/QUOTE]

Gary, could you move this list to the first post of this thread? It will make it easier to find.

BTW, it appears that PrimeGrid has knocked down one of the ESP k. I don't know which k as it hasn't been published. They are verifying.

[QUOTE=rogue;315709]Gary, could you move this list to the first post of this thread? It will make it easier to find.

BTW, it appears that PrimeGrid has knocked down one of the ESP k. I don't know which k as it hasn't been published. They are verifying.[/QUOTE]

No, I'd rather not. It's just another thing for us CRUS admins to maintain and the PSP and ESP k's are not part of this project; they are just reflected on the pages. All needed information about all of the base 2 efforts can be found on the CRUS web pages including links to:
1. The Liskovets-Gallot sieve files (on the reservation pages).
2. Info. about the Liskovets-Gallot conjectures.
3. Info. about the Riesel base 2, SOB, PSP, and ESP projects.
4. The Riesel base 2, SOB, PSP, and ESP stats.

The ESP prime will be reflected shortly.

[QUOTE=gd_barnes;315736]No, I'd rather not. It's just another thing for us CRUS admins to maintain and the PSP and ESP k's are not part of this project; they are just reflected on the pages. All needed information about all of the base 2 efforts can be found on the CRUS web pages including links to:
1. The Liskovets-Gallot sieve files (on the reservation pages).
2. Info. about the Liskovets-Gallot conjectures.
3. Info. about the Riesel base 2, SOB, PSP, and ESP projects.
4. The Riesel base 2, SOB, PSP, and ESP stats.

The ESP prime will be reflected shortly.[/QUOTE]

What I like about what I posted was that it is a single list with relevant links. I had to go to multiple pages and follow multiple links to gather that summary of data. Imagine what someone would have to do if they want to continue with any base 2 work. If I were to change anything, I would modify the "search type" column to link to the project that describes the search in more detail. How is what I posted different than the first post in the single k or recommended bases threads?

[QUOTE=rogue;315837]What I like about what I posted was that it is a single list with relevant links. I had to go to multiple pages and follow multiple links to gather that summary of data. Imagine what someone would have to do if they want to continue with any base 2 work. If I were to change anything, I would modify the "search type" column to link to the project that describes the search in more detail. How is what I posted different than the first post in the single k or recommended bases threads?[/QUOTE]

I don't know what you mean by the search type column.

The difference is that the posts in the single k or recommended bases threads are a subset of bases on the project with specific conditions. You can't easily look at the pages and quickly see all of the 1k bases or bases that are kind of important to the project, i.e. recommended. Here, I would just be duplicating what is already on the pages. It would only require 1-2 extra clicks for a person to get to the sieve file that they needed. Also we don't need the info. about the ESP or PSP projects here. They are only shown on the pages for completeness about who is testing what parts of what bases.