Hashgraph uses gossip and locally calculated votes to agree on transaction order. Leemon Baird introduced the design in a Swirlds report in 2016.[1] The algorithm is used by Hedera.[4]
Author and Document
Published: May 31, 2016. Revised: March 18, 2018. Length: 28 PDF pages. Report license: unspecified.[1]
Original report (PDF). The 2016 consensus report and Hedera’s later public-network whitepaper are separate documents.
How Hashgraph Works
Gossip About Gossip
Nodes exchange information through gossip. Each signed event contains a timestamp, transactions, and hashes identifying its self-parent and other-parent. Those references form a directed acyclic graph (DAG) of communication history. Nodes can temporarily know different recent events; shared events have consistent ancestor histories. The graph records who learned information through whom, supporting local consensus calculations.[2]
Virtual Voting
Nodes calculate votes from event ancestry instead of transmitting separate voting messages. The process assigns rounds, decides witness fame, and orders events. A witness is a node’s first event in a round; fame is decided through virtual votes across later rounds. An event’s round received is the first round whose famous witnesses all see it. Ordering then uses round received, consensus timestamp, and a signature tie-breaker.[3]
Security, Finality and Limits
aBFT assumes fewer than one-third Byzantine participants, secure cryptography and eventual honest-node communication. Finalized consensus is certain within these assumptions. Median timestamps resist minority manipulation but depend on honest clocks; they reflect network observation, not universal arrival time.[4]
Agreement eventually terminates with probability one; nondeterminism concerns completion, not uncertainty about a finalized order.[1] The FLP result explains why deterministic consensus cannot guarantee termination in a fully asynchronous model even with one possible crashed process.[5]
Practical implication: arbitrary message delays prevent a fixed completion deadline. Throughput depends on implementation and network resources; universal TPS claims need separate evidence. Avoiding proof-of-work does not eliminate node resource costs.[4]
Historical Context and Current Implementation
The platform’s 2020 Open Review release imposed usage restrictions. Hedera’s announcement records the change to Apache 2.0 open source on August 5, 2022.[6] In September 2024, Hedera contributed its code to Hiero under LF Decentralized Trust; software stewardship and Hedera network operational governance remain distinct.[7] The current Hiero consensus-node repository carries Apache 2.0.[8]
That software license does not establish the PDF’s license. Open code also does not, by itself, establish unrestricted membership in a deployed network.
Common Misconceptions
- No voting messages does not mean no communication. Gossip still transports events and transactions.
- aBFT is a conditional guarantee. Fault thresholds and communication assumptions matter.
- Consensus finality is separate from latency. Certainty about an agreed order does not guarantee a deadline.
- The 2016 report is not the 2020 network whitepaper. Their scope and editions differ.
Last updated: October 8, 2026
Related Terms
- Hedera (HBAR) — the network using Hashgraph consensus.
- DAG — the graph structure underlying event ancestry.
- Consensus Mechanism — how participants establish agreement.
See Also
- Algorand whitepaper — another approach to distributed agreement.
- Stellar consensus paper — a different trust and consensus model.
Sources
- Baird, Leemon. Swirlds report SWIRLDS-TR-2016-01 (2016; revised 2018). Original algorithm and proof.
- Hedera documentation. Gossip About Gossip. Event fields and communication history.
- Hedera documentation. Virtual Voting. Rounds, fame and event ordering.
- Hedera documentation. Hashgraph Consensus Algorithm. Security assumptions, timestamps and resource context.
- Fischer, Lynch and Paterson. Impossibility of Distributed Consensus with One Faulty Process (JACM, 1985). Deterministic asynchronous termination limits.
- Hedera. Hashgraph Platform is Now Available as Open Review (2020; updated notice). Records the August 2022 license change.
- Adkins, Charles. Introducing Hiero: The Foundation of the Future (September 16, 2024). Code contribution and governance scope.
- Hiero consensus-node repository. LICENSE. Current Apache 2.0 software terms.