How Hashgraph Works - Dr. Leemon Baird at Thomson Reuters
HTML-код
- Опубликовано: 19 май 2024
- Leemon Baird, CTO/Co-founder of Swirlds' Hashgraph, gives an introduction to hashgraph and how it works at Thomas Reuters in Dallas, TX.
Special thanks to Thomson Reuters for hosting and filming/editing the video, and Hashgraph Ambassadors Sam Ulrich, Johnny Nobles, and Manish Patel for organizing.
Timestamps for this video
0:00 Distributed ledgers have four generations
4:51 Timestamp fairness, fast transactions and hashgraph gossip
9:43 What is gossip about gossip?
13:44 How does hashgraph achieve consensus? (Virtual voting)
15:41 What is the hashgraph consensus algorithm?
Join Our Community and Learn More:
Website: www.hedera.com/
Telegram Community Channel: t.me/hashgraph
Telegram News Channel: t.me/hashgraphnews
Twitter: / hashgraph
Reddit: / hashgraph
Medium: / hashgraph
LinkedIn: / 1129. .
Facebook: / hashgraph
#LeemonBaird #Hashgraph #GossipAboutGossip 
Наука
Please get Leemon Baird on Lex Fridmans podcast! Both are such great communicators
One of the best explanations of hashgraph ever...
Genius.
Dr Leemon Baird is so addictive to listen to. What a genius
This stuff never gets old!!! Had to get my Leemon fix!!! LFG!!!
If nodes each pick another random node to broadcast to, wouldn't you likely end up with massive duplication, whereby a node receives many different copies of the same message? And since it appears that nodes broadcast their message multiple times, how do the nodes know when to stop broadcasting?
Actually, when the nodes sync, they only share what they don't know. This is easily doable by sharing the last thing they know and working down from there. They don't need to share the entire event, just what the event was about. In Hashgraph, they track rounds, you can find more explanations about this in other videos he made.
@@Supremax67 this is so cool. It really is like neurons almost and how information flows through a network. Anyone who has gotten real time word of mouth gossip in junior high and highschool, especially before social media became big, gets it. Let's say the topic is, who is taking who to the homecoming dance. That's a time stamped event in the future. And there's a finite number of kids in the school who are going to go to this one event. (Afawk, obviously in real life sometimes people bring kids from other schools but for the sake of this example it's mainly kids within the school only going to the dance)
Kids naturally start to pair up or form carpool groups if they aren't going as couples. As the days get shorter and shorter to when the dance is gonna happen, you learn through the networks you are in, who is going with who. You mainly just remember who told you and if you talk to your friends, you hopefully remember what you told to the next person... The goal and use of this gossip is precisely avoiding repeated information, needing to be reshared as if we had all forgotten every round. Obviously as human beings with a decent memory we don't, because that would make picking dance dates inefficient if guys and gals and all the LGBT folks all kept trying to ask people who were already paired up. Instead if you're a smart kid you will ask people out to the dance who you KNOW or suspect aren't taken yet.
It very much sucks when you are the lonely kid who is out of the loop and last to know. But even if you are the kid who is last to know, and you still go to the dance alone, you know who is paired up with who because that's the culminating time stamp when the gossip is finished and you can just see with your eyes who is dancing with who.
@@Iquey bruh
I never have enough of him.
Great explanation.
I love the concept. I’m just confused as to what if someone originates a false transaction, how does the network detect that?
As long as the nodes are 66% honest it will even penalize false transactions.
@@learntotradecrypto3470 So its byzantine fault tolerance is lower than Proof of Work? Then why use it?
@@anonmouse956 -- It is a misconception of a network to claim they are 51% vulnerable. The math theorem states you can't do better than 1/3 malicious.
Got to be careful where you get your information, if they are not a math professor with a PhD, I wouldn't trust the source.
@@anonmouse956 POW takes more time which increases both Finality and Transaction cost., Hashgraph overcomes this issue through the Gossip protocol way.
THIS is why the first 39 Master nodes are going to be run with big cooperations with big volumes and on all various parts of the world and in all various categories of interest...
Then when they all depolyed, others will be able to run nodes themselves..
go public already dude
It's not that simple
I hear they launch tomorrow?? Rumor or fact cant confirm
but how do you know the person who sent you isn't lying about the last 2 people who sent them?
cryptographically signed, something super computers would take more than a thousand years to fake. So no, you can't "lie" about it.
What if timestamps happen on the Lightning network, that way you have no miner that can re-order them.. wouldn't that make your argument to irrelevant ?
Lightning network, you mean the centralized BS that Bitcoin came up with to fix their shortcomings?
@@Supremax67 Hey man I have a question about Hedera. How would the nodes know that the first person to “gossip” is not gossiping a fake transaction. (Example: Bob says Alice pays John $1000 but Alice doesn’t consent)
@@ghostplayz9754 -- Every transaction is signed, a signature that requires the knowledge of a private key. So unless you know the private key, you can't fake the transaction.
Screw moon, we are going out of solar system
"Virtual votes" is a nice way to throw off malicious intent if one were to do so in the far future.... I mean, just show the algorithm says they would have done XYZ and done.
7 dollars before 2030
Hello again! 140x by 2030 would imply a 2x every year for 7 years straight. Seems aggressive but I guess we shall see.
We might see 7$ be next year.
@@Supremax67 what's your thoughts about it now
@@-Nobody15650 -- No thoughts. I am holding long term.
@@Supremax67still holding?
What happens if Bob hacks Alice and send themself 1000-H, is it possible for Alice to claim the H-bars back from Bob?
Hacks, you mean if Bob is able to know Alice's Private key? That same private key that would take the best computer centuries to break? That private key?
@@Supremax67 Let’s say Alice “gossips” that Bob paid her $1000, how would the system know if the info Alice is communicating is non-fraudulent?
@@ghostplayz9754 -- Every transaction is signed. That signature cannot be falsified, it would be rejected by the other nodes.
The only way to fake a signature is by knowing the private key. Unless you gave that information away freely, very unlikely to happen.
Your marketing is great. Too bad your hashgraph would not resist at a strong sybil attack...
This is true in it's simplest and most elementary form - as described in this video. But there is nothing to stop anyone implementing this technology from adding any sort of artificial overhead to make a Sybil attack however expensive they want. You could require a micro-fee for each transaction, or you could use proof-of-stake or maybe require a certain amount of computation be done, etc., etc. You can build Sybil protection on top exactly how you want it.
This tech is aBFT, resistant to all form of attacks. But when the tech comes out, have at it and try to bring it down. I would love a good laugh.
@@dwahlstedt Well you got that spot on Dave!
bla bla bla centralized
bla bla bla, you're irrelevant :)
you probably invested in some other shit coin and now you are shitting ur pants XD
Well, not everything has to be decentralised
@@drumbottle centralization is what crypto currencies are out to solve. Why else do you think the dollar is failing ??
Can somebody explain how this is centralised ?
go public already dude
Done, March 2018
What a difference 5 years makes… here’s to the next 5…