Consensus mechanism design based on structured directed acyclic graphs

Capacity limit is a bottleneck for broader applications of blockchain systems. Scaling up capacity while preserving security and decentralization are major challenges in blockchain infrastructure design. In this paper, we design a proof of work-based mechanism by endowing directed acyclic graphs (DA...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Jiahao He, Guangju Wang, Guangyuan Zhang, Jiheng Zhang
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2021
Materias:	Consensus Directed acyclic graph Proof of work Transaction assignment Information technology T58.5-58.64
Acceso en línea:	https://doaj.org/article/36551789cbdd44fe8a5107b451b26156
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:36551789cbdd44fe8a5107b451b26156
record_format	dspace
spelling	oai:doaj.org-article:36551789cbdd44fe8a5107b451b261562021-11-22T04:23:30ZConsensus mechanism design based on structured directed acyclic graphs2666-953610.1016/j.bcra.2021.100011https://doaj.org/article/36551789cbdd44fe8a5107b451b261562021-03-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2096720921000063https://doaj.org/toc/2666-9536Capacity limit is a bottleneck for broader applications of blockchain systems. Scaling up capacity while preserving security and decentralization are major challenges in blockchain infrastructure design. In this paper, we design a proof of work-based mechanism by endowing directed acyclic graphs (DAG) with a novel structure so that peers can reach consensus at a large scale. At a high level, we break large blocks into smaller ones to improve utilization of broadcast network and embed a Nakamoto chain inside the DAG in a decent way to ensure security. We further exploit the DAG structure and design a mempool transaction assignment method. The method reduces the probability that a transaction is processed by multiple miners and hence improves processing efficiency. Without sacrificing security and decentralization, our design significant scales up capacity and also addresses important issues such as high latency and mining power concentration in existing blockchain systems.Jiahao HeGuangju WangGuangyuan ZhangJiheng ZhangElsevierarticleConsensusDirected acyclic graphProof of workTransaction assignmentInformation technologyT58.5-58.64ENBlockchain: Research and Applications, Vol 2, Iss 1, Pp 100011- (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Consensus Directed acyclic graph Proof of work Transaction assignment Information technology T58.5-58.64
spellingShingle	Consensus Directed acyclic graph Proof of work Transaction assignment Information technology T58.5-58.64 Jiahao He Guangju Wang Guangyuan Zhang Jiheng Zhang Consensus mechanism design based on structured directed acyclic graphs
description	Capacity limit is a bottleneck for broader applications of blockchain systems. Scaling up capacity while preserving security and decentralization are major challenges in blockchain infrastructure design. In this paper, we design a proof of work-based mechanism by endowing directed acyclic graphs (DAG) with a novel structure so that peers can reach consensus at a large scale. At a high level, we break large blocks into smaller ones to improve utilization of broadcast network and embed a Nakamoto chain inside the DAG in a decent way to ensure security. We further exploit the DAG structure and design a mempool transaction assignment method. The method reduces the probability that a transaction is processed by multiple miners and hence improves processing efficiency. Without sacrificing security and decentralization, our design significant scales up capacity and also addresses important issues such as high latency and mining power concentration in existing blockchain systems.
format	article
author	Jiahao He Guangju Wang Guangyuan Zhang Jiheng Zhang
author_facet	Jiahao He Guangju Wang Guangyuan Zhang Jiheng Zhang
author_sort	Jiahao He
title	Consensus mechanism design based on structured directed acyclic graphs
title_short	Consensus mechanism design based on structured directed acyclic graphs
title_full	Consensus mechanism design based on structured directed acyclic graphs
title_fullStr	Consensus mechanism design based on structured directed acyclic graphs
title_full_unstemmed	Consensus mechanism design based on structured directed acyclic graphs
title_sort	consensus mechanism design based on structured directed acyclic graphs
publisher	Elsevier
publishDate	2021
url	https://doaj.org/article/36551789cbdd44fe8a5107b451b26156
work_keys_str_mv	AT jiahaohe consensusmechanismdesignbasedonstructureddirectedacyclicgraphs AT guangjuwang consensusmechanismdesignbasedonstructureddirectedacyclicgraphs AT guangyuanzhang consensusmechanismdesignbasedonstructureddirectedacyclicgraphs AT jihengzhang consensusmechanismdesignbasedonstructureddirectedacyclicgraphs
_version_	1718418214902300672

Consensus mechanism design based on structured directed acyclic graphs

Ejemplares similares