Elliptic Curve Rank Leaderboard

curve #6502

y2 = x3 − 355134338176054624252x + 2529770195088837108478667023540
a-invariants
[0, 0, 0, -355134338176054624252, 2529770195088837108478667023540]
c-invariants
[17046448232450621964096, -2185721448556755261725568308338560]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
17781650931748464731843618509615062726355017661111990269304
discriminant (Δ)
101853296537055205984000246823075079296561541162849480262573312
Faltings height
10.6887
naive height
153.5707
primes of bad reduction
2, 179, 18289, 89917, 7550875227399260691431851949878486369563079369
regulator
1362623900856756772.029354389510767018000635580062221453325548828882729961697
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,3,10,19,20,76,97,134,136,169: 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); for the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, rational points were found by a point search on the quartic y^2 = r(x), and the curves were screened by conductor and by a GRH explicit-formula upper bound on the rank. Rank >= 19: the 19 listed points come from the point search and are independent (height matrix nonsingular at 57 and 115 digits). Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.