Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix typos #811

Open
wants to merge 2 commits into
base: develop
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion book/src/mpt/encoding_hashing.md
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@ Encoding is done recursively starting from the trie root. Leaf, branch
and extension nodes are encoded as the RLP encoding of list containing
the hex prefix encoding of the node key as well as

- Leaf Node: the encoding of the the payload,
- Leaf Node: the encoding of the payload,

- Branch Node: the hash or encoding of the 16 children and the encoding of the payload,

Expand Down
2 changes: 1 addition & 1 deletion book/src/mpt/prover_input_format.md
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ 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
different. The prover input 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.
Loading