Hashgraph ? Vs Holochain ?

0 views
Skip to first unread message

Dante-Gabryell Monson

unread,
Jan 14, 2018, 8:54:26 AM1/14/18
to econ...@googlegroups.com, op-...@googlegroups.com, ope...@googlegroups.com
https://hashgraph.com/




Update: A message left by the Hashgraph team that explains a bit better on how their platform technically works:

Note that we are our own consensus algorithm. While Ethereum is looking at PoS with Casper, our algorithm uses something called Virtual Voting – its a voting system – without having to do the votes. Hashgraph uses a protocol called “Gossip about Gossip” to achieve consensus. Gossip is a well known computer science term, which can be defined as calling any random node and telling that node everything you know, that it does not know. In distributed ledger technology the “baseline” or minimum bandwidth required is that the transactions go to every node. Gossip about Gossip refers to attaching a small additional amount of information to this Gossip, which contains the last person we talked to, hence, we are gossiping about the information we gossiped. Using this information, we can build the Hashgraph. Once we have the Hashgraph, it is extremely easy to know what a node would vote, because we know what each node knows, and when they knew it. We now can use the data from the Hashgraph as an input to 30 year old voting algorithms, and achieve consensus essentially for free. These 30 year old voting algorithms have strong math proofs- they are Asynchronous Byzantine Fault Tolerant, which means we know when we will achieve consensus, guaranteed, and our math proofs make no assumptions about the speed of the internet, due to firewalls, ddos attacks, viruses or botnets. In addition, because of gossip about gossip, Hashgraph is extremely fast, (250,000 transactions/sec), and we also get fair ordering and time stamping on every event.


Reply all
Reply to author
Forward
0 new messages