Nova/README.md
README.mdRaw
1# Nova: Recursive SNARKs without trusted setup
2
3Nova 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).
4
5Recursive 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](https://eprint.iacr.org/2020/758.pdf). 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](https://eprint.iacr.org/2021/370).
6
7This repository provides `nova-snark,` a Rust library implementation of Nova.
8
9To run tests (we recommend the release mode to drastically shorten run times):
10```text
11cargo test --release
12```
13
14To run example:
15```text
16cargo run --example minroot
17```
18
19## References
20[Nova: Recursive Zero-Knowledge Arguments from Folding Schemes](https://eprint.iacr.org/2021/370) \
21Abhiram Kothapalli, Srinath Setty, and Ioanna Tzialla \
22CRYPTO 2022
23
24## Acknowledgments
25See the contributors list [here](https://github.com/microsoft/Nova/graphs/contributors)
26
27## Contributing
28
29This project welcomes contributions and suggestions. Most contributions require you to agree to a
30Contributor License Agreement (CLA) declaring that you have the right to, and actually do, grant us
31the rights to use your contribution. For details, visit https://cla.opensource.microsoft.com.
32
33When you submit a pull request, a CLA bot will automatically determine whether you need to provide
34a CLA and decorate the PR appropriately (e.g., status check, comment). Simply follow the instructions
35provided by the bot. You will only need to do this once across all repos using our CLA.
36
37This project has adopted the [Microsoft Open Source Code of Conduct](https://opensource.microsoft.com/codeofconduct/).
38For more information see the [Code of Conduct FAQ](https://opensource.microsoft.com/codeofconduct/faq/) or
39contact [opencode@microsoft.com](mailto:opencode@microsoft.com) with any additional questions or comments.
40
41## Trademarks
42
43This project may contain trademarks or logos for projects, products, or services. Authorized use of Microsoft
44trademarks or logos is subject to and must follow
45[Microsoft's Trademark & Brand Guidelines](https://www.microsoft.com/en-us/legal/intellectualproperty/trademarks/usage/general).
46Use of Microsoft trademarks or logos in modified versions of this project must not cause confusion or imply Microsoft sponsorship.
47Any use of third-party trademarks or logos are subject to those third-party's policies.