Merkle tree is a tree in which every leaf node is labelled with the hash of a data block and every non-leaf node is labelled with the cryptographic hash of the labels of its child nodes. Hash trees allow efficient and secure verification of the contents of large data structures. Hash trees are a generalization of hash lists and hash chains.
Questions tagged [merkle-tree]
73 questions
1
vote
2 answers
Blockchain ledger storage
I've been studying Blockchain since a while and I've been looking out for information explaining where the blockchain ledger is saved and how it is saved locally (as in, locally in a full node). What I have most of the time found is state database…
rohitpaniker
- 695
- 1
- 7
- 25
1
vote
1 answer
How to Multithread Merkle Tree Hashing
I have a large list I'd like to be able to get the merkle root of in java. It's large enough that being able to multithread the process would speed it up significantly, and as such, I've been trying to do so.
Here's my code so far:
public static…
Lev Knoblock
- 611
- 2
- 6
- 20
1
vote
0 answers
Keyless Signature Infrastructrue ( KSI ) Token Verification
So I was reading about the KSI blockchain but the resources that I have explored on the Internet were not enough to clear up some questions in my mind which are still bothering me!
Questions:
Whenever a customer requests to participate in the ksi…
DEVENDRA MEENA
- 43
- 1
- 6
1
vote
1 answer
Can Merkle tree tell if more than one copy of the object exist in it?
With Merkle root hash, and Merkle path, one can verify if a given object (i.e a transaction) exist in a Merkle tree. But is it possible to tell there is no other duplication of the object in the tree.
For example, if I have the Merkle root of a list…
Leo Zhang
- 3,040
- 3
- 24
- 38
1
vote
1 answer
Are Merkle trees generated from a single SSTable?
When Cassandra is doing the data integrity check, it does a validation compaction, but what does this mean exactly? My understanding is that it creates a single SSTable that will be stored temporarily (until the repair finishes), and then it…
Pedro Gordo
- 1,825
- 3
- 21
- 45
1
vote
1 answer
Influnce of partition quantity on repair time in Cassandra cluster
How does quantity of partitions influence on repair time in Cassandra cluster?
Is it correct that the less quantity of partitions the faster speed of Merkle tree algorithm and repair procedure?
Will repair faster for -
CREATE TABLE ks.t1 (
id2…
Dimaf
- 653
- 1
- 11
- 25
1
vote
1 answer
Which hashes are needed in a Merkle tree?
When you have a Merkle tree, what is the minimal number of hashes needed to verify a change to one leaf node?
Am I correct in my understanding that, at first, only the top hash (the Merkle tree root or hash of the Merkle tree root) is needed? And…
Cedric Martin
- 5,945
- 4
- 34
- 66
0
votes
0 answers
Why is the Merkle tree proof for m1 (H2, H34, H5555) and not (H1, H12, H1234)?
enter image description here
article: "A Merkle tree [29], is a tree-like data storage structure used to efficiently verify the integrity of large data sets. In a binary Merkle tree, the most common type used in blockchain technology, leaf nodes…
0
votes
0 answers
Merkle Tree Implementation in JS with keccak256
Merkle Tree Implementation in JS with keccak256
I coded some Merkle Tree implementations in JavaScript with keccak256. This code takes JSON Objects from the local JSON File that called output.json. It has this type of objects:
{
"key":…
Koray Akpınar
- 1
- 1
0
votes
1 answer
How do we know a Merkle Proof contains legitimate hashes?
I'm trying to understand merkle trees in the context of blockchain and am not understanding how it helps with transaction verification (verifying if a transaction is inside a block).
The typical explanation is that merkle trees enable a SPV (simple…
Jeremy Bernier
- 1,746
- 1
- 17
- 17
0
votes
0 answers
Having issue calculating the merkle proof with just these given parameters
Can anyone here help me ? Help is really appreciated
https://forum.soliditylang.org/t/how-to-calculate-the-merkle-proof-in-this-case/1490
I tried using merkel tree.js and I couldn't figure it out as it's not even a sha hash or keccak256 one
0
votes
0 answers
How to use Merkle Tree to synchronize data between two nodes?
I am trying to understand how Merkle trees can be used to find inconsistencies and synchronize the data in two peer nodes.
Suppose I have two nodes with data
Node 1 : [1,3,5,7,8, 10]
Node 2 : [2,6]
Now I can generate the Merkle tree of the data on…
voila
- 1,594
- 2
- 19
- 38
0
votes
0 answers
my wallet address is whitelisted. how i will get merkle proof for minting?
const leaves = whitelistAddresses.map(addr => padBuffer(addr))
const merkletree = new MerkleTree(leaves, keccak256, {sortPairs: true})
console.log('merkletree', merkletree.toString())
const rootHash = merkletree.getHexRoot()
…
Harsh M
- 1
- 2
0
votes
1 answer
Transform Hash in javascript (Buffer) to python SHA256
I have a problem understanding this specific code and managing to convert it to Python from Javascript. The problem lies in the Buffer method used by Javascript which creates a different hash output than in Python. The main goal is to get the…
Projects KK
- 3
- 2
0
votes
0 answers
Different hash outputs for the same hash function using the merklelib library
I am using the merklelib library to generate a Merkle Tree from transactions. However, the Hashes turn out to be different even though I am using the same hashfunction.
I tried different styles of converting the string input, however the output is…
Projects KK
- 3
- 2