Design proposal for a Keccak circuit that can handle multiple variable-length inputs. Context After redefining $$\mathsf{circuitID}(vk) = \mathsf{keccak}(vk)$$ we will be hashing Fixed-length inputs: The Pedersen commitment $m$ Inputs with one variable length: The proof ID is $\mathsf{keccak}(cid, p_0, \ldots p_\ell)$ Inputs with two variable lengths: The circuit ID is $\mathsf{keccak}(vk.fixed, vk.s, vk.pedersen)$ and the last two inputs have variable lengths. Summary

A PCS for multilinear polynomials over small fields with polylogarithmic verifier and zero embedding overhead. "FRI-Binius = Sum-Check + FRI + Packing" References FRI Binius (Diamond & Posen 2024): https://eprint.iacr.org/2024/504 Binius: (Diamond & Posen 2023) https://eprint.iacr.org/2023/1784 Novel Polynomial Basis (Lin, Chung, Han 2014): https://arxiv.org/abs/1404.3458 BaseFold (Zeilberger, Chen, Fisch 2023) https://eprint.iacr.org/2023/1705