linear-time sumcheck protocol for multilinear polynomials and related addends
-
Updated
Nov 21, 2025 - Rust
linear-time sumcheck protocol for multilinear polynomials and related addends
Zero-knowledge proof system over binary tower fields. Streaming architecture. Bounded memory. Edge-native.
Rust protocol lab for SNARK building blocks: Sumcheck, Zerocheck, PermCheck, IPA polynomial commitments, fuzzing, release evidence, and visualizer.
How does the SumCheck protocol work?
ZK is a Rust-based repo that aims to focus on learning and implementing zero-knowledge proofs.
This is where I document all my zk-research implementations
Interactive unofficial companion for learning Proofs, Arguments, and Zero-Knowledge: chapter maps, glossary, toy labs, quizzes, and progress tracking.
Educational implementation of the sumcheck protocol in Rust
Research from ParanO(1)d Lab: proof-native systems, cryptographic protocols, verifiable-state architectures, and reproducible engineering results.
FROST-GKR: Frobenius Reduction Over Shifted Tables for batched Poseidon2b relations over binary tower fields.
Add a description, image, and links to the sumcheck topic page so that developers can more easily learn about it.
To associate your repository with the sumcheck topic, visit your repo's landing page and select "manage topics."