arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

GridSMR:分片区块链的因果压缩

GridSMR: Causal Compression for Sharded Blockchains

Shir Cohen, Adam Alon, Raz Omessi, Amir Sarid, Dana Shamir, Ofir Zohar

arXiv 2610.01443首次发表:更新:

发表机构

Gen Labs(Gen实验室)

机构由 AI 辅助整理,请以论文原文为准。

AI 中文总结

GridSMR通过先执行后共识架构和账户级原子性实现因果压缩,使分片区块链跨分片延迟不随因果深度增长,显著提升吞吐量并降低因果链延迟。

AI 中文摘要

我们提出了GridSMR,一种分片区块链,它能够水平扩展执行能力,同时允许依赖性的跨分片操作在单个区块内推进。现有的分片系统通常将协调放在依赖性的跨分片步骤之间,导致延迟随因果深度增长。GridSMR将原子性局部化到单个账户,并异步执行跨账户工作。采用先执行后共识的架构,依赖操作在可用时跨分片执行,而共识随后验证并提交生成的调度。这实现了因果压缩:跨分片延迟无需随计算的因果深度增长。GridSMR将单验证器执行扩展到每秒107万请求,四验证器执行扩展到每秒19.3万已提交请求,同时将16跳因果链延迟相比延迟执行降低了8.2倍。

英文摘要

We present GridSMR, a sharded blockchain that scales execution horizontally while allowing dependent cross-shard operations to progress within a single block. Existing sharded systems typically place coordination between dependent cross-shard steps, making latency grow with causal depth. GridSMR localizes atomicity to individual accounts and executes cross-account work asynchronously. Using an execute-before-agree architecture, dependent operations execute across shards as they become available, while consensus later validates and commits the resulting schedule. This enables Causal Compression: cross-shard latency need not grow with the causal depth of a computation. GridSMR scales single-validator execution to 1.07M requests/s and four-validator execution to 193K committed requests/s, while reducing 16-hop causal-chain latency by 8.2x versus deferred execution.

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