Merge pull request #259 from cleishm/ssz-treehash-large-int
Clarify TreeHash treatment of integers > 256bit
This commit is contained in:
commit
50afec9337
|
@ -394,11 +394,11 @@ The below `SSZTreeHash` algorithm is defined recursively in the case of lists an
|
|||
|
||||
We define `hash(x)` as `BLAKE2b-512(x)[0:32]`.
|
||||
|
||||
#### `uintN`, `bool`, `address`, `hash32`
|
||||
#### `uint8`..`uint256`, `bool`, `address`, `hash1`..`hash32`
|
||||
|
||||
Return the serialization of the value.
|
||||
|
||||
#### `bytes`, `hashN`
|
||||
#### `uint264`..`uintN`, `bytes`, `hash33`..`hashN`
|
||||
|
||||
Return the hash of the serialization of the value.
|
||||
|
||||
|
|
Loading…
Reference in New Issue