Mind · Reasoning

RoutingSanityCheck

Test a candidate carve by routing a few concrete tasks through it before it is kept

Definition

Mechanism

When a Decompose step proposes a candidate carve, a few concrete tasks from its domain, typically three, are generated before the carve is kept, and each is passed by Route to the proposed sub-concepts. A task that finds no clean home suggests a missing dimension, and a task that belongs equally to two sub-concepts suggests that they are not independent enough. The carve is reframed until each task, or each part of a task, routes cleanly to exactly one sub-concept, or it is kept with a recorded warning; a task whose parts go to different sub-concepts is clean, while a part that could go equally to two is not. The check is empirical: it catches carves that are logically elegant but functionally weak, which the four tests, judged in the abstract, can miss.

Invariants

  1. Concrete tasks from the carve's domain are routed through the proposed sub-concepts before the carve is kept.
  2. A task with no clean home, or with two equal homes, leads to a reframing of the carve or to keeping it with a recorded warning.

Risks

Failure modes

  1. Tailored sample

    the tasks are chosen to fit the proposed carve, so every one routes cleanly.

  2. Warning forgotten

    a carve kept with a routing warning is later treated as if it had routed cleanly.

  3. Sample read as proof

    a clean routing of a few tasks is taken to certify the carve.

Relationships

Builds on

References

Decompose

Dividing complexity into manageable units

Infrastructure

Route

Classify input and direct to specialized handler

Used by

References

ConceptualDecomposition

Finding what a concept is made of: locate it, carve it into the dimensions every case it claims needs, test each, search for what is missing, route real cases through it, say how the parts make the whole, and carve again below

SolverDecomposition

Breaking a concept into solver-contract-bound sub-concepts — the move that enables fractal recursion

Reference

Identity

Ref
RoutingSanityCheck#71bd
Sema ID
sema:RoutingSanityCheck#mh:SHA-256:71bdf79f3d471779f7312d699718cab13efef2db27d45873aeb0e91e35c73a8b
Ring
2
Tier
2
Updated
2026-11-11