Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time

Ittai Abraham; Eli Chouatt; Yossi Gilad; Gilad Stern; Sophia Yakoubov

doi:10.1145/3732772.3733533

Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time

Ittai Abraham
, Eli Chouatt
, Yossi Gilad
, Gilad Stern^*
, Sophia Yakoubov

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

The celebrated Algorand protocol solves validated byzantine agreement in a scalable manner in the synchronous setting. In this paper, we study the feasibility of similar solutions in the asynchronous setting. Our main result is an asynchronous validated byzantine agreement protocol that we call Asynchronous Algorand. As with Algorand, it terminates in an expected constant number of rounds, and honest parties send an expected O(n polylog n) bits, where n is the number of parties. The protocol is resilient to a fully-asynchronous weak-adaptive adversary that can corrupt a near-optimal number of parties (< (1/3 - ϵ)n) and requires just a verifiable random function (VRF) setup and secure erasures.A key innovation in Asynchronous Algorand is a rather simple but surprisingly effective method to do committee-based role assignment for asynchronous verifiable secret sharing in the You Only Speak Once (YOSO) model. This method achieves near-optimal resilience and near-linear communication complexity while relying solely on a VRF setup and secure erasures.

Original language	English
Title of host publication	PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	28-38
Number of pages	11
ISBN (Electronic)	9798400718854
DOIs	https://doi.org/10.1145/3732772.3733533
State	Published - 13 Jun 2025
Event	44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025 - Huatulco, Mexico Duration: 16 Jun 2025 → 20 Jun 2025

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume	Part of F216205

Conference

Conference	44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025
Country/Territory	Mexico
City	Huatulco
Period	16/06/25 → 20/06/25

Bibliographical note

Publisher Copyright:
© 2025 Copyright held by the owner/author(s).

Keywords

asynchrony
committee sampling
consensus
cryptographic protocols

Access to Document

10.1145/3732772.3733533

Cite this

Abraham, I., Chouatt, E., Gilad, Y., Stern, G., & Yakoubov, S. (2025). Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. In PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing (pp. 28-38). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. Part of F216205). Association for Computing Machinery. https://doi.org/10.1145/3732772.3733533

Abraham, Ittai ; Chouatt, Eli ; Gilad, Yossi et al. / Asynchronous Algorand : Reaching Agreement with Near Linear Communication and Constant Expected Time. PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. pp. 28-38 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

@inproceedings{2a1ee7941a0e480ba2259b31ed2b898b,

title = "Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time",

abstract = "The celebrated Algorand protocol solves validated byzantine agreement in a scalable manner in the synchronous setting. In this paper, we study the feasibility of similar solutions in the asynchronous setting. Our main result is an asynchronous validated byzantine agreement protocol that we call Asynchronous Algorand. As with Algorand, it terminates in an expected constant number of rounds, and honest parties send an expected O(n polylog n) bits, where n is the number of parties. The protocol is resilient to a fully-asynchronous weak-adaptive adversary that can corrupt a near-optimal number of parties (< (1/3 - ϵ)n) and requires just a verifiable random function (VRF) setup and secure erasures.A key innovation in Asynchronous Algorand is a rather simple but surprisingly effective method to do committee-based role assignment for asynchronous verifiable secret sharing in the You Only Speak Once (YOSO) model. This method achieves near-optimal resilience and near-linear communication complexity while relying solely on a VRF setup and secure erasures.",

keywords = "asynchrony, committee sampling, consensus, cryptographic protocols",

author = "Ittai Abraham and Eli Chouatt and Yossi Gilad and Gilad Stern and Sophia Yakoubov",

note = "Publisher Copyright: {\textcopyright} 2025 Copyright held by the owner/author(s).; 44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025 ; Conference date: 16-06-2025 Through 20-06-2025",

year = "2025",

month = jun,

day = "13",

doi = "10.1145/3732772.3733533",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "28--38",

booktitle = "PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing",

}

Abraham, I, Chouatt, E, Gilad, Y, Stern, G & Yakoubov, S 2025, Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. in PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. Part of F216205, Association for Computing Machinery, pp. 28-38, 44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025, Huatulco, Mexico, 16/06/25. https://doi.org/10.1145/3732772.3733533

Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. / Abraham, Ittai; Chouatt, Eli; Gilad, Yossi et al.
PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. p. 28-38 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. Part of F216205).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Asynchronous Algorand

T2 - 44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025

AU - Abraham, Ittai

AU - Chouatt, Eli

AU - Gilad, Yossi

AU - Stern, Gilad

AU - Yakoubov, Sophia

PY - 2025/6/13

Y1 - 2025/6/13

N2 - The celebrated Algorand protocol solves validated byzantine agreement in a scalable manner in the synchronous setting. In this paper, we study the feasibility of similar solutions in the asynchronous setting. Our main result is an asynchronous validated byzantine agreement protocol that we call Asynchronous Algorand. As with Algorand, it terminates in an expected constant number of rounds, and honest parties send an expected O(n polylog n) bits, where n is the number of parties. The protocol is resilient to a fully-asynchronous weak-adaptive adversary that can corrupt a near-optimal number of parties (< (1/3 - ϵ)n) and requires just a verifiable random function (VRF) setup and secure erasures.A key innovation in Asynchronous Algorand is a rather simple but surprisingly effective method to do committee-based role assignment for asynchronous verifiable secret sharing in the You Only Speak Once (YOSO) model. This method achieves near-optimal resilience and near-linear communication complexity while relying solely on a VRF setup and secure erasures.

AB - The celebrated Algorand protocol solves validated byzantine agreement in a scalable manner in the synchronous setting. In this paper, we study the feasibility of similar solutions in the asynchronous setting. Our main result is an asynchronous validated byzantine agreement protocol that we call Asynchronous Algorand. As with Algorand, it terminates in an expected constant number of rounds, and honest parties send an expected O(n polylog n) bits, where n is the number of parties. The protocol is resilient to a fully-asynchronous weak-adaptive adversary that can corrupt a near-optimal number of parties (< (1/3 - ϵ)n) and requires just a verifiable random function (VRF) setup and secure erasures.A key innovation in Asynchronous Algorand is a rather simple but surprisingly effective method to do committee-based role assignment for asynchronous verifiable secret sharing in the You Only Speak Once (YOSO) model. This method achieves near-optimal resilience and near-linear communication complexity while relying solely on a VRF setup and secure erasures.

KW - asynchrony

KW - committee sampling

KW - consensus

KW - cryptographic protocols

UR - https://www.scopus.com/pages/publications/105026935240

U2 - 10.1145/3732772.3733533

DO - 10.1145/3732772.3733533

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105026935240

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 28

EP - 38

BT - PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

Y2 - 16 June 2025 through 20 June 2025

ER -

Abraham I, Chouatt E, Gilad Y, Stern G, Yakoubov S. Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. In PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery. 2025. p. 28-38. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). doi: 10.1145/3732772.3733533

Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this