Mind · Strategy

RootSolver

Apex triage node of a SolverTree, with Pathway Memory as its compounding learning site

Definition

Mechanism

The apex node of a solver Tree — the unique entry point where a Problem (attached to a Task) enters that tree. Its cognitive operation is triage: determining what kind of problem this is and routing it via a dispatch function conditioned on its PathwayMemory. The RootSolver holds four unique authorities: Problem Framing (initial constraints and ProblemSpace), Budget Allocation (cascading Budget to child SolverNodes), Ultimate Accountability (owning the final Result or Solution), and Pathway Memory maintenance (compounding learning about which routes work for which problem types). Every tree has exactly one RootSolver; sub-trees carry their own. A FrameError arriving from any descendant is the signal that reframing is required rather than retry; the RootSolver is its terminal consumer, since it alone holds Reframe Authority.

Invariants

  1. Singleton per tree: every SolverTree has exactly one RootSolver.
  2. Owns the final success or failure of the root Task.
  3. Sole reframe authority, and terminal consumer of any FrameError raised beneath it.
  4. PathwayMemory writes name the node that wrote them.

Risks

Failure modes

  1. Bad Frame

    problem framed incorrectly, unsolvable by downstream nodes.

  2. Reframe Failure

    Root fails to find a valid alternative frame after downstream failure.

  3. Budget Misallocation

    resources distributed poorly across child nodes.

  4. Poisoned Pathway Memory silently biases routing decisions — mitigated by signed writes only.

Relationships

Builds on

Composes with

PathwayMemory

Learned routing memory: problem_class → route → outcome_quality

References

Infrastructure

Budget

Resource allocation limit

FrameError

Typed failure signaling that lateral reframing, not retry, is required

Infrastructure

Problem

A state gap with a cost of inaction

Infrastructure

Result

The output of agentic transformation

Infrastructure

Solution

The fractal unit of completed work

Society

SolverNode

Stateful container for a running solver instance

Infrastructure

Task

The atomic unit of intent

Infrastructure

Tree

Branching reasoning topology

Used by

References

MandatoryAbstraction

Before decomposing a concrete problem, locate it by climbing specialization links to the root, then retrace the route

Society

SolverTree

Active hierarchy of coordinated solver instances

Reference

Data schema

{
  "type": "object",
  "required": [
    "task_ref",
    "problem_frame"
  ],
  "properties": {
    "task_ref": {
      "type": "string",
      "description": "Reference to originating task"
    },
    "problem_frame": {
      "type": "object",
      "description": "Initial problem constraints and space"
    },
    "budget_allocation": {
      "type": "object",
      "description": "Resource distribution to children"
    },
    "pathway_memory_ref": {
      "type": "string",
      "description": "Reference to this Root's PathwayMemory"
    },
    "children": {
      "type": "array",
      "items": {
        "type": "string"
      },
      "description": "Child solver node refs"
    }
  }
}

Identity

Ref
RootSolver#f7f5
Sema ID
sema:RootSolver#mh:SHA-256:f7f5a39c4d93545b506ddc3eeb03660295425657486a5ab1f71811cb8e5816ca
Ring
1
Tier
1
Updated
2026-11-11
Supersedes
  • sema:SolverRoot#mh:SHA-256:d31bfa55e755ef10526cf18631128ba7fa9f77afbc6417a07bb5c0700f7a671f
  • sema:SolverRoot#mh:SHA-256:8a84b7a912568866ea4b75faf00eb272cb9611b5c96648c073ddcf5a4d687ba1
  • sema:RootSolver#mh:SHA-256:750d3992db274fa89e6bad275ad10c0fc6ea9969cc9e4ff9cd809c77f96a4d32
  • sema:RootSolver#mh:SHA-256:6d0d34bacbf2d51f0c8152acde51d1bcc1c3f2e93127d4e03ea037a87183980b
  • sema:RootSolver#mh:SHA-256:332edbdd0535c4895116d911fbdc4dfeb1ccefc3266d56f413b39f418f66f31b
  • sema:RootSolver#mh:SHA-256:29d798d343e265e5a0e7de0f84917106067fdaf958476eb9128c5b271a711acb