As described in Section 3.4 of [MR:3540958, arXiv:1602.03715], the completeness of the genus 2 curve database for curves of absolute discriminant $\Delta\le 10^6$ has been tested against other tables of genus 2 curves, including those of [Stoll], and Merriman and Smart [10.1017/S030500410007153X]. However, as explained on the completeness page, it is only complete within the boxes that were searched, and it is likely that there are at least a few genus 2 curves of minimal discriminant $D\le 10^6$ that are not included (even though no such curves are currently known).
The reliability of specific data associated to genus 2 curves is discussed below.

In cases where the set of rational points has not been provably determined, this is indicated by the label known rational points. In cases where the set of rational points has been provably determined (via some variant of Chabauty's method implemented in Magma), this is indicated by the label Rational points; in all other cases lists of rational points are preceded by the caption Known rational points.

The power of 2 in the conductor of the Jacobian (originally bounded analytically) has been rigorously verified by Tim Dokchitser and Christopher Doris [arXiv:1706.06162] using algebraic methods.

All Lfunction computations are conditional on the assumption that the Lfunction lies in the Selberg class (in particular, that it has a meromorphic continuation to $\C$ and satisfies a functional equation). This also applies to the Euler factor at 2 for curves with bad reduction at 2.

In general, positive analytic ranks are upper bounds that are believed to be equal to the true analytic rank (this can fail to be true only if there is a zero very close to but not at the critical point). This is explicitly indicated on the home page of each curve, but these upper bounds are treated as exact for the purpose of searching. In cases where modularity is known (including curves whose Jacoabians are of GL2type), the analytic rank is provably correct if it is equal to 1 (our analytic rank bounds are all compatible with the sign in the functional equation.

Subject to the assumption that the Lfunction lies in the Selberg class, the root number has been rigorously computed and the analytic ranks are rigorous upper bounds. For 99 percent of the curves in the database the MordellWeil rank of the Jacobian has been rigorously computed using Magma code provided by Michael Stoll; in every case this matches the listed analytic rank.

The data on the geometric endomorphism ring that was initially computed heuristically has now been rigorously certified by Davide Lombardo [arXiv:1610.09674] and by Edgar Costa, Nicolas Mascot, Jeroen Sijsling, and John Voight [arXiv:1705.09248], independently, by different methods. This rigorously confirms the SatoTate group computations (the fact that these independent computation agree is a consistency check).

Isogeny class identifications are based on a comparison of Euler factors at good primes up to $2^{20}$. Jacobians that are not identified as members of the same isogeny class are provably nonisogenous, but the identification of membership within a particular isogeny class is heuristic (except for Richelot isogenies, no explicit isogenies have been computed). In principle it could be made rigorous in any particular case via a FaltingsSerre argument, as described in [arXiv:1805.10873], but this has only been done for a handful of cases such as the isogeny class of conductor 277.

MordellWeil generators and regulators are conditional on BSD in cases where the MordellWeil rank is marked as a lower bound (in all such cases it is equal to our computed upper bound on the analytic rank).

All values of the analytic order of sha are accurate to at least six decimal places, and under BSD exactly equal to the rounded integer displayed.
All invariants not specifically mentioned above were computed using rigorous algorithms that do not depend on any unproved hypotheses.
 Review status: reviewed
 Last edited by Andrew Sutherland on 20200107 21:37:51
 20200107 21:37:51 by Andrew Sutherland (Reviewed)
 20200107 20:46:06 by Andrew Sutherland
 20190905 19:10:25 by Kiran S. Kedlaya
 20190503 17:22:44 by Jennifer Paulhus (Reviewed)
 20190502 15:54:07 by Andrew Sutherland
 20190502 15:52:51 by Andrew Sutherland
 20190422 20:48:52 by Andrew Sutherland
 20190322 16:56:10 by Andrew Sutherland
 20190322 16:55:37 by Andrew Sutherland
 20190321 23:59:02 by Andrew Sutherland
 20190321 23:21:17 by Andrew Sutherland