Delphi：面向分布式预言机的高效异步近似共识协议
Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles
AI总结：
本文提出确定性异步共识协议 Delphi，通过结合共识原语与新颖加权平均技术，将通信开销降至 𝒪̃(n²)，在 160 节点系统中相比现有协议实现 8 倍（CPS）和 3 倍（AWS）的延迟改进。
摘要：
共识协议在各类新兴应用中至关重要，涵盖分布式（区块链）预言机到容错信息物理系统。在传感器或预言机节点测量共同源的场景中，将输出保持在正确输入的凸范围内（即凸有效性）是必不可少的。现有的异步凸共识协议要么采用随机化方法，导致大量计算开销，要么采用近似共识技术，导致 n 节点系统高达 𝒪̃(n³) 的通信开销。本文提出 Delphi，一种具有 𝒪̃(n²) 通信开销和最小计算开销的确定性协议。Delphi 假设诚实输入是有界的（除非以可忽略的概率出现例外），并将文献中的共识原语与一种新颖的加权平均技术相结合。实验结果凸显了 Delphi 的卓越性能，与最先进的协议相比，其延迟显著降低。具体而言，对于 n=160 节点的系统，Delphi 在 CPS 和 AWS 环境中分别实现了 8 倍和 3 倍的延迟改进。
英文摘要：
Agreement protocols are crucial in various emerging applications, spanning from distributed (blockchains) oracles to fault-tolerant cyber-physical systems. In scenarios where sensor/oracle nodes measure a common source, maintaining output within the convex range of correct inputs, known as convex validity, is imperative. Present asynchronous convex agreement protocols employ either randomization, incurring substantial computation overhead, or approximate agreement techniques, leading to high $\mathcal{\tilde{O}}(n^3)$ communication for an $n$-node system. This paper introduces Delphi, a deterministic protocol with $\mathcal{\tilde{O}}(n^2)$ communication and minimal computation overhead. Delphi assumes that honest inputs are bounded, except with negligible probability, and integrates agreement primitives from literature with a novel weighted averaging technique. Experimental results highlight Delphi's superior performance, showcasing a significantly lower latency compared to state-of-the-art protocols. Specifically, for an $n=160$-node system, Delphi achieves an 8x and 3x improvement in latency within CPS and AWS environments, respectively.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
