实用无速率集合协调
Practical Rateless Set Reconciliation
AI总结：
该研究提出新型无速率可逆布鲁姆查找表集合协调协议，在广泛场景下实现低计算成本与近最优通信成本，在以太坊区块链状态同步中显著提升性能。
摘要：
集合协调是指双方持有定长比特串并运行协议以获知彼此缺失的串，是许多分布式系统中的一项基础任务。我们提出了无速率可逆布鲁姆查找表（Rateless Invertible Bloom Lookup Tables，简称Rateless IBLT），据我们所知，这是首个在广泛场景下实现低计算成本和近最优通信成本的集合协调协议：适用场景涵盖集合差异从1到数百万、比特串从几字节到几兆字节，以及潜在对手注入的工作负载。Rateless IBLT基于一种新型编码器，该编码器将集合差异增量编码为无限的编码符号流，类似于无速率纠错码。我们将Rateless IBLT与最先进的集合协调方案进行了比较，证明了其显著的改进效果。在计算成本相近的情况下，Rateless IBLT的通信成本比非无速率方案低3-4倍；在通信成本相近的情况下，其计算成本比其他方案低2-2000倍。我们通过将Rateless IBLT应用于同步以太坊（Ethereum）区块链状态，展示了其在实际应用中的优势，结果表明，与生产环境中使用的系统相比，其端到端完成时间降低了5.6倍，通信成本降低了4.4倍。
英文摘要：
Set reconciliation, where two parties hold fixed-length bit strings and run a protocol to learn the strings they are missing from each other, is a fundamental task in many distributed systems. We present Rateless Invertible Bloom Lookup Tables (Rateless IBLT), the first set reconciliation protocol, to the best of our knowledge, that achieves low computation cost and near-optimal communication cost across a wide range of scenarios: set differences of one to millions, bit strings of a few bytes to megabytes, and workloads injected by potential adversaries. Rateless IBLT is based on a novel encoder that incrementally encodes the set difference into an infinite stream of coded symbols, resembling rateless error-correcting codes. We compare Rateless IBLT with state-of-the-art set reconciliation schemes and demonstrate significant improvements. Rateless IBLT achieves 3--4x lower communication cost than non-rateless schemes with similar computation cost, and 2--2000x lower computation cost than schemes with similar communication cost. We show the real-world benefits of Rateless IBLT by applying it to synchronize the state of the Ethereum blockchain, and demonstrate 5.6x lower end-to-end completion time and 4.4x lower communication cost compared to the system used in production.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
