From e374b420aa21ad38581d54ea9b73064ce6ebd303 Mon Sep 17 00:00:00 2001
From: Guillaume Ballet <3272758+gballet@users.noreply.github.com>
Date: Wed, 10 May 2023 14:43:40 +0200
Subject: [PATCH] fix a couple typos in README

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index d7193be71..605db4ef0 100644
--- a/README.md
+++ b/README.md
@@ -124,7 +124,7 @@ LEFT in RIGHT where FUN;
 Where `LEFT` is a tuple of committed polynomials, `RIGHT` is an `x`-product of tuples of constant polynomials, expressions or variable declarations
 and `FUN` is a function of the variables that returns `bool`.
 
-The semantics is as follows: If there is more than one factor, then all factors has to have finite size such that
+The semantics is as follows: If there is more than one factor, then all factors have to have finite size such that
 the product of the sizes is less than the maximal polynomials size. New constant polynomials are constructed,
 so that there is at least one row for all combinations of rows in the factor (cross product).
 If `FUN` is present, then all rows where the function returns `false` are removed.
@@ -230,7 +230,7 @@ The optimizer will of course ensure that redundant constraints are removed
 
 ### Instruction / Assembly language
 
-The second layer of this langauge is to define an assembly-like language that helps in defining complex constants.
+The second layer of this language is to define an assembly-like language that helps in defining complex constants.
 
 A more detailed description of the current plans can be found in [notes_asm.md](notes_asm.md).