M src/spartan/mod.rs → src/spartan/mod.rs

@@ -357,7 +357,7 @@ },
     ));
 
     // We will now reduce a vector of claims of evaluations at different points into claims about them at the same point.
-    // For example, eval_W =? W(r_y[1..]) and eval_W =? E(r_x) into
+    // For example, eval_W =? W(r_y[1..]) and eval_E =? E(r_x) into
     // two claims: eval_W_prime =? W(rz) and eval_E_prime =? E(rz)
     // We can them combine the two into one: eval_W_prime + gamma * eval_E_prime =? (W + gamma*E)(rz),
     // where gamma is a public challenge

M src/spartan/sumcheck.rs → src/spartan/sumcheck.rs

@@ -43,7 +43,7 @@ return Err(NovaError::InvalidSumcheckProof);
       }
 
       // we do not need to check if poly(0) + poly(1) = e, as
-      // decompress() call above already ensures that hods
+      // decompress() call above already ensures that holds
       debug_assert_eq!(poly.eval_at_zero() + poly.eval_at_one(), e);
 
       // append the prover's message to the transcript