A Cooperative Proof of Work Scheme for Distributed Consensus Protocols
classification
💻 cs.DS
cs.CR
keywords
consensusorderproof-of-workrefinementschemetransactionsallowsautonomous
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.