The Decrits Consensus Algorithm: Decentralized Agreement without Proof of Work
Ryan Pfeiffer
TL;DR
The paper introduces the Decrits Consensus Algorithm, a novel trustless consensus method for cryptocurrencies that offers enhanced security without the need for proof-of-work, reducing computational costs.
Contribution
It presents a new consensus algorithm that achieves trustlessness and security comparable to proof-of-work without incurring high computational costs.
Findings
DCA is as trustless as proof-of-work algorithms.
DCA provides superior transaction security.
DCA operates at virtually no computational cost.
Abstract
Decrits is a cryptocurrency in development that makes use of a novel consensus algorithm that does not require proof-of-work. This paper describes how the Decrits Consensus Algorithm (DCA) is as trustless as a proof-of-work algorithm while offering superior transaction security at virtually no cost.
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
TopicsBlockchain Technology Applications and Security · Cryptography and Data Security · Distributed systems and fault tolerance