EXPLAINING GKR FOR FAST HASH-PROVING

Summary from the TLDR Crypto newsletter

The GKR protocol turns large “batch and layers” computations like Poseidon2 hashing into simple polynomial evaluations, letting provers commit only to inputs and outputs. With tricks like reducing rounds, batching linear layers, and optimizing sumchecks, GKR achieves around 15x theoretical overhead and under 10x in practice, potentially reaching single-digit overhead. This proving system is the basis behind proposals to reduce the time required to verify Ethereum blocks.