Competition Race Condition State Drift
Use this skill only as a downstream specialization after $ctf-sandbox-orchestrator is already active and has established sandbox assumptions, node ownership, and evidence priorities. If that has not happened yet, return to $ctf-sandbox-orchestrator first.
Use this skill when the decisive behavior depends on request timing, async ordering, lock gaps, or stale state.
Reply in Simplified Chinese unless the user explicitly requests English.
Quick Start
- Identify mutable state first: rows, cache keys, queue payloads, session fields, counters, or files.
- Reproduce with smallest concurrent sequence and fixed timing assumptions.
- Capture one baseline run and one racing run with only one variable changed.
- Track read, check, write, enqueue, and commit boundaries separately.
- Prove final state drift from a clean reset.
Workflow
1. Map Mutable Boundaries
- Record transaction scope, lock behavior, retry logic, idempotency keys, cache invalidation, and queue handoff.
- Note where read-check-write is split across requests, workers, or services.
- Keep each boundary tied to exact timestamps or sequence numbers.
2. Reproduce Timing Window
- Build deterministic concurrent inputs with controlled delay, duplicate requests, or reordered worker execution.
- Compare accepted and rejected paths under identical payloads.
- Record which condition flips when ordering changes.
3. Reduce To Decisive Race Chain
- Compress to: request A and B ordering -> stale check or lock gap -> conflicting writes -> resulting capability or artifact.
- State whether root cause is missing lock, weak idempotency, stale cache read, delayed async commit, or retry side effect.
- If the path becomes queue-dominant, hand off to queue worker drift skill.
Read This Reference
- Load
references/race-condition-state-drift.md for race harness ideas, evidence blocks, and parity checks.
What To Preserve
- Mutable keys, transaction boundaries, lock behavior, and idempotency markers
- Timestamped or sequenced traces for baseline and race runs
- One minimal replayable concurrent sequence proving drift
1---2name: competition-race-condition-state-drift3description: Internal downstream skill for ctf-sandbox-orchestrator. CTF-sandbox workflow for race windows, ordering bugs, idempotency failures, lock gaps, concurrent worker drift, and state inconsistencies that produce decisive effects. Use when the user asks to reproduce timing-sensitive bugs, concurrent state corruption, duplicate actions, stale reads, or privilege or balance drift caused by request ordering. Use only after `$ctf-sandbox-orchestrator` has already established sandbox assumptions and routed here.4---5
6# Competition Race Condition State Drift
7
8Use this skill only as a downstream specialization after `$ctf-sandbox-orchestrator` is already active and has established sandbox assumptions, node ownership, and evidence priorities. If that has not happened yet, return to `$ctf-sandbox-orchestrator` first.
9
10Use this skill when the decisive behavior depends on request timing, async ordering, lock gaps, or stale state.
11
12Reply in Simplified Chinese unless the user explicitly requests English.
13
14## Quick Start
15
161. Identify mutable state first: rows, cache keys, queue payloads, session fields, counters, or files.
172. Reproduce with smallest concurrent sequence and fixed timing assumptions.
183. Capture one baseline run and one racing run with only one variable changed.
194. Track read, check, write, enqueue, and commit boundaries separately.
205. Prove final state drift from a clean reset.
21
22## Workflow
23
24### 1. Map Mutable Boundaries
25
26- Record transaction scope, lock behavior, retry logic, idempotency keys, cache invalidation, and queue handoff.
27- Note where read-check-write is split across requests, workers, or services.
28- Keep each boundary tied to exact timestamps or sequence numbers.
29
30### 2. Reproduce Timing Window
31
32- Build deterministic concurrent inputs with controlled delay, duplicate requests, or reordered worker execution.
33- Compare accepted and rejected paths under identical payloads.
34- Record which condition flips when ordering changes.
35
36### 3. Reduce To Decisive Race Chain
37
38- Compress to: request A and B ordering -> stale check or lock gap -> conflicting writes -> resulting capability or artifact.
39- State whether root cause is missing lock, weak idempotency, stale cache read, delayed async commit, or retry side effect.
40- If the path becomes queue-dominant, hand off to queue worker drift skill.
41
42## Read This Reference
43
44- Load `references/race-condition-state-drift.md` for race harness ideas, evidence blocks, and parity checks.
45
46## What To Preserve
47
48- Mutable keys, transaction boundaries, lock behavior, and idempotency markers
49- Timestamped or sequenced traces for baseline and race runs
50- One minimal replayable concurrent sequence proving drift
gabrielmoreira