---
title: "Binius and binary-field systems"
description: "Binius and binary-field systems: Transparent hash-based, binary fields. Setup: None. Proof size: Hash-based scale."
type: "option"
url: "https://zkpick.com/proof-systems/binius/"
section: "01 Choosing a proof system"
authors:
  - "MarketComp"
publisher: "MarketComp"
version: "1.3"
updated: "2026-09-12"
license: "CC-BY-4.0"
json: "https://zkpick.com/data/proof-systems/binius.json"
---

*By MarketComp. Updated 2026-09-12. Version 1.3. CC BY 4.0.*

# Binius and binary-field systems — *Transparent hash-based, binary fields*

> 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.

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**

- 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 when:** Hash- and bitwise-heavy workloads, and client-side proving, for teams able to track a fast-moving codebase.

Maintained by: Diamond and Posen (Irreducible, formerly Ulvetanna, 2023). Implementation: Binius64 (Irreducible) · Maturity: Early production; active development · License: n/a (construction) · Source: https://eprint.iacr.org/2023/1784

**In the proof system selection matrix** (https://zkpick.com/proof-systems/#proof-systems-matrix-binius-binary-fields)

| Family | Setup | Proof size | On-chain verification | PQ | Recursion | Maturity |
| --- | --- | --- | --- | --- | --- | --- |
| Binius (binary fields) | None | Hash-based scale | Impractical directly | Plausibly | Developing | Early production; fast-moving codebase |

**In the prover profile, implementations and benchmarks** (https://zkpick.com/proof-systems/#proof-systems-matrix-2-binius-binary-fields)

| Family | Prover cost profile | Peak prover memory | Off-chain verifier | Implementations and maintainers | Where it is measured |
| --- | --- | --- | --- | --- | --- |
| Binius (binary fields) | Binary-field arithmetic maps to hardware bit operations; strongest on hashing and bitwise workloads | Low — tiny field elements, no embedding overhead | Milliseconds | Binius64 (Irreducible); the original binius repository is archived | Irreducible's published figures; few independent measurements |

**In the commitment schemes — the layer that decides most of it** (https://zkpick.com/proof-systems/#proof-systems-matrix-3-binius-commitments)

| Scheme | Assumption | Setup | Opening size | Verifier cost | Field constraint |
| --- | --- | --- | --- | --- | --- |
| Binius commitments | Hash over binary fields | None | Hash-based scale | Polylogarithmic | Binary field towers |