Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with hash-algorithm
Search options not deleted
user 23682
A hash algorithm is any algorithm that can be used to map data of arbitrary size to data of fixed size. The values returned by a hash function are called hash values, hash codes, hash sums, or simply hashes. In Ethereum, the algorithm used is Keccak 256.
2
votes
1
answer
275
views
How Merkle Tree obtain root node hash (example from 'Understanding the ethereum trie')?
I read Understanding the ethereum trie and try to do examples from that article. Now i am at ex1.py - first exaple. Look at code from that example:
import sys
sys.path.append('src')
import trie, util …
- 317
2
votes
Accepted
How Merkle Tree obtain root node hash (example from 'Understanding the ethereum trie')?
I read code bad: when we got
key = pack_nibbles(with_terminator('\x01\x01\x02')
value = rlp.encode(['hello'])
which is tantamount to:
key = '\x01\x01\x02'
value = '\xc6\x85hello'
this value st …
- 317