2024-05-30 17:48:38 +00:00
|
|
|
* Check whether `HashKey` can be reduced to a simple 32 byte array (see
|
|
|
|
*desc_identifiers.nim*)
|
|
|
|
|
2024-06-07 10:56:31 +00:00
|
|
|
* 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.
|
2024-07-01 10:59:18 +00:00
|
|
|
|
|
|
|
* Mental note: For *proof-mode* with pre-allocated locked vertices and Merkle
|
2024-07-10 12:19:35 +00:00
|
|
|
keys, verification of a partial tree must be done by computing sub-tree keys
|
2024-07-01 10:59:18 +00:00
|
|
|
at the relative roots and comparing them with the pre-allocated Merkle keys.
|