Browse Source

add repo link

main
arnaucube 1 year ago
parent
commit
bc687724eb
2 changed files with 4 additions and 1 deletions
  1. +2
    -0
      src/README.md
  2. +2
    -1
      src/folding-and-sonobe.md

+ 2
- 0
src/README.md

@ -2,6 +2,8 @@
Experimental folding schemes library implemented in a joint effort by [0xPARC](https://0xparc.org/) and [PSE](https://pse.dev).
[**https://github.com/privacy-scaling-explorations/sonobe**](https://github.com/privacy-scaling-explorations/sonobe)
<img align="left" style="width:30%;min-width:250px;margin:20px;" src="imgs/sonobe.png">
<b>Sonobe</b> is a modular library to fold circuit instances in an Incremental Verifiable computation (IVC) style. It features multiple folding schemes and decider setups, allowing users to pick the scheme which best fit their needs.

+ 2
- 1
src/folding-and-sonobe.md

@ -2,7 +2,8 @@
## Folding schemes overview
A folding scheme is a protocol that can help build incrementally verifiable computation (IVC). This is particularly interesting in the case of iterative computations. An IVC allows to prove that a function $F$ applied $n$ times to an initial input $z_0$ results in $z_n$.
Folding schemes efficitently 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$).
<p align="center">
<img src="imgs/folding-main-idea-diagram.png" style="width:70%;" />

Loading…
Cancel
Save