{
  "id": 6549,
  "curve_key": "1727617199826000:-71795667404211169901400",
  "ainvs": [
    "0",
    "0",
    "1",
    "-35992024996375",
    "83096837273392557756"
  ],
  "rank_lower_bound": 15,
  "torsion": [],
  "family": null,
  "families": [],
  "naive_height": 105.25655853861946,
  "faltings_height": 6.483559034618434,
  "conductor": "549894719050365402544138247677159525",
  "bad_primes": [
    "5",
    "73",
    "1158551",
    "380084567",
    "684260212479980341"
  ],
  "discriminant": "1003557862266916859643052302010816133125",
  "regulator": "584801121758.49952779853561827809885463145733302170010626236412695515",
  "points": [
    [
      "-25628271/4",
      "56955693829/8"
    ],
    [
      "376311895",
      "-7299062133778"
    ],
    [
      "-479044781/81",
      "-6881235076855/729"
    ],
    [
      "1726434860/289",
      "-44291193392249/4913"
    ],
    [
      "479737630/121",
      "-2195379050013/1331"
    ],
    [
      "122598985/36",
      "-31310350273/216"
    ],
    [
      "1160412990/361",
      "5384345186618/6859"
    ],
    [
      "4004877265/441",
      "208154000501497/9261"
    ],
    [
      "9439302505/1024",
      "757646141293621/32768"
    ],
    [
      "-5013200",
      "11727721052"
    ],
    [
      "-6766190",
      "4106161122"
    ],
    [
      "6961075/9",
      "201546287819/27"
    ],
    [
      "193593789/169",
      "14468583678401/2197"
    ],
    [
      "21826252095/76729",
      "181446359058153341/21253933"
    ],
    [
      "-9206181245/10201",
      "11041242203549677/1030301"
    ]
  ],
  "submitter": "Michael Rubinstein",
  "history": [],
  "commentary": "Mestre ten-root construction, roots 0,8,27,51,66,72,76,126,128,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 >= 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:22",
  "updated_at": "2026-11-04 15:52:22"
}