Reproduce “Consensus Mechanism Design based on Structured Directed Acyclic Graphs” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Jiahao He, Guangju Wang, Guangyuan Zhang, Jiheng Zhang
Researchers from The Hong Kong University of Science and Technology propose a structured Directed Acyclic Graph (sDAG) consensus mechanism that integrates a Nakamoto-like milestone chain to enhance blockchain scalability while maintaining security. This design achieves an estimated throughput of 1180 transactions per second (TPS) in an illustrative example, addressing the throughput and latency limitations of traditional chain-based systems.
Key insights
- Integrating a secure, Nakamoto-style milestone chain within a parallel DAG structure allows for increased scalability without fundamentally compromising PoW security.
- The use of small blocks and structured pointers facilitates faster propagation and enhanced network connectivity, enabling higher parallelism in transaction processing.
- Latency can be comprehensively understood by decomposing it into queueing, infection (internal DAG confirmation), and secure (milestone chain depth) components, offering insights into performance bottlenecks.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.