From 5f4374c8363ec7a845464eb67741540dbae41800 Mon Sep 17 00:00:00 2001 From: Dimitris Apostolou Date: Sat, 7 Dec 2019 15:51:54 +0200 Subject: [PATCH] Fix typo --- src/fr.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/fr.rs b/src/fr.rs index 4495e3b..de86e87 100644 --- a/src/fr.rs +++ b/src/fr.rs @@ -241,7 +241,7 @@ impl Fr { // // 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