Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
1–8 of 8 posts
Re: Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
#2Re: Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
#3Re: Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
#4Re: Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
#5Re: Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
#6Had 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.
Re: Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
#7What would you use this for ? I see a solidity client which implies a blockchain but this info should be in the readme
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.
Re: Quadrable: Multiversion DB – Sparse binary Merkle tree with partial-tree proofs
#8What would you use this for ? I see a solidity client which implies a blockchain but this info should be in the readme