From c0444f8c316509e5a87945c79b14427fa4383ba0 Mon Sep 17 00:00:00 2001 From: Dimitris Apostolou Date: Tue, 1 Sep 2020 20:45:20 +0300 Subject: [PATCH] Fix typos --- src/arithmetic/fields/fp.rs | 2 +- src/arithmetic/fields/fq.rs | 2 +- src/polycommit.rs | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/src/arithmetic/fields/fp.rs b/src/arithmetic/fields/fp.rs index f79fb070..ae99c249 100644 --- a/src/arithmetic/fields/fp.rs +++ b/src/arithmetic/fields/fp.rs @@ -209,7 +209,7 @@ impl Fp { // // 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 diff --git a/src/arithmetic/fields/fq.rs b/src/arithmetic/fields/fq.rs index 24358e3f..29babced 100644 --- a/src/arithmetic/fields/fq.rs +++ b/src/arithmetic/fields/fq.rs @@ -224,7 +224,7 @@ impl Fq { // // 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 diff --git a/src/polycommit.rs b/src/polycommit.rs index 29f6c5b9..2adeb151 100644 --- a/src/polycommit.rs +++ b/src/polycommit.rs @@ -310,7 +310,7 @@ impl Params { blind += &(r_randomness * &challenge_sq_inv); } - // We have fully colapsed `a`, `b`, `G` + // We have fully collapsed `a`, `b`, `G` assert_eq!(a.len(), 1); let a = a[0]; assert_eq!(b.len(), 1);