gkr

ChainCatcher news, Vitalik Buterin's latest article elaborates on the GKR (Goldreich--Kahan--Rothblum) protocol used to accelerate ZK proofs, adapting to the "batch × multi-layer" computational structure, significantly reducing intermediate layer commitments, and only committing to inputs and outputs.The article uses Poseidon2 hash as an example to detail the recursive proof process centered around sumcheck, and provides optimizations (Gruen's trick, linear batching, partial rounds with only cubic leading elements), which can be combined with BaseFold or FRI in polynomial commitment scenarios. The author claims that the actual overhead is less than 100 times the theoretical value of traditional STARK, with single-digit level overhead expected, and warns that the Fiat--Shamir challenge must guard against predictability risks within the circuit.