[Vitalik Publishes GKR Tutorial Article: The 'Batch × Layer' Protocol Supporting Ultra-Fast ZK Proofs] Vitalik Buterin has recently published an article detailing how the GKR (Goldreich–Kahan–Rothblum) protocol is used to accelerate ZK proofs, adapting to a 'batch × multi-layer' computational structure that significantly reduces intermediate layer commitments, focusing only on input and output commitments. Using Poseidon2 hash as an example, the article explains the recursive proof process centered on sumcheck and provides optimizations (Gruen’s trick, linear batching, partial rounds with only cubic leading elements). In polynomial commitment scenarios, it can be combined with BaseFold or FRI. The author states that the actual cost is theoretically about 100 times lower than traditional STARKs, with single-digit-level costs achievable, while cautioning against predictability risks within circuits in Fiat–Shamir challenges.