Crate binius_math 

Mathematical primitives used in Binius, built atop the binius-field crate.

This crate provides a variety of mathematical primitives used in Binius, including:

• Multilinear polynomials
• Univariate polynomials
• Additive number-theoretic transform
• Error-correcting codes

Re-exports

pub use binary_subspace::BinarySubspace;

pub use field_buffer::FieldBuffer;

pub use field_buffer::FieldSlice;

pub use field_buffer::FieldSliceMut;

pub use field_buffer::FieldVec;

pub use field_buffer::StructuredBuffer;

pub use reed_solomon::ReedSolomonCode;

Modules

batch_invert

Batch multiplicative inversion via Montgomery’s trick.

binary_subspace

Binary subspaces: $\mathbb{F}_2$-linear spans of a binary field, enumerated in order.

bit_reverse

field_buffer

A power-of-two-sized buffer of packed field elements.

inner_product

Inner products sum_i a_i * b_i over sequences of field elements.

line

Extrapolation of the line through two points.

multilinear

ntt

Efficient implementations of the binary field additive NTT.

reed_solomon

[Reed–Solomon] codes over binary fields.

tensor_algebra

test_utils

univariate

Univariate polynomials, in the two forms a protocol carries them in.