A Rust library for polynomial commitments
-
Updated
Apr 26, 2026 - Rust
#
polynomial-commitments
Here are 13 public repositories matching this topic...
FFT, data-recovery and KZG commitments, a.k.a. Kate commitments, in Go - *super experimental*
fft kate data-recovery ntt kzg eth2 bls12-381 polynomial-commitments kate-commitment kzg-commitment data-availability-sampling kate-proofs kzg-proofs
-
Updated
Nov 29, 2023 - Go
PoC implementation of polynomial commitment scheme based Range Proofs
-
Updated
Sep 13, 2023 - Rust
Formalizing Polynomial Commitment Schemes in the Interactive Theorem Prover Isabelle.
cryptography theorem-proving isabelle formal-verification pcs agm kzg polynomial-commitments algebraic-group-model
-
Updated
Jul 30, 2026 - Isabelle
Rust protocol lab for SNARK building blocks: Sumcheck, Zerocheck, PermCheck, IPA polynomial commitments, fuzzing, release evidence, and visualizer.
rust cryptography visualizer fuzzing ipa pcs zero-knowledge zk-snarks snark polynomial-commitments research-prototype zkproof sumcheck proof-systems protocol-labs interactive-proofs zerocheck permutation-check multilinear-polynomials
-
Updated
Aug 1, 2026 - Rust
Bachelor Thesis - Formalizing the KZG Polynomial Commitment Scheme in Isabelle/HOL.
-
Updated
Jan 14, 2025 - Isabelle
A blazing fast implementation of KZG polynomial commitment scheme in rust
-
Updated
Jul 17, 2024 - Rust
A production-ready implementation of KZG polynomial commitments and zero-knowledge PIOPs with formal security analysis
-
Updated
Jun 25, 2025 - C++
FROST-GKR: Frobenius Reduction Over Shifted Tables for batched Poseidon2b relations over binary tower fields.
rust cryptography reproducible-research fiat-shamir gkr verifiable-computation zero-knowledge-proofs polynomial-commitments sumcheck proof-systems arithmetization poseidon2 binary-fields multilinear-polynomials parano1d binary-tower-fields
-
Updated
Aug 2, 2026 - Rust
Implementing the KZG according to the original paper in Rust
-
Updated
Nov 23, 2023 - 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.
-
Updated
Jul 30, 2026 - Rust
Research from ParanO(1)d Lab: proof-native systems, cryptographic protocols, verifiable-state architectures, and reproducible engineering results.
cryptography reproducible-research post-quantum-cryptography gkr verifiable-computation zero-knowledge-proofs polynomial-commitments sumcheck proof-systems poseidon2 blockchain-research cryptographic-research binary-fields parano1d
-
Updated
Aug 5, 2026 - HTML
Improve this page
Add a description, image, and links to the polynomial-commitments topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the polynomial-commitments topic, visit your repo's landing page and select "manage topics."