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
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!
-
-
Looking to learn more Rust and move the datrs project forward at the same time, so would love to help on either or both of these issues. -
Yay, that'd be great!
End of conversation
New conversation -
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.