From b2ccce478af5a6a89d5d7336b4b6fec58c00de1f Mon Sep 17 00:00:00 2001
From: Danil <37103154+Danyylka@users.noreply.github.com>
Date: Mon, 16 Dec 2024 20:56:33 +0100
Subject: [PATCH 1/2] Update domain.md

---
 book/src/plonk/domain.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/book/src/plonk/domain.md b/book/src/plonk/domain.md
index 4dd79da36a..45ec4a78c0 100644
--- a/book/src/plonk/domain.md
+++ b/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

From c635349882a7cda5861bdde09322f2cd6e540040 Mon Sep 17 00:00:00 2001
From: Danil <37103154+Danyylka@users.noreply.github.com>
Date: Mon, 16 Dec 2024 20:59:35 +0100
Subject: [PATCH 2/2] Update urs.md

---
 book/src/specs/urs.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/book/src/specs/urs.md b/book/src/specs/urs.md
index dd63174520..8abb969b4b 100644
--- a/book/src/specs/urs.md
+++ b/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.