Rigorous Proof of Stake Security via Process Algebra
Formal modeling of probabilistic consensus using process calculus and noninterference verification provides mathematically provable security bounds against sophisticated attacks.
