| Authors | Harmony Team |
|---|---|
| Year | 2019 (Version 2.0) |
| Project | Harmony |
| Document | Harmony Technical Whitepaper (PDF) |
This page summarizes the paper in original wording. The design and performance statements are the authors’ claims and depend on the assumptions stated in the paper; this is not an independent security audit or a description of every current network setting.
The Harmony Technical Whitepaper, authored by the Harmony Team, presents a proof-of-stake design for a blockchain that combines sharding, BFT consensus, distributed randomness, and cross-shard communication. Its 2019 Version 2.0 describes a proposed architecture; it should be read as a technical design with explicit security assumptions, not as evidence that every design choice remains active in the live network today.
What the paper is trying to solve
The paper focuses on scaling a public ledger while dividing validator communication, transaction processing, and stored state among shards. Its proposal links those components: shard chains process separate portions of activity, while a beacon chain records validator information and helps coordinate network-wide functions. The paper’s figures and security claims are theoretical or experimental results under its stated model, not guarantees for all deployments.
Shards, the beacon chain, and state
In the paper’s architecture, each shard chain validates relevant transactions and keeps its own state. The beacon chain is also a chain: it maintains the validator registry and participates in producing and recording randomness. It is not accurately described as a central coordinator that processes every cross-shard transfer. The design aims to let shards work in parallel while retaining ways to verify information from other shards.
Randomness and reshaping validator groups
Harmony proposes combining verifiable random functions (VRFs) with a verifiable delay function (VDF). Validators contribute VRF outputs; the protocol reaches BFT agreement on a preliminary value before applying the delay function and agreeing on the resulting randomness. The delay is meant to make it harder for a leader to choose a favorable outcome after seeing it.
That randomness is used in epoch-based assignment of stake-weighted voting shares. The paper describes a Cuckoo-rule resharding process; it does not simply say that every validator is replaced and randomly shuffled in full at every epoch. The security analysis assumes a particular adversary model, including slowly adaptive corruption, and should be understood within those limits.
FBFT and BLS multisignatures
The paper calls its consensus protocol Fast Byzantine Fault Tolerance (FBFT). A leader proposes a block, gathers validator signatures, and aggregates them into compact BLS multisignatures. The protocol has prepare and commit stages; quorum weight is based on staked voting shares, rather than treating every validator as one equal vote. The authors analyze communication complexity as linear in the validator group, compared with the quadratic all-to-all voting pattern they discuss for classic PBFT.
This is the paper’s protocol description, not an unconditional promise about finality or latency under every network condition.
Cross-shard communication
The paper proposes shard-driven messaging between chains, supported by Kademlia-style routing and erasure coding. It also describes an atomic-locking mechanism intended to keep cross-shard state changes consistent. These details differ from a simplified “receipt goes to the beacon, then the destination shard unlocks it” account: the beacon’s documented roles include randomness, staking, and shard-header references, while the paper presents cross-shard communication as direct shard-to-shard exchange.
How to read the claims
Version 2.0 is useful for understanding Harmony’s original technical goals and how it combined ideas from BFT consensus and sharded ledgers. Its security arguments rely on assumptions about stake distribution, randomness, validator behavior, and network operation. Distinguish those design arguments from an independent proof of deployed behavior, and check current protocol documentation or code before using the paper to describe today’s configuration.
Related Terms
See Also
- The Zilliqa Technical Whitepaper
- Nightshade: NEAR’s Sharding Design and Its Evolution
- Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Sources
- Harmony Team. (2019). Harmony Technical Whitepaper, Version 2.0. Official PDF — Primary source for the proposed architecture, consensus, randomness protocol, and stated security model.
- Castro, M., & Liskov, B. (1999). Practical Byzantine Fault Tolerance. OSDI ’99. USENIX paper record — Foundational BFT design that provides context for Harmony’s comparison of voting-message complexity.
- Boneh, D., Lynn, B., & Shacham, H. (2001). Short Signatures from the Weil Pairing. ASIACRYPT 2001. IACR paper PDF — Original short-signature work relevant to the BLS scheme cited by the whitepaper.
- Kokoris-Kogias, E., et al. (2018). OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding. IEEE Symposium on Security and Privacy. DOI record — A contemporary sharding design that the Harmony paper cites as related prior work.
- Zamani, M., Movahedi, M., & Raykova, M. (2018). RapidChain: Scaling Blockchain via Full Sharding. ACM CCS. IACR ePrint PDF — Related work on committee reshuffling and sharded blockchain architecture cited by Harmony.
Editorial review updated: October 28, 2026.