What do you mean?
History section of any prime page?
There's only a date given (no time) and links to forum posts or found dates of the Top5000 page.

The history dates are handled like this:
- if a prime is in the Top5000, the found date is taken from there
- if this prime is also mentioned in this forum, the post # is given and builds a link of the date given from above not from the post (this can differ when user not posted or posted later)
- if the prime is only in a forum post, the date of this post is given

There's no need to keep any time and would makes it more difficult to manage.

You even do not have to update any prime you reserved several times in a day or two.
Consider:
- every edit will save the whole page, so keep several edits at once
- testing new a value, a reservation entry is needed
- every Top5000 prime should be inserted with a HistF entry
- update the value page after reaching n=1M or unreserved
- update further milestones like new primes

If you meant the "View history" of any page:
- I've no influence on the server time because it's hosted.

[QUOTE=kar_bon;541466]...History section of any prime page?
[/QUOTE]

Exactly. As you have no control, other than typo's, this can stand as is.

Some of the prime pages may not be showing up in the table. 10151 is not there, or I am missing it.

The table may eventually get so large that it might refuse to load for some. I am going to stop introducing new [I]k's[/I] and work some already there to higher [I]n[/I] values. There is a lot to choose from.

k=10151 wasn't showing up because the word "prime" in the page title was incorrectly capitalized. That word should be in all lowercase. I went ahead and moved the page to the correct title, and it shows up now in the table.

As for the table becoming too large, we may soon have to ditch the complete table and just use the table ranges derived from the old RPPDb.

The other option would to move the full table to a pdf, much like what is done [URL="https://www.rieselprime.de/ziki/2_Minus_Tables"]for the Cunningham tables[/URL]. The one downside is that editing it would be a bit harder for us who work on the tables.

[QUOTE=Happy5214;541649]k=10151 wasn't showing up because the word "prime" in the page title was incorrectly capitalized. That word should be in all lowercase. I went ahead and moved the page to the correct title, and it shows up now in the table.

As for the table becoming too large, we may soon have to ditch the complete table and just use the table ranges derived from the old RPPDb.[/QUOTE]

Thank you so much. Most kind. :smile:

The last time I tried to load the table, it took somewhere between 10 and 15 seconds to pull it all in. Some of this is due to bandwidth because of so many stuck at home.

I believe doing away with the table might be best. Each item in there has its own page with a link. Simply jump to the index pages. There are only two at the moment, I believe.

[QUOTE=storm5510;541699]Thank you so much. Most kind. :smile:

The last time I tried to load the table, it took somewhere between 10 and 15 seconds to pull it all in. Some of this is due to bandwidth because of so many stuck at home.

I believe doing away with the table might be best. Each item in there has its own page with a link. Simply jump to the index pages. There are only two at the moment, I believe.[/QUOTE]


The table is the most useful thing in the whole wiki. It allows visual analysis and is just beautiful to look at. The HTML for the list of all Riesel k's is 50KB. That's nothing, your average cat meme is more than that. I don't think removing useful content because your computer is slow or your network speed sucks is the best way.

First, the table with all Riesel values will be too much to keep, because looking at the RPPDb there will be much more values than now in the Wiki.

I can't say by now if the ranges for all k-values like now are a good choice or need to be changed later (the table for Leyland numbers with ~1500 values takes some seconds here).

Those tables are generated on the fly so it could take some time to create. Faster if they are in the cache already.
The page for k<300 will remain as is, for the other ranges I need more data to determine if they have to be shorten. So k<300 contains 150 values, for others ranges <10k there're 1000. It's a difference in timings.
There're several changes that could be done:
- create smaller ranges = categories
- create tables with less data to collect and display

I'm also considering on every Riesel prime page a navbox: links to the previous/next value, links to other ranges/tables, pages with raw data of every range for download/copy.

All k-values of any range (or all over) as PDF is an option for a download later, but this can't be updated immediately as any page edit is done.
I also plan a link/page to create a LLR result file of any k-value to copy/download for easy doublechecking (this could be done like for [url='https://www.rieselprime.de/ziki/Leyland_prime_P_csv']Leylands[/url]).

If I create more data with k-values the next weeks when k<300 is ready, we will see the behaviour.
The next days I can change some links and pages and split the whole k-value table into smaller/own tables first.
The Wiki handling and layout is still not complete yet and I know it's much work to do so this will take some time but there's a current data table with Riesel k<300 by now with more information on every other list I know and it grows.

My previous comment was actually distressed about the suggestion of removing the k<300 table. That table seems very well defined and grows slowly. On the other hand the table for 'all' k's is indeed a bit arbitrary. Even if it is just 50KB. Since it's easy to find Riesel primes, it's going to be impossible to catalogue them all, especially if n has no lower limit. I could generate primes for millions of k's with small n's and submit them to the wiki... that would be bad news. That's why the Prime Pages works - they have a dynamic limit for the size of the prime - that's the necessary 'well defined' rule for them. So maybe there's not much point for the 'all ks' table after all.

I've created a Navigation-Box for Riesel primes and inserted them to some pages which makes it easier to find those.
So far not all tables/links available and the all-Riesel-table is still available but not linked.
Please do not edit the navbox-template, perhaps there're other suggestions to insert.

I recommend protecting pages and templates like that navbox to technically prevent non-admins from editing them. It may not be absolutely necessary given the small number of users, but it's a good way to signal to people who don't regularly check this thread to not edit those pages.

I've restricted the namespace for templates editable only by admins, so this should do it.

[QUOTE=kar_bon;541709]...I'm also considering on every Riesel prime page a navbox: links to the previous/next value, links to other ranges/tables, pages with raw data of every range for download/copy...[/QUOTE]

You have done an excellent job on the makeover. It looks good. The above would be helpful. :smile:

The table/data for [url='https://www.rieselprime.de/ziki/Riesel_k%3D4000-6000']4000<k<4200[/url] is online now.
Due to the data spreadsheet given by Amphoria and the collecting posts of primes found by Riesel Prime Search this was an almost easy run to complete so far.

The one caveat about this database is that anyone with a password can edit [U]anything[/U]. I found an entry I did not make in one of my [I]k's[/I] which I was finishing up, [I]k[/I] = 10207. The entry is for [I]n[/I] = 980,083, which is prime. It was not in the list because I had not tested up to the next multiple of 100e3 above it. I stopped using "HistF" because of the length using it could add to the history. Running a large Nash[I] k[/I] would probably do this.

So, if anyone in authority decides to add to, remove from, or change, anything I have put up, please let me know so I will not think I am going insane. :loco:

So where do you see a problem here?

Sure every logged in user can edit any page, but as admin I have to mark as checked every edit, so any 'spam' will be spotted.

Any edit can be watched in the page history (see link 'View history' on top right of any page) and the edits and username is shown (for that k-value [url='https://www.rieselprime.de/z/index.php?title=Riesel_prime_10207&diff=prev&oldid=7582']here[/url]).

The 'page information' (left menu bottom) shows a page length of 616 bytes, so no serious worry about it.
For the history entries of such values see for example [url='https://www.rieselprime.de/ziki/Riesel_prime_337']k=337[/url]: by now there're 108 entries/lines of history and the page length is 5713 bytes, also no worry here.

If the history entries of such page will climb to say 100 kBytes, that history can be changed like this: create a text file (CSV formatted) and show those data in a table.
An example can be seen [url='https://www.rieselprime.de/ziki/Riesel_prime_small_bases_least_n']here[/url]: the data table is done from a saved file (~30 kByte) although the page itself is ~5 kByte.

The new entry for n=980053 of k=10207 contains also the source of your find, so the reference is given and more informative.
Any Top5000 prime will get a HistF entry, smaller ones can be listed only in the list, because the finder is mentioned in the reservation of the history.
So the prime for n=133 here is not worth a HistF entry, but the above is.

If there's any external (from the Wiki) reference available, that is a helpful information to be shown.

