The challenge curve has rational points
OpenECDLP.card_pointscryptographyelliptic-curvesnumber-theory
The group of -rational points of the challenge curve has order with cofactor :
This is the point-count assertion of the benchmark's public data. Together with the group-structure theorem it pins down the abstract group , and it is the certified input needed for any argument that locates inside the subgroup without computing the discrete logarithm.
Formalization Note. Nat.card counts the elements of the point type ECDLP.E.toAffine.Point (including the point at infinity); the right-hand side is the concrete product ECDLP.h * ECDLP.n.
Preamble
import Mathlib import Definitions.Def_ECDLPChallengeData
Formal statement
namespace ECDLP
theorem card_points [Fact (Nat.Prime ECDLP.p)] :
Nat.card ECDLP.E.toAffine.Point = ECDLP.h * ECDLP.n := by sorry
end ECDLPSource
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.