Implementation of Nova using arkworks-rs just for learning purposes.
Warning: Implementation from scratch to learn the internals of Nova. Do not use in production.
This repo is an ongoing implementation, the code will be dirty for a while and not optimized but just to understand and experiment with the internals of the scheme and try experimental combinations.
Thanks to Levs57, Nalin Bhardwaj and Carlos Pérez for clarifications on the Nova paper.
"Nova: Recursive Zero-Knowledge Arguments from Folding Schemes" (https://eprint.iacr.org/2021/370) by Abhiram Kothapalli, Srinath Setty, Ioanna Tzialla.
Current implementation uses a cycle of pairing-friendly curves with Groth16 for the compressed IVC proofs (as an example, the tests use MNT4, MNT6 curves), once the full scheme works, will see how many constraints the circuits need and might change one of the sides to a non-pairing curve with a non-pairing proof instead of Groth16. Eventually would like to explore also using BN254 with Grumpkin for ending up verifying the proofs in Ethereum.