← → Print all
01 — Proof system · Proof system

Binius and binary-field systems

Transparent hash-based, binary fields

In one paragraph

Binius and binary-field systems: Transparent hash-based, binary fields. Setup: None. Proof size: Hash-based scale. On-chain verification: Impractical directly. PQ: Plausibly. Recursion: Developing. Maturity: Early production; fast-moving codebase. Prover cost profile: Binary-field arithmetic maps to hardware bit operations; strongest on hashing and bitwise workloads. Peak prover memory: Low — tiny field elements, no embedding overhead. Off-chain verifier: Milliseconds. Implementations and maintainers: Binius64 (Irreducible); the original binius repository is archived. Where it is measured: Irreducible's published figures; few independent measurements. Assumption: Hash over binary fields. Setup: None. Opening size: Hash-based scale. Verifier cost: Polylogarithmic. Field constraint: Binary field towers. Choose it when: Hash- and bitwise-heavy workloads, and client-side proving, for teams able to track a fast-moving codebase.

By MarketComp Updated v1.3 About the authors Changelog
Setup
None
Proof size
Hash-based scale
On-chain verification
Impractical directly
PQ
Plausibly
Recursion
Developing
Maturity
Early production; fast-moving codebase
Selection matrix · as Binius (binary fields) · see the row in context
Prover cost profile
Binary-field arithmetic maps to hardware bit operations; strongest on hashing and bitwise workloads
Peak prover memory
Low — tiny field elements, no embedding overhead
Off-chain verifier
Milliseconds
Implementations and maintainers
Binius64 (Irreducible); the original binius repository is archived
Where it is measured
Irreducible's published figures; few independent measurements
Prover profile · as Binius (binary fields) · see the row in context
Assumption
Hash over binary fields
Setup
None
Opening size
Hash-based scale
Verifier cost
Polylogarithmic
Field constraint
Binary field towers
Commitment schemes · as Binius commitments · see the row in context

What it is

SNARKs over towers of binary fields, with a commitment that has no embedding overhead for tiny field elements. The current generation computes natively over 64-bit words with built-in bitwise and multiplication constraints, explicitly targeting client-side proving on commodity CPUs.

Strengths and tradeoffs

Strengths
  • Binary-field arithmetic maps directly to hardware bit operations — a strong fit for hashing, ciphers and bit manipulation
  • No trusted setup; hash-based and plausibly post-quantum
  • Explicitly targets commodity CPUs rather than GPU clusters
Tradeoffs
  • The most volatile family here: the original implementation was archived and superseded, with significant features still on the roadmap at the successor's launch — confirm current capability before designing around it
  • Small implementation and auditor base
  • Not directly on-chain verifiable

Choose it whenHash- and bitwise-heavy workloads, and client-side proving, for teams able to track a fast-moving codebase.

Maintained implementations

Diamond and Posen (Irreducible, formerly Ulvetanna, 2023). Implementation: Binius64 (Irreducible)

Maturity: Early production; active development · License: n/a (construction) · eprint.iacr.org ↗

How to decide
Other proof systems in §01
Groth16PLONK and the PLONKish familyFRI-based STARKsHalo2 with IPA, and Halo2 with KZGNova, SuperNova and HyperNovaSTIR and WHIRGKR-based systemsSpartanBulletproofsLookup arguments: Plookup, LogUp, cq, Lasso/Shout/Twist

Sources cited on this page · 1

  1. Binius — succinct arguments over towers of binary fieldspaper

All 40 sources for §01 are listed on the section page →

Cite this page 
MarketComp (2026). Binius and binary-field systems. The ZK Field Manual (Version 1.3). MarketComp. https://zkpick.com/proof-systems/binius/
@misc{zkfieldmanual-binius-and-binary-field-systems,
  title        = {Binius and binary-field systems — The ZK Field Manual},
  author       = {MarketComp},
  year         = {2026},
  version      = {1.3},
  howpublished = {\url{https://zkpick.com/proof-systems/binius/}},
  note         = {Accessed: YYYY-MM-DD}
}