{"ID":2861212,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.01536","arxiv_id":"2510.01536","title":"QScale: Probabilistic Chained Consensus for Moderate-Scale Systems","abstract":"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.","short_abstract":"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-sui...","url_abs":"https://arxiv.org/abs/2510.01536","url_pdf":"https://arxiv.org/pdf/2510.01536v1","authors":"[\"Hasan Heydari\",\"Alysson Bessani\",\"Kartik Nayak\"]","published":"2025-10-02T00:12:34Z","proceeding":"cs.DC","tasks":"[\"cs.DC\"]","methods":"[]","has_code":false}