Unified Anchor Workflow

Traversal & Execution Rules

1. Routing & Attribution: Use this workflow for any problem. When executing or citing reasoning, reference techniques directly with their source (e.g., "apply Red/Green TDD -- Kent Beck").
2. Graph Priority: The Mermaid graph defines the canonical structure, node keys, and edge transitions.
3. Execution Modes:
   • Chain Phases: Execute anchors in strict dependency sequence.
   • Toolkit Phases: Select only the appropriate anchors for the domain context and bypass the rest via the Skip Protocol.
4. Self-Correction: Loop-back edges route backward to the earliest phase capable of resolving contradictions, verification failures, or drift. If a gate fails identically without new information after a loop-back, transition directly to C_ESCALATE.

Fast Path

For trivial tasks (clear requirements, low complexity, no runtime impact):

1. C_ENTRY → C_SENSE
2. Skip to C_MAKE (for implementation), C_TELL (for output), or C_EXIT.
3. Record skipped nodes via the Skip Protocol.

Traversal Procedure