Mathematics of PoS blockhains for Impatient

The purpose of this talk is to provide an intro into mathematics of Proof of Stake blockchains at a level accessible to everyone new to cryptography. I am going to discuss basic stages of a provably-secure blockchain, such as pending queue, block proposal, block commit and finalization, as we'll cover the great mathematical algorithms that are used to efficiently implement it, such as Distributed Key Generation, BLS signatures and asynchronous binary consensus. By end of the talk the audience will hopefully understand how a provably secure PoS blockchain actually works."