Improved zk-SNARKs for Randomized Algorithms with Universal Circuit Design

This paper presents a new and improved zk-SNARK system, designed specifically for randomized algorithms. Unlike previous systems, our approach does not encode randomness generation within the arithmetic circuit, resulting in faster prover times. Additionally, we propose a universal circuit that can verify consistency of any arithmetic circuit with a bounded number of operations by performing randomized checks. Our approach has numerous practical applications, and its potential significance in the field of cryptography cannot be overstated.