Binary Proofs, Blazing Fast
-
Updated
Aug 19, 2026 - Rust
#
binary-fields
Here are 5 public repositories matching this topic...
A high-performance, constant-time implementation of binary tower fields (F(2^k)) optimized for Sumcheck-based provers and Binius protocols.
-
Updated
Aug 12, 2026 - Rust
Python package for linear algebra operations in GF(2)
-
Updated
Apr 15, 2026 - Rust
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 11, 2026 - Rust
Executable soundness analysis for ParanO(1)d production proof parameters, with theorem-backed bounds and reproducible industry-metric comparisons.
rust cryptography reproducible-research security-analysis gkr fri zero-knowledge-proofs soundness cryptographic-proofs proof-systems binary-fields interactive-oracle-proofs basefold parano1d
-
Updated
Aug 7, 2026 - Rust
Improve this page
Add a description, image, and links to the binary-fields topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the binary-fields topic, visit your repo's landing page and select "manage topics."