Consensus Mechanism Design based on Structured Directed Acyclic Graphs
Abstract
We introduce a structure for the directed acyclic graph (DAG) and a mechanism design based on that structure so that peers can reach consensus at large scale based on proof of work (PoW). We also design a mempool transaction assignment method based on the DAG structure to render negligible the probability that a transaction being processed by more than one miners. The result is a significant scale-up of the capacity without sacrificing security and decentralization.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2019
- DOI:
- 10.48550/arXiv.1901.02755
- arXiv:
- arXiv:1901.02755
- Bibcode:
- 2019arXiv190102755H
- Keywords:
-
- Computer Science - Distributed;
- Parallel;
- and Cluster Computing;
- Mathematics - Probability