Elliptic Curve Rank Leaderboard

curve #7625

y2 + xy = x3 − x2 − 86644761330836634x + 10112838447232713888970640
a-invariants
[1, -1, 0, -86644761330836634, 10112838447232713888970640]
c-invariants
[4158948543880158441, -8737492399693796352609919989]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
40302257664046127120339654222684229116030310 ★ record for rank ≥ 17
discriminant (Δ)
-2550377242802918981833993743779236373748793054687500
Faltings height
8.6363
naive height
128.6748
primes of bad reduction
2, 3, 5, 161017, 2093411, 393913547, 8005936507, 421257430933
regulator
30839759436817.2630195024509958888377836870483279728544135485366821024551
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,6,11,26,76,78,122,125,142,160: 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 >= 17: the 17 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.