TY - GEN
T1 - Gorilla
T2 - 37th International Symposium on Distributed Computing, DISC 2023
AU - Pu, Youer
AU - Farahbakhsh, Ali
AU - Alvisi, Lorenzo
AU - Eyal, Ittay
N1 - Publisher Copyright: © Youer Pu, Ali Farahbakhsh, Lorenzo Alvisi, and Ittay Eyal; licensed under Creative Commons License CC-BY 4.0.
PY - 2023/10
Y1 - 2023/10
N2 - 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.
AB - 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.
KW - Blockchains
KW - Byzantine fault tolerance
KW - Consensus
KW - Deterministic Safety
KW - Permissionless
UR - http://www.scopus.com/inward/record.url?scp=85175311203&partnerID=8YFLogxK
U2 - https://doi.org/10.4230/LIPIcs.DISC.2023.31
DO - https://doi.org/10.4230/LIPIcs.DISC.2023.31
M3 - منشور من مؤتمر
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 37th International Symposium on Distributed Computing, DISC 2023
A2 - Oshman, Rotem
Y2 - 10 October 2023 through 12 October 2023
ER -