PANews reported on October 20th that Vitalik Buterin published a new article detailing how the Goldreich–Kahan–Rothblum (GKR) protocol is used to accelerate ZK proofs. Adapting to a "batch × multi-layer" computational structure, the article significantly reduces intermediate commitments, requiring only input and output commitments. Using the Poseidon2 hash as an example, the article details a recursive proof process centered around sumcheck and offers optimizations (Gruen's trick, linear batching, and only the first element of the cube in some rounds). This can be combined with BaseFold or FRI in polynomial commitment scenarios. The author claims that the actual overhead is approximately 100 times lower than the theoretical value of traditional STARKs, with single-digit overhead expected. He also cautions against the risk of in-circuit predictability in the Fiat–Shamir challenge.