Skip to content
cccskills
FreePublished on GitHub

work-decomposition

Decompose goals into MEOWs (Molecular Expressions of Work) - trackable atomic units following Gas Town's bead-based work model.

The English summary is being prepared. Showing the original description.

See how to install

Files included (2)

  • SKILL.md1.3 KB
  • README.md607 B

SKILL.md (original)

Review the instructions the agent will receive before you install.

  • When a goal is too large for a single agent
  • When parallel execution would benefit progress
  • When work needs tracked attribution

Process

  1. Analyze the goal and project context
  2. Identify natural seams for decomposition
  3. Create MEOWs with clear boundaries and dependencies
  4. Classify as beads (persistent) or wisps (ephemeral)
  5. Map dependencies between MEOWs
  6. Estimate effort and assign priorities

Decomposition Principles

  • Each MEOW should be completable by a single agent
  • Dependencies should form a DAG (no cycles)
  • Prefer more smaller beads over fewer larger ones
  • Wisps for throwaway work (scaffolding, exploration)
  • Every MEOW gets attribution tracking

Tool Use

Invoke via babysitter process: methodologies/gastown/gastown-orchestrator (analyze-work step)

Reviews

No reviews yet. Tell others what you thought.

Comments

No login needed. Share how it worked for you, ask a question, or note where it did not run.

No comments yet. Be the first to write one.

Comments are published right away. Do not include personal information such as email addresses or phone numbers. Up to 2 URLs.

0 / 1,000 characters

This form is protected by reCAPTCHA, and the Google Privacy Policy and Terms of Service apply.

More skills from this repository

Provide implementations of advanced data structures

The English summary is being prepared. Showing the original description.

a5c-ai/babysitter1.9KUpdated Sep 17, 2026

Fresh adversarial code review with binary PASS/FAIL verdicts, evidence citations, and anchoring bias prevention via fresh reviewer spawning.

The English summary is being prepared. Showing the original description.

a5c-ai/babysitter1.9KUpdated Sep 17, 2026

WASM-based instant code transforms for simple tasks, achieving 352x speedup over LLM inference with zero cost.

The English summary is being prepared. Showing the original description.

a5c-ai/babysitter1.9KUpdated Sep 17, 2026

Coordinate Crew (persistent) and Polecat (transient) agents using Gas Town's hook-based work distribution and GUPP principle.

The English summary is being prepared. Showing the original description.

a5c-ai/babysitter1.9KUpdated Sep 17, 2026

Generate visual representations of algorithm execution

The English summary is being prepared. Showing the original description.

a5c-ai/babysitter1.9KUpdated Sep 17, 2026

Hierarchical coordination and drift detection with frequent checkpoints, shared memory coherence validation, role specialization enforcement, and short task cycles.

The English summary is being prepared. Showing the original description.

a5c-ai/babysitter1.9KUpdated Sep 17, 2026

See all skills by a5c-ai

Report a problem with this skill