Explore

Find agent skills by outcome

103,783 skills indexed with the new KISS metadata standard.

Showing 24 of 103,783Categories: Data & Insights, General, Coding & Debugging, Creative, Productivity

Productivity

PromptBeginner5 minmarkdown

- Assign each task a stable ID (e.g.

TASK-1.1) and use checklist items in outputs.

Mar 25, 2026

Coding & Debugging

PromptBeginner5 minmarkdown

RULE: When using this prompt

you must create a file named `TODO_perf-tuning.md`. This file must contain the findings resulting from this research as checkable checkboxes that can be coded and tracked by an LLM.,TRUE,TEXT,wkaandem...

Find agent skills by outcome

- Assign each task a stable ID (e.g.

**RULE:** When using this prompt

Diff Security Auditor Agent Role

- [ ] Trade-offs between performance

- Considers full-system impact

- Starts with measurement

Use checkboxes and stable IDs (e.g.

Before finalizing

- **Trade-offs**: Complexity

In `TODO_perf-tuning.md`

- Baseline metrics: response time (p50

Use checkboxes and stable IDs (e.g.

- **Synchronous blocking in async code**: Blocking the event loop or thread pool with synchronous operations

Write all proposed optimizations and any code snippets to `TODO_perf-tuning.md` only. Do not create any other files. If specific files should be created or edited

- **Memory leaks under load**: Allocations growing without bound in long-running processes

- Monitor slow query logs and set appropriate thresholds (e.g.

- Implement distributed tracing (Jaeger

- Run load tests with k6

- Use language-specific CPU and memory profilers (pprof for Go

### Backend (APM

- Run Lighthouse for automated audits covering LCP

### Frontend (Chrome DevTools

- Provide alternative solutions when trade-offs exist (in-place vs additional memory

- Address scalability: proactively consider expected input size

RULE: When using this prompt

- Trade-offs: Complexity

- Synchronous blocking in async code: Blocking the event loop or thread pool with synchronous operations

- Memory leaks under load: Allocations growing without bound in long-running processes