Struct StructureAccounting 

pub struct StructureAccounting {
    pub n: usize,
    pub orbits: usize,
    pub covered_by_degree: Vec<usize>,
    pub structureless: usize,
}

Structure accounting — the answer to “how many minimal-UNSAT families have no structure, and how does cheap structure run out?” For each n: the cumulative number of orbits covered by a certified proof of degree ≤ d (covered_by_degree[d]), and the structureless count = orbits with no bounded certificate at all (rung = beyond-budget). The honest finding at n ≤ 4: structureless = 0 — every minimal-UNSAT cover is algebraically structured (degree ≤ n). Nothing at finite n is truly random; but the degree the structure requires grows with n (= n), so any fixed-degree (“cheap”) lens covers a shrinking fraction. That reconciles “no finite randomness” with the counting bound: structure always exists, but cheap structure runs out.

Fields

n: usize

orbits: usize

covered_by_degree: Vec<usize>

covered_by_degree[d] = orbits refutable by a certified proof of degree ≤ d, d = 0..=n.

structureless: usize

Orbits with no bounded certificate (rung = beyond-budget) — the truly-structureless count.

Trait Implementations

impl Clone for StructureAccounting

fn clone(&self) -> StructureAccounting

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for StructureAccounting

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

Formats the value using the given formatter.