A Cooperative Proof of Work Scheme for Distributed Consensus Protocols
Wouter Kuijper
TL;DR
This paper introduces a cooperative proof-of-work scheme enabling multiple users to collaboratively achieve consensus on transaction order, enhancing distributed consensus protocols.
Contribution
It presents a novel refinement to traditional proof-of-work allowing cooperative efforts among users for transaction ordering in distributed systems.
Findings
Enables multiple users to cooperate on proof-of-work
Improves consensus efficiency in distributed protocols
Maintains security properties of traditional proof-of-work
Abstract
We propose a refinement to the well known, and widely used, proof-of-work scheme of zeroing a cryptographic hash. Our refinement allows multiple autonomous users to cooperate on the proof-of-work for their own transactions in order to bring about consensus on the order of said transactions.
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 · Cryptography and Data Security · Blockchain Technology Applications and Security