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.

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

SSZ list Merkle hashing change #538

Merged
merged 4 commits into from
Feb 3, 2019
Merged

SSZ list Merkle hashing change #538

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
5488e7b
SSZ list Merkle hashing change
vbuterin Jan 31, 2019
9271e6e
Update specs/simple-serialize.md
hwwhww Jan 31, 2019
acb432e
Update specs/simple-serialize.md
hwwhww Jan 31, 2019
197fa18
Zpad is already in #543
vbuterin Feb 3, 2019
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
7 changes: 5 additions & 2 deletions specs/simple-serialize.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -385,7 +385,7 @@ Return the hash of the serialization of the value.

#### List/Vectors

First, we define some helpers and then the Merkle tree function.
First, we define the Merkle tree function.

```python
# Merkle tree hash of a list of homogenous, non-empty items
Expand All @@ -401,7 +401,10 @@ def merkle_hash(lst):
items_per_chunk = SSZ_CHUNK_SIZE // len(lst[0])

# Build a list of chunks based on the number of items in the chunk
chunkz = [b''.join(lst[i:i+items_per_chunk]) for i in range(0, len(lst), items_per_chunk)]
chunkz = [
zpad(b''.join(lst[i:i + items_per_chunk]), SSZ_CHUNK_SIZE)
for i in range(0, len(lst), items_per_chunk)
]
else:
# Leave large items alone
chunkz = lst
Expand Down