Groth16 Algorithm

PivotSwap adopts ZK-SNARKs as the underlying cryptographic technology to achieve zero-knowledge proofs for transaction validation. Within this framework, Groth16 is specifically chosen for its efficiency, small proof sizes, and fast verification speeds.

The Groth16 algorithm, named after its creator Jens Groth, is a non-interactive zero-knowledge proof system specifically designed for proving the knowledge of a witness to a statement without revealing any information about the underlying data. It operates on Quadratic Arithmetic Programs (QAPs), a mathematical representation of computations in zero-knowledge proof systems. PivotSwap employs QAPs to succinctly capture the relevant computations while ensuring the confidentiality of transaction details.

Efficient Zero-Knowledge Proofs:

Groth16 enables PivotSwap to generate efficient zero-knowledge proofs. Users can validate transactions without revealing specific information, ensuring privacy and confidentiality. The efficiency of these proofs contributes to a seamless user experience within the PivotSwap platform.

Smaller Proof Sizes:

One of the key advantages of Groth16 is its ability to produce smaller proof sizes compared to other zk-SNARK algorithms. This feature is instrumental in helping PivotSwap minimize the data transmitted and stored, leading to faster, optimized performance and reduced computational overhead.

	Proof Size	Prover	Verifier
Fractal	250 kB
Halo	20 kB
SuperSonic	8 kB		75 ms
Plonk	0.5-1 kB
Marlin	1 kB		8-20 ms
Sonic	2 kB
Groth16	0.2 kB	1-2 min	1-10 ms
ZK-STARK	> 100 kB		40 ms