• What is Proof of Stake
• What are the benefits of proof of stake as opposed to proof of work?
• How does proof of stake fit into traditional Byzantine fault tolerance research?
• What is the "nothing at stake" problem and how can it be fixed?
• That shows how chain-based algorithms solve nothing-at-stake. Now how do BFT-style proof of stake algorithms work?
• What is "economic finality" in general?
• So how does this relate to Byzantine fault tolerance theory?
• What is "weak subjectivity"?
• Can we try to automate the social authentication to reduce the load on users?
• Can one economically penalize censorship in proof of stake?
• How does validator selection work, and what is stake grinding?
• What would the equivalent of a 51% attack against Casper look like?
• That sounds like a lot of reliance on out-of-band social coordination; is that not dangerous?
• Doesn't MC <= MR mean that all consensus algorithms with a given security level are equally efficient (or in other words, equally wasteful)?
• What about capital lockup costs?
• Will exchanges in proof of stake pose a similar centralization risk to pools in proof of work?
• Are there economic ways to discourage centralization?
• Can proof of stake be used in private/consortium chains?
• Further reading