Menu
The review-first prompt is selected by default. You can switch to a direct command or download a local copy.
Read SKILL.md and any companion files shown by SkillsMP before deciding whether to install.
Install with Codex or Claude Copy this prompt, paste it into Codex, Claude, or another assistant, and let it review the skill page and install it for you.
A direct command skips the review prompt. Inspect the source before running it.
npx skills add https://github.com/ben-manes/caffeine --skill audit-adversarial-inputThe command stays on one line. Scroll horizontally to inspect it before copying.
Prefer a local copy? Download the files currently available to SkillsMP.
Showing SKILL.md
Regenerate the window climber's adversarial trap traces and run the behavioral gate against the real cache in the simulator
Adversarial workload search for eviction-policy regret. Crafts, shrinks, and classifies workloads on which the adaptive window climber fails to close the gap to its achievable optimum, and routes each failure class to the mechanism responsible (controller, policy structure, or recovery layer)
Price each algorithmic step of the window climber by removing it, to find steps that no longer earn their keep and branches that no longer fire
Based on SOC occupation classification
| name | audit-adversarial-input |
| description | Analyze behavior under adversarial or extreme API inputs |
| context | fork |
| agent | auditor |
| disable-model-invocation | true |
Analyze the cache for defects triggered by adversarial or extreme API inputs.
For each category, construct concrete inputs and trace the code path:
Weight extremes: Integer.MAX_VALUE for every entry (overflow?), MAX_VALUE→1 delta (overflow?), 0 for all (unbounded growth?), inconsistent weigher (divergence?).
Expiry extremes: Long.MAX_VALUE nanos (timer wheel overflow?), 0 or negative (infinite loops?), MAX→0 transitions, alternating durations.
Maximum size extremes: Long.MAX_VALUE (arithmetic overflow?), maximumSize(0) (graceful degeneration?), maximumSize(1) (temporary oversize?).
Key/value adversarial behavior: constant hashCode(0) (sketch degeneration?), slow equals() (lock hold explosion?), mutating hashCode (silent corruption?), huge values (allocation failure handling?).
Concurrency extremes: 10K threads on same computeIfAbsent, puts exceeding maintenance throughput (backpressure?), refresh storms from short refreshAfterWrite.
Frequency sketch saturation: all accesses to same key, all unique keys (reset cost?), counter overflow beyond 4-bit limit.
Time extremes: nanoTime near Long.MAX_VALUE (wrap-around?), non-monotonic ticker, large time jumps (timer wheel handling?).
For each issue: state input values, trace computation, state whether it causes incorrect behavior / OOM / infinite loop / degraded performance / graceful handling.
Do not report issues requiring API contract violations (e.g., null keys) unless the violation is undetected and causes silent corruption.