.claude/skills/design-tournament/SKILL.md
Use when facing a design decision with multiple viable approaches, when you want competing proposals evaluated objectively, or when brainstorming needs structured diverge-then-converge evaluation. 3-5 independent design agents plus ranked synthesis.
npx skillsauth add ahrav/gossip-rs design-tournamentInstall this skill globally with one command. Works with Claude Code, Cursor, and Windsurf.
3 of 9 scanners reported clean
Some scanners were skipped, did not run, or reported a non-clean status. Review each row below.
A two-phase "wisdom of crowds" pattern for design work. Multiple independent agents explore the same problem in isolation, then independent rankers evaluate and merge the findings into a confidence-weighted stack ranking.
/design-tournament <problem statement>
The <problem statement> is the full description of what needs to be designed.
If no argument is given, ask the user for the problem statement before
proceeding.
Launch 5 independent agents in parallel using the Task tool with
subagent_type=general-purpose. Every agent receives identical instructions
so that their outputs are independently generated with zero cross-contamination.
All 5 agents MUST be launched in a single message (one message, five Task tool calls) so they run concurrently.
Each agent receives this prompt, with {PROBLEM} replaced by the user's
problem statement and {AGENT_ID} set to a unique label (Alpha, Beta, Gamma,
Delta, Epsilon):
You are Design Agent {AGENT_ID} in an independent design tournament.
## Problem
{PROBLEM}
## Your Task
Produce a COMPLETE, standalone design proposal. You are working independently —
do not assume anyone else's output exists.
### Required Sections
1. **Problem Restatement** — Restate the problem in your own words to confirm
understanding. Call out any ambiguities or assumptions you are making.
2. **Design Proposal** — Your recommended design. Include:
- Core idea / approach (1-2 sentence summary)
- Detailed description with concrete types, signatures, or pseudocode
- Key invariants or contracts the design enforces
- How the design handles edge cases and failure modes
3. **Alternatives Considered** — At least 2 alternative approaches you
evaluated and why you rejected them.
4. **Trade-offs** — Explicit trade-off analysis:
- What does this design optimize for?
- What does it sacrifice?
- Under what conditions would a different design be better?
5. **Risks & Open Questions** — What could go wrong? What remains uncertain?
6. **Self-Assessment** — Rate your own confidence (0-100) in this design and
explain why.
### Rules
- Be specific and concrete — pseudocode or type signatures over hand-waving.
- Do NOT hedge with "it depends" — commit to a design and defend it.
- Explore the codebase if you need context (use Glob, Grep, Read).
- Aim for depth over breadth. One well-defended design beats three sketches.
### Output Format
Return your response as a single markdown document with the sections above.
Start with: `# Design Proposal — Agent {AGENT_ID}`
After all 5 agents complete, gather their outputs. If any agent fails or times out, proceed with the agents that succeeded (minimum 3 required).
Launch 2 independent ranking agents in parallel using the Task tool with
subagent_type=general-purpose. Both receive identical instructions and
the collected Phase 1 outputs.
Both rankers MUST be launched in a single message (one message, two Task tool calls) so they run concurrently.
You are Ranking Judge {JUDGE_ID} in a design tournament.
## Original Problem
{PROBLEM}
## Design Proposals
Below are {N} independently generated design proposals for the same problem.
Evaluate them WITHOUT knowing which agent produced each one (they are labeled
Alpha through Epsilon for reference only).
{PROPOSALS}
## Your Task
### 1. Evaluation Criteria
Score each proposal on these dimensions (1-10 scale):
| Criterion | Weight | Description |
|-----------|--------|-------------|
| **Correctness** | 25% | Does the design actually solve the problem? Are invariants sound? |
| **Simplicity** | 20% | Is this the simplest design that could work? Minimal moving parts? |
| **Robustness** | 20% | How well does it handle edge cases, failures, and adversarial inputs? |
| **Extensibility** | 15% | Can the design accommodate likely future requirements without rework? |
| **Specificity** | 10% | How concrete and implementable is the proposal? |
| **Trade-off Awareness** | 10% | Does the author understand what they're sacrificing? |
### 2. Per-Proposal Evaluation
For EACH proposal, provide:
- Scores on each criterion
- Weighted total score
- Top strength (1 sentence)
- Top weakness (1 sentence)
- Key insight unique to this proposal (if any)
### 3. Stack Ranking
Produce a final ranking from best to worst. For each position:
- Rank position (1 = best)
- Agent label
- Weighted total score
- Confidence in this ranking position (0-100):
- 90-100: Clear winner/loser, large score gap
- 70-89: Solid ranking, meaningful score gap
- 50-69: Close call, could reasonably swap with adjacent rank
- Below 50: Essentially tied, ranking is arbitrary
### 4. Synthesis Recommendation
After ranking, provide:
- **Recommended design**: Which proposal to use as the starting point
- **Cherry-pick list**: Specific ideas from OTHER proposals that should be
incorporated into the winner
- **Composite confidence** (0-100): Your overall confidence that the #1
ranked proposal (with cherry-picks) is the right design
### Rules
- Judge designs on MERIT, not on writing quality or verbosity.
- If two designs are substantively identical, say so — don't force a
false distinction.
- Be willing to rank a simple, correct design above an elaborate one.
- Explore the codebase if you need context to evaluate feasibility.
### Output Format
Return your response as a single markdown document.
Start with: `# Ranking Report — Judge {JUDGE_ID}`
After both rankers complete, merge their results:
Present the merged result to the user as:
## Design Tournament Results
### Problem
{one-line restatement}
### Stack Ranking
| Rank | Agent | Avg Score | Judge Agreement | Confidence | Key Strength |
|------|-------|-----------|-----------------|------------|--------------|
| 1 | ... | 8.2/10 | Yes | 92% | ... |
| 2 | ... | 7.5/10 | Yes | 78% | ... |
| 3 | ... | 6.8/10 | No (J1:#2,J2:#4)| 54% | ... |
| ... | ... | ... | ... | ... | ... |
### Recommended Design
**Base**: Agent {winner}'s proposal
**Cherry-picks from other proposals**:
- From Agent X: {specific idea}
- From Agent Y: {specific idea}
**Composite Confidence**: {average of both judges' composite}%
### Winning Proposal Summary
{2-3 paragraph summary of the #1 design with cherry-picks integrated}
### Full Proposals (collapsed)
<details><summary>Agent Alpha — Score: X.X</summary>
{full proposal text}
</details>
{repeat for each agent}
### Ranking Details (collapsed)
<details><summary>Judge 1 Report</summary>
{full ranking report}
</details>
<details><summary>Judge 2 Report</summary>
{full ranking report}
</details>
The default is 5 explorers + 2 rankers (7 total agents). If the user specifies
a different count (e.g., /design-tournament 3 agents: ...), respect it but
enforce these minimums:
development
Deep first-principles code explanation that builds real understanding through phased walkthroughs with diagrams. Covers algorithms, data structures, memory layout, concurrency patterns, and performance tricks — especially for systems code in Rust. Use whenever the user asks to explain, walk through, break down, deep dive into, or understand code. Trigger on "how does this work", "what's happening here", "teach me about this", "why is it done this way", or when the user references a file with @ and wants to understand it. Proactively use when examining code involving lock-free algorithms, atomics/CAS, memory ordering,
development
Use when creating implementation-ready beads tasks that need testing strategy, optimal implementation approach, and documentation requirements baked in — composes /create-task with parallel enrichment agents that analyze the codebase and produce concrete test specifications, algorithm/data-structure guidance, and doc quality standards so implementing agents don't need to re-research
development
--- name: autoresearch description: Autonomous Goal-directed Iteration. Apply Karpathy's autoresearch principles to ANY task. Loops autonomously — modify, verify, keep/discard, repeat. Supports bounded iteration via Iterations: N inline config. version: 1.9.11 --- # Claude Autoresearch — Autonomous Goal-directed Iteration Inspired by [Karpathy's autoresearch](https://github.com/karpathy/autoresearch). Applies constraint-driven autonomous iteration to ANY work — not just ML research. **Core id
development
Use when implementing a new feature and assessing coverage gaps, during periodic test hygiene, when test suites feel bloated, or before merging code that changes coordination or hot paths. Two-phase assess-then-improve testing pipeline.