StakeDag: Stake-based Consensus For Scalable Trustless Systems
Quan Nguyen, Andre Cronje, Michael Kong, Alex Kampa, George Samman

TL;DR
StakeDag introduces a novel proof-of-stake consensus model for DAG-based trustless systems, enhancing security and scalability by leveraging participant stakes in a leaderless asynchronous environment.
Contribution
The paper presents a new stake-based consensus protocol, S_phi, for DAG systems, integrating trust and stake to improve security and practical Byzantine fault tolerance.
Findings
Proposes a new stake-based consensus protocol S_phi.
Achieves practical Byzantine fault tolerance in DAG systems.
Provides a general model of staking for asynchronous distributed systems.
Abstract
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 \emph{\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 , operating on the DAG as in the Lachesis protocol~\cite{lachesis01}. Specifically, we propose a stake-based protocol that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Blockchain Technology Applications and Security · Cryptography and Data Security
