Reduce Gas Cost by Batch Proof
Introduction
zkBridge introduces an exceptionally secure architecture designed to facilitate the uninterrupted transmission of messages and the seamless bridging of assets across various Layer 1 and Layer 2 networks. This avant-garde framework ensures that state transitions initiated on the source chain are meticulously authenticated on the destination chain, employing a trustless approach. This strategic move obviates reliance on the security measures of third-party intermediaries.
A cornerstone of zkBridge’s operational prowess is deVirgo, a trailblazing mechanism revered for its unparalleled speed in generating zero-knowledge proofs. By harnessing the capabilities of parallel computing, deVirgo significantly accelerates the creation of block header proofs. This swift functionality is crucial, synchronizing the rhythm of proof generation with that of block production, which in turn bolsters the dependability and efficiency of transactions traversing chains.
Despite these advancements, challenges persist, particularly regarding the optimization of batch proofs to reduce the on-chain gas costs. Each instance of proof verification conducted on-chain incurs gas costs, an aspect that necessitates continual refinement. Addressing this, we introduce an evolved scheme dedicated to the refinement of batch proofing. This novel strategy ingeniously consolidates multiple proofs, thereby simplifying the verification process. Consequently, this method not only substantially diminishes gas expenditures but also fortifies the economic rationale of cross-chain engagements.
Batch proof
We have pioneered a sophisticated system that utilizes batch proofing to significantly decrease gas consumption on the blockchain. At the heart of this innovation is a method of batch proofing, where we consolidate multiple individual claims into a singular entity, thereby streamlining the proof size. This condensed proof is then registered on-chain, resulting in a verification cost that is markedly lower than the cumulative cost of verifying each claim independently.
In detail, our process involves encoding each claim within a distinct arithmetic circuit. There are instances where certain circuits are duplicated, yet our proof generator skillfully integrates all these circuits, treating them as a unified, larger circuit. To expedite the proof generation time associated with data-parallel circuits, we employ the cutting-edge deVirgo proof system, leveraging its parallel computing prowess. Impressively, the time required for proof generation equates to that of producing a proof for any arbitrary sub-circuit claim, meaning our method introduces no additional overhead during proof generation.
Furthermore, we enhance efficiency by implementing recursive proofing techniques to minimize both the proof size and subsequent gas costs. This strategy entails an additional application of the zero-knowledge proof system to pare down the final-round proof — a tactic that has gained considerable traction in numerous contemporary real-world applications. Through these innovations, our system not only achieves substantial gas savings but also pioneers advancements in the practical application of blockchain technology, such as zkBridge.