Daniel Lubarov
|
7f366cdace
|
Treat storage tries as sub-tries of the state trie
I.e. have leaves in the state trie point to the root of a storage trie
|
2022-10-16 20:26:37 -07:00 |
|
Daniel Lubarov
|
ecce5be9e3
|
MPT format tweaks
Don't need value lengths in memory. Branches with null values recognized as value_ptr = null.
|
2022-10-14 18:09:43 -07:00 |
|
Daniel Lubarov
|
299aabf860
|
Fix branch hashing bug
|
2022-10-11 15:56:23 -07:00 |
|
Daniel Lubarov
|
8ee7265863
|
Tweak MPT value storage
|
2022-10-08 13:51:52 -07:00 |
|
Daniel Lubarov
|
e6b5e3656f
|
Some more uses of %increment, %decrement
|
2022-10-07 12:03:37 -07:00 |
|
Daniel Lubarov
|
f8c104033c
|
Hash MPT extension nodes
|
2022-10-06 20:50:32 -07:00 |
|
Daniel Lubarov
|
ed2aac3af3
|
MPT fixes
|
2022-10-06 16:28:52 -07:00 |
|
Daniel Lubarov
|
f2cb42bbe8
|
MPT logic to hash branch nodes
|
2022-10-05 20:46:49 -07:00 |
|
Daniel Lubarov
|
0c9847abf3
|
Rework MPT hashing to support inlining <32 byte children
|
2022-10-05 15:23:06 -07:00 |
|
Daniel Lubarov
|
9f9143d6f6
|
Finish some misc storage logic
|
2022-10-02 11:14:19 -07:00 |
|
Daniel Lubarov
|
9e483528d3
|
MPT hashing logic, part 3
|
2022-10-02 09:11:39 -07:00 |
|
Daniel Lubarov
|
f2f05952ab
|
MPT hashing logic, part 2
|
2022-10-01 20:02:42 -07:00 |
|
Daniel Lubarov
|
12247047ae
|
MPT hashing logic, part 1
|
2022-09-30 17:02:25 -07:00 |
|
Daniel Lubarov
|
37d92b55ac
|
Basic MPT logic
For now this contains most of the basic framework/structure. Logic for things like insertions will come later.
|
2022-09-22 11:25:37 -07:00 |
|