The FrontierMath ECDLP challenge: the secret scalar exists
OpenECDLP.ecdlp_challengeFor the concrete FrontierMath challenge instance — the curve over with the published 256-bit data — there exists a natural number with
where is the -fold sum of under the elliptic-curve group law. This is the mathematical core of the benchmark's task: the secret scalar exists in the stated range, and a proof that exhibits a witness with recovers the benchmark's answer. The instance is chosen so that no known attack finds feasibly: is prime, the curve is not anomalous, and its embedding degree is large.
Formalization Note. The only hypothesis is the Fact (Nat.Prime ECDLP.p) instance needed for the group law, matching the source's 'let be a prime'. The goal is an existence statement: a proof that locates in abstractly without exhibiting the scalar satisfies the Lean statement but does not recover the benchmark's secret (see the mission's Formalization scope).
import Mathlib import Definitions.Def_ECDLPChallengeData
namespace ECDLP
theorem ecdlp_challenge [Fact (Nat.Prime ECDLP.p)] :
∃ x : ℕ, 1 ≤ x ∧ x < ECDLP.n ∧ ECDLP.Q = x • ECDLP.P := by sorry
end ECDLPConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.