Bitcoin came into existence in 2008 and introduced a digital currency to the world which was based on the blockchain. The technology introduced a new monetary system that utilized the distributed ledger system.
Relying solely on a peer-to-peer network, the distributed ledger technology (DLT) presents a better model which could help industries harness computing power like never before. As we are moving ahead of the client-server compute model, we have come closer to the new trust layer of the internet.
The transition is still limited due to the problems yet to be solved around scalability, efficiency and interoperability. Founded by Leemon Baird, the co-founder and CTO of Swirlds, Hashgraph has come as an alternative to the blockchain with its features like security, fairness, cost and speed.
This article is intended to understand the difference between the two different DLTs, i.e., Blockchain and Hashgraph.
In this article, we shall first discuss the following points:
A distributed ledger database is described as the ledger of any transactions or shared contracts, synchronized and maintained in decentralized form across different locations and people (nodes), eliminating the need for a central authority.
All the information on the distributed ledger (DL) is stored securely and accurately, kept immutable using cryptographic techniques. While the centralized ledgers are prone to cyber-attack, it is difficult to attack DLs because all the nodes will have to be attacked and manipulated simultaneously.
Underlying the distributed ledger technology is the Blockchain and Hedera Hashgraph, which use different data-structure and consensus mechanism to maintain Distributed Ledger Database.
The blockchain is a first generation Distributed ledger technology, working on a Sequential Data Structure which forms a sequence of Blocks.
Every time a new block is generated gets added on top of the last block.
Each block contains a set of transactions.
Blockchain relies on consensus mechanism such as ‘Proof of Work’ or ‘Proof of Stake.’
Proof of Work: It is the consensus mechanism which requires solving a puzzle by computation to bring a consensus in the network and secure the block.
Proof of Stake: It is a consensus mechanism in which a creator/validator is chosen to verify and add the block to the blockchain on the basis of coins they hold.
Proof of Elapsed Time: By following a fair lottery system, it prevents the network from high energy consumption and resource utilization. Often used on permissioned networks where participants have to identify themselves before joining the network, the algorithm offers the fair winning chances.
Practical Byzantine Fault Tolerance (PBFT): PBFT emphasizes the state machine. Though it can duplicate the system, it can prevent the network from Byzantine General Problem. Designed for asynchronous consensus systems, the nodes in the system are organized in a certain order. It can validate the transaction without any confirmation as required in proof of work algorithm.
Smart contracts deployed on the blockchain network are immutable. It means that the code and address of the smart contracts cannot be edited or modified once written permanently on the blockchain.
But a new contract can be used instead, which is similar to modifying a smart contract. Also, an intermediary smart contract can be updated that can hold the address of the current active smart contract with a function “delegatecall”.
The function used in a new intermediary smart contract would redirect all the transactions and calls to the active version.
An alternative solution is to just extract the information from the previous contract and add it into a new one. Update the address that you want your users to see.
Hedera Hashgraph is based on Distributed Ledger technology like Blockchain that works on Graph like Structure where all the nodes communicate their information to each other, and their communication is reported by building a graph of connections.
All the information or data is stored in events.
It relies on ‘Gossip about Gossip’ and ‘Virtual Voting’ mechanism to bring consensus to the network.
Gossip about Gossip:
Gossip means to transfer or sync information from one node to another random node.
In Gossip about Additional Gossip information, i.e., the previous information along with the new data is transferred from one node to another arbitrary node.
Using Gossip about Gossip mechanism, each node is already aware of what the other node knows, and each node can predict what the other node would vote, which results in electronic voting or virtual voting.
Since smart contracts are software programs, they can also face challenges like bugs, uneven behavior in certain conditions and design flaws.
As smart contracts once deployed cannot be modified whether one has to fix a bug or add new functionality, the only option is to deploy a new contract to replace the old one.
But Hedera Hashgraph presents an optional mechanism to enable “binding arbitration” for smart contracts. No doubt that the Hedera Smart Contract would be immutable, but it can be changed if several parties designed by a smart contract developer agree.
While deploying a smart contract on Hedera, developers can have a choice to choose the contract’s subsequent mutability.
Another way is to deploy a contract with a list of the public key of arbitrators. It would allow arbitrators to edit the code of contract, add features, reverse particular transactions and fix bugs.
Hashgraph Vs Blockchain
|Consensus||Proof of Work, Proof of Stake, Practical Byzantine Fault Tolerance, Proof of Elapsed Time||Virtual Voting|
|Security Mechanism||Cryptographic Hashing||Asynchronous Byzantine Fault Tolerance|
|Applications||Bitcoin, Ethereum, Hyperledger Blockchain Projects, EOS||Swirlds|
|Speed||100 to 1000 transaction based on the protocol implementation like ethereum, hyperledger etc.||500,000 transaction per second|
|Asynchronous Byzantine Fault Tolerance||Few implementation in Hyperledger are Byzantine Fault tolerance ready.||100% compliance|
Blockchain ensures that the data is not stored at an individual location and controlled by the single entity.
On the other hand, Hedera Hashgraph is also a distributed ledger technology that works on the above data structure and a better consensus mechanism that gives the benefit of Blockchain without its limitations.
The Hedera Hashgraph algorithm does not require Proof of Work or Leader Based Systems, and can also deliver low-cost and high performance without a single point of failure.
Also, Hashgraph does not need high computation power and electrical supply.
Every blockchain platform has a different speed in terms of transactions per second.
For example, Bitcoin can make 7-10 transactions in a second, Ethereum has potential to perform 15-20 transactions per second and Hyperledger Sawtooth can make thousands of transactions in a second.
Hedera Hashgraph allows hundreds of thousands of transactions per second, as the information travels exponentially.
Hedera Hashgraph also proves to be fairer than Blockchain as miners can choose the order of transactions, can delay them or even stop them from entering the block if necessary. But in Hashgraph, a consensus of a timestamp is used preventing individuals from changing the order of transactions.
Hashgraph is a promising technology, but it also comes with some limitations.
Currently, the technology has only been deployed in private and permission-based network. It is still to be tested and explored in public network.
In Gossip about Gossip technique when a node passes information to another node, there are chances that the closest nodes are malicious which may prevent the passage of information to other nodes.
The technology behind the Hedera Hashgraph is exceptionally intriguing, but its real potential and effectiveness will only be known once it is released to the public and non-permission based network.
At LeewayHertz, we have a created a workforce that has been building distributed ledger applications for multiple industrial use-cases.
Talk to us to discuss your project requirement.