Keep in mind:
I see and have to mark reviewed any edit first, otherwise I can undo any change then.
If any registered user will do any spam/harm/damage he/she will be warned and/or banned!

As the person who added the HistF entry in question, I really don't see a problem here. I often do "drive-by" updates to the Prime-Wiki when I see updates posted in the RPS forum.

My personal opinion is that only Karsten can claim ownership of the Prime-Wiki pages, since he owns the wiki, and that any constructive edit to any page is fair game, regardless of reservation status.

[QUOTE=kar_bon;545199]So where do you see a problem here?

The new entry for n=980053 of k=10207 contains also the source of your find, so the reference is given and more informative.

Any Top5000 prime will get a HistF entry, smaller ones can be listed only in the list, because the finder is mentioned in the reservation of the history.
So the prime for n=133 here is not worth a HistF entry, but the above is.[/QUOTE]

I did not see this as a Top 5000 result because the 5,000th item in the list I looked at just minutes ago has 449,323 digits. The list goes to 5,768 items. I understand the contents, but not the relevance of having those there.

Where is the cutoff for a Top 5000 result, if not more digits than the 5,000th entry?

[QUOTE=storm5510;545250]I did not see this as a Top 5000 result because the 5,000th item in the list I looked at just minutes ago has 449,323 digits. The list goes to 5,768 items. I understand the contents, but not the relevance of having those there.

Where is the cutoff for a Top 5000 result, if not more digits than the 5,000th entry?[/QUOTE]

This is a list of the [URL="https://primes.utm.edu/top20/index.php"]top20s[/URL].

This gives the [URL="https://primes.utm.edu/top20/sizes.php"]thresholds[/URL].

[QUOTE=paulunderwood;545266]
This is a list of the [URL="https://primes.utm.edu/top20/index.php"]top20s[/URL].

This gives the [URL="https://primes.utm.edu/top20/sizes.php"]thresholds[/URL].[/QUOTE]

Interesting. Riesel must be mixed in somewhere. I do not see it specifically listed as such. Several different types use the Riesel form, k*2^n-1. :confused::blush:

Riesel type primes are not listed separately in the Top20, but Proth primes do.

To get into the Top5000 with a Riesel prime, the n-value has currently be >~1.5 M (a higher k-value makes only small difference).

The 'smallest' Riesel prime in the Top5000 is [url='https://primes.utm.edu/primes/page.php?id=116569']1287*2^1493088-1[/url] ranked 4993 with 449,468 digits, so only a few days to fall out of the Top5000 list.

[QUOTE=kar_bon;545299]Riesel type primes are not listed separately in the Top20, but Proth primes do.

To get into the Top5000 with a Riesel prime, the n-value has currently be >~1.5 M (a higher k-value makes only small difference).

The 'smallest' Riesel prime in the Top5000 is [URL="https://primes.utm.edu/primes/page.php?id=116569"]1287*2^1493088-1[/URL] ranked 4993 with 449,468 digits, so only a few days to fall out of the Top5000 list.[/QUOTE]

I saw Proth. There does not seem to be much interest in this type here, not that I have seen.

I have a link in my browser to the Top 5000 list, which is basically the same as the one quoted above. Just different pages on the same web site. I have always gone by the rule-of-thumb provided by the formula that calculates the number of digits in any Base 2 exponential form. Multiplying by 0.30103 gets it close enough. The bottom end would stay in the neighborhood of 450,000 digits. My result from earlier was 295,030 digits. Thus my confusion about why it was noted in the first place.

I have never tried to run an [I]n[/I] to 1,500,000. Most of the "high-horsepower" CPU guys do. I always felt it would take too much time. On the other had, I read a while back where someone here had been working on the same [I]k[/I] for 11 years, I believe it was. That would be something for an older computer sitting in a garage and only being looked at once in a great while. At my fairly advanced age, I would not consider trying such a thing.

[QUOTE=storm5510;545324]I saw Proth. There does not seem to be much interest in this type here, not that I have seen.

I have a link in my browser to the Top 5000 list, which is basically the same as the one quoted above. Just different pages on the same web site. I have always gone by the rule-of-thumb provided by the formula that calculates the number of digits in any Base 2 exponential form. Multiplying by 0.30103 gets it close enough. The bottom end would stay in the neighborhood of 450,000 digits. My result from earlier was 295,030 digits. Thus my confusion about why it was noted in the first place.

I have never tried to run an [I]n[/I] to 1,500,000. Most of the "high-horsepower" CPU guys do. I always felt it would take too much time. On the other had, I read a while back where someone here had been working on the same [I]k[/I] for 11 years, I believe it was. That would be something for an older computer sitting in a garage and only being looked at once in a great while. At my fairly advanced age, I would not consider trying such a thing.[/QUOTE]
"Riesel prime" is really an abuse of nomenclature, as most places outside of the Riesel prime-searching community don't really seem to recognize them as their own type, like Proth primes are.

Your reported prime is nowhere close to Top 5000-range, but since it was individually reported in a forum post, I felt it was worth including.

Just a guess, but I think you might be referring to Jean Penné's [I]k[/I]=138847, which he's tested to about [I]n[/I]=11.5M. He actually took that [I]k[/I] over around the start of 2015, and he's tested the entire range (including a double-check of the range below the second prime).

No, it was [url='https://www.rieselprime.de/ziki/Riesel_prime_25']Riesel k=25[/url] (see [url='https://www.mersenneforum.org/showpost.php?p=537956&postcount=1932']here[/url]).
Borys found his first prime of this k-value in 2006 and I don't think he used the same computer since then for his calculations. It's more about a passion in prime searching, because the second last prime was from 2008. This k is not that low weighted but the gap is quite big here.

[QUOTE=kar_bon;545362]No, it was [URL="https://www.rieselprime.de/ziki/Riesel_prime_25"]Riesel k=25[/URL] (see [URL="https://www.mersenneforum.org/showpost.php?p=537956&postcount=1932"]here[/URL]).
Borys found his first prime of this k-value in 2006 and I don't think he used the same computer since then for his calculations. It's more about a passion in prime searching, because the second last prime was from 2008. This k is not that low weighted but the gap is quite big here.[/QUOTE]

Wow! There is a lot of history with this one, but it is all spread out over time. Around two months just by taking a quick glance. That is passion, and dedication. :smile:

[QUOTE=Happy5214]"Riesel prime" is really an abuse of nomenclature, as most places outside of the Riesel prime-searching community don't really seem to recognize them as their own type, like Proth primes are.

Your reported prime is nowhere close to Top 5000-range, but since it was individually reported in a forum post, I felt it was worth including.[/QUOTE]

I will stick with the 450,000 digit floor and leave it go at that. Doing a reciprocal on the number of digits formula says this would be an [I]n[/I] of 1,494,867.

About the database: I would much rather pick up a [I]k[/I] which already exists and needs more attention rather than start a new one. 10673 was tested to [I]n[/I] = 25,000. I reserved it.

[QUOTE=kar_bon;545362]No, it was [url='https://www.rieselprime.de/ziki/Riesel_prime_25']Riesel k=25[/url] (see [url='https://www.mersenneforum.org/showpost.php?p=537956&postcount=1932']here[/url]).
Borys found his first prime of this k-value in 2006 and I don't think he used the same computer since then for his calculations. It's more about a passion in prime searching, because the second last prime was from 2008. This k is not that low weighted but the gap is quite big here.[/QUOTE]

Thanks for the correction.

LLR has gotten much faster from 2006 (when it only had SSE2 code) till now (with AVX2 and AVX-512 versions). For example, my laptop is 50% faster at LLR then my desktop, despite having only 60% of the desktop's clock frequency, because the laptop has the FMA3 FFT version and my desktop only has the SSE2 FFT code.

[QUOTE=storm5510;545386]About the database: I would much rather pick up a [I]k[/I] which already exists and needs more attention rather than start a new one. 10673 was tested to [I]n[/I] = 25,000. I reserved it.[/QUOTE]

