Meaning
Succinct non-interactive arguments of knowledge provide a method for verifying complex computations with minimal data overhead. The groth16 snark is a specific pairing-based protocol that offers the smallest proof size among widely used zero-knowledge systems. It allows a verifier to confirm that a calculation was performed correctly without the prover sharing the input data.
The protocol is restricted to circuits that do not change after the initial setup.
Setup Ceremony
Structured reference strings require a pre-computation phase before any proofs can be generated. The groth16 snark uses this one-time generation of parameters to enable its succinct verification properties. Trusted participants must destroy the entropy used during this phase to ensure no one can forge a false proof later.
Prover Performance
Generating a valid witness requires the prover to perform large-scale multi-scalar multiplications and fast Fourier transforms. Because a groth16 snark involves intensive arithmetic, specialized hardware is often used to speed up the creation of proofs for complex commercial logic. The time taken to generate a proof increases with the number of gates in the circuit.
Higher complexity allows for more intricate business rules to be validated within a single proof.
Verification Speed
Checking a proof is a constant-time operation regardless of the complexity of the underlying computation. Implementing a groth16 snark allows a blockchain or a database to verify thousands of transactions per second. This efficiency makes it the preferred choice for scaling solutions that require low-cost verification.