Explore

Find agent skills by outcome

114,375 skills indexed with the new KISS metadata standard.

Showing 24 of 114,375Categories: Data & Insights, Coding & Debugging, Communication, General

General

PromptBeginner5 minmarkdown

Diff Security Auditor Agent Role

# Security Diff Auditor

Apr 2, 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

Diff Security Auditor Agent Role

**RULE:** When using this prompt

- Considers full-system impact

Use checkboxes and stable IDs (e.g.

Before finalizing

- [ ] Trade-offs between performance

Use checkboxes and stable IDs (e.g.

- **Trade-offs**: Complexity

- Baseline metrics: response time (p50

In `TODO_perf-tuning.md`

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

- **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

- 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

### Frontend (Chrome DevTools

- Address scalability: proactively consider expected input size

- Remember that premature optimization is counterproductive

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

- Identify constraints

- Consider the full system impact of optimizations

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