pub struct CoverageSummary {
pub n: usize,
pub orbits: usize,
pub by_rung: BTreeMap<String, usize>,
pub max_ns_degree: usize,
pub structured: usize,
pub rigid: usize,
pub by_resolution_width: BTreeMap<usize, usize>,
}Expand description
The hardness spectrum of the n-variable SAT hypercube — the durable “how much do we cover, and
where is the hard core” map, aggregated from census. Each minimal-UNSAT family is placed on the
certified proof-complexity ladder by its weakest crushing rung (the cheapest proof system that
refutes it), and split by whether it carries Bₙ symmetry to break. The Nullstellensatz rung is
further resolved by minimum degree — the algebraic-hardness dial — so the spectrum shows not just
that the residue is algebraic but how deep it sits.
Fields§
§n: usize§orbits: usize§by_rung: BTreeMap<String, usize>Family count per proof rung: trivial (unit propagation), counting, parity,
nullstellensatz-d{degree}, beyond-budget. The rung is exactly which proof system covers it.
max_ns_degree: usizeThe deepest minimum-Nullstellensatz degree at this n — the algebraic-hardness ceiling.
structured: usizeFamilies with a non-trivial Bₙ stabilizer — symmetry there is to break.
rigid: usizeFamilies with trivial stabilizer — the rigid residue, no symmetry shortcut.
by_resolution_width: BTreeMap<usize, usize>Distribution of minimum resolution width across the families.
Trait Implementations§
Source§impl Clone for CoverageSummary
impl Clone for CoverageSummary
Source§fn clone(&self) -> CoverageSummary
fn clone(&self) -> CoverageSummary
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read more