Heh, interesting realization: in flat-tree, if appending data linearly parent nodes only need to be updated when inserting data and the index `((n + 2) % 4) == 0`. I guess doing a bitfield lookup might be more generic and reliable though, but it's still interesting I think :D
Heh, got me thinking of our merkle implementation, and realized we can probably simplify it somewhat. Wrote an issue to constrain the Node type in the HashMethods trait on `From<PartialNode>`, and remove the `node` method from the trait.https://github.com/datrs/merkle-tree-stream/issues/20 …
-
-
There's another issue open to move the `Roots` argument in the `new` method to an internal slab allocator, further simplifying the API. https://github.com/datrs/merkle-tree-stream/issues/19 … Happy to provide mentoring / instructions on implementing either of these!
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.