Struct ModpRecovery 

pub struct ModpRecovery {
    pub modulus: u64,
    pub num_vars: usize,
    pub equations: Vec<ModpEquation>,
    pub groups: Vec<Vec<u32>>,
}

A mod-m linear system recovered from an opaque Boolean CNF: the one-hot groups (each a ℤ/m variable, with the boolean var ids listed in value order) plus the congruences fitted to the forbidden-combination clauses. The recovered system is equisatisfiable to the source CNF, so the modular verdict carries back — over the prime field solve when modulus is prime, over the composite ring crate::modm::solve otherwise. See recover_from_cnf.

Fields

modulus: u64

num_vars: usize

One ℤ/modulus variable per one-hot group.

equations: Vec<ModpEquation>

groups: Vec<Vec<u32>>

groups[g][val] = the boolean variable that means “variable g takes value val”.

Trait Implementations

impl Clone for ModpRecovery

fn clone(&self) -> ModpRecovery

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ModpRecovery

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

Formats the value using the given formatter.