Module bounds 

A-priori height bounds (in bits) used to provision an adaptive crate::basis::Basis.

These turn “might overflow” into “provision exactly enough channels, then prove it fit.” Every bound here is an upper bound on the bit-height of the result, so Basis::with_bits(bound + slack) is guaranteed large enough for reconstruction.

Functions

determinant_bits

Hadamard bound on an n×n integer determinant in bits: ∏ row-2-norms.

integer_bits

Bit-length of an integer (0 has length 0).

mignotte_bits

Mignotte bound on the coefficients of any integer factor g | f in bits: ‖g‖∞ ≤ 2^deg g · ‖f‖₂ (we use deg f as the worst-case factor degree).

product_bits

Exact bound for a product of integers: the sum of their bit-lengths (+1 slack for the leading carry).

resultant_bits

Hadamard/Mahler bound on Res(f, g) in bits: ‖f‖₂^deg g · ‖g‖₂^deg f (with slack for the sign bit and rounding).