Dr. Leemon Baird: How Hashgraph Works - A Simple Explanation w/ Pictures

NOTE: At 43:51 Dr. Leemon Baird says: ’Now C2 can’t see it - there is no line from C2 to the black event.“ - This was a mistake (C2 can see [Black Event] through Alice); however, it doesn’t matter because C2 is not famous. Timestamps for this video 0:00 Intro 0:33 What is a hashgraph? 4:10 Why use a gossip protocol and how does it work? 6:44 What does an event include? 10:11 An example of a hashgraph 12:33 Rounds of voting without votes 15:47 What are witness events? 18:18 What are famous witnesses? 23:32 Counting votes are based on strongly seeing events 31:47 How to determine if a witness isn’t famous 36:15 How are normal rounds and coin rounds different? 39:55 The magic is in the math 41:14 Swirlds SDK download 42:36 Sorting all events 51:14 An example of a real hashgraph demo and closing Join our community to learn more: Website: Twitter: https://twitter.c