SnarkFold: Efficient SNARK Proof Aggregation from Split Incrementally Verifiable Computation

ePrint Report: SnarkFold: Efficient SNARK Proof Aggregation from Split Incrementally Verifiable Computation

Xun Liu, Shang Gao, Tianyu Zheng, Bin Xiao

The succinct non-interactive argument of knowledge (SNARK) technique is widely used in blockchain systems to replace the costly on-chain computation with the verification of a succinct proof. However, when dealing with multiple proofs, most existing applications require each proof to be independently verified, resulting in a heavy load on nodes and high transaction fees for users. To improve the efficiency …

aggregation argument blockchain computation eprint report gao knowledge non proof report systems verification