Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2510.01536 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915530574659584 |
|---|---|
| author | Heydari, Hasan Bessani, Alysson Nayak, Kartik |
| author_facet | Heydari, Hasan Bessani, Alysson Nayak, Kartik |
| contents | Existing distributed ledger protocols either incur a high communication complexity and are thus suited to systems with a small number of processes (e.g., PBFT), or rely on committee-sampling-based approaches that only work for a very large number of processes (e.g., Algorand). Neither of these lines of work is well-suited for moderate-scale distributed ledgers ranging from a few hundred to a thousand processes, which are common in production (e.g, Redbelly, Sui). The goal of this work is to design a distributed ledger with sub-linear communication complexity per process, sub-quadratic total communication complexity, and low latency for finalizing a block into the ledger, such that it can be used for moderate-scale systems. We propose QScale, a protocol in which every process incurs only $\widetilde{O}(κ\sqrt{n})$ communication complexity per-block in expectation, $\widetilde{O}(nκ)$ total communication complexity per-block in expectation, and a best-case latency of $O(κ)$ rounds while ensuring safety and liveness with overwhelming probability, with $κ$ being a small security parameter. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_01536 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | QScale: Probabilistic Chained Consensus for Moderate-Scale Systems Heydari, Hasan Bessani, Alysson Nayak, Kartik Distributed, Parallel, and Cluster Computing Existing distributed ledger protocols either incur a high communication complexity and are thus suited to systems with a small number of processes (e.g., PBFT), or rely on committee-sampling-based approaches that only work for a very large number of processes (e.g., Algorand). Neither of these lines of work is well-suited for moderate-scale distributed ledgers ranging from a few hundred to a thousand processes, which are common in production (e.g, Redbelly, Sui). The goal of this work is to design a distributed ledger with sub-linear communication complexity per process, sub-quadratic total communication complexity, and low latency for finalizing a block into the ledger, such that it can be used for moderate-scale systems. We propose QScale, a protocol in which every process incurs only $\widetilde{O}(κ\sqrt{n})$ communication complexity per-block in expectation, $\widetilde{O}(nκ)$ total communication complexity per-block in expectation, and a best-case latency of $O(κ)$ rounds while ensuring safety and liveness with overwhelming probability, with $κ$ being a small security parameter. |
| title | QScale: Probabilistic Chained Consensus for Moderate-Scale Systems |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2510.01536 |