binary-fields
Here are 7 public repositories matching this topic...
A Lightweight Elliptic Curve Cryptography Arithmetic Library For Python with Support for Prime and Binary Fields
-
Updated
Jun 9, 2026 - Python
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.
-
Updated
Aug 11, 2026 - Rust
Executable soundness analysis for ParanO(1)d production proof parameters, with theorem-backed bounds and reproducible industry-metric comparisons.
-
Updated
Aug 7, 2026 - Rust
Research from ParanO(1)d Lab: proof-native systems, cryptographic protocols, verifiable-state architectures, and reproducible engineering results.
-
Updated
Aug 12, 2026 - HTML
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."