diff --git a/README.md b/README.md
index be96a23..a4ffeac 100644
--- a/README.md
+++ b/README.md
@@ -205,7 +205,7 @@ The order of the output is arbitrary and will differ on different runs of minisk
 
 ## Applications
 
-Communications efficient set reconciliation has been proposed to optimize Bitcoin transaction distribution<sup>[[8]](#myfootnote8)</sup>, which would allow Bitcoin nodes to have many more peers while reducing bandwidth usage. It could also be used for Bitcoin block distribution<sup>[[9]](#myfootnote9)</sup>, particularly for very low bandwidth links such as satellite.  A similar approach (CPISync) is used by PGP SKS keyservers to synchronize their databases efficiently. Secure sketches can also be used as helper data to reliably extract a consistent cryptographic key from fuzzy biometric data while leaking minimal information<sup>[[1]](#myfootnote1)</sup>. They can be combined with [dcnets](https://en.wikipedia.org/wiki/Dining_cryptographers_problem) to create cryptographic multiparty anonymous communication<sup>[[10]](#myfootnote10)</sup>. 
+Communications efficient set reconciliation has been proposed to optimize Bitcoin transaction distribution<sup>[[8]](#myfootnote8)</sup>, which would allow Bitcoin nodes to have many more peers while reducing bandwidth usage. It could also be used for Bitcoin block distribution<sup>[[9]](#myfootnote9)</sup>, particularly for very low bandwidth links such as satellite.  A similar approach (CPISync) is used by PGP SKS keyservers to synchronize their databases efficiently. Secure sketches can also be used as helper data to reliably extract a consistent cryptographic key from fuzzy biometric data while leaking minimal information<sup>[[1]](#myfootnote1)</sup>. They can be combined with [dcnets](https://en.wikipedia.org/wiki/Dining_cryptographers_problem) to create cryptographic multiparty anonymous communication<sup>[[10]](#myfootnote10)</sup>.
 
 ## Implementation notes
 
diff --git a/doc/math.md b/doc/math.md
index cf46f19..04ce801 100644
--- a/doc/math.md
+++ b/doc/math.md
@@ -9,7 +9,7 @@ A sketch, for the purpose of this description, can be seen as a "set checksum" w
 * Sketches have a predetermined capacity, and when the number of elements in the set is not higher than the capacity, minisketch will always recover the entire set from the sketch. A sketch of *b*-bit elements with capacity *c* can be stored in *bc* bits.
 * The sketches of two sets can be combined by adding them (XOR) to obtain a sketch of the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference) between the two sets (*i.e.*, all elements that occur in one but not both input sets).
 
-This overview explains how sets can be converted into a sketch and how a set can be recovered from a sketch. 
+This overview explains how sets can be converted into a sketch and how a set can be recovered from a sketch.
 
 ## From field elements to sketches
 
diff --git a/src/fields/clmul_common_impl.h b/src/fields/clmul_common_impl.h
index 3d179a1..2cecbf5 100644
--- a/src/fields/clmul_common_impl.h
+++ b/src/fields/clmul_common_impl.h
@@ -36,7 +36,7 @@ template<typename I, int BITS, I MOD> NO_SANITIZE_MEMORY I MulWithClMulReduce(I
     __m128i product = _mm_clmulepi64_si128(_mm_cvtsi64_si128((uint64_t)a), _mm_cvtsi64_si128((uint64_t)b), 0x00);
     if (BITS <= 32) {
         __m128i high1 = _mm_srli_epi64(product, BITS);
-        __m128i red1 = _mm_clmulepi64_si128(high1, MOD128, 0x00); 
+        __m128i red1 = _mm_clmulepi64_si128(high1, MOD128, 0x00);
         __m128i high2 = _mm_srli_epi64(red1, BITS);
         __m128i red2 = _mm_clmulepi64_si128(high2, MOD128, 0x00);
         return _mm_cvtsi128_si64(_mm_xor_si128(_mm_xor_si128(product, red1), red2)) & MASK;