Distributed timestamping protocols were first applied to decentralizing a financial network in the ground-breaking paper on Bitcoin by Nakamoto1. The field has seen explosive research follow-up from both amateurs and professionals, competing to offer extensions, adjustments, improvements, and refinements of the existing protocol. Notable implementations of new ideas include Ethereum2, which extended scripting, CryptoNote3, which refined privacy, and Sidechains4, which investigated two-way pegs with 1:1 Bitcoin tokens. These protocols all utilize proof-of-work (PoW) as originally described in the Bitcoin whitepaper.
A common extension to the Bitcoin protocol modifies the consensus mechanism to either completely or partially use proof-of-stake (PoS), or the use of one’s stake (tokens) rather than one’s computational power to participate in the timestamping process. The first proof-of-stake blockchain based on the Bitcoin protocol was implemented in 2012 by King and Nadal5, and includes both PoW and PoS that gradually skew towards complete PoS over time. Criticisms of pure PoS consensus systems have themselves been abundant6 7, with the most vehement opposition coming from those working with purely PoW blockchains. The most common argument against PoS for distributed timestamping is “nothing-at-stake” or “costless simulation”, describing the systematic instability resulting from stakeholders being able to generate alternatively timestamped histories with no cost to themselves.
Despite the controversy, it is apparent that systems with a PoS overlay dependent on a PoW timestamping system may be able to independently achieve consensus. This is mathematically explored by Bentov and colleagues8 in a paper on their scheme, proof-of-activity (PoA), and appears to be a viable extension to the PoW protocols that may enable some interesting new properties. A similar design called MC2 was earlier proposed by Mackenzie in 20139. Here we describe the construction and implementation of a similar consensus system that we have named “Decred”.
Research work in Decred is currently organized around the following subsections:
- Hybrid Design
- Decentralized Stake Pooling
- Elliptic Curve Signature Algorithms
- BLAKE-256 Hash Function
- Script Extensions
- Signature Script Isolation and Fraud Proofs
- Transaction Extensions
- Schnorr Signatures
- Miscellaneous Improvements
Buterin V. 2014. A Next-generation smart contract and decentralized application platform. ↩
Back A., Corallo M., Dashjr L., Friedenbach M., Maxwell G., Miller A., Poelstra A., Timon A., Wuille P. 2014. Enabling Bitcoin innovations with pegged sidechains. ↩
King S. and Nadal S. 2012. PPCoin: Peer-to-peer crypto-currency with proof-of-stake. ↩
Bentov I., Lee C., Mizrahi A., Rosenfeld M. 2014. Proof-of-activity: Extending Bitcoin’s proof-of-work via proof-of-stake. ↩
Mackenzie A. 2013. MEMCOIN2: A hybrid proof-of-work, proof-of-stake crypto-currency. ↩