Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The challenge modulus ppp is prime

Proved
ECDLP.p_prime

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

cryptographynumber-theory

The modulus of the FrontierMath ECDLP challenge,

p=92031864238688105485400538143121826382268912998421731683072033206257804487869,p = 92031864238688105485400538143121826382268912998421731683072033206257804487869,p=92031864238688105485400538143121826382268912998421731683072033206257804487869,

is a prime number. The benchmark presents ppp as a 256-bit prime; this theorem certifies that assertion. It provides the Fact (Nat.Prime ECDLP.p) instance under which Fp=Z/pZ\mathbb{F}_p = \mathbb{Z}/p\mathbb{Z}Fp​=Z/pZ is a field and the elliptic-curve group law on E(Fp)E(\mathbb{F}_p)E(Fp​) 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
  • 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