zkDaily - 2026-08-23

零知识证明zkDaily

ZKP Frontier Tracker 🎯

Sun

08.23

2026

Sluice: Prove-Phase Bounded-Memory Groth16 via Read-Write Streaming

Paper

https://eprint.iacr.org/2026/1758

StreamingMemory-BoundedBN-254

Lee et al. proposed Sluice, a read-write streaming Groth16 prover that cuts prove-phase memory from O(N) to O(log N) via the SBM algorithm. It preserves the standard interface, trading RAM for sequential storage I/O, and succeeds under an 8GB cap at N=2^23.

NotesNotes要点

Sluice reduces Groth16 prove-phase random-access memory to O(log N).
Core innovation is the Split-Butterfly-Merge (SBM) streaming NTT algorithm.
SBM uses O(log N) memory, O(N log N) total I/O, and O(log N) sequential passes.
Combines streaming sparse R1CS evaluation with chunked Pippenger MSM.
Fully compatible with standard Groth16: 128-byte proofs and 3-pairing verification.
Generates N=2^23 proofs under an 8GB cap, while standard provers require 16GB.

Collected by @icerdesign

零知识证明zkDaily

Q&A Deep Dive 💬

Sun

08.23

2026

What resource does Sluice mainly reduce?

It cuts Groth16 prove-phase random-access memory from O(N) to O(log N), trading sequential storage I/O and time.

How does SBM balance memory and I/O overhead?

SBM achieves O(log N) memory, O(N log N) total I/O, and O(log N) sequential external storage passes in the streaming model.

How does SBM adapt to the read-write streaming model constraints?

SBM avoids random access via the Split-Butterfly-Merge structure, completing NTT using only sequential reads/writes and O(log N) passes.

Prompted by @icerdesign