Live data from Hacker News

Our modular, high-performance Merkle Tree library for Rust

github.com

31–33 of 33 posts

Re: Our modular, high-performance Merkle Tree library for Rust

#31
post #30

Earlier quoted context omitted.

I'm working on a project where I need to prove that a file in a git repo is append only, ie all changes to the file only added lines. The only way I can think of is looking at the git history of the file, but would there be a faster way using Merkel trees somehow?

Is this trying to deal with that git history can be replaced?

We handle the case to prevent git history rewrites, but an alternative solution could be adopted if less cumbersome.

Re: Our modular, high-performance Merkle Tree library for Rust

#32
post #28
post #14

nice crate thanks. I wasn't expecting sqlite to be faster than rocksdb, which is key-value. The way you store the leaves (level, index) should be super fast for a key-value store.

This surprised me too. My guess is that while rocks is typically faster for write-heavy workloads, inserting into the merkle tree actually require a fair few reads as part of the process (but I haven't looked closely).

mmm most of writes and reads (if not all) are batched, meaning a leaf insert triggers just a batched write (containing all updates). maybe there is some fine tunning to be made.
Post reply on HN