The challenge curve is nonsingular
ProvedECDLP.E_isEllipticcryptographyelliptic-curvesnumber-theory
The challenge curve over is an elliptic curve: its discriminant is nonzero, equivalently
This certifies the nonsingularity implicit in the benchmark's setup, where is presented as an elliptic curve.
Formalization Note. WeierstrassCurve.IsElliptic is Mathlib's typeclass asserting that the discriminant Δ is a unit; over the field this is equivalent to , and for a short Weierstrass equation to .
Preamble
import Mathlib import Definitions.Def_ECDLPChallengeData
Formal statement
namespace ECDLP theorem E_isElliptic : ECDLP.E.IsElliptic := by sorry end ECDLP
Source
Epoch AI, FrontierMath: Open Problems — The Elliptic-Curve Discrete Logarithm Problem (ECDLP), https://epoch.ai/frontiermath/open-problems/elliptic-curve-discrete-logarithm — public challenge data (p, a, b, P, Q, n, h) and Task section.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.