arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.03347cs.CR
收藏

面向基于委员会区块链的实用轻客户端

Practical Light Clients for Committee-Based Blockchains

Frederik Armknecht, Ghassan Karame, Malcom Mohamed, Christiane Weis

AI总结:

本文针对基于委员会的区块链提出一种实用轻客户端协议,利用验证者变化缓慢和客户端离线时间短的实际特征,显著降低了通信与计算开销,并在延迟和证明大小上实现数量级优化。

摘要:

轻客户端在文献中受到越来越多的关注,因为它们使用户无需搭建专用的区块链全节点。虽然文献中已有多种轻客户端实例,但大多数轻客户端协议针对长时间离线阶段进行优化,并隐含假设待验证的区块头由高度动态变化的验证者签名。在本文中,我们表明:(i) 大多数轻客户端很少离线超过一周;(ii) 在大多数许可链以及许多非许可链(如 Cosmos 和 Polkadot)中,验证者不太可能发生剧烈变化。受这些发现的启发,我们提出了一种新颖的实用系统,该系统针对此类现实假设进行优化,与现有协议相比,为轻客户端实现了最小的通信和计算开销。通过我们解决方案的原型实现,我们表明,与文献中两种最先进的轻客户端实例相比,我们的协议在端到端延迟上分别实现了最高 90 倍和 40000 倍的降低,并且证明大小分别缩小了最高 1000 倍和 10000 倍。

英文摘要:

Light clients are gaining increasing attention in the literature since they obviate the need for users to set up dedicated blockchain full nodes. While the literature features a number of light client instantiations, most light client protocols optimize for long offline phases and implicitly assume that the block headers to be verified are signed by highly dynamic validators. In this paper, we show that (i) most light clients are rarely offline for more than a week, and (ii) validators are unlikely to drastically change in most permissioned blockchains and in a number of permissionless blockchains, such as Cosmos and Polkadot. Motivated by these findings, we propose a novel practical system that optimizes for such realistic assumptions and achieves minimal communication and computational costs for light clients when compared to existing protocols. By means of a prototype implementation of our solution, we show that our protocol achieves a reduction by up to $90$ and $40000\times$ (respectively) in end-to-end latency and up to $1000$ and $10000\times$ (respectively) smaller proof size when compared to two state-of-the-art light client instantiations from the literature.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