SolverDecomposition

Mechanism

The cognitive act of taking a concept, typically the capability that frames a problem, once its claim frame is stated and it has been located among broader kinds, and breaking it into sub-concepts where each sub-concept is bound by the Solver contract (it exposes at least the Manifest and Execute surfaces of the five-surface contract, so it is independently delegatable). Generic Decompose requires independent parts that combine into the whole; this method adds the claim frame, the location and the tests of the general method it extends, and binds every part to the solver contract, so the same five-surface contract governs every level and the structure can recurse. It asks which differentiated dimensions the capability needs across the instances it claims, not which steps would accomplish it, which would produce a procedural carve. Candidate dimensions are generated and each is put to the DecompositionGate tests; a failed or uncertain candidate may be reframed, narrowed or kept as a labelled alternative in the frontier of the ArchiveServingFrontier. A bounded search then looks for any dimension the accepted set still misses, and a RoutingSanityCheck routes a few concrete tasks through the carve before it is kept. Accepted dimensions are bound to the parent by CompositionEdge links, the split declares the Synthesis that recomposes them, and recursion continues into a dimension only while the MarginalValueRule says further depth pays. A few agents can take these solver roles for one problem, and the resulting structure may persist as a reusable pattern or be torn down at completion.