2019/07/05 by Quan Nguyen, André Cronje, Nguyen, Quan +7
Computer Science · #Blockchain Technology Applications and Security #Cryptography and Data Security #Cryptography and Security (cs.CR) #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1907.03655
openalex publication_date 2019/07/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Trustless systems, such as those blockchain enpowered, provide trust in the system regardless of the trust of its participants, who may be honest or malicious. Proof-of-stake (PoS) protocols and DAG-based approaches have emerged as a better alternative than the proof of work (PoW) for consensus. This paper introduces a new model, so-called \stakedag, which aims for PoS consensus in a DAG-based trustless system. We address a general model of trustless system in which participants are distinguished by their stake or trust: users and validators. Users are normal participants with a no assumed trust and validators are high profile participants with an established trust. We then propose a new family of stake-based consensus protocols \mathfrakS, operating on the DAG as in the Lachesis protocol~\citelachesis01. Specifically, we propose a stake-based protocol Sϕ that leverages participants' stake as validating weights to achieve more secure distributed systems with practical Byzantine fault tolerance (pBFT) in leaderless asynchronous Directed Acyclic Graph (DAG). We then present a general model of staking for asynchronous DAG-based distributed systems.