Byzantine agreement, arguably the most fundamental problem in distributed computing,
operates among n processes, out of which t< n can exhibit arbitrary failures. The problem …

Byzantine agreement enables n processes to agree on a common L-bit value, despite up to
t> 0 arbitrary failures. A long line of work has been dedicated to improving the bit complexity …

It is well known that a trusted setup allows one to solve the Byzantine agreement problem in
the presence of $ t< n/2$ corruptions, bypassing the setup-free $ t< n/3$ barrier. Alas, the …

Multi-valued validated Byzantine agreement (MVBA), a fundamental primitive of distributed
computing, enables n processes to agree on a valid L-bit value, despite t faulty processes …

Byzantine agreement enables n processes to agree on a common L-bit value, despite t> 0
arbitrary failures. A long line of work has been dedicated to improving the worst-case bit …