If you've ever looked at my reservations, you'll find that almost all of my work involves filling in gaps in the old RPPDb. My primary foci right now are the RPS 9th and 10 Drive [I]k[/I]'s and Woodall and near-Woodall [I]k[/I]'s. I run them through PRPNet servers, though I only have one computer (the aforementioned laptop) currently working on them.

The 'problem' with RPS Drive 9 &10 is they started searching for n>400k, so the given max n-value is not correct in the Wiki for all those k-values yet.

In the bgeinning I decided not to include a parameter for the lowest n-value, because most of them are n=1 and not necessary at all. Otherwise there's always the remark paramter to fill in such missing range.

I think of two additions later:
- The Riesel template (and Proth also) can determine the highest found prime value. If this is higher than the given nMax value, put that k-value into an own category.
Example: k=69 : highest prime n=6838971, nMax=2416000

- Create the category and fill in this category entry for such k-values with smaller missing n-ranges by hand:
Example k=17369 from RPS Drive 10: entry on the "Riesel prime 17369" page added as
[[Category:Riesel prime missing range]]

The latter is done in the Wiki right now.

Many higher k-values in the RPPDb got missing n-ranges, because of twin search, SG search or even constant n-search.
The advantage of such category is to catch those help needed k-values easily.

When I'm ready with including all data for Riesel k<1002 I'm working on the drives of RPS and NPLB transferring data from my old pages.

[QUOTE=Happy5214]If you've ever looked at my reservations, you'll find that almost all of my work involves filling in gaps in the old RPPDb. My primary foci right now are the RPS 9th and 10 Drive [I]k[/I]'s and Woodall and near-Woodall [I]k[/I]'s. I run them through PRPNet servers, though I only have one computer (the aforementioned laptop) currently working on them. [/QUOTE]

I have only recently began looking at some of the assignments which individuals have. I found one which has 12. I thought I was being excessive with two, and on rare occasions, three.

[QUOTE=kar_bon]Example: k=69 : highest prime n=6838971, nMax=2416000[/QUOTE]

This particular [I]k[/I] has far larger primes than the highest [I]n[/I] value. Values of [I]n[/I] must not have been important back then.

I'm currently working on trying to speed up the generating of the prime tables for Riesel primes.

So I decided to extend a new parameter "RCount" to the [url='https://www.rieselprime.de/ziki/Template:Riesel_prime']Riesel prime template[/url].

If RCount is not given nothing changes in the handling.
If RCount is given, there're two options:
- RCount is the same as the automated counting -> no problem, everything ok
- RCount differs from counting -> Alert shown like the attachement

So please do always:
- Creating new k-values now have to contain this new parameter.
- Before saving any k-value use the "Show preview" button, which will show the alert before saving and the count, so you don't need to count by your own. Fill in the correct value and save.

In the end when all k-values contain the RCount the template to create the tables will only use this parameter which should speed up the creation time.

If this helps, other templates like Proth will changed, too.

[QUOTE=kar_bon;546369]...Creating new k-values now have to contain this new parameter.
- Before saving any k-value use the "Show preview" button, which will show the alert before saving and the count, so you don't need to count by your own. Fill in the correct value and save.

In the end when all k-values contain the RCount the template to create the tables will only use this parameter which should speed up the creation time.

If this helps, other templates like Proth will changed, too.[/QUOTE]

RCount is a verification of the number of items in RNList. Is this correct? I take it that the auto-count will go away? When creating a new k, RCount would be set to zero if RNList contains no entries.

The addition of RSieve will be helpful as it will indicate a k is not in process. I added this to one of mine which needs more sieving and is currently inactive. 98475.

RCount will become the value which will be taken when a k-value is shown in any overview table. The automated counting is only done in the template of the k-value page to be sure taking the correct value (this will stay).
RCount will not set automatically (perhaps possible later).
So creating a new k-value an entry without "RCount=" does not matter now, but this is noticed.

The RSieve value is meant to show there's a sieve available for this k, which can be uploaded by everyone (the filename is generated). You can show the max n-value, sieve depth and number of candiates in the RRemarks parameter (as example see [url='https://www.rieselprime.de/ziki/Carol-Kynea_prime_10']here[/url]).

Again the sieve file:
I've changed the handling, when creating a new k-value

- new k-value for Riesel prime created (not saved yet, only "Show preview") with RSieve set (like "RSieve=y")
- there is a red link "Upload me!"
- right klick the link -> open in new tab
- a new page pops up to upload the file with destination filename given
- choose your local file
- upload file

- back to the k-value page
- Show preview again
- the link should become blue (available page) and is "(sieve)" now
- save k-value page if anything is correct

I've also included the parameter list with text into the Riesel template and a new category, when there're 100 n-value or more for this k-value (see [url='https://www.rieselprime.de/ziki/Category:Riesel_count_100']here[/url]).

[QUOTE=kar_bon;546422]...The RSieve value is meant to show there's a sieve available for this k, which can be uploaded by everyone (the filename is generated). You can show the max n-value, sieve depth and number of candiates in the RRemarks parameter (as example see [URL="https://www.rieselprime.de/ziki/Carol-Kynea_prime_10"]here[/URL]).[/QUOTE]

Understood, and thank you for the reply. I removed the reference I made earlier. I always use "Show Preview" to make sure everything is proper before doing the actual save.

In your example link, there is a unit of measure, "21T." (K)ilo, (M)ega, (G)iga, (T)era, and (P)eta would be a guess. In this case, 21e12. To be honest, there are times when I would much rather sieve than test. All a person would need to do is pick a [I]k[/I] and look at its ending [I]n[/I] value and go from there.

[URL="https://www.rieselprime.de/ziki/Williams_prime_PM_table"]Williams prime PM table[/URL] does not show the primes for bases 64, 128, 256, and 512

[COLOR="SeaGreen"]Done.[/COLOR]

I've included templates for [url='https://www.rieselprime.de/ziki/Template:Gen_Proth_prime']Proth prime base b[/url] (example [url='https://www.rieselprime.de/ziki/Gen._Proth_prime_5_6436']here[/url], smallest open SR5, Sierpinski side)
and [url='https://www.rieselprime.de/ziki/Template:Gen_Riesel_prime']Riesel prime base b[/url] (example [url='https://www.rieselprime.de/ziki/Gen._Riesel_prime_5_1396']here[/url], found SR5 prime, Riesel side).

So every combination of k/base for Proth and Riesel are possible, helpful for [url='https://www.rieselprime.de/ziki/Sierpi%C5%84ski-Riesel_Base_5']PrimeGrid Sierpinski Riesel Base 5 Search[/url] or CRUS.

Every base value creates it's own category for those k/base combinations.
Category-Tree:
- Riesel prime
-- Riesel prime base 5 (here a general page for such base should be located, like a table of all k-values)
---- Riesel prime 5 1396 (= Riesel primes of the form 1396*5^n-1)

As a preview for including General Fermat numbers (so Top5000 comments like "Divides GF(a,b)" or "Divide xGF(a,b,c)" are possible with links in the Wiki, see [url='https://www.rieselprime.de/ziki/Proth_prime_3']here[/url] only as texts) a page for [url='https://www.rieselprime.de/ziki/Generalized_Fermat_262144']Gen.Fermat k^262144+1[/url] (=b^2^18+1) all known primes are listed, with data as a CSV file, so expandable without editing the page itself. Smaller exponents consists of way more values, so the page for example for b^2^16+1=b^65536+1 is the same size and all data saved as file.

Some new changes:

- There's now a small menu on top of every page instead of the info block. Links to helpful pages are now available for new users or even for a quick overview.
Especially the "Template prototypes" should be used by every user when creating new prime pages: all current prototype are available for the implemented prime types. Using those won't miss any parameter or using false ones.

Other links are still available in the left side menu.

