Elliptic Curve Rank Leaderboard

curve #6025

y2 = x3 − 69131832784234167x + 7112981775483787670682010
a-invariants
[0, 0, 0, -69131832784234167, 7112981775483787670682010]
c-invariants
[3318327973643240016, -6145616254017992547469256640]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
2931503334443348555683450903039817245704936
discriminant (Δ)
-711511881582374334331425772412460198806903189453568
Faltings height
8.5511
naive height
127.9711
primes of bad reduction
2, 3, 7, 13, 439, 56774085483287, 17951545169341382075551
regulator
48273895717582.17794497195811123985283791625844218881583706976212716468
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,7,8,15,24,30,44,61,62,77: 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 16, proved: 16 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.