Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The FrontierMath ECDLP challenge: the secret scalar exists

Open
ECDLP.ecdlp_challenge

by LG · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

cryptographyelliptic-curvesnumber-theory

For the concrete FrontierMath challenge instance — the curve E:y2=x3+ax+bE : y^2 = x^3 + ax + bE:y2=x3+ax+b over Fp\mathbb{F}_pFp​ with the published 256-bit data (p,a,b,P,Q,n,h)(p, a, b, P, Q, n, h)(p,a,b,P,Q,n,h) — there exists a natural number xxx with

1≤x<nandQ=xP,1 \le x < n \quad \text{and} \quad Q = xP,1≤x<nandQ=xP,

where xPxPxP is the xxx-fold sum of PPP 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 xxx with Q=xPQ = xPQ=xP recovers the benchmark's answer. The instance is chosen so that no known attack finds xxx feasibly: nnn 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 ppp be a prime'. The goal is an existence statement: a proof that locates QQQ in ⟨P⟩\langle P\rangle⟨P⟩ abstractly without exhibiting the scalar satisfies the Lean statement but does not recover the benchmark's secret (see the mission's Formalization scope).

Preamble
import Mathlib
import Definitions.Def_ECDLPChallengeData
Formal statement
namespace ECDLP

theorem ecdlp_challenge [Fact (Nat.Prime ECDLP.p)] :
    ∃ x : ℕ, 1 ≤ x ∧ x < ECDLP.n ∧ ECDLP.Q = x • 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
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me