Introduction to ZK
For anyone who wants to learn how zero knowledge proofs work
Last updated
For anyone who wants to learn how zero knowledge proofs work
Last updated
A zero knowledge proof (ZKP or just ZK) is a proof of computation satisfying:
Succinctness: the size of the proof is constant (or in some cases logarithmic) in the size of the computation
Zero knowledge: certain inputs or intermediate variables of the computation can be hidden from the verifier of the proof
Contrary to the name, the succinctness property is more central to current applications of ZK, whereas the zero knowledge aspect is often not used and can be turned off. Succinctness allows us to compress expensive computations into ZKPs that are computationally cheap to verify:
The general dynamic of a zero knowledge proof is that a Prover generates a ZKP of an expensive computation and sends the (constant sized) ZKP to a Verifier. Because the ZKP is constant sized, the Verifier can run a cheap constant time verification algorithm on the ZKP: if it passes, then the Verifier is assured that the Prover executed the claimed computation truthfully. Most importantly, the Verifier has this assurance without trusting the Prover. The precise assurance is of the form
under certain cryptographic assumptions, ___ is true with probability .
There are now developer toolkits with varying levels of abstraction (Rust/Go/Javascript API libraries, domain-specific languages) to translate arbitrary NP computations to ZK circuits. Given computation-specific inputs, a ZK circuit generates a ZK proof to be submitted to the Verifier.
This step of translation from familiar computation to ZK circuit is tricky: at their core, ZK "circuits" are closer in spirit to circuits in hardware chips than normal computer programs (in CS lingo: ZK circuits are not specified in a Turing complete language). There are still many improvements to be made in ZK circuit design. This is where we need brilliant minds (that's you!) to join us and innovate.
In a ZK circuit, a computation is represented as a collection of vectors together with imposed constraints (aka relations) between certain entries in the vectors. For example, computing 1 + 1 = 2 could be saying we have a vector (a, b, c) and constraints
One way to think about constraints is that in a trustless environment, all entries of the vector can be adversarially selected, and your only safeguards are the constraints you impose on these numbers. Continuing the example, if we didn't have the last constraint a + b == c, then I could supply c = 0 and all our constraints would still be satisfied!
There are different ways to translate a standard computation into such a collection of vectors and constraints - these are called arithmetizations. Nowadays there are developer "front-ends" with different levels of abstraction and customizability for translating a ZK circuit into an arithmetization.
The choice of an arithmetization and a front-end for writing in that arithmetization is the closest thing to choosing a programming language in ZK.
Once we have an arithmetization (vectors + constraints), the prover-verifier dynamic goes as follows:
The Prover sends the Verifier some commitment to the vectors and further commitments (details omitted) to the constraints.
The Verifier sends the Prover some random numbers
Prover uses the previous commitment, along with some cryptography, to give a proof that the supplied vectors actually satisfies the claimed constraints (aka, the computation did what it claimed to do).
Use elliptic curve cryptography (not quantum-secure, additional assumptions for security, slower runtime)
In the real world, after you have designed your [hardware] circuit its performance is governed by the laws of physics. In ZK, circuit performance is governed by the laws of math, and polynomial commitment schemes specify which laws apply.
To choose a ZK proving stack and start building:
Choose what polynomial commitment scheme to prover/verifier will use. Often this choice is baked into the choice of arithmetization.
Find an existing library that generates proofs from a given arithmetization. (Not recommended: rolling your own.)
Everything is largely the same. The main difference is that the Verifier is now a smart contract. This means that a smart contract runs the algorithm to verify a ZK SNARK supplied by the Prover. This enables powerful modularity and composability: the smart contract can programmatically perform further actions depending on whether the SNARK is verified correctly or not. For more details about how to produce SNARK verifier smart contracts, see this page.
Why is ZK not used more prevalently if it can compress any computation? One reason is that only recently have the developer tooling and cryptographic systems become expressive and stable enough for people to actual build on top of them.
There are also some intrinsic challenges related to the nature of ZK circuits:
While proof size and proof verification time are constant, the runtime to generate a proof is far from it. Right now, the estimated overhead of generating a proof for a particular computation is around 100-1000x. This is an active engineering problem with many facets for improvement:
Improving circuit design - this involves finding the optimal way to translate a computation into an arithmetization.
General performance engineering - some of the open source code used for proof generation was developed for other purposes, and serious performance optimization has not been applied yet.
Choice of proving system: the combination of arithmetization and polynomial commitment scheme forms a proving system. New research in this area can lead to step change improvements in performance.
Hardware: many core algorithms (Fast Fourier Transform, Elliptic Curve Multiscalar Multiplication) involved in the polynomial commitments can be parallelized or otherwise optimized using GPUs, FPGAs, ASICs.
in a circuit, we need to compute both f(b) and g(b) and then return a * f(b) + (1 - a) * g(b) (assuming that a is either 0 or 1).
This difference means that:
Operations that are cheap for bits (bit shifts, AND, XOR, OR) are expensive to implement in ZK.
Since ZK circuits still need to be implemented in traditional architectures, the implementation of things like finite field arithmetic adds another layer of overhead to all computations.
The potential of things ZK can build is tremendous and only increasing exponentially. We believe that a key ingredient in successfully building new ZK applications is to have a good understanding of the current features and limitations of ZKPs.
We haven't gone into the weeds of the math involved with ZK.
And of course, contact us to ask questions, give suggestions, and discuss further!
The above procedure is interactive, since the Verifier needs to provide randomness, but we remark that there is a general way to make it non-interactive: see . In the non-interactive protocol, the prover does all of their steps first and sends the result to the verifier. The Fiat-Shamir Heuristic allows the verifier to then verify the proof with the same assurance of correctness as if the whole process had been interactive.
We skipped over some cryptographic details in our overview of the . Namely, what are commitments? One can think of a commitment as a more expressive hash: it pins down the vector so you can't change it later, but still allows you to perform some operations on the hashes which tell you useful information.
The question of how to commit to vectors is an area of active research. First, most vector commitments translate a vector into a polynomial (by ) and work with the polynomial. Then, broadly speaking, they currently fall into two categories:
Hash the polynomials and do some sampling (proof sizes are larger, additional for security)
For an overview of polynomial commitments from the API perspective, see this .
The choice of which polynomial commitment scheme to use is extremely important for the performance and security of the entire ZKP process. The speed of proof generation ( in the prover-verifier dynamic) and cost of proof verification hinge upon this choice.
First, choose which to use, along with a developer front-end for writing circuits in that arithmetization.
with the Halo2 frontend.
The polynomial commitment scheme.
Privacy Scaling Explorations' of the Halo2 backend, which supports KZG commitments.
We described the in a general off-chain setting above. How does it translate to using ZK SNARKs on-chain?
As mentioned , a ZK circuit in its purest form is not Turing complete (you cannot have recursive functions or infinite loops). It also does not behave in the way we are used to a general purpose VM (e.g., LLVM) behaving. For example, the notion of an "if" statement is very different: assuming boolean a, to replicate
There are ways to build general or customized VMs from ZK circuits using the principles of recursion and aggregation of ZK circuits. For example, to create a ZKP of f(g(x)), you would create ZKP A for y == g(x) and then a ZKP B that verifies the proof A: y == g(x) and further computes f(y). This is a more advanced topic which we will write about in more depth later, but for now we direct the interested reader to this blog .
A fundamental difference between traditional compute and all ZK circuits is the numerical system the compute is applied on top of. In traditional architecture, we work in the world of bits: numbers are uint32, uint64, int32, int64, etc. Meanwhile, due to the cryptographic underpinnings behind ZK, all ZK circuits involve , i.e., numbers are element in a finite field. This usually means there is a special prime number p, and then all operations are performed modulo p.
There are continual developments to overcome this challenge, such as ZK friendly or using "lookup tables" for ZK-unfriendly operations, but for now it is still a source of difficulties for performance and development.
For the classic explanation of ZKPs that you can repeat at dinner parties (no math): see
For a more math-y intro that gives a better flavor of how ZK works now, see Vitalik's post on QAPs . This uses a more straightforward arithmetization known as R1CS.