zk-STARK란 무엇인가요

zk-STARKs offer a compelling alternative to zk-SNARKs, primarily by eliminating the trusted setup requirement through the use of public randomness and cryptographic hash functions as the source of randomness (making them transparent). Their scalability is derived from the underlying algebraic structure, often involving polynomial commitments over finite fields and the application of Fast Fourier Transforms (FFTs) for efficient polynomial manipulation. The computational problem is typically framed as satisfying a set of algebraic constraints, often represented as a computation trace or execution trace. The prover generates a polynomial that interpolates this trace. Techniques like FRI (Fast Reed-Solomon Interactive Oracle Proofs of Proximity) are crucial for proving that the generated polynomial is indeed close to a low-degree polynomial, which is essential for succinctness and security. While STARK proofs are generally larger than the most optimized SNARK proofs, their verification complexity scales more favorably with computation size, and they are resistant to quantum computers due to their reliance on collision-resistant hash functions rather than problems vulnerable to Shor's algorithm. Vulnerability analysis often focuses on the soundness error of the underlying protocols, which is made vanishingly small by repeating the verification process multiple times.