arnaucube/sonobe
1
1
Fork 0
mirror of https://github.com/arnaucube/sonobe.git synced 2026-02-06 03:06:44 +01:00
Code Issues Packages Projects Releases Wiki Activity

Add HyperNova's NIMFS circuit (#99)

Browse Source 
* add HyperNova's NIMFS verifier circuit

* update poseidon usage after rebasing to latest main branch changes
This commit is contained in:
arnaucube
2024-06-04 10:57:39 +02:00
parent 852134a898
commit 59b8bdb0c4
12 changed files with 604 additions and 204 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@@ -42,7 +42,7 @@ Detailed usage and design documentation can be found at [Sonobe docs](https://pr
### Folding Schemes introduction
Folding schemes efficitently achieve incrementally verifiable computation (IVC), where the prover recursively proves the correct execution of the incremental computations.
Folding schemes efficiently achieve incrementally verifiable computation (IVC), where the prover recursively proves the correct execution of the incremental computations.
Once the IVC iterations are completed, the IVC proof is compressed into the Decider proof, a zkSNARK proof which proves that applying $n$ times the $F$ function (the circuit being folded) to the initial state ($z_0$) results in the final state ($z_n$).