diff --git a/glossary.asciidoc b/glossary.asciidoc
index 17882fd..a0aaee2 100644
--- a/glossary.asciidoc
+++ b/glossary.asciidoc
@@ -335,12 +335,12 @@ Penalty Transaction::
     Look at the breach remedy transaction.
 
 Preimage::
-    In mathematics given a function $f$ and a value $h$ the preimage of $h$ with respect to $f$ is the set of values $R = \{r_1,r_2,...\}$ such that $f(r_i) = h$ for all $\r_i \in R$.
+    In mathematics, given a function $f$ and a value $h$ the preimage of $h$ with respect to $f$ is the set of values $R = \{r_1,r_2,...\}$ such that $f(r_i) = h$ for all $\r_i \in R$.
     In layman's terms, it is the set of values which is mapped to $h$ by the function $f$.
     This preimage set can be empty, finite or infinite.
-    In cryptography the function $f$ is usually taken to be a hash function.
+    In cryptography, the function $f$ is usually taken to be a hash function.
     Cryptographers use the term preimage for an arbitrary element of $R$.
-    In particular when using SHA-256 we should state that each element has an infinite amount of preimages.
+    In particular, when using SHA-256 we should state that each element has an infinite amount of preimages.
     Yet it is still believed to be computationally hard to find such a preimage.
 
 Proof-of-Work::