ASICs And Decentralization: Proof-of-Work FAQ.pdf

Key Takeaways from Andrew Poelstra's FAQ

This document summarizes the key points from Andrew Poelstra's "ASICs and Decentralization FAQ."

Central Arguments:

Simplicity and Raw Power: Proof-of-work (PoW) schemes should be as simple as possible, relying primarily on raw computational power.
Thermodynamic Limit: The ideal PoW system quickly approaches a thermodynamic limit, minimizing energy consumption and maximizing decentralization.
Decentralization Concerns:

Centralization Dangers: Powerful ASICs (Application-Specific Integrated Circuits) focused on mining can lead to centralization if they dominate the network's computational power.
PoW as Signatures: A PoW acts as a "signature" for included transactions, committing resources to their validity.
Consensus and Verification:

Efficient verification times are crucial for fast consensus among all network participants.
Proof-of-work should be easily parallelizable with no reliance on state, preventing any single actor from gaining an unfair advantage.
Poisson Process: The probability of a PoW being calculated within a given time frame is Poisson-distributed, ensuring miners join and leave the network freely without penalty.

Algorithmic Considerations:

Optimization and Approximation Freedom:

No algorithmic speedups should be possible to prevent centralization through hidden advantages.
Defective variants of PoW algorithms that offer speedups are unacceptable as they undermine decentralization.

Physical Implications:

Irreversible Computing: While a complete reversal of a proof-of-work is impossible, some components may be reversibly computable, potentially reducing energy consumption.
Thermodynamic Limit and Energy Dissipation: The ultimate goal is to reach Landauer's principle, where computational work directly translates into energy dissipation.