AFTD Auto-Formalizing Theoretical Domains

Schnorr.Transcript

abbrevimported Lean

A Schnorr transcript is a triple $(a, c, s) \in G \times \mathbb{Z}_q \times \mathbb{Z}_q$, where $a$ is the prover's commitment (an element of the group $G$), $c \in \mathbb{Z}_q$ is the verifier's challenge, and $s \in \mathbb{Z}_q$ is the prover's response.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {G : Type*} [CommGroup G] in
variable {q : ℕ} [Fact q.Prime] in
variable (g : G) in
abbrev Schnorr.Transcript (G : Type*) (q : ℕ)
Defined in
TCSlib, `Schnorr.Transcript`
Lean proof
By Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
none listed
Used by 2
  • Schnorr.simulateThe zero-knowledge simulator, given public key $\mathit{pk}$, challenge $c$, and a fresh response $s$, outputs the transcript…
  • Schnorr.honestThe honest prover's full transcript for witness $w$, randomness $r$, and challenge $c$ is the triple…

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {G : Type*} [CommGroup G] in
variable {q : ℕ} [Fact q.Prime] in
variable (g : G) in
/-- A Schnorr transcript `(a, c, s)`: commitment in `G`, challenge and response in `ZMod q`. -/
abbrev Schnorr.Transcript (G : Type*) (q : ℕ) := G × ZMod q × ZMod q
See it in the graphDiscuss this resultChallenge it