mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-16 23:31:16 +00:00
72c3ab8ced
* Implement partial trees why: This is currently needed for unit tests to pre-load the database with test data similar to `proof` node pre-load. The basic features for `snap-sync` boundary proofs are available as well for future use. What is missing is the final proof verification and a complete storage data load/merge function (stub is available.) * Cosmetics, clean up
1001 B
1001 B
-
Re-visit
delTree()
. Suggestion is deleting small trees on the memory later, otherwise only deleting the root vertex (so it becomes inaccessible) and remember the follow up vertices which can travel through the tx-layers to be picked up by the backend store. -
Some comletions migh be needed for the
aristo_part
module which is a re-implementation of the module supporting proof-mode/partial trees.- Complete
partMergeStorageData()
. This function might not be needed at all unless snap-sync is really revived. - For snap-sync, write a
proof
function verifying whether the partial tree is correct relative to thePartStateRef
descriptor. - One might need to re-visit the
removeCompletedNodes()
module when using snap-sync proof features. The algorithm used here assumes that the list of proof nodes is rather small. Also, a right boundary leaf node is typically cleared. This needs to be re-checked when writing theproof
function mentioned above.
- Complete