{"id":19318,"date":"2017-12-09T18:48:20","date_gmt":"2017-12-10T02:48:20","guid":{"rendered":"https:\/\/cryptoslate.com\/?p=19318"},"modified":"2020-03-24T06:49:50","modified_gmt":"2020-03-24T06:49:50","slug":"hashgraph-vs-blockchain","status":"publish","type":"post","link":"https:\/\/cryptoslate.com\/hashgraph-vs-blockchain\/","title":{"rendered":"Hashgraph vs… Blockchain?"},"content":{"rendered":"

There have been literally thousands of competitors since the birth of Bitcoin, many of which have made great improvements to the scalability and durability that we now see lacking in the number one coin. Because we are still in the early phases of blockchain technology (some say it's where the Internet was in '93), there is still room for something beyond<\/em> Bitcoin to rise.\u00a0But is there still time for a new distributed ledger technology (DLT)?<\/p>\n

\"Hashgraph
Hashgraph is a data structure and consensus algorithm that is fast, secure and fair.<\/figcaption><\/figure>\n

After the summer of ICOs<\/a> and the thousands of companies created off of the blockchain, there are billions of dollars invested. But Leemon Baird, founder of Hashgraph, doesn't feel stunted by this. He believes that in the fast-paced way the Internet works, Hashgraph stands a big chance of being the first true competitor to blockchain.<\/p>\n

Hashgraph is not new- Leemon has been working on the math for five years now. While it seemed impossible at first, he was determined to get fast, scalable consensus with immutable security features. As we have seen with Bitcoin's recent jump in scale, the blockchain is immutable, but incredibly slow.<\/p>\n

Even with faster methods such as Proof of Stake<\/a>, transaction speeds are still relatively slow. In fact, the scaling problem<\/a> is arguably the biggest technological barrier we face with blockchain.<\/p>\n

Baird saw this coming years ago. Which is why he came up with Hashgraph.<\/p>\n

Hashgraph<\/a> comes to consensus in a much different way. This replicated state machine uses a true asynchronous Byzantine fault tolerance (meaning that a consensus must be made) and communicates transactions through a process in the computer science world known as\u00a0gossip.\u00a0<\/em>The phrase used in the white paper is actually “gossip about gossip.” The Hashgraph is the reflection of the gossip being made by the transactions.<\/p>\n

\"\"
Hashgraph opens up exciting decentralized application use cases such as micro-payments, distributed capital markets, live collaboration apps, distributed MMOs, auctions and more.<\/figcaption><\/figure>\n

If you think about the blockchain being a chain of blocks, one after the other in chronological order, Hashgraph can be seen as multiple avenues that are webbed together by gossip<\/em>. “Gossip” is when one computer makes a transaction, then randomly tells two other computers.<\/p>\n

Those two computers will tell four other computers, and it exponentially increases until all computers on the network know about a transaction. The messages, or hashes, that are sent by the “gossip” can be compressed to only 1 or 2 bytes big.<\/p>\n

“You know the consensus. You know that you know the consensus. You know that everyone else is going to agree with your consensus. Guaranteed mathematically \u2013 that\u2019s where the Byzantine fault tolerance purely asynchronous all comes in. You do this with zero communication. You get it for free and in a fraction of a second. That\u2019s Hashgraph<\/em>.”
\n– Leemon Baird (Hidden Forces<\/a> Interview)<\/em><\/p><\/blockquote>\n

Sounds like it would be a lot of memory to add a completely new history each time, but Baird has found a way to compress down to as little as 1 or 2 bytes per message.<\/p>\n

“The only reason you could do it is because you have this \u201cH<\/em>ashgraph\u201d<\/em>\u00a0that shows you exactly how everybody talked to each other, and you get that almost for free by adding just two really compressed hashes to each message. If I\u2019m a computer on the network, I know everyone you\u2019ve talked to, when you learn things, when those people learn things, and when those people learn things. If you\u2019re another computer on the network and you\u00a0were to vote, I bet I could predict what your vote would be. So, I\u2019m just going to pretend that you sent me that vote \u2013 you don\u2019t even have to bother sending it to me.”<\/p><\/blockquote>\n

And that's another interesting point about blockchain: \u00a0Nothing is truly Byzantine fault tolerant. When you go to check on a transaction on the blockchain, there is never a moment when a transaction has come to 100% consensus. We just come to agree that it is true after about 6 confirmations. Hashgraph would guarantee\u00a0confirmation after the first message.<\/p>\n

While the numbers\u00a0aren't out yet in terms of transactions per second, it is said by the Hashgraph community to be much larger than anything we've seen. From reading the whitepaper, I would imagine it's comparable to Visa.<\/p>\n