Merge pull request #2881 from Danyylka/master

Fix typos and spelling errors

book/src/plonk/domain.md

@@ -31,7 +31,7 @@ The code above also defines a generator $g$ for it, such that $g^{2^{32}} = 1$ a
 
 [Lagrange's theorem](https://en.wikipedia.org/wiki/Lagrange%27s_theorem_(group_theory)) tells us that if we have a group of order $n$, then we'll have subgroups with orders dividing $n$. So in our case, we have subgroups with all the powers of 2, up to the 32-th power of 2.
 
-To find any of these groups, it is pretty straight forward as well. Notice that:
+To find any of these groups, it is pretty straightforward as well. Notice that:
 
 * let $h = g^2$, then $h^{2^{31}} = g^{2^{32}} = 1$ and so $h$ generates a subgroup of order 31
 * let $t = g^{2^2}$, then $t^{2^{30}} = g^{2^{32}} = 1$ and so $t$ generates a subgroup of order 30

book/src/specs/urs.md

@@ -9,7 +9,7 @@ This needs to be fixed.
 The URS comprises of:
 
 * `Gs`: an arbitrary ordered list of curve points that can be used to commit to a polynomial in a non-hiding way.
-* `H`: a blinding curve point that can be used to add hidding to a polynomial commitment scheme.
+* `H`: a blinding curve point that can be used to add hiding to a polynomial commitment scheme.
 
 The URS is generated deterministically, and thus can be rederived if not stored.