Project · Build a Schnorr-based NIZK of knowledge

Implement Schnorr's identification protocol as a non-interactive zero-knowledge proof (NIZK) using Fiat-Shamir, with optional message binding. Submit: Python or Rust code that (a) generates a keypair over secp256k1 or Ed25519, (b) produces a NIZK proof of knowledge of the secret key, binding an optional message, (c) verifies the proof. Include a soundness test that produces 10,000 proofs with a forged witness and confirms 0 verify. Include a ZK test: a simulator that produces a valid-looking transcript from only the public key and a random challenge.

• Working code that generates and verifies a zero-knowledge proof for the stated statement.
• A README distinguishing what's hidden (the witness) from what's revealed (the public statement).
• One reproducible benchmark number: prover time, verifier time, and proof size.

• The zero-knowledge property is stated up-front: what an adversary can and cannot learn from the proof.
• The soundness bound is documented with its concrete security parameter.
• Proof size and timings match published numbers for the scheme within 3×, or the gap is explained.