Vitalik Buterin Explores GKR Protocol for Enhanced ZK Proofs

According to PANews, Vitalik Buterin has published a new article detailing the use of the Goldreich–Kahan–Rothblum (GKR) protocol to accelerate zero-knowledge (ZK) proofs. The protocol is adapted for a 'batch × multi-layer' computational structure, significantly reducing intermediate layer commitments by focusing solely on input and output commitments. Using the Poseidon2 hash as an example, Buterin explains the recursive proof process centered around sumcheck, offering optimizations such as Gruen’s trick, linear batching, and partial rounds with only cubic first elements. In polynomial commitment scenarios, these can be combined with BaseFold or FRI. Buterin claims that the actual costs are theoretically 100 times lower than traditional STARK methods, with single-digit level costs achievable. He also cautions about the need to prevent predictability risks within circuits when using the Fiat–Shamir challenge.