A Rust library for polynomial commitments
-
Updated
Aug 31, 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.
Bachelor Thesis - Formalizing the KZG Polynomial Commitment Scheme in Isabelle/HOL.
Implementing the KZG according to the original paper in Rust
A blazing fast implementation of KZG polynomial commitment scheme in rust
A production-ready implementation of KZG polynomial commitments and zero-knowledge PIOPs with formal security analysis
KSTARK Hybrid — Rust kernel-basis global-linear proofs composed with binary-field nonlinear reductions and FRI, by Algorizk Labs.
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.
To associate your repository with the polynomial-commitments topic, visit your repo's landing page and select "manage topics."