Minting mechanism for proof of stake blockchains
From MaRDI portal
Publication:2229280
Recommendations
Cites work
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- Algorithmic rationality: game theory with costly computation
- Analysis of the Blockchain Protocol in Asynchronous Networks
- But why does it work? A rational protocol design treatment of bitcoin
- Computationally Sound Proofs
- Efficient verifiable delay functions
- FruitChains: a fair blockchain
- Homomorphic time-lock puzzles and applications
- Majority is not enough: bitcoin mining is vulnerable
- On the size of pairing-based non-interactive arguments
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Proofs of space
- Sequential auctions and externalities
- Simple verifiable delay functions
- The Bitcoin Backbone Protocol: Analysis and Applications
- The Bitcoin backbone protocol with chains of variable difficulty
Cited in
(6)- FAST: fair auctions via secret transactions
- Incentive compatible and anti-compounding of wealth in proof-of-stake
- McFly: verifiable encryption to the future made practical
- Better incentives for proof-of-work
- scientific article; zbMATH DE number 5859846 (Why is no real title available?)
- Trading under the proof‐of‐stake protocol – A continuous‐time control approach
This page was built for publication: Minting mechanism for proof of stake blockchains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229280)