Welcome to the resource topic for 2024/325
Title:
Proofs for Deep Thought: Accumulation for large memories and deterministic computations
Authors: Benedikt Bünz, Jessica Chen
Abstract:We construct two new accumulation schemes. The first one is for checking that \ell read and write operations were performed correctly from a memory of size T. Unlike all prior work, the prover time is entirely independent of T and only depends on \ell. The second one is for deterministic computations. It does not require committing to the intermediate wires of the computation but only the input and output. This is achieved by building an accumulation scheme for a modified version of the famous GKR protocol. We show that these schemes are highly compatible and that the accumulation for GKR can further reduce the cost of the memory-checking scheme. Using the BCLMS (Crypto 21) compiler, these protocols yield an efficient incrementally verifiable computation (IVC) scheme that is particularly useful for machine computations with large memories and deterministic steps.
ePrint: https://eprint.iacr.org/2024/325
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .