Provide implementations of advanced data structures
The English summary is being prepared. Showing the original description.
Discover public GitHub repositories that import defineTask from @a5c-ai/babysitter-sdk and maintain a deduplicated catalog of those repositories in docs/repo-with-babysitter-processes.md. Excludes any repo named "babysitter" (to filter out forks of this monorepo). Invoke when asked to find, discover, catalog, or refresh "repos using babysitter", "babysitter in the wild", or "who else is using babysitter".
The English summary is being prepared. Showing the original description.
Run score Not tested
See how to installReview the instructions the agent will receive before you install.
Produce a curated, deduplicated catalog of public GitHub repositories that import defineTask from @a5c-ai/babysitter-sdk, stored at docs/repo-with-babysitter-processes.md. Refresh the catalog in-place when re-run; do not delete entries that no longer match (mark them as "last seen" instead, so the catalog is additive over time).
retrospect-external-babysitter-run).gh CLI installed and authenticated (gh auth status must be OK). GitHub code search requires an authenticated user.Search the literal import statement across public code:
gh search code \
"import { defineTask } from '@a5c-ai/babysitter-sdk'" \
--json repository,path,url \
--limit 200
Also run the double-quote variant to catch formatter differences:
gh search code \
'import { defineTask } from "@a5c-ai/babysitter-sdk"' \
--json repository,path,url \
--limit 200
Union the two result sets. If the CLI caps out at 100 per query, paginate by adding language:javascript, language:typescript, and extension:js, extension:ts qualifiers to split the search space.
repository.name (case-insensitive) equals babysitter. This excludes forks of this monorepo.repository.nameWithOwner starts with a5c-ai/ -- those are first-party and already known.repository.isArchived === true). Enrich via gh api repos/<owner>/<name> if the search JSON lacks it.repository.nameWithOwner -- one entry per repo, even if multiple files match. Keep the count of matching files as evidence.For each repo, fetch:
gh api repos/<owner>/<name> \
--jq '{nameWithOwner, description, stargazerCount: .stargazers_count, pushedAt: .pushed_at, defaultBranch: .default_branch, license: .license.spdx_id, topics}'
Also record:
processFiles: the list of matching file paths from the search (cap at 10 per repo in the catalog; note total count if higher).firstSeen: if the repo is new to the catalog, today's date (ISO). If already present, preserve the existing value.lastSeen: today's date (ISO) for every repo that matched this run.Maintain docs/repo-with-babysitter-processes.md as an additive, idempotent document. Structure:
# Repositories Using Babysitter
<!-- Generated by .claude/skills/catalog-babysitter-users. Re-run the skill to refresh. -->
Last refreshed: YYYY-MM-DD
Total repos tracked: N
New this run: M
No longer matching: K
## Active
| Repository | Stars | Description | License | Pushed | Process files | First seen | Last seen |
|------------|-------|-------------|---------|--------|---------------|------------|-----------|
| [owner/name](https://github.com/owner/name) | 123 | ... | MIT | 2026-04-01 | 3 | 2026-03-15 | 2026-04-12 |
### owner/name
- Default branch: `main`
- Topics: `a5c`, `orchestration`
- Matching files:
- [`src/processes/build.js`](https://github.com/owner/name/blob/main/src/processes/build.js)
- ...
## Stale (no longer matching at last refresh)
| Repository | Last seen | Notes |
|------------|-----------|-------|
| ... | ... | Import removed / repo archived / ... |
Rules when updating:
firstSeen.lastSeen note if the situation changes (e.g. re-matched -> move back to Active).pushedAt descending.docs/repo-with-babysitter-processes.md (if absent, treat as an empty catalog).nameWithOwner.gh search code queries above; union results.gh api repos/....gh search code is throttled (30 req/min for authenticated users). If the first pass returns the default cap, split by language: qualifier and by file extension: rather than spamming retries. Always include --limit 100 (max) and paginate via qualifier-splitting, not --page (code search doesn't page).
Suggest the sibling skill retrospect-external-babysitter-run to go deeper on any specific entry -- "pick a repo from the catalog and retrospect on one of its runs".
No reviews yet. Tell others what you thought.
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.
Provide implementations of advanced data structures
The English summary is being prepared. Showing the original description.
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.
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.
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.
Generate visual representations of algorithm execution
The English summary is being prepared. Showing the original description.
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.