Content
And zkSNARK, is a variant of zero-knowledge proof, which enables the prover to concisely convince any verifier of the validity of a given assertion, and achieve zero-knowledge calculations, without the need for the prover and any verifier. Interactive.
In zero-knowledge, zkSNARKs can be used to prove and verify the completeness of calculations and are expressed as NP statements. A prover who has some knowledge of NP statement verification can produce a concise proof that verifies the authenticity of the NP statement. Anyone can verify this short proof, which provides the following attributes:
Zero knowledge: The verifier can get nothing except the authenticity of the statement from the proof.
Simplicity: the proof is short and easy to verify;
Non-interactive: The proof does not require interaction between the prover and the verifier
Reliability: The proof is computationally correct (that is, it is not feasible to forge false NP statements). This proof system is also called argumentation;
Knowledge proof: This proof not only proves that the NP statement is true, but the prover knows why it is so.
These attributes together constitute zkSNARK, which represents a zero-knowledge, concise, non-interactive knowledge argumentation.
On this topic, Howard Wu, a blockchain consultant at the University of Berkeley, has studied deeply. In the course "The Rise of SNARKs" [3], he introduced the concepts of zero-knowledge proof, zkSNARKs and libsnark in detail. Interested readers can learn more .