This paper is a Systematization of Knowledge (SoK) on Directed Acyclic Graph (DAG)-based consensus protocols, analyzing their performance and trade-offs within the framework of consistency, availability, and partition tolerance inspired by the CAP theorem. We classify DAG-based consensus protocols into availability-focused and consistency-focused categories, exploring their design principles, core functionalities, and associated trade-offs. Furthermore, we examine key properties, attack vectors, and recent developments, providing insights into security, scalability, and fairness challenges. Finally, we identify research gaps and outline directions for advancing DAG-based consensus mechanisms.
@article{arxiv.2411.10026,
title = {SoK: DAG-based Consensus Protocols},
author = {Mayank Raikwar and Nikita Polyanskii and Sebastian Müller},
journal= {arXiv preprint arXiv:2411.10026},
year = {2025}
}
Comments
This is a revised and updated version of the paper published in the proceedings of IEEE ICBC 2024. Comments are welcome