- There're two new categories for Riesel primes in the Wiki:
1) k-values without any [url='https://www.rieselprime.de/ziki/Category:Riesel_prime_without_Sophie_Germain']Sophie Germain prime[/url]
2) k-values without any [url='https://www.rieselprime.de/ziki/Category:Riesel_prime_without_twin']twin prime[/url]
These only holds for k-values [TEX]k \equiv 0\ mod\ 3[/TEX]
The conditions will be generated by the Riesel template, so could be take some time, if all k-values are updated by the Wiki.

[QUOTE=kar_bon;548486]Some new changes:

- There's now a small menu on top of every page instead of the info block. Links to helpful pages are now available for new users or even for a quick overview.
Especially the "Template prototypes" should be used by every user when creating new prime pages: all current prototype are available for the implemented prime types. Using those won't miss any parameter or using false ones.

Other links are still available in the left side menu.

- There're two new categories for Riesel primes in the Wiki:
1) k-values without any [url='https://www.rieselprime.de/ziki/Category:Riesel_prime_without_Sophie_Germain']Sophie Germain prime[/url]
2) k-values without any [url='https://www.rieselprime.de/ziki/Category:Riesel_prime_without_twin']twin prime[/url]
These only holds for k-values [TEX]k \equiv 0\ mod\ 3[/TEX]
The conditions will be generated by the Riesel template, so could be take some time, if all k-values are updated by the Wiki.[/QUOTE]

The "twin prime pair" is a Riesel prime and a Proth prime with the same values of k and n, but the wiki only has category "Riesel prime without twin" and does not have category "Proth prime with twin", I know that they are the same values of k and n, but why only the Riesel primes have this category, but the Proth primes do not have?

Also, Sophie-Germain prime is two consecutive values of n for a fixed value of k for Riesel prime (k*2^n-1), why the wiki do not have the page of two consecutive values of n for a fixed value of k for Proth prime (k*2^n+1)? See the page [URL="http://harvey563.tripod.com/cunninghams.txt"]http://harvey563.tripod.com/cunninghams.txt[/URL], the CK of Proth primes is 32469, which is mush larger than that of Riesell primes (807)

The Wiki make high use of templates, which are still more in testing phase than complete.
Over the last weeks I've changed the Riesel prime template for serveral issues and additions:
- determine if a SopheiGermain is present
- determine if a Twin is present
- determine if a tested n-range is missing
- determine if there's no prime
- categorizing a k-value into special categories depending of such information
- added parameter for counting n-values

Those changes still in test-mode and others could implemented later.

If all such changes needed are done, the same can be easily done for other templates like Proth.
Before editing several templates for any change done, it's easier to test them on one template and be sure it's running properly.

For Twins:
As you can see, if any Twin is given in a Riesel k-value, it's shown as link to the Proth side... automatically! The same is done later on Proth side.

Stop pushing others, try to clean "your" dozenal "wiki"!

[QUOTE=kar_bon;549924]The Wiki make high use of templates, which are still more in testing phase than complete.
Over the last weeks I've changed the Riesel prime template for serveral issues and additions:
- determine if a SopheiGermain is present
- determine if a Twin is present
- determine if a tested n-range is missing
- determine if there's no prime
- categorizing a k-value into special categories depending of such information
- added parameter for counting n-values

Those changes still in test-mode and others could implemented later.

If all such changes needed are done, the same can be easily done for other templates like Proth.
Before editing several templates for any change done, it's easier to test them on one template and be sure it's running properly.

For Twins:
As you can see, if any Twin is given in a Riesel k-value, it's shown as link to the Proth side... automatically! The same is done later on Proth side.

Stop pushing others, try to clean "your" dozenal "wiki"![/QUOTE]

These are nice additions.

Dozenal? I have never seen this before.

Proth: There appears to be two types in the [I]Wiki[/I]: k*2^n+1 and k*3^n+1. Neither seems to attract much attention. Their relationship to 2^p-1 is obvious. There is none. However, I find them interesting even though Nash values are different for the "+1" form. The little program I have cannot calculate them. Oh well. :smile:

[QUOTE=storm5510;549937]However, I find them interesting even though Nash values are different for the "+1" form. The little program I have cannot calculate them. Oh well. :smile:[/QUOTE]

Try [url]https://www.mersenneforum.org/showthread.php?t=7213[/url]. Those tools can calculate both Riesel and Proth Nash weights (use a positive [I]k[/I] for Proth and a negative [I]k[/I] for Riesel).

[QUOTE=Happy5214;549938]Try [URL]https://www.mersenneforum.org/showthread.php?t=7213[/URL]. Those tools can calculate both Riesel and Proth Nash weights (use a positive [I]k[/I] for Proth and a negative [I]k[/I] for Riesel).[/QUOTE]

There are several links in this thread. Which post number are you referring to?

Thank you! :smile:

I've created a page for the [url='https://www.rieselprime.de/ziki/Nash_weight']Nash weight tool[/url] (for WIN) in the Wiki with downloadlink and some external links.

[QUOTE=storm5510;549937]Proth: There appears to be two types in the [I]Wiki[/I]: k*2^n+1 and k*3^n+1. Neither seems to attract much attention.[/QUOTE]

I'm concentrating on the Riesel side first, as said those template will be changed further and if running perfect will be converted to the Proth prime template and others.

Base 3 Proth (same as Base 5) are first attempts to create a template for the general form not base 2, same done for Riesel.
The aim for the Wiki was to find an easy way to save and display such sequences.

