Decentralized network congestion control for DAG-based distributed ledger system
Researchers propose node-specific variable proof-of-work to curb transaction spamming in DAG-based distributed ledgers, proving a Nash equilibrium enforces prescribed node behavior.
The paper proposes a variable, behavior-based node-specific proof-of-work model for DAG-based distributed ledger networks, where congestion is mainly driven by transaction spamming rather than user growth or token launches. The model grants equal opportunity to stakeholders regardless of computational resources and penalizes nodes issuing more than a prescribed number of transactions. System behavior is modeled as a non-cooperative game over finite network resources, and the authors prove existence of a Nash equilibrium enforcing the prescribed behavior.
- Targets congestion caused by transaction spamming in DAG-based DLT networks.
- Node-specific variable PoW inside the consensus framework deters network spamming.
- Grants equal opportunity to stakeholders regardless of computational resources.
- Nash equilibrium proof shows the model enforces prescribed node behavior.
From the original article
1 min read at arxiv.orgWe propose a variable and behavior-based node-specific proof-of-work (PoW) model for a directed acyclic graph (DAG)-based distributed ledger technology (DLT) network to mitigate decentralized network congestion control. Network congestion control for centralized communication systems is an established field of study, with detailed and continuous research being done on the subject.
By Mayank Pandey · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.