Snowman for partial synchrony
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909622850289664 |
|---|---|
| author | Buchwald, Aaron Buttolph, Stephen Lewis-Pye, Andrew Sekniqi, Kevin |
| author_facet | Buchwald, Aaron Buttolph, Stephen Lewis-Pye, Andrew Sekniqi, Kevin |
| contents | Snowman is the consensus protocol run by blockchains on Avalanche. Recent work established a rigorous proof of probabilistic consistency for Snowman in the \emph{synchronous} setting, under the simplifying assumption that correct processes execute sampling rounds in `lockstep'. In this paper, we describe a modification of the protocol that ensures consistency in the \emph{partially synchronous} setting, and when correct processes carry out successive sampling rounds at their own speed, with the time between sampling rounds determined by local message delays. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_15904 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Snowman for partial synchrony Buchwald, Aaron Buttolph, Stephen Lewis-Pye, Andrew Sekniqi, Kevin Distributed, Parallel, and Cluster Computing Snowman is the consensus protocol run by blockchains on Avalanche. Recent work established a rigorous proof of probabilistic consistency for Snowman in the \emph{synchronous} setting, under the simplifying assumption that correct processes execute sampling rounds in `lockstep'. In this paper, we describe a modification of the protocol that ensures consistency in the \emph{partially synchronous} setting, and when correct processes carry out successive sampling rounds at their own speed, with the time between sampling rounds determined by local message delays. |
| title | Snowman for partial synchrony |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2501.15904 |