Byzantine broadcast is one of the fundamental problems in distributed computing. Many
practical applications from secure multiparty computation to consensus mechanisms for
blockchains require increasingly weaker trust assumptions, as well as scalability for an ever-
growing number of users, which rules out existing solutions with linear number of rounds or
trusted setup requirements. In this paper, we propose the first sublinear-round and trustless
Byzantine broadcast protocol. Unlike previous sublinear-round protocols, our protocol does …

Byzantine broadcast is one of the fundamental problems in distributed computing. Many of
its practical applications, from multiparty computation to consensus mechanisms for
blockchains, require increasingly weaker trust assumptions, as well as scalability for an ever-
growing number of users n. This rules out existing solutions which run in a linear number of
rounds in n or rely on trusted setup requirements. In this paper, we propose the first
sublinear-round and trustless Byzantine broadcast protocol for the dishonest majority …