How Zk-SNARKs Work

Epistemic status: low

1. Translate the check function into a polynomial equation (how do you translate information into a polynomial equation?)
2. Verifier picks a random point encrypted using homomorphic encryption
3. The prover computes the polynomial encrypting the values in the polynomial
4. The verifier checks equality in encrypted form zero knowledge is achieved by adding some random numbers to both sides

One downside to SNARKs is that they need a trusted setup which some consider a flaw.

See also:

• Trust models