Schnorr.honest
defimported Lean
The honest prover's full transcript for witness $w$, randomness $r$, and challenge $c$ is the triple $(\mathrm{commit}(g, r),\; c,\; \mathrm{respond}(w, r, c))$, i.e.\ $(g^r,\, c,\, r + c \cdot w)$.
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 def Schnorr.honest (w r c : ZMod q) : Transcript G q
- Defined in
- TCSlib, `Schnorr.honest`
- 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.Schnorr.honest← Schnorr.honest (TCSlib/Cryptography/SchnorrProtocol.lean:53): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- Schnorr.TranscriptA 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…
- Schnorr.respondGiven witness $w$, randomness $r$, and challenge $c$ in $\mathbb{Z}_q$, the response is $s := r + c \cdot w \in \mathbb{Z}_q$.
- Schnorr.commitGiven randomness $r \in \mathbb{Z}_q$ and a generator $g \in G$, the commitment is $a := g^{r}$, where the exponent is taken via the…
- Used by 1
- Schnorr.schnorr_hvzkHonest-verifier zero knowledge of the Schnorr protocol. Let $G$ be a commutative group, let $q$ be prime, and let $g \in G$ be an element…
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 /-- Full honest transcript: `(commit g r, c, respond w r c)`. -/ def Schnorr.honest (w r c : ZMod q) : Transcript G q := (commit g r, c, respond w r c)