Wow... When I saw the first minute go by in fumbling around and describing what is being covered here , I wondered if the remaining 2 minutes would be enough to cover something which sounds as complicated as "Merkle Tree"! Surprisingly, you have explained a concept really simply and really well in just under 3 minutes, that others would have taken 15 minutes at the very least to explain! Thumbs up! And thanks for saving me a lot of time ! I'm your 378th subscriber! :)
This video was great much needed explanation. Especially loved the ending when you said you weren't going to force us to do anything with our life loll
LOL, "I'm not going to force you to do anything with your life." Hahahahaha!!!! Great video. You actually explained it. (unlike all the other idiots on UA-cam to talk and talk and talk, yet explain nothing)
"Satoshi loves to hash shit" -- and then I subscribed to your chanel. Thank you for explanation, I just like listening about hashes before I fall asleep.
*The fumbling* *The baby voice (I wont force you to do anything you don't wanna do)* I love you 😂😂😂 Don't worry you have my subscription and like now😂 I like the explanation too
Lol You're so chill and funny and knowledgeable! I'm taking an intro to blockchain course at my university now and the professor made this seem so complicated, when you were able to show that it's literally not. Thank you :)
Good video! I understand almost everything except the part of searching the hash (transaction id values), for example t1... I will code it for better understand of merkle trees. Thanks good explanation
Most CEXs only included BTC in their prove of reserve but MEXC have utilised the binary hash tree model for BTC, ETH and stable tokens and aims to include other tokens in the long run
What's the point of a merkle root though? Surely if you just hashed a regular file with the list of transactions it would still be tamper proof? Changing one of the transactions would still completely alter the hash
the missing part is how the tree with the perfect number of transactions changes when you add one more. by doing this exercise, adding that oddball txn, you see MUCH better how Merkel Trees really work.
I read the use is also for light-weight verification nodes, so they don't need to download the whole blockchain, but just need the merkle trees hashes.
Your video is great. but something bothers me. I am very sorry, I am a beginner. How can I look at the branches of the merkle tree when everything is hashed? I thought if you hash something you will not know the data itself?
Hi man and thanks for your video. Btw i think you made a little mistake. The right child of the root should be Hefgh instead of Habcd. Have a good day !
Explanied Very well, Good Job Kiefer Kif. I have a quick question, Who decides the block time duration ? Currently for every 10 minutes a new block is getting created. Who is deciding this Block time? Thanks, Kalyan
Thank you! The block time is determined by the Difficulty and it's a very rough system of timing it. the way it works is the protocol looks at the current hash power and sets the difficulty to to make it so that based on the current hash power of the network, it will take an average of 10 minutes to find the next block. and it re-targets the difficulty ever 2016 blocks. because there's a lot of chaos involved in this process some blocks can take much more or much less time than 10 minutes. Especially if the hash power changes suddenly.(i.e. lots of miners go offline or get put online)
Thanks Keifer Kif for your explanation.. Another quick question... Who decides which transaction to go for which block. I see there are lot of transactions happening in Bitcoin at any given time.. Who will be deciding which transactions to take and what to reject ? Is it the Miners ?
yes the miners / mining pools choose which transactions get included. they usually choose the transactions with the highest transaction fee to go on the block.
Thanks a Ton..Another quick question, Can you explain what and all will be included in Block Chain. If my understanding is correct. Block Hash will be hash of "BlockCreation Date and Time", "Transactions hash(Merkle Tree hash", "Previous Block Hash", "Nonce". Please add if I forget anything.. Thanks.
i thought that verified transactions in the transaction pool get chosen based on the size,(first 50kb) but also based on age of transaction and also based on the input (value of bitcoins in input). If my understanding is correct then if it was only the miners deciding based on input and best fees then wouldn't small transactions continually be left out and stay in the transaction pool forever? (BTW great vid on the Merkle tree)
Can the cryptographic hash function be anything or is it a specific type? For example is it still a merkle tree if it uses SHA256 as opposed to some other hash function or does it have to be one specifically?
Hey thank you for your reply! It looks like you're right, according to the wiki definition: "Usually, a cryptographic hash function such as SHA-2 is used for the hashing. If the hash tree only needs to protect against unintentional damage, much less secure checksums such as CRCs can be used." Does the same apply to the process you described in 2:00? Does hashing a pair mean a specific process or can someone simply append the two hashes from the previous transactions and then run them through a hash function again?
you dropped the magic mark and then .... Force you to do anything with your life!!! you were little high I reckon lolll Thanks for this nice short video! Great job dude
Hi Keifer! Super video! Could you clarify for me what the actual transaction looks like when I hash it in the first step? So in other words, how does a single transaction look like and in which text format is it written in order to then hash that text to get to the tx-id? Hope to hear from you, and thanks in advance.
So funny how one minute ago you said you could not grow the whiteboard magically and then through editing you expand it upwards. Made me laugh, I thought it was hilarious.
"The whiteboard doesn't just magically grow" --> 2:31 whiteboard magically grows haha
This was so subtle I didn’t catch it at first. Good content.
i saw the comment, watched the video and didnt noticed it xD
I liked your video because you didn't force me to and I do what I wanna do
varan9595 that fuels my life force
varan9595 signed: cartman :))
I'm so glad that in such short amount of time you explained it so well. Thank you!
Wow... When I saw the first minute go by in fumbling around and describing what is being covered here , I wondered if the remaining 2 minutes would be enough to cover something which sounds as complicated as "Merkle Tree"!
Surprisingly, you have explained a concept really simply and really well in just under 3 minutes, that others would have taken 15 minutes at the very least to explain!
Thumbs up! And thanks for saving me a lot of time ! I'm your 378th subscriber! :)
This video was great much needed explanation. Especially loved the ending when you said you weren't going to force us to do anything with our life loll
You make complicated stuff very easy to understand. This is a must watch video to understand bitcoin transactions process.
Thank you, finally someone who actually explained it in a way I can understand!
LOL, "I'm not going to force you to do anything with your life."
Hahahahaha!!!!
Great video. You actually explained it.
(unlike all the other idiots on UA-cam to talk and talk and talk, yet explain nothing)
“Satoshi loved to hash shit” and that was when I knew I had to subscribe 😂😂
Thanks for explaining so well man. I really appreciate it
excellent presentation. thank you Keifer
"Satoshi loves to hash shit" -- and then I subscribed to your chanel. Thank you for explanation, I just like listening about hashes before I fall asleep.
I don't usually comment but your content is hilarious and educational. hard to find that combo anywhere else
*The fumbling*
*The baby voice (I wont force you to do anything you don't wanna do)*
I love you 😂😂😂
Don't worry you have my subscription and like now😂
I like the explanation too
"Satoshi loved to hash shit" OMG this is amazing video
ma nigga this is the best explanation of merkele tree , the part at end gave me the answer i was looking for , the why
You explained in a very simple way and it was completely clear.. Thank you ... Your video is worth watching....
It is unbelievable simple concept but people complicate it. Thank you for explaining it in a simple english.
Brilliant cristal clear explanation! Thank you very much 🖐️😊🌺
a difficult subject to deal with, good job!.
Thanks Mr. Bitman!
Nice, short, and clear explanation. Love it!
Thanks my dude!
This video filled a knowledge void that I didn't even know was there, thank you!
Hey man that was a great explanation of merkle trees, thanks !
Hi Keifer, Can you explain the Digital Signature Technique which is used in Bitcoin. I guess it is Elliptic Curve Digital Signature Algorithm.
Lol You're so chill and funny and knowledgeable! I'm taking an intro to blockchain course at my university now and the professor made this seem so complicated, when you were able to show that it's literally not. Thank you :)
Thank you!
Lovely explanation with visuals, thank you kindly !
Loved this. Learned what I needed and also made me laugh. Good job.
1:52 - This is where it start
Very nice video... Explained the topic in very simple term....
Love the video, very good explanation! Good that you explain it step wise and also why they do it, thank you!
you're welcome! Thank you for watching!
Love your explanations. Simple and to the point. Kudos man!
That explanation is so prefect...thanks man for making such video 😊😊
Very important concept, explained very succinctly.
i love you video, but i wondering why you have a portrait image's Ho Chi Minh
Thank you. Why do you only need to know the branch that the transaction is on?
informative and highly entertaining banter.... hahaha.. nice work Kiefmeister
Many thanks!
Very well explained and it took a few mins. Kudos!
Explained it in such simple terms!
what is the benefit of Mekle Tree? I think we can just hash all the transactions at once , eg : all_transactions_hash=SHA256( t1 + t2 + t3 + t4 ... )
Muchas gracias. Great explanation.
I’m subscribing to you. You helped me a lot with this video and you seem like a cool dude!
Where does the previous block hash come me? Cant I just put anything in there and as such pre-compute my merkle tree ahead of time
I love it. Exactly what I needed as a relative novice.
Good video! I understand almost everything except the part of searching the hash (transaction id values), for example t1... I will code it for better understand of merkle trees. Thanks good explanation
Awesome, straight to the point. Thanks man.
Good video! What do they do if the number of transactions is not a power of 2?
I Loooove your videos every thing is simply explained
Plain and simple. Perfect!
that humour is beyond 3d + time
A funny and very helpful video, beautifully produced. haha Thanks man.
thank YOU!
Thankx captain,I still can't belive you left your avengers job and now trading cryptos :)
Really good videos. And like the honesty.
Nice explanation. Shouldn't the vertices connected to the root read h hab hc and h hef hgh, since we're hashing the hashes of ab and cd concatenated?
Awesome. Would like to see some more of such videos
Clear and concise, thank you so much. Only thing i would say is if you could be a bit more energetic lol, 10000+ subscribers
Concise, logical, well explained. Thanks!
How do you hash 2 hash values in Bitcoin? Just by putting the next to each other with a space in between? Or do we use another symbol such as the "+"?
Thank you very much for the explanation
Awesome video, great explanation
i'm late but could 'other stuff' be the proof-of-work by any chance?
simple and informative ...thanks man!!1
Hi Keifer thank you very much for this explanation it was well explained :)
"The whiteboard doesn't just magically grow" ahaha good one
ok, this is very good video, very helpful actually to understand the blocks and its nature.
Thank you! very explanatory
Most CEXs only included BTC in their prove of reserve but MEXC have utilised the binary hash tree model for BTC, ETH and stable tokens and aims to include other tokens in the long run
Great explanation, thank you for this video!
Love this video, thank you
What's the point of a merkle root though? Surely if you just hashed a regular file with the list of transactions it would still be tamper proof? Changing one of the transactions would still completely alter the hash
it makes it so you can store only a portion of the tree and verify the transaction.
Thanks for taking the time to explain this :)
Thank you for the support :) I really do appreciate it! there will more video to come
the missing part is how the tree with the perfect number of transactions changes when you add one more. by doing this exercise, adding that oddball txn, you see MUCH better how Merkel Trees really work.
Hi there, I was wondering why you have a pic of HCM on the wall @.@
HUY BACH I took him down a while ago. I bought it in Vietnam when I visited
Then why you took him down :v LOL but still, I like you taking that picture down :))))
Your Great! Thanks for the video.
great explanation, thanks!
Good video! but now I'm wondering which are parts that form the block! (block header, hash of last block, merkle tree...)
Thank you!
The block is made of 5 parts:
-the magic number
-block size
-the block header
-transaction counter
-transactions
I read the use is also for light-weight verification nodes, so they don't need to download the whole blockchain, but just need the merkle trees hashes.
Finally an authentic one thanks man
Nice display of the NAP at the end there!
Your video is great. but something bothers me. I am very sorry, I am a beginner.
How can I look at the branches of the merkle tree when everything is hashed?
I thought if you hash something you will not know the data itself?
Hi man and thanks for your video. Btw i think you made a little mistake. The right child of the root should be Hefgh instead of Habcd. Have a good day !
great video man, thank you
What is a merkle branch?
why don't we hash(t1,t2,t3,....t999)? why the tree?
Explanied Very well, Good Job Kiefer Kif.
I have a quick question, Who decides the block time duration ? Currently for every 10 minutes a new block is getting created. Who is deciding this Block time?
Thanks,
Kalyan
Thank you!
The block time is determined by the Difficulty and it's a very rough system of timing it. the way it works is the protocol looks at the current hash power and sets the difficulty to to make it so that based on the current hash power of the network, it will take an average of 10 minutes to find the next block. and it re-targets the difficulty ever 2016 blocks. because there's a lot of chaos involved in this process some blocks can take much more or much less time than 10 minutes. Especially if the hash power changes suddenly.(i.e. lots of miners go offline or get put online)
Thanks Keifer Kif for your explanation.. Another quick question... Who decides which transaction to go for which block. I see there are lot of transactions happening in Bitcoin at any given time.. Who will be deciding which transactions to take and what to reject ? Is it the Miners ?
yes the miners / mining pools choose which transactions get included. they usually choose the transactions with the highest transaction fee to go on the block.
Thanks a Ton..Another quick question, Can you explain what and all will be included in Block Chain. If my understanding is correct. Block Hash will be hash of "BlockCreation Date and Time", "Transactions hash(Merkle Tree hash", "Previous Block Hash", "Nonce". Please add if I forget anything.. Thanks.
i thought that verified transactions in the transaction pool get chosen based on the size,(first 50kb) but also based on age of transaction and also based on the input (value of bitcoins in input). If my understanding is correct then if it was only the miners deciding based on input and best fees then wouldn't small transactions continually be left out and stay in the transaction pool forever? (BTW great vid on the Merkle tree)
Amazing explanation, thank you so much
Brilliant. Thanks.
Can the cryptographic hash function be anything or is it a specific type? For example is it still a merkle tree if it uses SHA256 as opposed to some other hash function or does it have to be one specifically?
NewWarrior21st I believe the concept of a merkle tree is not specific to any particular hash function.
Hey thank you for your reply! It looks like you're right, according to the wiki definition:
"Usually, a cryptographic hash function such as SHA-2 is used for the hashing. If the hash tree only needs to protect against unintentional damage, much less secure checksums such as CRCs can be used."
Does the same apply to the process you described in 2:00? Does hashing a pair mean a specific process or can someone simply append the two hashes from the previous transactions and then run them through a hash function again?
Appreciate the Vid Brother 😊
Was searching for a guy who would say " subscribe to my channel if you want to, im not forcing you" on youtube.......so I subscribed !
Nice explanation :)
feedback: You could use a reverse arrow (thinking left to right) when exiting [Hash of Last Block]
you dropped the magic mark and then .... Force you to do anything with your life!!! you were little high I reckon lolll Thanks for this nice short video! Great job dude
Hi Keifer! Super video! Could you clarify for me what the actual transaction looks like when I hash it in the first step? So in other words, how does a single transaction look like and in which text format is it written in order to then hash that text to get to the tx-id? Hope to hear from you, and thanks in advance.
Nice job, satoshi nakamoto wrote and explained this on his Bitcoin whitepaper
Very nice closure :)
thanks, super helpful!!
Great video and funny too!
love your video...
Great explanation, bro!
So funny how one minute ago you said you could not grow the whiteboard magically and then through editing you expand it upwards. Made me laugh, I thought it was hilarious.
Xd what a dramatic ending
But gotta thank you for teaching us.
May Allah bless you.
decent explanation man, thanks!