arnaucube/Nova
1
0
Fork 0
mirror of https://github.com/arnaucube/Nova.git synced 2026-01-09 07:31:28 +01:00
Code Issues Projects Releases Wiki Activity

Update README.md (#72)

Browse Source
This commit is contained in:
Srinath Setty
2022-05-18 09:03:24 +05:30
committed by GitHub
parent 4970826f0f
commit b080bac949
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@@ -2,9 +2,9 @@
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). The details of Nova are described in our [paper](https://eprint.iacr.org/2021/370). Recursive SNARKs including Nova have a wide variety of applications such as constructions of 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. 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.
This repository provides `nova-snark,` a Rust library library implementation of Nova.
This repository provides `nova-snark,` a Rust library implementation of Nova.
To run tests, run:
To run tests:
```text
cargo test
```