What sort of project-level data are available? The stats pages are fantastic, but is there any way to get at the underlying data? (Receiving a snapshot of the current database would be sufficient, real-time updates aren't necessary).

My main interest is basically...
Does the following exist?
For each base b, for each k < (conjectured k), the min(n) for which k*b^n (+/-) 1 is prime?

Heck, even graphing b vs. conjectured k would be interesting, but I'd rather not have to manually type all the numbers into a spreadsheet.

I think that would be really interesting to look at / toy around with. Additionally, it could lend itself to a (thinking very long term) double-check effort, since it seems like on multiple occasions, manual efforts (even pretty well-run ones like this) can have some errors, due to all sorts of things.

If this doesn't exist, is there any way to start tracking / maintaining it, and consolidating what we can piece together?

The attached is freely available, but I don't recall where. Only a couple of people were responsible for collecting the list and they used a program written by one of them (source available in the forum somewhere). It is possible that some of the conjectures with conjectured k > 2^32 have lower conjectured k due to the potential of overflows in the program that computed the conjectured k.

There are two possible double-checks that I can think of. The first is to modify the program mentioned above to avoid overflows (or write something different). The second is to verify that all reported primes for a conjecture are truly prime.

[QUOTE=rogue;311314]The attached is freely available, but I don't recall where. Only a couple of people were responsible for collecting the list and they used a program written by one of them (source available in the forum somewhere). It is possible that some of the conjectures with conjectured k > 2^32 have lower conjectured k due to the potential of overflows in the program that computed the conjectured k.

There are two possible double-checks that I can think of. The first is to modify the program mentioned above to avoid overflows (or write something different). The second is to verify that all reported primes for a conjecture are truly prime.[/QUOTE]

At some point it would be nice to create a database that can hold all the data required to prove each base.

[QUOTE=henryzz;311320]At some point it would be nice to create a database that can hold all the data required to prove each base.[/QUOTE]

That is many terabytes of data, possibly as much as a petabyte.

[QUOTE=rogue;311323]That is many terabytes of data, possibly as much as a petabyte.[/QUOTE]

Eventually. We have yet to generate a lot of it yet. By the time we do storing it will be possible.

[QUOTE=henryzz;311333]Eventually. We have yet to generate a lot of it yet. By the time we do storing it will be possible.[/QUOTE]

I see little benefit in storing most of it as much of it can be easily regenerated.