Skip to content
rd-skills
All skills

task-dag-decomposition

FoundationJIT only

Analyze candidate task nodes, dependencies, collisions, and critical path before a consumer accepts or rejects a final DAG.

Group
Engineering workflow
Supported roles
MainAnalysisTaskReview
Source
SKILL.md

Use when

Trigger signals that make this skill the right owner

  • candidate work units need evidence-backed analysis of nodes dependency edges collisions cycles critical path or parallel opportunity before a consumer accepts a final graph

Do not use when

Anti-triggers — as binding as the triggers above

  • one acceptance outcome and produced output cannot be separated into useful candidate nodes
  • an authoritative graph has already been accepted

Required inputs

What must be supplied before this skill can decide anything

  • acceptance outcomes and candidate produced outputs
  • current evidence for producer-consumer relationships contracts and order constraints
  • candidate read write shared-resource and collision surfaces
  • known uncertainty about nodes edges ownership or resources

Output contract

What this skill owes the next role

  • candidate-graph evidence with acceptance-linked nodes, produced outputs, evidence-backed data/control/contract/order edges, rejected edges, collision/shared-write/resource surfaces, candidate critical path, parallel opportunity, cycles, uncertainty, proof limits, and residual risk for consumer acceptance or rejection

Escalation signals

When this skill must hand the decision back

  • candidate output ownership edge evidence collision identity or cycle resolution remains uncertain

Loaded by

This skill never owns a task. These professionals may pull it in as Layer 3.

Targeted references

Each reference carries its own load condition. None of them enter context by default.

ReferenceLoad whenDo not load whenRequired by
candidate-graph-evidence.mdevidence-patterncandidate nodes edges collisions cycles critical path or parallel opportunity need source-backed comparisonone candidate graph has accepted node-output bindings and every edge is supported or rejectedAnalysis