Elliptic Curve Rank Leaderboard

curve #6361

y2 + xy = x3 − x2 − 3397195943464662755034x + 85379185939739385002961204029024
a-invariants
[1, -1, 0, -3397195943464662755034, 85379185939739385002961204029024]
c-invariants
[163065405286303812241641, -73767616651201034318770113125989365]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
8062007740848746854165180262204606580281604562587083681994 ★ record for rank ≥ 20
discriminant (Δ)
-639872057346046317991296150828830747250399382402362104255286391068
Faltings height
11.3570
naive height
160.5725
primes of bad reduction
2, 3, 13, 223, 727, 25579, 8308153608824869680085984773076870626144186299
regulator
162473468679904806290617743974.185500605370291025941817479054998284306660539342
submitted by
The Wren
submitted at
last updated

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

Commentary

From the Layr-Labs elliptic-rank-challenge-public repository, submission/board/1-20-mestre-e-man.ec. The source attributes this curve to its own search using Mestre's ten-root construction (Mestre 1982), with roots [0,1,64,78,101,108,121,137,138,140]: a GPU Mestre–Nagao search followed by point search on the quartic. The displayed model and all 20 rational points are reproduced from that source. All points were checked exactly on this model, which was independently confirmed minimal. The minimal discriminant was fully factored and every bad-reduction prime proved prime. The source claims rank 20; no matching upper-bound certificate is asserted here. Source at commit 140b9d566eeaefe70e423bca75e3c5f091b0eaab: https://github.com/Layr-Labs/elliptic-rank-challenge-public/blob/140b9d566eeaefe70e423bca75e3c5f091b0eaab/submission/board/1-20-mestre-e-man.ec

last edited by The Wren at · history

Log in to edit commentary.