Fix typos (0xPolygonZero#1479)

evm/spec/mpts.tex

@@ -59,7 +59,7 @@ \subsection{Prover input format}
   \item A digest node is encoded as $(\texttt{MPT\_NODE\_HASH}, d)$, where $d$ is a Keccak256 digest.
 \end{enumerate}
 Nodes are thus given in depth-first order, enabling natural recursive methods for encoding and decoding this format.
-The payload of state and receipt tries is given in the natural sequential way. The transaction an receipt payloads contain variable size data, thus the input is slightly different. The prover input for for the transactions is the transaction RLP encoding preceeded by its length. For the receipts is in the natural sequential way, except that topics and data are preceeded by their lengths, respectively.
+The payload of state and receipt tries is given in the natural sequential way. The transaction an receipt payloads contain variable size data, thus the input is slightly different. The prover input for for the transactions is the transaction RLP encoding preceded by its length. For the receipts is in the natural sequential way, except that topics and data are preceded by their lengths, respectively.
 
 \subsection{Encoding and Hashing}
 

plonky2/src/gates/gate.rs

@@ -219,7 +219,7 @@ pub trait Gate<F: RichField + Extendable<D>, const D: usize>: 'static + Send + S
     /// The number of wires used by this gate.
     ///
     /// While vanilla Plonk can only evaluate one addition/multiplication at a time, a wider
-    /// configuration may be able to accomodate several identical gates at once. This is
+    /// configuration may be able to accommodate several identical gates at once. This is
     /// particularly helpful for tiny custom gates that are being used extensively in circuits.
     ///
     /// For instance, the [crate::gates::multiplication_extension::MulExtensionGate] takes `3*D`