Completed
How to define security of a Pos
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Proofs of Space
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 General idea
- 3 Proofs of Work - a tool for dealing with the Sybil attacks
- 4 How are the Pows used?
- 5 How to measure computational difficulty?
- 6 A drawback of PoW systems
- 7 What to do?
- 8 Example of an application
- 9 Main difference from Pows
- 10 Advantages
- 11 How to measure time and space
- 12 The proof is done with respect to an identifier Id
- 13 How to define security of a Pos
- 14 How to define the efficiency?
- 15 How to define soundness?
- 16 What would be the goal of a cheating prover?
- 17 Observation: a cheating prover has a simple (but inefficient) winning strategy.
- 18 Restrictions on cheating prover
- 19 Security definition
- 20 Why is constructing the Pos schemes non-trivial?
- 21 Our main technique
- 22 Very informally
- 23 How to build a Pos from a good graph?
- 24 Our solution: let the prover commit to R with a Merkle tree.
- 25 The Proof phase
- 26 Our results
- 27 Spacecoin
- 28 Previous/related/independent work
