The hashgraph algorithm is protected by patents. The patents are a tool designed to inhibit forking and the associated instability and loss of network effects. The absence of enterprise-grade applications running on the public networks today is partly due to the possibility of those networks splitting into competing networks and cryptocurrencies. This represents risk to anyone considering building mission critical applications on those networks. The patents will allow Hedera to make a commitment to such enterprises that we will never authorize a fork.
Articles in this section
- How much bandwidth overhead does gossip about gossip add to messages?
- Have any non-Carnegie Mellon professors or academics verified hashgraph as asynchronous Byzantine fault tolerant (ABFT)?
- Who generates the timestamp on a transaction?
- What is 'gossip about gossip and 'virtual voting'?
- Why was hashgraph invented?
- Is the hashgraph consensus algorithm patented?
- How can hashgraph deliver consensus without proof-of-work?
- How efficient is the hashgraph consensus algorithm?
- Does the FLP theorem say aBFT consensus is impossible?
- Where can I find more information about the hashgraph Coq proof?