From 39cf4b6afdfb96c1ed91abba515d9ff136d365ed Mon Sep 17 00:00:00 2001 From: Dimitris Apostolou Date: Tue, 14 Jan 2025 11:24:59 +0200 Subject: [PATCH] Fix typos --- src/product_tree.rs | 2 +- src/scalar/ristretto255.rs | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/src/product_tree.rs b/src/product_tree.rs index 3be6bde5..f65fd057 100644 --- a/src/product_tree.rs +++ b/src/product_tree.rs @@ -272,7 +272,7 @@ impl ProductCircuitEvalProofBatched { .collect::>(); let mut rand = Vec::new(); for layer_id in (0..num_layers).rev() { - // prepare paralell instance that share poly_C first + // prepare parallel instance that share poly_C first let len = prod_circuit_vec[0].left_vec[layer_id].len() + prod_circuit_vec[0].right_vec[layer_id].len(); diff --git a/src/scalar/ristretto255.rs b/src/scalar/ristretto255.rs index b678d5ae..ee4a7525 100755 --- a/src/scalar/ristretto255.rs +++ b/src/scalar/ristretto255.rs @@ -454,7 +454,7 @@ impl Scalar { // // and computing their sum in the field. It remains to see that arbitrary 256-bit // numbers can be placed into Montgomery form safely using the reduction. The - // reduction works so long as the product is less than R=2^256 multipled by + // reduction works so long as the product is less than R=2^256 multiplied by // the modulus. This holds because for any `c` smaller than the modulus, we have // that (2^256 - 1)*c is an acceptable product for the reduction. Therefore, the // reduction always works so long as `c` is in the field; in this case it is either the