The challenge subgroup order is prime
ProvedECDLP.n_primecryptographynumber-theory
The subgroup order of the FrontierMath ECDLP challenge,
is a prime number. The benchmark presents as the 254-bit prime order of the base point ; this theorem certifies that assertion. Primality of is what makes the challenge resistant to the Pohlig–Hellman reduction and makes the discrete logarithm in unique modulo .
Formalization Note. The statement is Nat.Prime applied to the concrete natural number ECDLP.n from the challenge-data definition.
Preamble
import Mathlib import Definitions.Def_ECDLPChallengeData
Formal statement
namespace ECDLP theorem n_prime : Nat.Prime 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.