PHANTOM and GHOSTDAG: A Scalable Generalization of Nakamoto Consensus
Yonatan Sompolinsky, Shai Wyborski, Aviv Zohar
Abstract
This paper introduces PHANTOM and GHOSTDAG, two protocols that generalize the Nakamoto consensus to directed acyclic graph (DAG) topologies. The traditional blockchain structure restricts throughput by forcing a linear order of blocks, often leading to stale blocks and network inefficiency. The authors present a mechanism where blocks can be mined in parallel and integrated into a DAG, while still ensuring a robust total ordering of transactions. PHANTOM provides a theoretical solution for a BFT-like consensus in a PoW-based network, while GHOSTDAG offers a scalable, highly efficient implementation that allows for fast confirmation times without compromising security. These contributions are instrumental in understanding how to maintain the decentralization properties of Proof of Work while breaking the scalability constraints of linear chains. The analysis provides deep insights into block-DAG structures and the mathematical proofs required to guarantee network security in non-linear topologies.
Key Findings
- 1Generalizes Nakamoto consensus to DAGs.
- 2Allows parallel block production without creating security vulnerabilities.
- 3Introduces GHOSTDAG for efficient ordering of blocks in a DAG.
- 4Demonstrates significant throughput improvements over linear PoW chains.
Topics
Citation
BibTeX
@misc{phantomand2018,
title = {PHANTOM and GHOSTDAG: A Scalable Generalization of Nakamoto Consensus},
author = {Yonatan Sompolinsky and Shai Wyborski and Aviv Zohar},
year = {2018},
howpublished = {\url{https://eprint.iacr.org/2018/104.pdf}},
}Knowledge Explorer
Explore Related Concepts
See how PHANTOM and GHOSTDAG: A Scalable Generalization of Nakamoto Consensus connects to glossary terms, books, and other research in the Knowledge Graph.