Skip to content
Browse files

Document that we also implement the Groth16 proof system.

  • Loading branch information...
madars committed Jun 18, 2019
1 parent bd2a6ca commit 477c9dfd07b280e42369f82f89c08416319e24ae
Showing with 13 additions and 0 deletions.
  1. +13 −0
@@ -67,6 +67,13 @@ The libsnark library currently provides a C++ implementation of:
optimizes the approach described in \[BCTV14a], itself an extension of
\[BCGTV13], following the approach of \[GGPR13] and \[BCIOP13]. (An alternative
implementation of this approach is the _Pinocchio_ system of \[PGHR13].)

The library also implements a zk-SNARK for R1CS secure in the generic group model
\[Groth16]. Compared to \[BCTV14a] the \[Groth16] proof system is faster and
achieves shorter proofs, at expense of making stronger security assumptions.

We provide [detailed empirical and asymptotic comparison](
between these choices.
2. A preprocessing SNARK for a language of arithmetic circuits, "BACS"
(_Bilinear Arithmetic Circuit Satisfiability_). This simplifies the writing
of NP statements when the additional flexibility of R1CS is not needed.
@@ -618,6 +625,12 @@ References
George Danezis, Cedric Fournet, Jens Groth, Markulf Kohlweiss,

\[Groth16] [
On the Size of Pairing-based Non-interactive Arguments
Jens Groth,

\[GM17] [
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable

0 comments on commit 477c9df

Please sign in to comment.
You can’t perform that action at this time.