diff --git a/README.md b/README.md
index f2a9c80ae..7af21f49a 100644
--- a/README.md
+++ b/README.md
@@ -4,7 +4,7 @@ Experimental folding schemes library implemented jointly by [0xPARC](https://0xp
 
 <img align="right" style="width:30%;min-width:250px;margin-bottom:20px;" src="https://privacy-scaling-explorations.github.io/sonobe-docs/imgs/sonobe.png">
 
-<b>Sonobe</b> is a modular library to fold arithmetic 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> is a modular library to fold arithmetic 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 fits their needs.
 <br><br>
 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.
 <br><br>
@@ -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$).
 
 
@@ -64,7 +64,7 @@ The development flow using Sonobe looks like:
 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
+4. Generate the decider verifier
 
 <p align="center">
     <img src="https://privacy-scaling-explorations.github.io/sonobe-docs/imgs/sonobe-lib-pipeline.png"/>
diff --git a/folding-schemes/src/lib.rs b/folding-schemes/src/lib.rs
index 51d2ecc4d..b43e49a0c 100644
--- a/folding-schemes/src/lib.rs
+++ b/folding-schemes/src/lib.rs
@@ -98,7 +98,7 @@ pub enum Error {
 
 /// FoldingScheme defines trait that is implemented by the diverse folding schemes. It is defined
 /// over a cycle of curves (C1, C2), where:
-/// - C1 is the main curve, which ScalarField we use as our F for al the field operations
+/// - C1 is the main curve, which ScalarField we use as our F for all the field operations
 /// - C2 is the auxiliary curve, which we use for the commitments, whose BaseField (for point
 /// coordinates) are in the C1::ScalarField.
 /// In other words, C1.Fq == C2.Fr, and C1.Fr == C2.Fq.