small polishing

src/README.md

@@ -4,7 +4,7 @@ Experimental folding schemes library implemented in a joint effort by [0xPARC](h
 
 <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. <b>Sonobe</b> also provides a way for developers to generate an EVM-verifiable zkSNARK proof of correct folding.
+<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.
 
 Sonobe is conceived as an exploratory effort with the aim to push forward the practical side of folding schemes and advancing towards onchain (EVM) verification.
 
@@ -12,7 +12,7 @@ Sonobe is conceived as an exploratory effort with the aim to push forward the pr
 
 
 > **Warning**: experimental code, do not use in production.<br>
-> The code has not been audited. Several optimizations are also pending. Our focus so far has been on implementing the Nova + CycleFold proving system and achieving onchain (EVM) verification.
+> The code has not been audited. Several optimizations are also pending. Our focus so far has been on implementing the Nova and CycleFold schemes and achieving onchain (EVM) verification.
 
 
 ## Schemes implemented

src/folding-and-sonobe.md

@@ -21,17 +21,17 @@ The next 3 videos provide a good overview of folding schemes:
 
 ## Sonobe overview
 
-Sonobe is a modular folding schemes library. It allows developers to fold R1CS instances in an Incremental Verifiable computation (IVC) style. It also provides tools required to generate a zkSNARK out of an IVC proof. Developers can configure sonobe so that those proofs can also be verified on Ethereum's EVM.
+Sonobe is a folding schemes modular library to fold arithmetic circuit instances in an incremental verifiable computation (IVC) style. It also provides the tools required to generate a zkSNARK proof out of an IVC proof and to verify it on Ethereum's EVM.
 
 The development flow using Sonobe looks like:
 
-1. Define a circuit to be folded. This is done using a frontend such as [`circom`](https://github.com/iden3/circom) or [arkworks](https://github.com/arkworks-rs/r1cs-std).
-2. Set which folding scheme to be used (eg. Nova).
-3. Set a final decider to generate the final proof (eg. Spartan over Pasta curves).
-4. Generate the decider verifier.
+1. Define a circuit to be folded
+2. Set which folding scheme to be used (eg. Nova with CycleFold)
+3. Set a final decider to generate the final proof (eg. Spartan over Pasta curves)
+4. Generate the the decider verifier
 
 <p align="center">
-    <img src="imgs/sonobe-lib-pipeline.png" style="width:70%;" />
+    <img src="imgs/sonobe-lib-pipeline.png" />
 </p>
 
 The folding scheme and decider used can be swapped respectively with a few lines of code (eg. switching from a Decider that uses two Spartan proofs over a cycle of curves, to a Decider that uses a single Groth16 proof over the BN254 to be verified in an Ethereum smart contract).

src/usage/decider-prove.md

@@ -45,6 +45,3 @@ let (pk, vk) =
 let decider_pp = (poseidon_config.clone(), g16_pk, kzg_pk);
 let proof = DECIDER::prove(decider_pp, rng, nova.clone()).unwrap();
 ```
-
-As mentioned above, complete examples can be found at [sonobe/folding-schemes/examples](https://github.com/privacy-scaling-explorations/sonobe/tree/main/folding-schemes/examples)
-

src/usage/frontend.md

@@ -1,6 +1,6 @@
 # Frontend
 
-The frontend interface allows to define the circuit to be folded. The currently available frontends are [`circom`](https://github.com/iden3/circom) or [arkworks](https://github.com/arkworks-rs/r1cs-std). We will show here how to define a circuit using `arkworks`.
+The frontend interface allows to define the circuit to be folded. The currently available frontends are [`circom`](https://github.com/iden3/circom) and [arkworks](https://github.com/arkworks-rs/r1cs-std). We will show here how to define a circuit using `arkworks`.
 
 # The `FCircuit` trait
 
@@ -219,4 +219,4 @@ impl FCircuit for ACircuitWithPrivateState {
     }
 }
 
-```
+```

src/usage/solidity-verifier.md

@@ -2,7 +2,7 @@
 
 Having used the `Decider` from `decider_eth.rs`, we can now verify it in Ethereum's EVM.
 
-First we need to generate the Solidity contracts that verify the Decider proofs. Use the [solidity-verifiers-cli](cli) tool
+First we need to generate the Solidity contracts that verify the Decider proofs. Use the [solidity-verifiers-cli](https://github.com/privacy-scaling-explorations/sonobe/tree/main/cli) tool
 ```
 > solidity-verifier-cli -p nova-cyclefold -d ./folding-verifier-solidity/assets/G16_test_vk_data
 ```