Computing the Heaviest Conflict-free Sub-DAG in DAG-based DLTs
Quentin Bramas
Abstract:In this paper, we consider DAG-based Distributed Ledger Technologies (DLTs),
i.e.
, DLTs where each block can reference several previous blocks hence forming a Directed Acyclic Graph of Blocks (BDAG). Each block has a weight (usually a constant normalized to one) and our goal is to compute the heaviest sub-BDAG that does not contain conflicting blocks.
First, we prove that computing such a sub-BDAG is NP-complete. Then, we show that the difficulty comes from concurr… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.