Mind · Inference
LayeredCheck
Hierarchical verification strategy
Definition
Mechanism
A Check strategy that evaluates constraints in a declared Hierarchy, cheapest first (e.g., existence -> Validate (schema) -> Understand (semantics), which is also increasing abstraction in the common case). It uses a Sequence of Gates where lower-level failures halt execution immediately, preventing resource waste on higher-level checks for fundamentally broken inputs.
Invariants
- A lower layer's failure stops the Sequence; the next layer does not run.
- Layers run in their declared order, cheapest first.
- Each layer declares whether a finding is a failure or a warning.
Risks
Failure modes
Misordered layers
an expensive check sits below a cheap one, so the halt saves nothing.
Warning inflation
findings are classed as warnings to keep the Sequence running, which defeats the halt.
Relationships
Builds on
Composes with
References
Infrastructure
Vertical rank ordering with Upper/Lower relations, inheritance, and authority
Deep semantic modeling
Infrastructure
Verifying inputs conform to expected schema
Nothing in this library builds on this pattern yet.
Reference
Signature
Check(Hierarchy)