Common reference string
A common reference string is publicly available setup data shared by participants in a cryptographic proof system.
Elliptic Curve Cryptography for Developers
A common reference string is publicly available setup data shared by the prover and verifier in a cryptographic proof system.
- How it is used
- Supplies public QAP-bound setup points for noninteractive zk-SNARK proof creation and pairing-based verification.
- How deep it goes
- Derives CRS point families, expands verifier equations, and maps setup through serialization into C routines.
- Examples
- Walks through snark_qap, snark_crs, snark_proof, and snark_verify plus loops for z powers, θᵢ, curve points, and file output.
- What you can do after
- Build it from scratch by deriving QAP-dependent scalars, converting them to curve points, and writing a CRS file.
Read how Elliptic Curve Cryptography for Developers explains common reference string →
Real-World Cryptography
A publicly available set of parameters and common values established before participants execute a cryptographic proof system.
- How it is used
- Frames zero-knowledge proof setup as a choice among trusted, universal, and transparent parameter-generation models.
- How deep it goes
- Explains setup types, forgeable-proof secrets, MPC mitigation, circuit scope, and transparent operation without implementation detail.
- Examples
- Uses general-purpose proof systems and a hidden-input Sudoku-solving proof to illustrate the surrounding zero-knowledge setting.
- What you can do after
- Evaluate setup trust, circuit reuse, proof-forging risk, and transparent alternatives when comparing zero-knowledge proof systems.
Read how Real-World Cryptography explains common reference string →
Related concepts
- quadratic arithmetic programuses · A quadratic arithmetic program is a polynomial constraint representation of an arithmetic computation in which the computation's validity is expressed through quadratic polynomial relationships.
- zero-knowledge proofconfigures · A zero-knowledge proof is a cryptographic protocol in which a prover demonstrates a statement’s truth without revealing information beyond its validity.
- toxic wasteconfigured by · Toxic waste is secret randomness and intermediate setup data whose disclosure can compromise the security assumptions of a cryptographic reference string.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.