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.
@article{arxiv.1901.02755,
title = {Consensus Mechanism Design based on Structured Directed Acyclic Graphs},
author = {Jiahao He and Guangju Wang and Guangyuan Zhang and Jiheng Zhang},
journal= {arXiv preprint arXiv:1901.02755},
year = {2019}
}