The project's aim is to develop an algorithmic solution with proven guarantees for the problem of
randomized Self-Stabilizing Byzantine Fault Tolerance.
To this end we have set the following objectives:
- Study the existing state-of-the-art of the problem and gain deeper understanding
of the areas of randomized BFT and randomized self-stabilization.
Based on the knowledge acquired, converge to a framework design and formal problem
definition for the system's task of randomized self-stabilizing BFT.
- Develop an algorithmic solution with proven guarantees for the problem of randomized self-stabilizing BFT.
- Perform a benchmark of the solution against an implementation of a deterministic solution of self-stabilizing BFT
and a non-stabilizing version of BFT. The comparison should clearly indicate the convergence time and
the overhead in terms of messages, the general overhead during normal operation, namely when the system is converged.