We've just released rs-merkle-tree, a Merkle tree crate designed with performance and modularity in mind. It comes with the following key features: * Fixed depth: All proofs have a constant size equal to the depth of the tree. The depth can be configured via a const generic. * Append-only: Leaves are added sequentially starting from index 0. Once added, a leaf cannot be modified. * Optimized for Merkle proof retrieva…
Blockchains are an alternative way to make an append only data structure, so it's not clear why you would want to use a merkle tree to create a block chain.
We've just released rs-merkle-tree, a Merkle tree crate designed with performance and modularity in mind. It comes with the following key features: * Fixed depth: All proofs have a constant size equal to the depth of the tree. The depth can be configured via a const generic. * Append-only: Leaves are added sequentially starting from index 0. Once added, a leaf cannot be modified. * Optimized for Merkle proof retrieva…
How are you supposed to show that two tree heads are consistent?
We've just released rs-merkle-tree, a Merkle tree crate designed with performance and modularity in mind. It comes with the following key features: * Fixed depth: All proofs have a constant size equal to the depth of the tree. The depth can be configured via a const generic. * Append-only: Leaves are added sequentially starting from index 0. Once added, a leaf cannot be modified. * Optimized for Merkle proof retrieva…
For those in the know... Do you have any recommended reading for Merkle-curious people that may have some scars from blockchain-related hype? It would be nice to find a nice introductory resource that covers some interesting use-cases that may not be well-known. Perhaps with nice graphics, interactivity, etc.? For example, here is a slick web site that shows how certificate transparency uses Merkle trees: https://cer…
The joke is there are two kinds of distributed systems: Spanner and Bitcoin.
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.
There are use-cases outside of "crypto" for blockchain - notably for security related use-cases such as historization ; tough I concede that use-case can be handled with more standard technologies it is very fun to get into it and study such use as it may have properties that could be interesting. One has to have some time for this but to be frank it's not really something super hard to pull-off (Bc itself conceptual…
I think the question, certainly the question I have - is, what are some use cases outside of "crypto" and the CT log ?
I think the question, certainly the question I have - is, what are some use cases outside of "crypto" and the CT log ?
You can make use of merkle-trees when ever you want to proof the data integrity of large amounts of individually independent data (distributed FS etc). After playing arround with SMTs for a bit, possible use-cases came to mind quite frequently.
The challenge to me is that the ability to prove the data integrity is quite hard once you store the data elsewhere, particularly on a single disk - I don’t know that people are regularly reading and reevalidating the stored data and likely not on every I/o operation.
We've just released rs-merkle-tree, a Merkle tree crate designed with performance and modularity in mind. It comes with the following key features: * Fixed depth: All proofs have a constant size equal to the depth of the tree. The depth can be configured via a const generic. * Append-only: Leaves are added sequentially starting from index 0. Once added, a leaf cannot be modified. * Optimized for Merkle proof retrieva…
Blockchains are an alternative way to make an append only data structure, so it's not clear why you would want to use a merkle tree to create a block chain.
We've just released rs-merkle-tree, a Merkle tree crate designed with performance and modularity in mind. It comes with the following key features: * Fixed depth: All proofs have a constant size equal to the depth of the tree. The depth can be configured via a const generic. * Append-only: Leaves are added sequentially starting from index 0. Once added, a leaf cannot be modified. * Optimized for Merkle proof retrieva…
Blockchains are an alternative way to make an append only data structure, so it's not clear why you would want to use a merkle tree to create a block chain.
Yes, the term block chain does has a specific technical meaning: a sequence of hashed values where each contains the hash of the previous, similar to the way a git commit includes the hash of its parent commit. But the term blockchain has also taken on a broader colloquial meaning of "log with certain cryptographic properties", which both block chain and merkle tree implementations can satisfy with various advantages and disadvantages. I think it's fair to allow usage of the broader definition.