JUNO：面向最优异步公共子集的聚合向量共识
JUNO: Aggregated Vector Consensus for Optimal Asynchronous Common Subset
浏览论文内容
中文总结 AI 辅助
本文提出聚合向量共识原语，实现了最优O(n²)消息复杂度的Juno异步公共子集协议，经与HoneyBadgerBFT、Dory对比实验，其吞吐量分别提升93%、47%，在全异步网络向量共识应用上取得重要进展。
中文摘要 AI 辅助
本文提出了一种名为“聚合向量共识”的新型向量共识原语，专为异步网络设计，该原语通过输出从独立进程输入聚合得到的值向量来达成共识。随后，我们引入了Juno协议，这是一种完全实现聚合向量共识的异步公共子集（ACS）协议，以达到最优的O(n²)消息复杂度。我们进一步实现并评估了Juno，与传统的HoneyBadgerBFT以及最先进的Dory进行对比。实验结果证明了其有效性和效率：与HoneyBadgerBFT相比，平均吞吐量性能提升了93%，与Dory相比提升了47%。值得注意的是，本研究在解决全异步网络中应用向量共识协议的缺口方面取得了重大进展。
英文摘要
In this paper, we propose \textit{aggregated vector consensus}, a new vector consensus primitive designed for asynchronous networks. The primitive achieves agreement by outputting a vector of values aggregated from independent process inputs. We then introduce \textsc{Juno}, an asynchronous common subset (ACS) protocol that fully implements our aggregated vector consensus to attain optimal $\mathcal{O}(n^2)$ message complexity. We further implement and evaluate \textsc{Juno} in comparison with the legacy HoneyBadgerBFT and the state-of-the-art Dory. Experiment results demonstrate its efficacy and efficiency. Our protocol demonstrates an average throughput performance improvement of 93\% compared with HoneyBadgerBFT and a 47\% improvement compared with Dory. Notably, our study makes significant progress in addressing the gap in applying vector consensus protocol in fully asynchronous networks.
