SuperNova is a new recursive proof system for incrementally producing succinct proofs of the correct execution of programs on a stateful machine with a particular instruction set.
These seem to be fantastic features. This article will mainly interpret how these features are implemented.
- What is folding?
- Represent computation with R1CS
- Nova: NIVC for a single instruction
- SuperNova: NIVC for multiple instructions(ZKVM)
- Different with other Recursion
For details of this article, check out Sin7y Tech Review (34): Is SuperNova’s Folding Scheme the Endgame for ZK?
If you have any questions about SuperNova’s Folding Scheme, please feel free to contact us at <firstname.lastname@example.org >. Welcome to follow Ola’s official Twitter, join our Discord server, and get the latest updates from Ola!
This weekly report aims to provide an update on the latest developments and news related to Sin7y — Ola and zero-knowledge cryptography, which has the potential to revolutionize the way we approach privacy and security in the digital age. We will continue to monitor and report on the latest developments in this field. Please write to <email@example.com> if you’d like to join or partner with us.
1 post – 1 participant