Page 379 - 《软件学报》2025年第8期
P. 379

软件学报 ISSN 1000-9825, CODEN RUXUEW                                        E-mail: jos@iscas.ac.cn
                 2025,36(8):3802−3830 [doi: 10.13328/j.cnki.jos.007269] [CSTR: 32375.14.jos.007269]  http://www.jos.org.cn
                 ©中国科学院软件研究所版权所有.                                                          Tel: +86-10-62562563



                                                         *
                 基于原生链的跨             Rollup   机制研究

                 张子龙  1,2 ,    贾林鹏  1 ,    蒋硕轩  1,2 ,    孙    毅  1,2


                 1
                  (中国科学院 计算技术研究所, 北京 100190)
                 2
                  (中国科学院大学 计算机科学与技术学院, 北京 100049)
                 通信作者: 孙毅, E-mail: sunyi@ict.ac.cn

                 摘 要: Rollup  是一种新兴的区块链链下交易处理方案. 随着应用的持续发展, 不同类型                     Rollup  间的互操作需求日
                 益增长. 现有   Rollup  间互操作方案通常使用第三方服务商来协助完成, 存在着信任假设的安全风险和单点故障等
                 问题. 基于原生链完成      Rollup  间互操作无需引入新的信任假设, 但会消耗原生链的计算与存储资源, 降低原生链的
                 交易吞吐量, 从而严重影响跨         Rollup  性能. 基于此, 提出一种基于原生链的跨         Rollup  方案, 通过聚合交易批量处理
                 的方式, 有效减少单笔交易的链上平均计算与存储资源开销. 具体而言, 提出基于零知识证明的交易有效性证明方
                 案, 显著减少交易有效性验证的链上计算开销. 提出基于索引表数据压缩的交易存储方案, 降低跨                             Rollup  交易的平
                 均链上存储开销. 提出聚合规模均衡调整算法, 得到最优的聚合规模, 实现链上资源消耗与处理时延之间的平衡.
                 最后, 对方案进行实验验证. 实验结果表明, 所提方案在完全去信任化的前提下, 能降低链上计算开销和存储开销,
                 实现链上资源消耗与处理时延的平衡, 并且与现有跨                 Rollup  方案相比, 所提方案的系统吞吐量也具有很好的表现.
                 关键词: 区块链; Rollup; 零知识证明; 多目标优化
                 中图法分类号: TP311

                 中文引用格式: 张子龙, 贾林鹏, 蒋硕轩, 孙毅. 基于原生链的跨Rollup机制研究. 软件学报, 2025, 36(8): 3802–3830. http://www.jos.
                 org.cn/1000-9825/7269.htm
                 英文引用格式: Zhang ZL, Jia LP, Jiang SX, Sun Y. Research on Cross-Rollup Mechanism Based on Native Blockchain. Ruan Jian Xue
                 Bao/Journal of Software, 2025, 36(8): 3802–3830 (in Chinese). http://www.jos.org.cn/1000-9825/7269.htm

                 Research on Cross-Rollup Mechanism Based on Native Blockchain
                             1,2
                                                         1,2
                                          1
                 ZHANG Zi-Long , JIA Lin-Peng , JIANG Shuo-Xuan , SUN Yi 1,2
                 1
                 (Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China)
                 2
                 (School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, China)
                 Abstract:  Rollup  is  an  emerging  off-chain  transaction  processing  solution  for  blockchains.  With  the  continuous  development  of
                 applications,  the  need  for  interoperability  among  different  types  of  Rollups  is  increasingly  growing.  Existing  cross-Rollup  interoperability
                 solutions  typically  rely  on  third-party  service  providers  to  assist  in  completion,  which  brings  about  security  risks  such  as  new  trust
                 assumptions  and  single-point-of-failure  issues.  Completing  interoperability  among  Rollups  based  on  the  native  chain  does  not  require
                 introducing  new  trust  assumptions,  but  will  consume  the  computing  and  storage  resources  of  the  native  chain,  reduce  the  transaction
                 throughput of the native chain, and thus seriously affect the performance of cross-Rollup. Based on this, this study proposes a cross-Rollup
                 mechanism based on a native blockchain. By aggregating and processing transactions in batches, it effectively reduces the on-chain average
                 computation  and  storage  resource  costs  of  individual  transactions.  Specifically,  a  transaction  validity  proof  scheme  based  on  zero-
                 knowledge  proof  is  proposed  to  significantly  reduce  the  on-chain  computation  overhead  of  transaction  validity  verification.  A  transaction
                 storage  scheme  based  on  index  table  data  compression  is  proposed,  reducing  the  average  on-chain  storage  overhead  of  cross-Rollup
                 transactions.  An  aggregation  scale  balance  adjustment  algorithm  is  proposed,  which  obtains  the  optimal  aggregation  scale,  achieving  a


                 *    基金项目: 国家重点研发计划  (2021YFB2700301); 国家自然科学基金  (U22B2032)
                  收稿时间: 2024-01-30; 修改时间: 2024-04-07, 2024-06-11; 采用时间: 2024-08-02; jos 在线出版时间: 2025-01-24
                  CNKI 网络首发时间: 2025-01-26
   374   375   376   377   378   379   380   381   382   383   384