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.
ZK is a Rust-based repo that aims to focus on learning and implementing zero-knowledge proofs.
How does the SumCheck protocol work?
Interactive unofficial companion for learning Proofs, Arguments, and Zero-Knowledge: chapter maps, glossary, toy labs, quizzes, and progress tracking.
FROST-GKR: Frobenius Reduction Over Shifted Tables for batched Poseidon2b relations over binary tower fields.
This is where I document all my zk-research implementations
Research from Parano1d Lab: proof-native systems, cryptographic protocols, verifiable-state architectures, and reproducible engineering results.
Basis-aware multilinear polynomial algorithms and the Sumcheck protocol in Rust
Educational implementation of the sumcheck protocol in Rust
To associate your repository with the sumcheck topic, visit your repo's landing page and select "manage topics."