Anna Shaleva a22b1caa3e core: implement MPT Billet structure for MPT restore ... MPT restore process is much simpler then regular MPT maintaining: trie has a fixed structure, we don't need to remove or rebuild MPT nodes. The only thing we should do is to replace Hash nodes to their unhashed counterparts and increment refcount. It's better not to touch the regular MPT code and create a separate structure for this.		2021-09-07 19:43:27 +03:00
..
base.go	mpt: use BinWriter.Grow() instead of custom buffer	2021-08-10 09:34:05 +03:00
batch.go	core: allow empty MPT Leaf values	2021-09-03 13:46:48 +03:00
batch_test.go	core: allow empty MPT Leaf values	2021-09-03 13:46:48 +03:00
bench_test.go	mpt: use BinWriter.Grow() instead of custom buffer	2021-08-10 09:34:05 +03:00
billet.go	core: implement MPT Billet structure for MPT restore	2021-09-07 19:43:27 +03:00
branch.go	mpt: add Size method to trie nodes	2021-08-06 12:01:16 +03:00
compat_test.go	core: adjust comments on behaviour defferences for MPT TestCompatibility	2021-09-03 13:46:52 +03:00
doc.go	mpt: implement MPT trie	2020-07-30 12:42:15 +03:00
empty.go	mpt: add Size method to trie nodes	2021-08-06 12:01:16 +03:00
extension.go	mpt: add Size method to trie nodes	2021-08-06 12:01:16 +03:00
hash.go	mpt: add Size method to trie nodes	2021-08-06 12:01:16 +03:00
helpers.go	core: implement MPT Billet structure for MPT restore	2021-09-07 19:43:27 +03:00
helpers_test.go	core: implement MPT Billet structure for MPT restore	2021-09-07 19:43:27 +03:00
leaf.go	mpt: add Size method to trie nodes	2021-08-06 12:01:16 +03:00
node.go	mpt: add Size method to trie nodes	2021-08-06 12:01:16 +03:00
node_test.go	mpt: add Size method to trie nodes	2021-08-06 12:01:16 +03:00
proof.go	mpt: move empty hash node in a separate type	2021-08-06 12:01:16 +03:00
proof_test.go	mpt: implement reference counting	2020-11-20 16:50:30 +03:00
trie.go	core: allow empty MPT Leaf values	2021-09-03 13:46:48 +03:00
trie_test.go	core: allow empty MPT Leaf values	2021-09-03 13:46:48 +03:00