The challenge base point has order
OpenECDLP.P_ordercryptographyelliptic-curvesnumber-theory
The challenge base point has additive order exactly :
The benchmark asserts that is a point of large prime order ; this theorem certifies that assertion, so the subgroup has exactly elements and the discrete logarithm in it is well defined modulo .
Formalization Note. addOrderOf is Mathlib's order of an element of an additive group; the group law on ECDLP.E.toAffine.Point requires the Fact (Nat.Prime ECDLP.p) instance, which is the theorem's only hypothesis.
Preamble
import Mathlib import Definitions.Def_ECDLPChallengeData
Formal statement
namespace ECDLP theorem P_order [Fact (Nat.Prime ECDLP.p)] : addOrderOf ECDLP.P = ECDLP.n := 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.