Install
$ agentstack add skill-v0idos-performance-deity-optimize ✓ scanned · ✓ verified, works with Claude Code, Cursor, and more.
Security review
✓ PassedNo issues found. Passed automated security review. · v0.1.0 How review works →
- ✓ Prompt-injection patterns
- ✓ Secret / credential exfiltration
- ✓ Dangerous shell & filesystem operations
- ✓ Untrusted network calls
- ✓ Known-malicious package signatures
What it can access
- ✓ Network access No
- ✓ Filesystem access No
- ✓ Shell / process execution No
- ✓ Environment & secrets No
- ✓ Dynamic code execution No
From automated source analysis of v0.1.0. “Used” means the capability is present in the source — more access means more to trust, not that it’s unsafe.
Verified badge
Passed review? Show it. Paste this badge into your README, it links to the public security report.
Reliability & compatibility
Declared compatibility
Compatibility is declared by the source manifest. End-to-end runtime verification is coming, see below.
We're building live execution health for every listing: tool-call success rate, median latency, uptime, and last-checked timestamps, measured, not self-reported. It isn't live yet, so we don't show numbers we can't stand behind.
How agent discovery & health will work →About
Execute all four phases in order. Do not skip any phase.
Phase 1 — Establish Baseline
- Identify the exact code to optimize.
- Run a micro-benchmark:
- Write a temporary micro-benchmark script in the user's workspace.
- The script MUST contain a warm-up phase (discard ≥10 iterations).
- The script MUST run ≥100 iterations and output the Average and P95 execution time.
- Run the script using the terminal.
- Delete the temporary script after recording the results.
- Note: If the script fails due to missing imports or dependencies, skip it and use the bash
timecommand as a fallback.
- Record P95 and Average. Do not proceed until the benchmark runs without error.
- Report baseline numbers before writing any new code.
Phase 2 — Algorithmic Analysis
- State the current Time Complexity (Big-O) explicitly.
- State the current Space Complexity and identify the primary allocation sites.
- Name the bottleneck precisely:
- "Nested loops causing O(n²) scaling"
- "Repeated string concatenation causing N heap allocations per call"
- "Full table scan caused by missing index on
user_id"
Phase 3 — Refactoring
- Rewrite using a more efficient algorithm or data structure (apply in priority order):
- Replace Array/List lookups with Hash Sets/Dictionaries: O(N) → O(1)
- Vectorization or batching instead of per-item iteration
- Caching/memoization of expensive pure computations
- Zero-allocation patterns and buffer reuse to reduce GC pressure
- Bitwise operations where mathematically equivalent
- Run the benchmark on the new code.
- If the new code is not measurably faster: discard it, select a different approach, repeat.
Phase 4 — Report
Present a Performance Report table:
| Metric | Baseline | Optimized | Δ | |---|---|---|---| | Average | Xms | Yms | -Z% | | P95 | Xms | Yms | -Z% |
Follow with a one-paragraph explanation grounded in CPU/memory theory.
Source & license
This open-source skill is cataloged on AgentStack and links to its original source — we do not rehost the code.
- Author: v0idOS
- Source: v0idOS/performance-deity
- License: MIT
- Homepage: https://v0idos.github.io/performance-deity/
Install and usage instructions live in the source repository linked above.
Reviews
No reviews yet, be the first.
Write a review
Versions
- v0.1.0 Imported from the upstream source.