Andrew Lewis-Pye@AndrewLewisPye
New paper with @_patrickogrady and @commonwarexyz: The Carnot Bound.
In leader-based consensus, the leader has to get each block out to every other processor. Erasure coding helps: instead of sending a full copy to everyone, the leader sends each processor a small fragment, from which the full block can be reconstructed once enough fragments are collected.
The efficiency of this encoding is captured by the data expansion rate — the ratio of total data sent to payload size. This is a key parameter for throughput: the closer it is to 1, the closer maximum throughput gets to the raw network bandwidth.
We prove that protocols with 2-round finality (one round of voting) can't achieve a data expansion rate below 2.5, which is a bound matched by existing protocols. We then show that an extra round of voting breaks the barrier, allowing rates arbitrarily close to 1.
Links to paper and blog below...