Optimal Strategic Mining Against Cryptographic Self-Selection in Proof-of-Stake

@article{Ferreira2022OptimalSM,
  title={Optimal Strategic Mining Against Cryptographic Self-Selection in Proof-of-Stake},
  author={Matheus V. X. Ferreira and Ye Lin Sally Hahn and S. Matthew Weinberg and Catherine Yu},
  journal={Proceedings of the 23rd ACM Conference on Economics and Computation},
  year={2022}
}
Cryptographic Self-Selection is a subroutine used to select a leader for modern proof-of-stake consensus protocols. In cryptographic self-selection, each round r has a seed Qr. In round r, each account owner is asked to digitally sign Qr, hash their digital signature to produce a credential, and then broadcast this credential to the entire network. A publicly-known function scores each credential in a manner so that the distribution of the lowest scoring credential is identical to the… 

Figures from this paper

Credible Decentralized Exchange Design via Verifiable Sequencing Rules

This work proposes to modify the interaction between miners and users and initiate the study of verifiable sequencing rules, and asks if there are sequencing rules that limit price manipulation from miners in a two-token liquidity pool exchange.

Credible, Optimal Auctions via Blockchains

,

References

SHOWING 1-10 OF 19 REFERENCES

Proof-of-Stake Mining Games with Perfect Randomness

This work considers a longest-chain Proof-of-Stake protocol with perfect, trusted, external randomness (e.g. a randomness beacon) and proves that a strategic miner can strictly outperform an honest miner with just 32.8% of the total stake.

Formal Barriers to Longest-Chain Proof-of-Stake Protocols

The main results of this paper are several formal barriers to designing incentive-compatible proof-of-stake cryptocurrencies (that don't apply to proof- of-work).

Bitcoin: A Peer-to-Peer Electronic Cash System

This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.

Algorand: Scaling Byzantine Agreements for Cryptocurrencies

Experimental results show that Algorand confirms transactions in under a minute, achieves 125x Bitcoin's throughput, and incurs almost no penalty for scaling to more users.

Proof-of-Burn

This paper puts forth the first cryptographic definition of what a proof-of-burn protocol is, a function which generates a cryptocurrency address and a novel construction for burning which is simple and flexible, making it compatible with all existing popular cryptocurrencies.

Algorand: A secure and efficient distributed ledger

Dynamic posted-price mechanisms for the blockchain transaction-fee market

This work proposes an alternative design - a dynamic posted- price mechanism - which uses not only block utilization but also observable bids from past blocks to compute a posted-price for subsequent blocks, and shows its potential to reduce price volatility.

Secure and Efficient Asynchronous Broadcast Protocols

This paper addresses secure service replication in an asynchronous environment with a static set of servers, where a malicious adversary may corrupt up to a threshold of servers and controls the network.

On the Instability of Bitcoin Without the Block Reward

This work shows that with only transaction fees, the variance of the block reward is very high due to the exponentially distributed block arrival time, and it becomes attractive to fork a "wealthy" block to "steal" the rewards therein and results in an equilibrium with undesirable properties for Bitcoin's security and performance.

Optimal Selfish Mining Strategies in Bitcoin

The Bitcoin protocol requires nodes to quickly distribute newly created blocks. Strong nodes can, however, gain higher payoffs by withholding blocks they create and selectively postponing their