topology-sanity-check

To verify NP-hardness reduction paths from 3-SAT, this Skill analyzes your reduction graph topology to ensure all NP-hard problems have a valid reduction chain originating from 3-SAT. It detects disconnected problems and validates structural completeness.

Detecting orphan problems in a reduction graph is best handled by automated sanity checks that identify registered problems not connected to the main topology. This Skill performs orphan detection to catch disconnected nodes before you publish new reduction rules.

Identifying redundant reduction rules is done through redundancy analysis, which detects if direct reduction rules are made obsolete by more efficient composite paths. This Skill analyzes graph structures to pinpoint and eliminate these inefficiencies.

Yes, this topology sanity check requires Cargo, the Rust package manager, because it utilizes Rust executables to perform automated graph analysis. You must have the Cargo environment configured to execute the verification scripts.

You should run a topology sanity check on your problem reduction graph before publishing new reduction rules. This ensures a robust, well-formed knowledge base of NP-hard problems by catching structural flaws, missing proofs, and redundant rules early.

Isolated problems during graph analysis indicate registered problems that lack a valid reduction path from 3-SAT to the main topology. This Skill performs orphan detection to identify these disconnected nodes and verify NP-hardness proof chain integrity.