Fix typos in RLP decoding and transaction splitting documentation (#1…

…5141) Co-authored-by: Roger <50648015+RogerLamTd@users.noreply.github.com>
taikoxyz · Nov 9, 2023 · 361e98b · 361e98b
1 parent a062249
commit 361e98b
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/packages/website/pages/docs/concepts/proposing.mdx b/packages/website/pages/docs/concepts/proposing.mdx
@@ -18,7 +18,7 @@ The Ethereum yellow paper has well-defined rules to compute the state transition
 
    2.1 Asserts that the length of the transaction list does not exceed a predefined maximum (MAX_TX_LIST_BYTES), ensuring that the list is within the limits.
 
-   2.2 The transaction list is (RLP) decoded into a list of transactions (txList). If the bytes are not decodeable it will result in an empty block.
+   2.2 The transaction list is (RLP) decoded into a list of transactions (txList). If the bytes are not decodable it will result in an empty block.
 
    2.3 The amount of gas required to include transactions is available. (If a transaction cannot fit into a block, it is simply excluded from it, but the block is still valid with other transactions.)
 

diff --git a/packages/website/pages/docs/concepts/taiko-nodes.mdx b/packages/website/pages/docs/concepts/taiko-nodes.mdx
@@ -83,7 +83,7 @@ To propose a block, the `proposer`:
 
 1. Fetches the pending transactions from the L2 execution engine through the `txpool_content` RPC method.
 2. If there are too many pending transactions in the L2 execution engine, splits them into several smaller `txLists`. This is because the Taiko protocol restricts the max size of each proposed `txList`.
-3. Proposes all splitted `txLists` by sending `TaikoL1.proposeBlock` transactions.
+3. Proposes all split `txLists` by sending `TaikoL1.proposeBlock` transactions.
 
 ## Process of proving a block