14 releases (7 breaking)

Uses new Rust 2021

0.8.1 Aug 23, 2022
0.7.2 Aug 10, 2022
0.7.1 Jul 14, 2022
0.4.0 Oct 20, 2021

#444 in Cryptography

Download history 6/week @ 2022-06-15 14/week @ 2022-06-22 24/week @ 2022-06-29 67/week @ 2022-07-06 49/week @ 2022-07-13 22/week @ 2022-07-20 35/week @ 2022-07-27 42/week @ 2022-08-03 49/week @ 2022-08-10 31/week @ 2022-08-17 39/week @ 2022-08-24 13/week @ 2022-08-31 71/week @ 2022-09-07 93/week @ 2022-09-14 104/week @ 2022-09-21 115/week @ 2022-09-28

384 downloads per month
Used in 2 crates (via lurk)

Custom license

245KB
6.5K SLoC

Nova: Recursive SNARKs without trusted setup

Nova is a high-speed recursive SNARK (a SNARK is type cryptographic proof system that enables a prover to prove a mathematical statement to a verifier with a short proof and succinct verification, and a recursive SNARK enables producing proofs that prove statements about prior proofs).

Recursive SNARKs including Nova have a wide variety of applications such as Rollups, verifiable delay functions (VDFs), succinct blockchains, and incrementally verifiable versions of verifiable state machines. A distinctive aspect of Nova is that it is the simplest recursive proof system in the literature, yet it provides the fastest prover. Furthermore, it achieves the smallest verifier circuit (a key metric to minimize in this context): the circuit is constant-sized and its size is dominated by two group scalar multiplications. The details of Nova are described in our CRYPTO 2022 paper.

This repository provides nova-snark, a Rust library implementation of Nova.

To run tests:

cargo test

References

Nova: Recursive Zero-Knowledge Arguments from Folding Schemes
Abhiram Kothapalli, Srinath Setty, and Ioanna Tzialla
CRYPTO 2022

Acknowledgments

See the contributors list here

Contributing

This project welcomes contributions and suggestions. Most contributions require you to agree to a Contributor License Agreement (CLA) declaring that you have the right to, and actually do, grant us the rights to use your contribution. For details, visit https://cla.opensource.microsoft.com.

When you submit a pull request, a CLA bot will automatically determine whether you need to provide a CLA and decorate the PR appropriately (e.g., status check, comment). Simply follow the instructions provided by the bot. You will only need to do this once across all repos using our CLA.

This project has adopted the Microsoft Open Source Code of Conduct. For more information see the Code of Conduct FAQ or contact opencode@microsoft.com with any additional questions or comments.

Trademarks

This project may contain trademarks or logos for projects, products, or services. Authorized use of Microsoft trademarks or logos is subject to and must follow Microsoft's Trademark & Brand Guidelines. Use of Microsoft trademarks or logos in modified versions of this project must not cause confusion or imply Microsoft sponsorship. Any use of third-party trademarks or logos are subject to those third-party's policies.

Dependencies

~18MB
~303K SLoC