This is also for later changes: The creation of the Williams prime template was easy, but should later be used by General Riesel/Proth prime pages like shown at [url='https://www.rieselprime.de/ziki/Williams_prime_MP_27']Williams prime 26*27^n+1[/url] (that's why base 3 here).

PrimeGrid is extensively testing Proth primes for k<10,000 so there [b]is[/b] much attention.

PS: Keep in mind the data I've collected for more than 10 years in my RPPDb pages could not instantly shown in the Wiki.
There's more work in need to show and save such different sequences with much more data (history).
Imagine how the Wiki would look like in 10 years from now.

[QUOTE=kar_bon;549973]I'm concentrating on the Riesel side first, as said those template will be changed further and if running perfect will be converted to the Proth prime template and others.

Base 3 Proth (same as Base 5) are first attempts to create a template for the general form not base 2, same done for Riesel.
The aim for the Wiki was to find an easy way to save and display such sequences.

This is also for later changes: The creation of the Williams prime template was easy, but should later be used by General Riesel/Proth prime pages like shown at [URL="https://www.rieselprime.de/ziki/Williams_prime_MP_27"]Williams prime 26*27^n+1[/URL] (that's why base 3 here).

PrimeGrid is extensively testing Proth primes for k<10,000 so there [B]is[/B] much attention.

PS: Keep in mind the data I've collected for more than 10 years in my RPPDb pages could not instantly shown in the Wiki.
There's more work in need to show and save such different sequences with much more data (history).
Imagine how the Wiki would look like in 10 years from now.[/QUOTE]

I really do not see how you are doing this all on your own. The challenge of collecting data from various places and consolidating it in one area is beyond monumental. If I had to do this, I believe I would be prone to displays of what some call a short-fuse. Frustration mixed with a bit of anger. I have seen this in your writing at times and it is quite understandable. 10 years? I see remarkable differences in it now. I look at it daily most times.

I have found Primegrid a bit hard to navigate. I did not spend much time with it either. That would take some study on my part.

Thank you for the Nash link. Oh! Dozenal. That did not take much time. Base 12. :smile:

[QUOTE=storm5510;549986]I really do not see how you are doing this all on your own.[/QUOTE]

That's what I've done over years in RPPDb, collecting data on my own.

The Wiki is an easier solution for everyone to contribute their own results into (non)existing pages. Only fill in a template with some data and the display and all other things (categorizing, displaying in several tables, reservations) are done automatically.
That's why the functioning of the templates has to be guaranteed first.
PrimeGrid has a tool to show their primes found for a project/type but still no list like Kellers page or my old ones.
The hard part of such collection is the history, because much of any links given elsewhere are not available anymore, I saw this again when I created the page for the Nash weight.
This forum is also full of them and others, too. It's a pitty loosing such old data from projects like RieselSieve or Seventeen or Bust or even small personel pages.

[QUOTE=storm5510;549955]There are several links in this thread. Which post number are you referring to?

Thank you! :smile:[/QUOTE]

Sorry, [url]https://www.mersenneforum.org/showpost.php?p=421186&postcount=19[/url]. That zip also includes the mnash tool. The only difference in nash.c in this version compared to the one Karsten linked on the wiki is a very subtle integer type difference, which shouldn't affect functionality.

[QUOTE=kar_bon;549996]...This forum is also full of them and others, too. It's a pitty loosing such old data from projects like RieselSieve or Seventeen or Bust or even small personel pages.[/QUOTE]

This is why I advocated using the [I]Wiki[/I] so firmly a while back. It appeared at the time that many of the members seemed disinterested in using it and would continue to post their results only in the forums.

I do not know if the section of the forum entitled [U]Archived Project[/U]s would be of any use or not. I suspect those old projects will be deleted entirely at some point in the future.

[QUOTE=Happy5214]Sorry, [URL="https://www.mersenneforum.org/showpost.php?p=421186&postcount=19"]https://www.mersenneforum.org/showpo...6&postcount=19[/URL]. That zip also includes the mnash tool. [/QUOTE]

After some experimentation with [I]MNash[/I], I found it to be very useful. Thank you! :smile:

I've included a table for the frequencies given by [url='http://www.prothsearch.com/rieselprob.html']W.Keller[/url] for the [url='https://www.rieselprime.de/ziki/Riesel_problem']Riesel problem[/url].

The categorizing is done with the Riesel prime template (another addition!) but the Wiki still needs some time to determine the values.
It is not done if RCount is not set and only for k-values < 509203.

The same can be done for smallest even or odd n-values (Liskovets-Gallot) or other projects.

A FWIW: There are two links on the page [URL]https://www.rieselprime.de/ziki/Proth_prime[/URL] which are non-functional. They point to the [I]PSearch Project[/I]. [URL]http://mysite.verizon.net/wfgarnett3/[/URL] They time-out .[URL="http://mysite.verizon.net/wfgarnett3/"]
[/URL]

[QUOTE=storm5510;550270]A FWIW: There are two links on the page [URL]https://www.rieselprime.de/ziki/Proth_prime[/URL] which are non-functional. They point to the [I]PSearch Project[/I]. [URL]http://mysite.verizon.net/wfgarnett3/[/URL] They time-out .[URL="http://mysite.verizon.net/wfgarnett3/"]
[/URL][/QUOTE]

I bet that site is down. The project has been dead since 2006. [url]https://web.archive.org/web/20140911084022/http://mysite.verizon.net/wfgarnett3/[/url] is the most recent archived copy I found. Perhaps we should change the verbs to past tense?

[QUOTE=storm5510;550270]There are two links on the page [URL]https://www.rieselprime.de/ziki/Proth_prime[/URL] which are non-functional[/QUOTE]

You meant the PSearch page: I've edited the link to a new one (available [url='https://www.mersenneforum.org/showpost.php?p=72686&postcount=1']here[/url], and the Wayback page).

The problem with such links: I used the MersenneWiki data for those pages, only changed small things for including in the Prime-Wiki so some years old.
Wikipedia adds a date when such links were used the last. There's no automation to mark a link if it's not available anymore.

The page with listed projects is also outdated: Every project should get its own page (with project-template)... but where is my time?

[U]Reference [I]k[/I] = 6059[/U].

I see some things were added, which is no problem. [I]LLR[/I] found a prime less than the largest value, and greater than the two before. 130,136. Normally, I would simply strip-out everything in the sieve below the largest prime. In this case, I will not do that. If it found one below, there may be another.

Thanks.

Creating a new Riesel prime in the Wiki please:
- use [b]always[/b] the current templates (see top link "Template prototypes") -> you missed the RCount parameter
- have a look at the RPPDb: Free-DC Drive #2 found the highest prime, the highest n-value is given as 50k
- please search the Top5000 page for any other entry for that k-value

There is still a chance that other primes for 50000<n<540968 could be found so do test the whole range then.
Information for Riesel (all k<100k with small primes, higher k-values special ones only) are available at my old pages or Top5000, just look there first.

[QUOTE=kar_bon;551220]Creating a new Riesel prime in the Wiki please:
- use [B]always[/B] the current templates (see top link "Template prototypes") -> you missed the RCount parameter
- have a look at the RPPDb: Free-DC Drive #2 found the highest prime, the highest n-value is given as 50k
- please search the Top5000 page for any other entry for that k-value

There is still a chance that other primes for 50000<n<540968 could be found so do test the whole range then.
Information for Riesel (all k<100k with small primes, higher k-values special ones only) are available at my old pages or Top5000, just look there first.[/QUOTE]

I have a Riesel template here in the form of a plain text file. It did not have [U]RCount[/U] in it. I just added it. I found the templates. Mine did not have [U]RMultiRes[/U]. I added it as well.

I have links to some of what you mention above. I am not sure about RPPDb. UT Martin updated their page layout and I didn't recognize it, at first. I have a link for it as well.

[I]k[/I] = 6059 continues. Closing in on [I]n[/I] = 500,000.

"RMultiRes" was added in Feb. 2020, "RCount" in May, that's why always use the [url='https://www.rieselprime.de/ziki/Template_prototypes']Template prototypes[/url] and not privately copies.
Those're the current versions of prime number templates and you only have to copy/paste them to a new page.
The Wiki is still in contruction/test mode with many templates, but the Riesel prime template is the most elaborated one: some features are done the last weeks like the Riesel frequencies.
Some features should later be added to other templates like Proth.
RPPDb: The data shown for k=6059 says, this k was searched to n=50,000 and FreeDC Drive #2 found a higher prime (started from n=410,000 -> see menu for FreeDC and Drive 2 also).
UT Martin = Top5000: go to [url='https://primes.utm.edu/primes/search.php']Search[/url], put in the "Mathmatical Description" as "^6059*2^%-1" and select the "Type" option "all (includes unverified primes)" -> will show all primes there for Riesel 6059*2^n-1.

Would using something like [url]https://www.mediawiki.org/wiki/Extension:Page_Forms[/url] help these issues?

I know this extension, but it's more work in keeping current of all prime templates than the benefit of a formular.
As posted [url='https://www.mersenneforum.org/showpost.php?p=546369&postcount=158']here[/url] the parameter will be used for speed up the tables display.
If all Riesel k-values got this parameter filled (~300 to go) I'll change the table display template.
By now there's only a hidden categorizing if this parameter is omitted but then an alert will be given (as shown in the other post) while saving such k-value.

There's seems to be a small issue on the Template Prototype page: where the table of contents is, instead of it reading "Contents" (like on every other page in the wiki that has a table of contents), it reads "Inhaltsverzeichnis" (which I am guessing is German for Table of Contents). Any reason why that is happening?

Perhaps you use "German" as page language? You can change this by choosing "English" in the top menu. And possibly have a look at your "Preferences": Internationalisation.

Try a "Purge" also.

Looks like it is fixed on my end now: just had to select English again in the top menu (it was selected before, so I am not sure why it wanted to put that in German. Maybe a caching issue).

I had also purged it, so that may have also helped.

[QUOTE=kar_bon;551293]...RPPDb: The data shown for k=6059 says, this k was searched to n=50,000 and FreeDC Drive #2 found a higher prime (started from n=410,000 -> see menu for FreeDC and Drive 2 also).
UT Martin = Top5000: go to [URL="https://primes.utm.edu/primes/search.php"]Search[/URL], put in the "Mathmatical Description" as "^6059*2^%-1" and select the "Type" option "all (includes unverified primes)" -> will show all primes there for Riesel 6059*2^n-1.[/QUOTE]

[B]RPPDb[/B] I think I found, but it says it is no longer maintained. It is [URL="https://www.rieselprime.de/default.htm"]here[/URL].

I did a forum search for [B]FreeDC[/B], but did not find anything specific. Perhaps my search was too broad.

Searching [B]UT Martin[/B] yields a lot of data once the parameters are correct.

RRPDb: What is not maintained where?
The link you gave is the home page with the menu/links to all different prime page I've designed the last 13 years.
The page for 6000<k<8000 is still [url='https://www.rieselprime.de/Data/06000.htm']there[/url] and will remain until I moved all data to the Wiki.
FreeDC got his forum [url='https://www.free-dc.org/']here[/url] (the Prime Search can be found [url='https://www.free-dc.org/forumdisplay.php?148-Free-DC-s-Prime-Search']here[/url] with their 3 drives) and an overview of the drives at RPPDB is also [url='https://www.rieselprime.de/FreeDC/Overview.htm']available[/url].
I don't know what browser you use or what you see but this is the available menu on RPPDb:

It appears I misinterpreted the line at the top of the front page. (Attachment). "Not under my control." My apologies. There is a lot there to move. Until then, a good reference.

I did my search for "FreeDC" and not "Free-DC." I had never seen this site before.

My browser is [I]Mozilla Firefox[/I].

What I see, cannot see, or cannot see correctly, is [U]not[/U] a topic for discussion. I was browbeat because of it and I do not wish a repeat.

On the old Riesel Prime database site you had marked k's that are primorials (for example, 255255 was marked since 255255 = 17#/2). Will this be added to the wiki?

This is possible by using a special category, because of the few k-values an automated recognition is not needed.

There are some problems:
- k=278970415063349480483707695 = 71#/2 the automated calculations of the 3k/15k/2145k/2805k values are not correct and will shown in those table falsely (see last entry of [url='https://www.rieselprime.de/ziki/Riesel_k%3D15k_value']this[/url] table). This calculation has to be done in another matter or anyway.
- Those long k-values will broaden some other tables until there's no other possibility.

I can create an own category, a page with table and the first few values.

In [URL="https://www.rieselprime.de/ziki/Riesel_prime_5110664609396115"]Riesel prime 5110664609396115[/URL], n=143 is also Sophie Germain (not only n=34944 and 34945)
Done.

I've implemented a recognition of missing markings of Sophie Germain in Riesel prime pages and found 6 more.
The algorithm is testing
- only for Riesel primes
- only if such page was saved
- not in any table view
If a missing value is detected, the page is categorized
Perhaps there're some more but the system has to check all which takes some time.

Some changes in handling MultiReservations for Riesel values:

If a project reserved several k-values a MultiReservation will be used to handling easy range or dates changes during that project: change only one value instead of editing many pages.

The problem before: If the n-value range is not set to n=1 but instead of say n>=400k and the lower ranges are not yet tested, the max n-value shown in any k-value page of the project is false.

Solution:
If a MultiReservation of a Riesel k-value is set [B]and[/B] a max n-value (RMaxn) is given, the RMaxn value is shown including the MultiRes n-value in brackets.
The categorizing into the [url='https://www.rieselprime.de/ziki/Category:Riesel_prime_missing_range']Missing range category[/url] is set, too.

Example:[url='https://www.rieselprime.de/ziki/Riesel_prime_15373']Riesel k=15373[/url] reserved by RPS Drive 10 which reserved for 400k<n<2M and the lower range 300k<n<400k is missing right now.
The display in the table are not yet changed (later to do).

More:
- All missing RCounts inserted in any Riesel k-value pages and so this value is used to be shown in the tables
- The display of the k-type has changed: for example a 2145k-value is linked to that [url='https://www.rieselprime.de/ziki/Riesel_k%3D2145k_value']page[/url] with table
- Many k-values from the [url='https://www.rieselprime.de/ziki/Riesel_problem']Riesel problem[/url] were inserted and the table of frequencies showing which values are complete
- Many Riesel k-values inserted and the original RPPDb pages are updated (deleted those values there but including a link to the Wiki).

I've inserted a [url='https://www.rieselprime.de/ziki/Statistics']statistics[/url] for sequences in the Wiki with own pages, depending on the type.

The recent days many Riesel prime pages were added, mostly from the beginning of the Riesel problem (first n-value > 8192), more to come.
All data inserted into the Wiki from my old pages are deleted there, to keep it easier what has to be transferred to the Wiki and to avoid outdated information.

A table for [url='https://www.rieselprime.de/ziki/Gen._Riesel_prime_10']k*10^n-1[/url] is created with some pages done for Near Repdigit numbers.

Also links in the sidebar for Woodall/Cullen were added.

The prime for [URL="https://www.rieselprime.de/ziki/Riesel_prime_small_bases_least_n"]6*354^n-1[/URL] is 6*354^25565-1, not 6*354^25561-1, see [URL="https://mersenneforum.org/showthread.php?t=12993&page=195"]https://mersenneforum.org/showthread.php?t=12993&page=195[/URL]

[COLOR="Green"]Done[/COLOR]

No, this should be done in the k-value pages or the CRUS pages if available so that page for smallest n-values could take those n-values from there automatically.
I'm currently working on other topics and I think Gary is not willing to keep CRUS pages current in the Wiki, so no: I'm not willing to create those pages for every base of my own.
Same procedure should be done for all Williams primes pages, but no time to do so yet.

Williams Primes base 3
 

I created a page for [URL="https://www.rieselprime.de/ziki/Gen._Proth_prime_3_10"]10*3^n+1[/URL] so that [URL="https://www.rieselprime.de/ziki/Williams_prime_PP_9"]Williams PP9[/URL] primes could be reused from there.

There are also two new entries for these form of primes found by Ryan. They are included in the 10*3^n+1 page. I don't know if he is searching only even n values (Williams Primes) or odd n values as well.

[COLOR="Green"]Thanks, I've corrected/extended those pages a little.[/COLOR]

Also, you can create page "Generalized Riesel prime 10 99" and "Generalized Proth prime 10 99" to make lists for "Williams prime MM 100" and "Williams primes MP 100"

Also, you can reuse the "Riesel prime 255", "Riesel prime 511", "Riesel prime 1023", and "Riesel prime 2047" for "Williams prime MM 256", "Williams prime MM 512", "Williams prime MM 1024", and "Williams prime MM 2048", currently, all power-of-2 bases for the other three types of Williams primes are in the list, but for the "MM" type, only power-of-2 bases <= 128 are currently in the list.

[QUOTE=kar_bon;510096]So far supported numbers/primes formats with some data:

- [url='https://www.rieselprime.de/ziki/Mersenne_prime']Mersenne primes[/url] M1-M51
- [url='https://www.rieselprime.de/ziki/Riesel_prime']Riesel primes[/url] k•2[sup]n[/sup]-1
- [url='https://www.rieselprime.de/ziki/Gen_Riesel_prime_5_1396']Genneral Riesel primes[/url] k•b[sup]n[/sup]-1 (Example: 1396•5^n-1)
- [url='https://www.rieselprime.de/ziki/Proth_prime']Proth primes[/url] k•2[sup]n[/sup]+1
- [url='https://www.rieselprime.de/ziki/Gen_Proth_prime_5_6436']Genneral Proth primes[/url] k•b[sup]n[/sup]+1 (Example: 6436•5^n+1)
- [url='https://www.rieselprime.de/ziki/Carol-Kynea_prime']Carol/Kynea primes[/url] (b[sup]n[/sup]±1)[sup]2[/sup]-2
- [url='https://www.rieselprime.de/ziki/Williams_prime'](generalized) Williams primes[/url] (b±1)•b[sup]n[/sup]±1
- [url='https://www.rieselprime.de/ziki/Gen_Woodall_prime'](generalized) Woodall primes[/url] n•b[sup]n[/sup]-1
- [url='https://www.rieselprime.de/ziki/Gen_Cullen_prime'](generalized) Cullen primes[/url] n•b[sup]n[/sup]+1
- [url='https://www.rieselprime.de/ziki/Leyland_number']Leyland numbers[/url]: x^y+y^x and x^y-y^x[/QUOTE]

Also,

(generalized) near-Woodall primes (n±1)•b[sup]n[/sup]-1

(generalized) near-Cullen primes (n±1)•b[sup]n[/sup]+1

(generalized) hyper-Woodall primes x^y•y^x-1

(generalized) hyper-Cullen primes x^y•y^x+1

(generalized) near-hyper-Woodall primes (x^y±1)•y^x-1

(generalized) near-hyper-Cullen primes (x^y±1)•y^x+1

(generalized) dual Williams primes b[sup]n[/sup]±(b±1)

(generalized) dual Woodall primes b[sup]n[/sup]-n

(generalized) dual Cullen primes b[sup]n[/sup]+n

(generalized) dual near-Woodall primes b[sup]n[/sup]-(n±1)

(generalized) dual near-Cullen primes b[sup]n[/sup]+(n±1)

(generalized) Fermat primes b^(2^n)+1 (with even b)

(generalized) half-Fermat primes (b^(2^n)+1)/2 (with odd b)

(generalized) half-Carol/Kynea primes ((b[sup]n[/sup]±1)[sup]2[/sup]-2)/2 (with odd b)

(generalized) repunit primes (b^p-1)/(b-1)

(generalized) nega-repunit primes (b^p+1)/(b+1)

factorial primes n!±1

primorial primes p#±1

There are still many pages on the wiki that have issues with tex formatting. Does this require each page to be edited or do the math tags just not work currently?

Two examples:
[url]https://www.rieselprime.de/ziki/P-1_factorization_method[/url]
[url]https://www.rieselprime.de/ziki/Elliptic_curve_method#:~:text=The%20elliptic%20curve%20method%20(sometimes,the%20number%20to%20be%20factored[/url].

Where do you see any problems?
Please give some small screenshots as examples.

[QUOTE=kar_bon;567881]Where do you see any problems?
Please give some small screenshots as examples.[/QUOTE]

Sorry, I should have done that before. I have seen this on multiple pcs so I assumed it was everyone. I have just tried other browsers and it works. The issue seems to be Chrome(both on windows and android).

Such irony. That's the issue I used to have, but don't anymore after I made Karsten upgrade the MathJax extension version on the wiki some time ago. Looking at my Chromium inspector, it appears the extension.json file may not have been updated with the rest of the extension, since it's trying to call a non-existent dependency.

Using here Google Chrome V87 64Bit on WIN10 shows the issues as in your image.
Pressing STRG+F5 to clear the cache solved the issue and all is displayed without errors.
Please test again.

The [URL="https://sites.google.com/site/geoffreywalterreynolds/programs"]download link[/URL] in page [URL="https://www.rieselprime.de/ziki/Srsieve"]srsieve[/URL] is broken.
[COLOR="Green"]Done[/COLOR]

I'm planning to make a greater change for the handling with Riesel and Proth templates:
To avoid using two different templates for 'normal' Riesel/Proth numbers (base=2) and General Riesel/Proth numbers (base>2) I will add a new parameter for the base into the templates.
Therefore the page-naming for Riesel/Proth numbers will change, too, including the base, so from "Riesel prime 125" to "Riesel prime 2 125" and from "Gen Riesel prime 5 2" to "Riesel prime 5 2", same manner for Proth side.
This means an easier way in handling those templates (two instead four).
Unfortunately all links to a special k-value outside the Wiki won't work anymore and I will not create any redirects.
This will be done first for the Proth side (small amount of pages), later Riesel side is done.

I've also managed to store information of General Fermat numbers, but still need some more templates (Fermat numbers) and testing, so please don't add more GFN-divisibilites to any Proth number. A test can be seen [url='https://www.rieselprime.de/ziki/Category:Generalized_Fermat_number_3_1']here[/url] to create tables like on prothsearch.com.

Banning redirects on the Prime-Wiki will not work in the long run.

Aside from that, I have an unrelated question related to the templates. What's the purpose of having the R/P prefix on all of the Riesel/Proth template arguments? It seems superfluous, since its meaning is provided by the template call being used, and it requires extra work to add the prefix letter. Does DPL require all field names to be unique across templates?

I've created a template for "Gerneralized Fermat numbers" to show some data and the dates/names for found factors from "GF Divisor"s.
[url='https://www.rieselprime.de/ziki/Generalized_Fermat_number_2_1_38']F(38)[/url] is an example with links to the corresponding Proth number and the GF Divisors. Perhaps some more data to show there.

I've managed to store and display "Long numbers", using the FactorDB-IDs and shortcuts.

This was needed to collect and display all types of Generalizes Fermat numbers of the forms a^2^n+b^2^n.

Example:
At the page for the [url='https://www.rieselprime.de/ziki/Proth_prime_2_3']Proth prime 3*2^n+1[/url] the notes for [I]n[/I] = 41 contains links to a page (GF Divisor) and showing the first entry (here Fermat(38)).
The old type using a template for all entries did not worked if there were more than 20 entries, so now an own page.

The page for the [url='https://www.rieselprime.de/ziki/GF_Divisor_3_41']GF Divisor 3*2^41+1[/url] contains all divisibilities to all GFn's including dates found and discoverers, if available.

Finally the page for the [url='https://www.rieselprime.de/ziki/Generalized_Fermat_number_2_1_38']Fermat(38)[/url] contains all data derived from the GF Divisor pages, links to them and the factorization.

The [url='https://www.rieselprime.de/ziki/Category:Generalized_Fermat_number_2_1']category[/url] of this GFN's now contains tables for:
- differences [I]n[/I]-[I]m[/I]
- GF numbers: including state and factorization
- GF Divisors: [I]k[/I]- and [I]n[/I]-value and discoverers
Perhaps here some further work has to be done, like different pages for the big tables or small changes to the 3rd table.

All data taken from Wilfrid Keller's pages, but the advantage here, all data contain links to other pages (like Proth primes, Persons, FactorDB entries) to find more data easily and creating/updating the last 3 tables automatically, if new GF Divisors/GF numbers are stored in the Wiki.

I've changed/updated the template for Proth primes (k*b^n+1) including the base as parameter [B]and[/B] in the page name. So there's no need to use a "Gen Proth prime" template (see also the "Template protoypes" page).
Some other templates used for Riesel and Proth are not yet fully updated (like showing the k-type in a table), but will follow.
Many other pages linked to those Proth primes were updated (like Williams) and some project pages.
Now every base of [url='https://www.rieselprime.de/ziki/Category:Proth_prime']Proth primes[/url] will get their own category with some cub-cats and pages from now on.

There's no need to use redirects for old pages, because if an old page in not found like [url='https://www.rieselprime.de/ziki/Proth_prime_3']Proth prime 3[/url] (without base in page name), a link as "search the related logs" is available and shows the moving of this page to a new one.

I will now start the same procedure for the Riesel prime pages, which will take some more time. So perhaps many pages will show errors, because I've to change the Riesel template to work with first.

This all will make the handling and updating of those templates much easier in the future (2 templates instead of 4 and some other used templates easier).

I will inform here, when the moving of all pages is complete and related pages are updated, too.
Be patient.

The moving of all Riesel type values and filling the new parameter for the base into those pages is done.
Many thanks to the bot from Happy5214 to do the task more automated.

All other things like templates or related pages should also updated according to those Riesel template change.

A new link on the sidemenu was included for Generalized Fermat numbers with a navbox related to them.
Although many pages are still missing, because the dataset is extremely big, examples for Fermat primes F(n) and GFN(3,1) are available. The related templates are also available in the Template prototype page on top.

Currently I'm working on the PrimeGrid searches, here the Proth types as
- Proth Prime Search (PPS)
- Proth Prime Search Extended (PPSE)
- Proth Mega Prime Search (MEGA)

I recently completed the import of Ken Davis's data, which included increasing the limits on all of his [I]k[/I]'s to 200k. I noticed that his 3 5-digit [I]k[/I]'s were not previously in Prime-Wiki, nor on the old RPPDb, despite being on the PrimePages since the early 2000s. That made me curious how many more [I]k[/I]'s we're missing from the UTM data. Turns out, it's a lot. Using automated scanning of the PrimePages for all odd [I]k[/I]'s between 10k and 100k using the standard Riesel form, I found 989 unique [I]k[/I]'s (and that doesn't even include special forms). Of those, 631 were not on the Prime-Wiki (I've attached them here). If we included all of them, that would nearly double our collection of 5-digit [I]k[/I]'s.

There're sure many Riesel or Proth primes at UTM which are not in the RPPDb. Many of them are only as the mentioned for only one n-value (constant n-searches or like) and were not at high priority to be included, neither in RPPDb nor the Wiki. Perhaps all UTM entries like those will be inlcuded but the near future has other priorities.

I've just created two pages to create new pages for Riesel or Proth primes. See the links on the "Template prototype" page.

Today: 2^13 = 8192 pages in the Wiki and counting!

I was nitpicking at [url]https://www.rieselprime.de/ziki/Riesel_2_Missing-range[/url], and I found a couple of minor things:[list=1][*]The lead isn't really a sentence, but rather a description in the form of a phrase. I wonder how often that recurs across the Wiki.[*]"There are 338 sequences in this Wiki:" (as of this writing) - First of all, this can be a lot more descriptive, maybe something like "There are 338 Riesel [I]k[/I]'s with missing ranges on this Wiki:"? And note the difference between "in" and "on". I don't know if German has separate words for those (I know Spanish uses the same word, "en", for both). I thought of the Wiki in two ways, as being a website and a database. Something being [I]on[/I] a website or a database made sense to me, as did something being [I]in[/I] a database, but something being [I]in[/I] a website sounded awkward to me, so "on" makes more sense here to me. A template might make sense for these headers.[*]The [I]k[/I] cells in the table should use [c]! scope="row" |[/c] instead of simple bolding, so that they serve as HTML row headers. You can handle the change in styling using MediaWiki:Common.css if you don't like the new rendering, but the semantics are important.[/list]

[QUOTE=Happy5214;588311][…] I don't know if German has separate words for those […].[/QUOTE]

You would always say [I]auf (engl. on) dieser Webseite[/I] and [I]in (engl. in) meiner Datenbank[/I], but [I]Ich las es in einer Webseite[/I] and [I]Meine Daten befinden sich auf einer Datenbank[/I] sounds definitely wrong to me. For local storage: [I]Ich speichere meine Daten auf einer Festplatte/SSD[/I] or [I]auf meinem Computer[/I], but [I]Meine Zwischenergebnisse befinden sich im (engl. in the) Arbeitsspeicher[/I] (in RAM).

For "Wiki", it is more complicated. While you would say [I]Auf [der Seite] Wikipedia konnte man sich darüber informieren…[/I] (you could inform yourself on Wikipedia about…), you would likely say [I]In diesem Wiki(pedia)-Artikel geht es um Käse[/I] (this Wiki(pedia) article is about cheese) like if you would say [I]In dieser Anleitung erkläre ich euch, wie man einen Fisch entgrätet[/I] (in this manual I tell you how to remove fish bones).

I should probably clarify about "on a database". That would be for something like a searchable database, such as one you'd find at an online library, rather than an SQL database you'd maintain for a website. I definitely would never say something like "The data on my database went missing," unless I was speaking metonymically about the server it was on, i.e. "The data on my database [I]server[/I] went missing." Now, running queries "on a database" is a different thing entirely.

Although it's only one letter (difference in wording of "in" instead "on") where I thinks it's not worth to discuss, but I've done this:

I've changed the phrase on top of the table in "There are currently xxx entries".
A template for such information is not required I think, because:
- it's only a small notice
- it depends on the table if the notice is given by the DPL-command or with an own command (differs, too)
- this is only a quick notice for not counting by yourself
- this notice could be omitted, when looking at the category (the counting is given there)
And yes, such phase is not the only one in/on this Wiki.

The description is given in the page title and the line above, so no need to repeat it in that phrase again.

I've inserted 'scope="row"' for this DPL-command, too.

[QUOTE=kar_bon;588451]Although it's only one letter (difference in wording of "in" instead "on") where I thinks it's not worth to discuss, but I've done this:

I've changed the phrase on top of the table in "There are currently xxx entries".
A template for such information is not required I think, because:
- it's only a small notice
- it depends on the table if the notice is given by the DPL-command or with an own command (differs, too)
- this is only a quick notice for not counting by yourself
- this notice could be omitted, when looking at the category (the counting is given there)
And yes, such phase is not the only one in/on this Wiki.

The description is given in the page title and the line above, so no need to repeat it in that phrase again.

I've inserted 'scope="row"' for this DPL-command, too.[/QUOTE]
The lead wasn't addressed, so I took that into my own hands and expanded that myself. Some new members to the project might want an explanation as to why there are so many missing ranges.

Understood on the notice. I didn't know if the "in"/"on" was a typo or a common translation error, since I've seen it before (not necessarily from you, but I wanted to rule it out).

The DPL template still needs the exclamation point for the [c]scope="row"[/c] to be useful. That's what makes it a row header (and semantically correct). You'll be able to override the default gray coloring using CSS.

The abbreviations inserted in the table header cells seems helpful on one side but explodes the code and makes it harder to read/edit on the other side.
Another question on my side: It seems self-explanatory so is it really needed here?

A more easier way to do this is to create a page, where such a table (and there're many others) are explained like the table headers (Nash), or the sorting ability or colouring.

If you only want to make those things more 'readable' for visually handicapped people (tools for reading out loud) or controllable it's too much to handle. The same is for building all pages to be accessible for mobiles, where I say strictly 'No' then.
I want to bring in more information and still have to make my mind, how to do this in many cases.

The (Generalized) Fermat Numbers are now manageable including there "GF Divisors" with links to the Proth prime pages and many historical data maintained by W.Keller's pages.
He only gave lists for Fermat numbers and for GFn-bases for 2,3,5,6,7,10,11,12 but no others (especially 8). More lists can be created by the new templates not available on any other internet page so far.
This Wiki is still not fully implemented and it could take years until all data are available so those table enhancements have to wait on my side.
I got more ideas to handle with like including references to online books and articles of authors to suppress the history of findings (like [url='https://www.ams.org/journals/mcom/1998-67-221/S0025-5718-98-00891-6/']those[/url], many articles of "Mathematics of Computation" are available as PDF).
Counting primes and creating downloadable LLR-type resultfiles or prime listings are another topic to do.
How to handle the check of Twin primes? Is it done always for any new Riesel prime found?
What about new Proth primes? Are those always checked for GFN divisibilities? How to manage this in the Wiki?
So way more work to do than those detailing.

I created a template in my user sandbox ([url]https://www.rieselprime.de/ziki/User:Happy5214/sandbox/Template:Riesel_list[/url]) in order to standardize the primary Riesel prime lists. Most of the pages would now become calls to this template, which would only require a few lines, while the logic would be in the template. I also included support for bases other than 2 via an extra parameter.

My Lua rewrite of the NVal and NVal list templates is complete enough to share. I achieved a speed improvement of over 5x vs. my copy of the current code (pre Gen. Fermat) on my personal server. This may help with the exorbitant load times on the Riesel [I]k[/I] list pages. Since my wiki is behind a firewall, I've attached the code here. Its only dependencies are those which come with Scribunto (the MediaWiki Lua extension) itself.