Deterministic Proof Of Work
share
Blockchains such as Bitcoin and Ethereum designed their consensus protocol based on the Proof-of-Work (PoW) protocol. However, PoW has certain problems - its throughput is small and it also requires the user to wait extended periods of time for transactions to be confirmed, and even then, there is only a probabilistic guarantee that the transaction is irreversible. In this paper, we propose a new consensus protocol, called Deterministic Proof of Work (DPoW) that guarantees the deterministic finality of transactions. Our protocol introduces a Map-reduce PoW mining mechanism to work alongside Practical Byzantine Fault Tolerance (PBFT) verification. This mechanism allows for transactions to be confirmed immediately, thus largely improving scalability. In addition, it assures strong consistency and security against a multitude of attacks largely because the protocol does not allow forking. Finally, we conducted experiments which demonstrate that our consensus protocol can attain high levels of scalability and consistency without significant reduction to decentralization.
READ FULL TEXT
