liveBook · Manning

Prover

A prover is the participant in a proof protocol who provides evidence for a claimed statement or knowledge of secret information.

How 2 Manning books explain it

Elliptic Curve Cryptography for Developers

A prover is the party in a proof protocol that claims a statement or knowledge of secret information and supplies evidence for that claim.

How it is used
Uses private witnesses to establish claims in privacy-preserving certificates, blockchain transactions, medical records, and zero-knowledge protocols.
How deep it goes
Develops the role from protocol interaction through QAP wires, gates, interpolation functions, modular values, and proof construction.
Examples
Uses digital certificates, anonymous blockchain transfers, Ali Baba’s cave, and a hidden-patient medical-record QAP.
What you can do after
Evaluate/understand how a prover turns private witness data into verifiable interactive or noninteractive proof evidence.

Read how Elliptic Curve Cryptography for Developers explains prover →

Real-World Cryptography

A prover is the participant in a proof protocol who generates evidence for a claimed statement or computation.

How it is used
Uses constrained polynomial construction and hidden evaluation to generate evidence for a claimed program output.
How deep it goes
Descends through polynomial interpolation, random-point evaluation, and exponentiation while leaving verifier completion as the next step.
Examples
Uses f(1) = a × (b + 3) – m and its selector-polynomial form f1(x) to illustrate constrained contributions.
What you can do after
Evaluate/understand how a prover converts secret-dependent computation into hidden polynomial evaluations for verification.

Read how Real-World Cryptography explains prover →

Related concepts

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.