I don't understand how you don't care about the other branch when you validate the "A" transaction, because the final hash is a result of the hash from AB and CD, so you should care about the CD hash
great explanation. I've read a lot about Merkel trees. it took me several readings before I developed even the most basic understanding. wish I would have come across your explanation sooner. would have saved me a lot of time. thanks.
Great videos! Love the way you explain everything in depth. I was wondering will the Merkle tree be getting slow over time, because the tree is growing over time ?
So in the Blockchain we just have the merkle root? When I have the Data A, I need the hash of the other hashes, even if they are offline, but how do I get them?
What I dont understand is how do I validate a transaction if only a Merkle root is stored in a block, and no branches? Then I still need to calculate the whole tree from scratch. And compared to calculating a hash just from all the transactions, I will need to calculate it again in order to find all the branches. So the only reason for Mercle tree seems that is strengthens sha 256
Юрик Лайков both Markle root and tx are stored in a block. Yes you need to reconstruct the Markle tree from scratch, find the root hash and check it against the given root hash during block validation
Nice Video Ivan :). One question I remained in my head: If you have more transactions then you in your example for bitcoin: will the 3 layers be stable and there are a lot of hashes which must be appended together in layer 2? Second option could be: only two hashes is allowed to combine and the tree have more than 3 layers at the end.
Merkle tree it is then. Hvad med at tale lidt om EOS og Bitshares? ups nordic language :-) What about talking a bit about EOS and Bitshares from what you think would be Daniel Laramies meaning with the new project please?
Hot topic today, Ivan explained it 5 years ago, legend 🤓
Thank you very much, man! I'm learning a lot of useful stuff in this channel.
Greetings from Peru!
hashes and how they work seem so cool, small change in the input makes a very different output
Finally understood Merkle Trees and Roots. Thank you so much, Ivan!
I don't understand how you don't care about the other branch when you validate the "A" transaction, because the final hash is a result of the hash from AB and CD, so you should care about the CD hash
I agree, we need CD in order to create the root hash.
Right. We need hash(cd). But we don't need hash(c) or hash(d) to compute the root hash.
great explanation. I've read a lot about Merkel trees. it took me several readings before I developed even the most basic understanding. wish I would have come across your explanation sooner. would have saved me a lot of time. thanks.
Great videos! Love the way you explain everything in depth.
I was wondering will the Merkle tree be getting slow over time, because the tree is growing over time ?
You have a great way of explaining things! I LOVE your channel and the content you are creating!!!!
Great video.... now its clear how Merkle trees are actually used in blockchain
Finally! Best explanation ever on Merkle Tree. Thank you Ivan you made my day !
So in the Blockchain we just have the merkle root?
When I have the Data A, I need the hash of the other hashes, even if they are offline, but how do I get them?
Thanks for this video, if we mining with this algo? we depends or RAMs or VGA cards?
Thanx man! Very good explanation. Is the Merkle tree a binary tree? in your example, what would happen when a new transaction (E) arrives?
What I dont understand is how do I validate a transaction if only a Merkle root is stored in a block, and no branches? Then I still need to calculate the whole tree from scratch. And compared to calculating a hash just from all the transactions, I will need to calculate it again in order to find all the branches. So the only reason for Mercle tree seems that is strengthens sha 256
Юрик Лайков both Markle root and tx are stored in a block. Yes you need to reconstruct the Markle tree from scratch, find the root hash and check it against the given root hash during block validation
Nice Video Ivan :). One question I remained in my head: If you have more transactions then you in your example for bitcoin: will the 3 layers be stable and there are a lot of hashes which must be appended together in layer 2?
Second option could be: only two hashes is allowed to combine and the tree have more than 3 layers at the end.
how do you traverse a merkel tree?
zcoin will use MTP, how do you think abiut that, and which coin the best in zero proof, in your opinion?
Great explanation!
thanks Ivan
Too make your merkle tree grow faster, use merklegro :)
"det finns very" Amazeballz =) Keep it up kompis!
thanks man, haha did I say that? 😅
Great video, could you explain the concept of Merkel proof
HE HAS RISEN
back in the game bro 😎
Such a sweet tree you have
Merkle tree it is then.
Hvad med at tale lidt om EOS og Bitshares? ups nordic language :-) What about talking a bit about EOS and Bitshares from what you think would be Daniel Laramies meaning with the new project please?
Michael Thomsen
confusing