So... What's wrong with hash(t1 + t2 + ... + tn) ? What's the advantage of Merkle tree vs. a simple block concatenation and then getting a hash of that?
I really appreciate the way you explained the basic concept about blockchain. How can we implement this technology in our web application,???. Can you please explain the tools and concept in order to integrate this technology in our web application.
Hi Navin, thank you for your Explanations all over the videos you are posting and it's really encouraging us to learn more about Block chain and other technologies. I have a question I have a question for you as I have no coding experience and currently working in an Indian W**** IT company from last 4 years. How can I get certified as a block chain Advisor/Architect. Will I get an opportunity outside as a Fresher??
Merkle tree seems to be the best means of verification for blockchain as it's gives users hope of security. I'm glad to know that MEXC have joined the league of exchanges to published theirs.
Thank you so much, sir, for this wonderful series,, I have one question, sir,,,, why we combine hash of only 2 at a time why not we combine the value of H1 to H10 and then find one value. and if we do in this way as you explained, then if I want to verify the transaction T1 how can I do that because at the end I have value of Hash which is generated by combining all the hash values,,, so to check I need to combine all these values once again to verify a single transaction T1?
I think it is just like quick sort in algorithms if we directly convert all the hash keys into a single hash key it will take a lot of time to find the transaction details of last nth transaction the Merkle root will help the block to fetch the transaction detail fast and secure and it also decreases the consumption of space in some cases
@@nagasai9591 if in odd number of transactions it is repeated doesn’t it brings 2 same entries twice in the block? So for eg is A paid B is repeated twice does he pay B twice? I dont get it
The merkle tree in bitcoin is not so that you can get one hash. Merkle trees are there for very very large (>10GB block sizes) - as was always Satoshi's plan - stated clearly by him from early on. The reason satoshi added merkle trees is so that when bitcoin is using 1GB or 1 terabyte blocks, it facilitates SPV verification and clients / wallets only need the 80 byte header + merkle proof to prove that some event did indeed take place (it's included in a block for sure!) - but do not need to ingest these massive blocks just to do SPV on one tx. All parts of the design make sense for the original, unadulterated bitcoin implementation, Bitcoin SV - (BSV) - don't listen to those BTC Segwit idiots about their 1MB block size production quotas...
@@quattroquinti8453 Exactly. At 1MB blocks on BTC they may as well just hash the whole piddly ass block (it's only 6MB / hour for christ sakes) and save all the hassle about merkle trees... and LOL now with segwit coin (BTC) you need to also go and grab the witness merkle root from the coinbase... How TF do you make SPV wallets for that? IDK... what a mess... People should just use Bitcoin (BSV).
yes naveen reddy, my understanding is every 2 of txn's givings a uni-hashing,and then this 2 hashing becomes a single hashing like this continuous to all the hashes form together gives a hash this process is called merkle tree right... so what is the actual purpose of merkle tree is to finding a simple way for transactions...?
But if new transaction is added to the block, the hash will change, and so the change has to be made on all the blocks. I am getting confused. Please Help.
that escalated quickly bro 2 minute video was like a teaser. if concept is simple please add two or more concepts in a single video if possible since i have been waiting days for this 2 minutes. i said "if possible" because i can understand ur situation its hard to handle this much of tutorials at the same time. hats off for your effort and time. thank you always 💓
At the end of the video: lecture turns into rap
hahaha
bwahaha
😂
Your hard work is clearly visible in the concepts you are saying and the editing of the video
Wow, this 2 mins explanation really cleared all the doubts, thanks :)
This is the only one i watched that really simplified the merkle tree concept. thank you!
Short. Informative. Crisp. Clear and to the point
Thanks for making me understand this complex subject in few minutes.
Thanks... easy to understand even if I am French speaker.. Your English was simple...
u make it so simple to understand thx so much man !
Awesome. Now we know how a hash of a block is calculated. Key concept! Thanks!
Wowww Mazzza aaa gya ☺️☺️
What a good Tallent /experience of teaching.
Thnx sir
Earlier i was not interested in blockchain but after u uploaded the videos i like the blockchain
Nice explaination.....
short and so informative!!
even chatgpt would not have tell this much simpler, Thanks
Great work @Telusko this is one easy way to explain complex things...Now I have subscribed for more content from you
very clear explanation. keep going
This explanation is the best thing i've ever seen
Great explanation in just 2 mins!!
Beautifully articulated....Thanks actually i was watching some other videos for reference i saw your video. Cool
just amazing, now I can write 2 pages on this in my exam..😁
Oh man!!! You are a great teacher...💥
Explanation is Amazing Bro...👌👌
Amazing animations to support every explanation!
Very good explanation! Thanks!
So... What's wrong with hash(t1 + t2 + ... + tn) ? What's the advantage of Merkle tree vs. a simple block concatenation and then getting a hash of that?
What a background music in the Introduction.....Bravo...so cool...and cool series...
I really appreciate the way you explained the basic concept about blockchain. How can we implement this technology in our web application,???. Can you please explain the tools and concept in order to integrate this technology in our web application.
Enjoying Blockchain series.
Happy Diwali..
Please make more practical implementation videos on blockchain
you are the best!!! excellent explanation
Very clear , thank you.
Thanks for the quick explanation, great videos!
Lucid and interesting manner of describing... 👍
beautiful explanation sir, big fan
Great explanation 😁🤩
Nice clear explanation
Two and half minutes and he managed to explain a complex topic in a way, which would enable a kid to understand lmfao
Like!
Excellent explanation as always..
fantastic video and explanation
Hi Navin, thank you for your Explanations all over the videos you are posting and it's really encouraging us to learn more about Block chain and other technologies. I have a question I have a question for you as I have no coding experience and currently working in an Indian W**** IT company from last 4 years. How can I get certified as a block chain Advisor/Architect. Will I get an opportunity outside as a Fresher??
U got opportunity? ,2 years over
great explanation thanks. Very easy to understand, google algorithm, make this guy rank 1 for bitcoin explained keywords
Thanks, at last I've understood it.
Merkle tree seems to be the best means of verification for blockchain as it's gives users hope of security. I'm glad to know that MEXC have joined the league of exchanges to published theirs.
Amazing! Thank you! Great Job
very nice explanation
amazing explanation
Killer explanation, thank you.
Thank you so much, sir, for this wonderful series,, I have one question, sir,,,, why we combine hash of only 2 at a time why not we combine the value of H1 to H10 and then find one value. and if we do in this way as you explained, then if I want to verify the transaction T1 how can I do that because at the end I have value of Hash which is generated by combining all the hash values,,, so to check I need to combine all these values once again to verify a single transaction T1?
I think it is just like quick sort in algorithms if we directly convert all the hash keys into a single hash key it will take a lot of time to find the transaction details of last nth transaction the Merkle root will help the block to fetch the transaction detail fast and secure and it also decreases the consumption of space in some cases
@@nagasai9591 if in odd number of transactions it is repeated doesn’t it brings 2 same entries twice in the block?
So for eg is A paid B is repeated twice does he pay B twice?
I dont get it
Short and useful, thank you
god bless this tutorial masters
Very helpful, thanks!
Can u plz do a video about LAMP STACK Developer
Bro learn MEAN stack. LAMP is becoming obsolete.
Very neat explaination.. Sir can you do a video on how to use digital signature in block chain technology
research public and private key cryptography, I recommend starting with Diffie Hellman exchanges
sir, will we develop block chain using any programming language??
If yes, then what is the language we go with??
@@Telusko ok sir
Great explanation!! thanks
The merkle tree in bitcoin is not so that you can get one hash. Merkle trees are there for very very large (>10GB block sizes) - as was always Satoshi's plan - stated clearly by him from early on. The reason satoshi added merkle trees is so that when bitcoin is using 1GB or 1 terabyte blocks, it facilitates SPV verification and clients / wallets only need the 80 byte header + merkle proof to prove that some event did indeed take place (it's included in a block for sure!) - but do not need to ingest these massive blocks just to do SPV on one tx. All parts of the design make sense for the original, unadulterated bitcoin implementation, Bitcoin SV - (BSV) - don't listen to those BTC Segwit idiots about their 1MB block size production quotas...
Exactly. To get one hash one could simply hash the whole block.
@@quattroquinti8453 Exactly. At 1MB blocks on BTC they may as well just hash the whole piddly ass block (it's only 6MB / hour for christ sakes) and save all the hassle about merkle trees... and LOL now with segwit coin (BTC) you need to also go and grab the witness merkle root from the coinbase... How TF do you make SPV wallets for that? IDK... what a mess... People should just use Bitcoin (BSV).
@@austecon6818 Btw. Austrian School rocks and von Mises is a god.
@@quattroquinti8453 Cheers homie. Seems he's catching on the last 5 years. He was my boy since before it was cool haha
Hi sir, can you suggest any references to explore blockchain in more detail... Thanks a lot for this video
Better explanation than at Coursera
Great sir mashallah
Sir please make a video about gate is mandatory for getting a engineering degree, is it good for all cse students????
Nicely explained 💥
Very amazing video sir
please post more videos on blockchain please
This man calls us aliens and it reminds me to go to mars as soon as possible
i felt stupid after reading 5 papers, thank you! I finally understood :D
I have a doubt. One block has only one transaction hash right and one previous block hash right? How are multiple transactions stored in one block?
Nice editing and bgm
Best place to learn
Happy Diwali Sir
yes naveen reddy, my understanding is every 2 of txn's givings a uni-hashing,and then this 2 hashing becomes a single hashing like this continuous to all the hashes form together gives a hash this process is called merkle tree right...
so what is the actual purpose of merkle tree is to finding a simple way for transactions...?
But if new transaction is added to the block, the hash will change, and so the change has to be made on all the blocks. I am getting confused. Please Help.
Awesome sir thanks a lot
love u bro , plz make a video on ETH, ico and its working with ETH blockchain ✌️✌️
Long time there are no further updates on this subject?
You are best sir. Please keep it up.
WELL DONE
not gonna lie the music are really cool
Sir waiting for your videos
nice editing
Great Sir..!!
sir post next lecture fast, why so late
Sir increase video length atleast to 7minutes
sir dont take me in wrong. i think 7 minute video would be awesome.
@@Telusko you are right its fine
📢📢 Libonomy’s engine Aphelion continuously improves by itself to grant the best performance at all times👌👌.
What happened other video?why not uploading sir????
Thank you sir
thank you
i have one doubt . what about one block of hash value changed in a blockchain due to threat . what happen next . plz post vidio about it.
excellent...!!!!
Thank you!
Thanks for sharing. You speak a bit too fast leading to unclear words sometimes.
tussi great ho sir ji
wonderful
thanks a lot
its basically a binary tree.A perfect binary tree
if the od number of transaction in a block then how the pairing is happening
Very easy
Clearly defined
that escalated quickly
bro 2 minute video was like a teaser. if concept is simple please add two or more concepts in a single video if possible since i have been waiting days for this 2 minutes.
i said "if possible" because i can understand ur situation its hard to handle this much of tutorials at the same time. hats off for your effort and time. thank you always 💓
And Why is there a merkle tree used and not just hash a concatenation of all transactions?
Thanks man
thank u sir