From d165113c989712da40c52d951e45294a45368831 Mon Sep 17 00:00:00 2001
From: Dmytrol <46675332+Dimitrolito@users.noreply.github.com>
Date: Mon, 16 Dec 2024 21:19:34 +0200
Subject: [PATCH] typos README.md (#347)

---
 prover/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/prover/README.md b/prover/README.md
index b95a73c0e..ab5ab8ae9 100644
--- a/prover/README.md
+++ b/prover/README.md
@@ -9,7 +9,7 @@ To generate a proof that a computation was executed correctly, you will need to
 1. Define *algebraic intermediate representation* (AIR) for your computation. This can be done by implementing `Air` trait (see [air crate](../air) for more info).
 2. Define an [execution trace](#Execution-trace) for your computation. This can be done by implementing `Trace` trait. Alternatively, you can use `TraceTable` struct which already implements `Trace` trait in cases when this generic implementation works for your use case.
 3. Execute your computation and record its execution trace.
-4. Define your prover(#Prover) by implementing `Prover` trait. Then execute `Prover::prove()` function passing the trace generated in the previous step into it as a parameter. The function will return a instance of `Proof`.
+4. Define your prover(#Prover) by implementing `Prover` trait. Then execute `Prover::prove()` function passing the trace generated in the previous step into it as a parameter. The function will return an instance of `Proof`.
 
 The resulting `Proof` object can be serialized and sent to a [verifier](../verifier) for verification. The size of proof depends on the specifics of a given computation, but for most computations it should be in the range between 15 KB (for very small computations) and 300 KB (for very large computations).