Elliptic Curve Rank Leaderboard

curve #6474

y2 = x3 − x2 − 102824600831727792x + 12881567608358874491069136
a-invariants
[0, -1, 0, -102824600831727792, 12881567608358874491069136]
c-invariants
[4935580839922934032, -11129674384008582520746129344]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
10968571582957756733620746557606511621425738596368
discriminant (Δ)
-2105965743927889292855183339060450231313741810502656
Faltings height
8.6455
naive height
129.1588
primes of bad reduction
2, 3, 59960213, 1669087579, 2283318757093803691254799261933
regulator
7901616115298367.49752970199723317868942448738408163784753327730500705698
submitted by
Michael Rubinstein
submitted at
last updated

Witness: 17 independent points log in to add more points →

Commentary

Mestre ten-root construction, roots 0,2,10,26,56,67,87,90,132,136: with p(x) = prod (x - a_i), write p = q^2 - r with q a monic quintic and deg r <= 4; the genus-one curve y^2 = r(x) carries the ten points (a_i, q(a_i)), and the curve submitted is the minimal Weierstrass model of its Jacobian. Found by enumerating integer ten-root sets 0 = a_1 < ... < a_10 and scoring each by S = sum of -a_p log(p)/p over the good primes 5 <= p <= 199 (with early abort on low partial sums); the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, were screened by exact conductor and by a GRH explicit-formula upper bound on the rank, and the survivors were certified with ellrank. Rank 17, proved: 17 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.