A Cooperative Proof of Work Scheme for Distributed Consensus Protocols
This is an incremental improvement for distributed consensus protocols, potentially enhancing efficiency in blockchain or similar systems.
The paper tackles the problem of achieving consensus on transaction order in distributed systems by proposing a cooperative proof-of-work scheme that allows multiple users to work together, resulting in a refinement of the existing cryptographic hash-based method.
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.