Nakamoto's consensus protocol works in a permissionless model and tolerates Byzantine failures, but only offers probabilistic agreement. Recently, the Sandglass protocol has shown such weaker guarantees are not a necessary consequence of a permissionless model; yet, Sandglass only tolerates benign failures, and operates in an unconventional partially synchronous model. We present Gorilla Sandglass, the first Byzantine tolerant consensus protocol to guarantee, in the same synchronous model adopted by Nakamoto, deterministic agreement and termination with probability 1 in a permissionless setting. We prove the correctness of Gorilla by mapping executions that would violate agreement or termination in Gorilla to executions in Sandglass, where we know such violations are impossible. Establishing termination proves particularly interesting, as the mapping requires reasoning about infinite executions and their probabilities.
@article{arxiv.2308.04080,
title = {Gorilla: Safe Permissionless Byzantine Consensus},
author = {Youer Pu and Ali Farahbakhsh and Lorenzo Alvisi and Ittay Eyal},
journal= {arXiv preprint arXiv:2308.04080},
year = {2023}
}
Comments
43 pages, 3 figures, published in the International Symposium on Distributed Computing (DISC) 2023