Page 406 - 《软件学报》2025年第8期

张子龙 等: 基于原生链的跨 Rollup 机制研究 3829

策略会使得系统的吞吐量低下. 本文提出了一种基于原生链的跨 Rollup 方案, 称为 NativeBridge, 该方案主要包括
基于零知识证明的交易有效性证明方案、基于索引表数据压缩的交易存储方案和聚合规模均衡调整算法, 通过聚
合交易批量集中处理的方式减少单笔交易的平均计算和存储开销, 增加系统的吞吐量. 本方案最大可实现 98% 的
链上计算开销优化, 平均链上资源开销能降低 66.62%, 系统整体吞吐量上限最高可达到每秒 785.6 笔交易, 相较于
现有 Rollup 系统的平均每秒 1000–3000 笔交易的吞吐量水平, 已经达到一个相对可用的水平.

5.2 进一步工作展望
本文设计的基于原生链的跨 Rollup 系统未来可在以下方面进一步改进. 首先, 目前采用的零知识证明策略在
生成证明时间上还较长, 同时需要初始化公共参数, 存在潜在的安全风险, 因此未来可以考虑采用无公共参数初始
化且证明生成时间较短的零知识证明策略如 Bulletproof [26] 或 Aurora [27] . 其次, 本文设计的基于原生链的跨 Rollup
系统能够满足最基础的单向的交易互操作方案, 未来跨 Rollup 交易需要兼容更多的交易互操作形式, 包括交易的
事务性、多 Rollup 间的交互形式. 可以通过选择适当的管理器并在本文提出的框架上进行扩展来满足这些需求.
此外, 本文的方案主要基于以太坊区块链及其扩容解决方案 Rollup, 但其他实现了 Rollup 扩容的区块链同样可以
利用本文提出的方案实现跨 Rollup 交易.

References:
[1] Sguanci C, Spatafora R, Vergani AM. Layer 2 blockchain scaling: A survey. arXiv:2107.10881, 2021.
[2] McCorry P, Buckland C, Yee B, Song D. SoK: Validating bridges as a scaling solution for blockchains. Cryptology ePrint Archive, 2021.
1589. https://eprint.iacr.org/2021/1589
[3] Mohanty S K, Tripathy S. n-HTLC: Neo hashed time-lock commitment to defend against wormhole attack in payment channel networks.
Computers & Security, 2021, 106: 102291. [doi: 10.1016/j.cose.2021.102291]
[4] Whinfrey C. Hop: Send tokens across rollups. 2021. https://ethresear.ch/t/hop-send-tokens-across-rollups/8581
[5] Orbiter. Orbiter Bridge. 2023. https://www.orbiter.finance/
[6] Buterin V, Feist D, Loerakker D, Kadianakis G, Garnett M, Taiwo M, Dietrichs A. EIP-4844: Shard blob transactions. 2022. https://eips.
ethereum.org/EIPS/eip-4844
[7] Liu JT, Wan SG, He XB. Alias-Chain: Improving blockchain scalability via exploring content locality among transactions. In: Proc. of the
2022 IEEE Int’l Parallel and Distributed Processing Symp. (IPDPS). Lyon: IEEE, 2022. 1228–1238. [doi: 10.1109/IPDPS53621.2022.
00122]
[8] Fiege U, Fiat A, Shamir A. Zero knowledge proofs of identity. In: Proc. of the 19th Annual ACM Symp. on Theory of Computing. New
York: ACM, 1987. 210–217. [doi: 10.1145/28395.28419]
[9] Chiesa A, Ojha D, Spooner N. FRACTAL: Post-quantum and transparent recursive proofs from holography. In: Proc. of the 39th Annual
Int’l Conf. on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. Zagreb: Springer, 2020. 769–793.
[doi: 10.1007/978-3-030-45721-1_27]
[10] Groth J. On the size of pairing-based non-interactive arguments. In: Proc. of the 35th Annual Int’l Conf. on Advances in Cryptology, Part
II. Vienna: Springer, 2016. 305–326. [doi: 10.1007/978-3-662-49896-5_11]
[11] ZKsync. The elastic chain. 2023. https://zksync.io/
[12] Maller M, Bowe S, Kohlweiss M, Meiklejohn S. Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured
reference strings. In: Proc. of the 2019 ACM SIGSAC Conf. on Computer and Communications Security. London: ACM, 2019.
2111–2128. [doi: 10.1145/3319535.3339817]
[13] Gabizon AG, Williamson ZJ, Ciobotaru O. Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of
knowledge. Cryptology ePrint Archive. 2019. 953. https://eprint.iacr.org/2019/953
[14] Zhang JH, Xie TC, Zhang YP, Song D. Transparent polynomial delegation and its applications to zero knowledge proof. In: Proc. of the
2020 IEEE Symp. on Security and Privacy (SP). San Francisco: IEEE, 2020. 859–876. [doi: 10.1109/SP40000.2020.00052]
[15] Xie TC, Zhang JH, Cheng ZR, Zhang F, Zhang YP, Jia YZ, Boneh D, Song D. zkBridge: Trustless cross-chain bridges made practical. In:
Proc. of the 2022 ACM SIGSAC Conf. on Computer and Communications Security. Los Angeles: ACM, 2022. 3003–3017. [doi: 10.1145/
3548606.3560652]
[16] Virgo ZK reference implementation. 2023. https://github.com/yudongbei/Virgo/blob/master/README.md
[17] ZoKrates. 2023. https://zokrates.github.io/