{
  "id": 6550,
  "curve_key": "128944810633151361:-46396827830355359994707265",
  "ainvs": [
    "1",
    "-1",
    "1",
    "-2686350221523987",
    "53700032882646999819315"
  ],
  "rank_lower_bound": 15,
  "torsion": [],
  "family": null,
  "families": [],
  "naive_height": 118.19854664605433,
  "faltings_height": 7.649808011213191,
  "conductor": "901860182242424097416884928108493502",
  "bad_primes": [
    "2",
    "7",
    "43",
    "71",
    "1030647031680323",
    "20472666704239247"
  ],
  "discriminant": "-5052472742301622700840385982917932385892302848",
  "regulator": "64664944128.099907333151606368258097669897080686299280895298557470355",
  "points": [
    [
      "-2952535213/169",
      "678247765317578/2197"
    ],
    [
      "546629243",
      "-12725052654526"
    ],
    [
      "-40902289",
      "308481936446"
    ],
    [
      "18962730803/361",
      "-1645312431083434/6859"
    ],
    [
      "34399397",
      "-44701062370"
    ],
    [
      "203736403/9",
      "-1809235343626/27"
    ],
    [
      "24822695",
      "-48100721146"
    ],
    [
      "536195887067/20449",
      "-105032051474914082/2924207"
    ],
    [
      "50624792003/1369",
      "3555195733843706/50653"
    ],
    [
      "230561623/9",
      "1110851876794/27"
    ],
    [
      "30479675",
      "11684815490"
    ],
    [
      "28391523",
      "17769411074"
    ],
    [
      "26707035",
      "31685155394"
    ],
    [
      "26666707",
      "32032994050"
    ],
    [
      "50631702867/1849",
      "2060177878484118/79507"
    ]
  ],
  "submitter": "Michael Rubinstein",
  "history": [],
  "commentary": "Mestre ten-root construction, roots 0,13,20,38,80,135,140,143,185,198: 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 >= 15: the 15 listed points come from the point search and are independent (height matrix nonsingular at 57 and 115 digits). Torsion trivial.",
  "created_at": "2026-11-04 15:52:29",
  "updated_at": "2026-11-04 15:52:29"
}