Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniqueness of the discrete logarithm below the order

Proved
ECDLP.dlog_unique

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

cryptographygroup-theorynumber-theory

Let GGG be an additive commutative group and P∈GP \in GP∈G an element of order nnn. If a,ba, ba,b are natural numbers with a<na < na<n and b<nb < nb<n and

aP=bP,aP = bP,aP=bP,

then a=ba = ba=b. In other words, the discrete logarithm in the cyclic subgroup ⟨P⟩\langle P\rangle⟨P⟩ is unique in the range [0,n)[0, n)[0,n); applied to the challenge base point, this shows that the benchmark's secret xxx with 1≤x<n1 \le x < n1≤x<n and Q=xPQ = xPQ=xP is the unique such integer.

Formalization Note. The order is Mathlib's addOrderOf, and a • P is the additive-monoid scalar multiplication (aaa-fold addition). The statement is for arbitrary additive commutative groups, so it is reusable beyond the challenge instance.

Preamble
import Mathlib
Formal statement
namespace ECDLP

theorem dlog_unique {G : Type*} [AddCommGroup G] {P : G} {n : ℕ}
    (hP : addOrderOf P = n) {a b : ℕ} (ha : a < n) (hb : b < n)
    (h : a • P = b • P) : a = b := by sorry

end ECDLP
Source
Well-definedness of the discrete logarithm in a cyclic subgroup; implicit in the Epoch AI problem statement ('the integer x with 1 <= x < n such that Q = xP'), https://epoch.ai/frontiermath/open-problems/elliptic-curve-discrete-logarithm; standard treatment: Washington, Elliptic Curves: Number Theory and Cryptography, 2nd ed., Chapman & Hall/CRC 2008, Chapter 5.
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