Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

https://github.com/arkworks-rs/marlin

A Rust library for the Marlin preprocessing zkSNARK
https://github.com/arkworks-rs/marlin

cryptography marlin r1cs rust zksnark

Last synced: about 1 month ago
JSON representation

A Rust library for the Marlin preprocessing zkSNARK

Lists

README 

        
Marlin





    

   




`marlin` is a Rust library that implements a



preprocessing zkSNARK for R1CS


with


universal and updatable SRS




This library was initially developed as part of the [Marlin paper][marlin], and is released under the MIT License and the Apache v2 License (see [License](#license)).



**WARNING:** This is an academic prototype, and in particular has not received careful code review. This implementation is NOT ready for production use.



## Overview



A zkSNARK with **preprocessing** achieves succinct verification for arbitrary computations, as opposed to only for structured computations. Informally, in an offline phase, one can preprocess the desired computation to produce a short summary of it; subsequently, in an online phase, this summary can be used to check any number of arguments relative to this computation.



The preprocessing zkSNARKs in this library rely on a structured reference string (SRS), which contains system parameters required by the argument system to produce/validate arguments. The SRS in this library is **universal**, which means that it supports (deterministically) preprocessing any computation up to a given size bound. The SRS is also **updatable**, which means that anyone can contribute a fresh share of randomness to it, which facilitates deployments in the real world.



The construction in this library follows the methodology introduced in the [Marlin paper][marlin], which obtains preprocessing zkSNARKs with universal and updatable SRS by combining two ingredients:



* an **algebraic holographic proof**

* a **polynomial commitment scheme**



The first ingredient is provided as part of this library, and is an efficient algebraic holographic proof for R1CS (a generalization of arithmetic circuit satisfiability supported by many argument systems). The second ingredient is imported from [`poly-commit`](https://github.com/arkworks-rs/poly-commit). See below for evaluation details.



## Build guide



The library compiles on the `stable` toolchain of the Rust compiler. To install the latest version of Rust, first install `rustup` by following the instructions [here](https://rustup.rs/), or via your platform's package manager. Once `rustup` is installed, install the Rust toolchain by invoking:

```bash

rustup install stable

```



After that, use `cargo` (the standard Rust build tool) to build the library:

```bash

git clone https://github.com/arkworks-rs/marlin.git

cd marlin

cargo build --release

```



This library comes with some unit and integration tests. Run these tests with:

```bash

cargo test

```



Lastly, this library is instrumented with profiling infrastructure that prints detailed traces of execution time. To enable this, compile with `cargo build --features print-trace`.



## Benchmarks



All benchmarks below are performed over the BLS12-381 curve implemented in the [`ark-bls12-381`](https://github.com/arkworks-rs/curves/) library, with the `asm` feature activated. Benchmarks were run on a machine with an Intel Xeon 6136 CPU running at 3.0 GHz.



### Running time compared to Groth16 



The graphs below compare the running time, in single-thread execution, of Marlin's indexer, prover, and verifier algorithms with the corresponding algorithms of [Groth16][groth16] (the state of the art in preprocessing zkSNARKs for R1CS with circuit-specific SRS) as implemented in [`groth16`](https://github.com/arkworks-rs/groth16). We evaluate Marlin's algorithms when instantiated with the PC scheme from [[CHMMVW20]][marlin] (denoted "M-AHP w/ PC of [[CHMMVW20]][marlin]"), and the PC scheme from [[MBKM19]][sonic] (denoted "M-AHP w/ PC of [[MBKM19]][sonic]").





Indexer

Prover





Verifier




### Multi-threaded performance



The following graphs compare the running time of Marlin's prover when instantiated with the PC scheme from [[CHMMVW20]][marlin] (left) and the PC scheme from [[MBKM19]][sonic] (right) when executed with a different number of threads.





Multi-threaded scaling of Marlin AHP with the PC scheme from [CHMMVW20]

Multi-threaded scaling of Marlin AHP with the PC scheme from [MBKM19]




### Proof size



We compare the proof size of Marlin with that of [Groth16][groth16]. We instantiate the Marlin SNARK with the PC scheme from [[CHMMVW20]][marlin], and the PC scheme from [[MBKM19]][sonic].



|                   Scheme                   | Proof size in bytes |

|:------------------------------------------:|:---------------------:|

| Marlin AHP with PC of [[CHMMVW20]][marlin] |         880         |

| Marlin AHP with PC of [[MBKM19]][sonic]    |         784         |

|  [\[Groth16\]][groth16]                    |         192         |



## License



This library is licensed under either of the following licenses, at your discretion.



 * [Apache License Version 2.0](LICENSE-APACHE)

 * [MIT License](LICENSE-MIT)



Unless you explicitly state otherwise, any contribution that you submit to this library shall be dual licensed as above (as defined in the Apache v2 License), without any additional terms or conditions.



[marlin]: https://ia.cr/2019/1047

[sonic]: https://ia.cr/2019/099

[groth16]: https://ia.cr/2016/260



## Reference paper



[Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS][marlin]     

Alessandro Chiesa, Yuncong Hu, Mary Maller, [Pratyush Mishra](https://www.github.com/pratyush), [Psi Vesely](https://github.com/psivesely), [Nicholas Ward](https://www.github.com/npwardberkeley)     

EUROCRYPT 2020



## Acknowledgements



This work was supported by: an Engineering and Physical Sciences Research Council grant; a Google Faculty Award; the RISELab at UC Berkeley; and donations from the Ethereum Foundation and the Interchain Foundation.