Struct LinearRigidityCert 

pub struct LinearRigidityCert {
    pub num_vars: usize,
    pub rows: Vec<u64>,
    pub rank: usize,
    pub kernel_basis: Vec<Vec<bool>>,
    pub solution_count_log2: u32,
}

A re-checkable certificate that F’s parity structure admits no linear symmetry shortcut beyond its exposed kernel: the GF(2) coefficient system has rank rank, its solution space is exactly 2^solution_count_log2 (spanned by kernel_basis), and this is the complete linear structure.

Fields

num_vars: usize

The number of Boolean variables F is over.

rows: Vec<u64>

The GF(2) coefficient rows recovered from F — bit v set iff variable v occurs in that parity equation (the right-hand side is irrelevant to the linear structure).

rank: usize

The rank of the coefficient system — the number of independent parity constraints.

kernel_basis: Vec<Vec<bool>>

A basis for the null space (the linear symmetry directions). Exactly num_vars − rank vectors.

solution_count_log2: u32

log₂ of the number of GF(2) solutions — = kernel_basis.len().

Trait Implementations

impl Clone for LinearRigidityCert

fn clone(&self) -> LinearRigidityCert

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LinearRigidityCert

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for LinearRigidityCert

fn eq(&self, other: &LinearRigidityCert) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for LinearRigidityCert

impl StructuralPartialEq for LinearRigidityCert