dido:public:ra:xapend:xapend.a_glossary:h:hashgraph
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
dido:public:ra:xapend:xapend.a_glossary:h:hashgraph [2022/01/10 21:00] nick |
dido:public:ra:xapend:xapend.a_glossary:h:hashgraph [2022/01/10 21:48] (current) nick |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| **Hashgraph** is a [[dido:public:ra:xapend:xapend.a_glossary:d:dlt]] that has been described as an alternative to [[dido:public:ra:xapend:xapend.a_glossary:b:blockchain | Blockchains]]. The Hashgraph technology is currently patented, and the only authorized ledger is Hedera Hashgraph. The native cryptocurrency of the Hedera Hashgraph system is **''HBAR''**. | **Hashgraph** is a [[dido:public:ra:xapend:xapend.a_glossary:d:dlt]] that has been described as an alternative to [[dido:public:ra:xapend:xapend.a_glossary:b:blockchain | Blockchains]]. The Hashgraph technology is currently patented, and the only authorized ledger is Hedera Hashgraph. The native cryptocurrency of the Hedera Hashgraph system is **''HBAR''**. | ||
| - | Unlike blockchains, Hashgraphs do not use [[dido:public:ra:xapend:xapend.a_glossary:m:miner | Miner Nodes]] to validate [[dido:public:ra:xapend:xapend.a_glossary:t:transaction | Transactions]]. Instead, Hashgraph use a [[dido:public:ra:xapend:xapend.a_glossary:g:gossip | "gossip about gossip" protocol]] where the individual [[dido:public:ra:xapend:xapend.a_glossary:n:node | Nodes]] on the network "gossip" about transactions to create [dido:public:ra:xapend:xapend.a_glossary:d:directed_acyclic_graph_dag | Directed Acyclic Graphs (DAGs)]] that time-sequence transactions without bundling them into blocks. Each "gossip" message contains one or more transactions plus a timestamp, a digital signature, and cryptographic hashes of two earlier events. This makes Hashgraph form an asynchronous Byzantine Fault-Tolerant (aBFT) consensus algorithm. | + | Unlike blockchains, Hashgraphs do not use [[dido:public:ra:xapend:xapend.a_glossary:m:miner | Miner Nodes]] to validate [[dido:public:ra:xapend:xapend.a_glossary:t:transaction | Transactions]]. Instead, Hashgraph use a [[dido:public:ra:xapend:xapend.a_glossary:g:gossip | "gossip about gossip" protocol]] where the individual [[dido:public:ra:xapend:xapend.a_glossary:n:node | Nodes]] on the network "gossip" about transactions to create [[dido:public:ra:xapend:xapend.a_glossary:d:directed_acyclic_graph_dag | Directed Acyclic Graphs (DAGs)]] that time-sequence transactions without bundling them into blocks. Each "gossip" message contains one or more transactions plus a timestamp, a digital signature, and cryptographic hashes of two earlier events. This makes Hashgraph form an [[dido:public:ra:xapend:xapend.a_glossary:a:abft]] consensus algorithm. |
| - | Hashgraph was invented in the mid-2010s by the American computer scientist Leemon Baird. Baird is the co-founder and chief technical officer of Swirlds, a company that holds patents covering the Hashgraph algorithm. | + | Hashgraph was invented in the mid-2010s by the American computer scientist Leemon Baird. Baird is the co-founder and chief technical officer of Swirlds, a company that holds patents covering the **Hashgraph** algorithm. |
| Source: [[https://en.wikipedia.org/wiki/Hashgraph ]] | Source: [[https://en.wikipedia.org/wiki/Hashgraph ]] | ||
dido/public/ra/xapend/xapend.a_glossary/h/hashgraph.1641866451.txt.gz · Last modified: 2022/01/10 21:00 by nick
