HyperPlonk’s Multilinear Arithmetization Unlocks Linear Prover Time for ZK-SNARKs
HyperPlonk eliminates the FFT bottleneck in Plonk by using multilinear polynomials over the boolean hypercube, enabling linear-time ZK-proof generation for massive circuits.
Binary GKR Proof System Accelerates ZK-EVM Computation by Optimizing Keccak Hashing
Binary GKR introduces a new ZK proof system optimized for bitwise operations, fundamentally unlocking the speed required for practical ZK-EVMs.
