Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
github.com
github.com
Had n-ary nodes though, the nice thing is that the proof is equal to the path to the node in that case (well because of radix/trie).
Was always playing with the idea of writing it down especially with all the crypto bullshit going on, but I was too lazy.
And merkle trees are what give "blockchains" their tamper protection: each state has a hash which includes the previous state's hash. (Although it'd be a list instead of a tree in the BC case.)
What's the use? I imagine 95% of companies that pretend to need blockchains could use something like this instead.