diff --git a/crypto/src/commitment.rs b/crypto/src/commitment.rs index 1d2667f7a..091a824d6 100644 --- a/crypto/src/commitment.rs +++ b/crypto/src/commitment.rs @@ -17,7 +17,7 @@ use crate::Hasher; /// position. /// /// This is achieved by providing the value `v_i` together with a proof `proof_i` such that anyone -/// posessing `com` can be convinced, with high confidence, that the claim is true. +/// possessing `com` can be convinced, with high confidence, that the claim is true. /// /// Vector commitment schemes usually have some batching properties in the sense that opening /// proofs for a number of `(i, v_i)` can be batched together into one batch opening proof in order diff --git a/crypto/src/hash/mds/mds_f64_12x12.rs b/crypto/src/hash/mds/mds_f64_12x12.rs index 2276f258d..eedb64057 100644 --- a/crypto/src/hash/mds/mds_f64_12x12.rs +++ b/crypto/src/hash/mds/mds_f64_12x12.rs @@ -77,7 +77,7 @@ pub(crate) fn mds_multiply_freq(state: [u64; 12]) -> [u64; 12] { let (u8, u9, u10) = fft4_real([s2, s5, s8, s11]); // This where the multiplication in frequency domain is done. More precisely, and with - // the appropriate permuations in between, the sequence of + // the appropriate permutations in between, the sequence of // 3-point FFTs --> multiplication by twiddle factors --> Hadamard multiplication --> // 3 point iFFTs --> multiplication by (inverse) twiddle factors // is "squashed" into one step composed of the functions "block1", "block2" and "block3". diff --git a/utils/core/src/serde/byte_reader.rs b/utils/core/src/serde/byte_reader.rs index f85ab20b4..652db5308 100644 --- a/utils/core/src/serde/byte_reader.rs +++ b/utils/core/src/serde/byte_reader.rs @@ -434,7 +434,7 @@ impl<'a> ReadAdapter<'a> { // Read until we have at least `count` bytes, or until we reach end-of-file, // which ever comes first. loop { - // If we have succesfully read `count` bytes, we're done + // If we have successfully read `count` bytes, we're done if count == 0 || self.buf.len() >= count { break Ok(()); }