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.
Start a fresh conversation. Replace the highlighted placeholders.
Use competition-race-condition-state-drift to 在 ctf-sandbox-orchestrator 已激活、已确认授权沙箱范围/节点归属/证据优先级并路由至此后，基于 [路由与范围回执] 和 [已净化状态与时序证据]，产出一个最小竞态状态漂移分析，比较基线顺序与单一变量改变后的并发顺序，追踪读/检查/写/提交边界并标注未知项；仅做纸面分析，不执行或声称复现。
Required inputs
[路由与范围回执]
[已净化状态与时序证据]
User-approved starter prompt based on a pinned source version; check current skill requirements before running. Task evidence ↗
SKILL.md
name: competition-race-condition-state-driftdescription: 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.
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