From f70878735720ee2c1e59e9c3dfeb0aed94f67af4 Mon Sep 17 00:00:00 2001
From: Bilog WEB3 <155262265+Bilogweb3@users.noreply.github.com>
Date: Mon, 16 Dec 2024 18:39:35 +0100
Subject: [PATCH] docs fix spelling issues (#348)

---
 fri/README.md  | 4 ++--
 math/README.md | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/fri/README.md b/fri/README.md
index d10af8812..20ef5f32c 100644
--- a/fri/README.md
+++ b/fri/README.md
@@ -16,7 +16,7 @@ FRI proofs are verified by a [FriVerifier](src/verifier/mod.rs) as follows:
 3. Finally, the query phase of the FRI protocol should be executed via `verify()` function. Note that query values at the first FRI layer are provided to the `verify()` function directly. The values at remaining layers, the verifier reads from the specified verifier channel.
 
 ## Protocol parameters
-This crates supports executing FRI protocol with dynamically configurable parameters including:
+This crate supports executing FRI protocol with dynamically configurable parameters including:
 
 * Base STARK field,
 * Extension field,
@@ -48,4 +48,4 @@ When this crate is compiled with `concurrent` feature enabled, `FriProver` will
 License
 -------
 
-This project is [MIT licensed](../LICENSE).
\ No newline at end of file
+This project is [MIT licensed](../LICENSE).
diff --git a/math/README.md b/math/README.md
index 7bacd1f7b..9d83e4a5c 100644
--- a/math/README.md
+++ b/math/README.md
@@ -2,7 +2,7 @@
 This crate contains modules with mathematical operations needed in STARK proof generation and verification.
 
 ## Finite field
-[Finite field](src/field) module implements arithmetic operations in STARK-friendly finite fields. The operation include:
+[Finite field](src/field) module implements arithmetic operations in STARK-friendly finite fields. The operations include:
 
 * Basic arithmetic operations: addition, multiplication, subtraction, division, inversion.
 * Drawing random and pseudo-random elements from the field.