The challenge modulus is prime
ProvedECDLP.p_primecryptographynumber-theory
The modulus of the FrontierMath ECDLP challenge,
is a prime number. The benchmark presents as a 256-bit prime; this theorem certifies that assertion. It provides the Fact (Nat.Prime ECDLP.p) instance under which is a field and the elliptic-curve group law on is available.
Formalization Note. The statement is Nat.Prime applied to the concrete natural number ECDLP.p from the challenge-data definition.
Preamble
import Mathlib import Definitions.Def_ECDLPChallengeData
Formal statement
namespace ECDLP theorem p_prime : Nat.Prime ECDLP.p := 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.