Skip to content

hash-functions: fix the definition of hash trees #389

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.

Sign up for GitHub

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

Open
multun wants to merge 1 commit into
base: master
Choose a base branch
from
Open

hash-functions: fix the definition of hash trees #389

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
4 changes: 2 additions & 2 deletions src/hash-functions.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -451,8 +451,8 @@ Hash trees
~~~~~~~~~~

Hash trees are trees [#]_ where each node is identified by a hash
value, consisting of its contents and the hash value of its ancestor.
The root node, not having an ancestor, simply hashes its own contents.
value, consisting of its contents and the hash value of its children.
Leaf nodes, not having no children, simply hash their own contents.

.. [#]
Directed graphs, where each node except the root has exactly one
Expand Down