A Rust library for polynomial commitments
-
Updated
Sep 28, 2026 - Rust
A Rust library for polynomial commitments
FFT, data-recovery and KZG commitments, a.k.a. Kate commitments, in Go - *super experimental*
PoC implementation of polynomial commitment scheme based Range Proofs
Formalizing Polynomial Commitment Schemes in the Interactive Theorem Prover Isabelle.
Rust protocol lab for SNARK building blocks: Sumcheck, Zerocheck, PermCheck, IPA polynomial commitments, fuzzing, release evidence, and visualizer.
FROST-GKR: Frobenius Reduction Over Shifted Tables for batched Poseidon2b relations over binary tower fields.
LZX — the post-quantum lattice zkVM research workspace: 17+ paper protocol cores (Akita PCS, Twist & Shout, LaBRADOR/Greyhound, RoKoko, SALSAA, HyperWolf, LatticeBlindFold...) wired end-to-end, adversarially tested. Stage-5.2 claims fold landed: 31 KB batched-compact memory-argument proofs.
Bachelor Thesis - Formalizing the KZG Polynomial Commitment Scheme in Isabelle/HOL.
Research from Parano1d Lab: proof-native systems, cryptographic protocols, verifiable-state architectures, and reproducible engineering results.
A production-ready implementation of KZG polynomial commitments and zero-knowledge PIOPs with formal security analysis
Implementing the KZG according to the original paper in Rust
A blazing fast implementation of KZG polynomial commitment scheme in rust
This module provides a from-scratch radix-2 FFT/IFFT implementation for the KZG Polynomial Commitment Scheme. It enables efficient polynomial evaluation and interpolation over roots of unity, supporting advanced KZG operations and modern proving systems.
KSTARK Hybrid — Rust kernel-basis global-linear proofs composed with binary-field nonlinear reductions and FRI, by Algorizk Labs.
To associate your repository with the polynomial-commitments topic, visit your repo's landing page and select "manage topics."