What problem does it solve? Timing-sensitive bugs like race windows, lock gaps, and idempotency failures are hard to reproduce and prove decisively. This Skill provides a structured CTF workflow for isolating concurrent state corruption, duplicate actions, and stale-read effects into a minimal replayable sequence. ## Core Features & Use Cases - Mutable Boundary Mapping: Identify rows, cache keys, queue payloads, counters, and session fields, then record transaction scope, lock behavior, retry logic, and idempotency keys. - Deterministic Race Reproduction: Build controlled concurrent inputs with fixed delays, duplicate requests, or reordered worker execution, comparing baseline and racing runs with only one variable changed. - Decisive Chain Reduction: Compress findings into a minimal chain of request ordering, stale check or lock gap, conflicting writes, and resulting capability or artifact. - Use Case: During a CTF challenge, you suspect a balance-transfer endpoint accepts duplicate concurrent requests. Use this Skill to map the read-check-write boundary, replay a two-request race, and prove final balance drift from a clean reset. ## Quick Start Ask the agent to reproduce a race condition on the target endpoint by capturing one baseline run and one concurrent run, then proving the final state drift with a minimal replayable sequence.
