AGENT SKILL

principle-make-operations-idempotent

Apply when designing commands, lifecycle steps, or processing loops that run amid crashes, restarts, and retries. Converge to the same end state regardless of partial prior runs.

License 许可
MIT
所属仓库
ravnhq/ravn-core
最近更新
2026-11-13
Stars
★ 2
Forks
0

01 前言 Front Matter

name
principle-make-operations-idempotent
license
See LICENSE.txt
metadata
{ "proof": "subjective" }
description
Apply when designing commands, lifecycle steps, or processing loops that run amid crashes, restarts, and retries. Converge to the same end state regardless of partial prior runs.
disable-model-invocation
true

02 资源文件 2

03 SKILL.md 正文

Make Operations Idempotent

Adapted from pstack principle-make-operations-idempotent, MIT License, Copyright (c) 2026 Lauren Tan. See LICENSE.txt.

Design operations to converge to the correct state however many times they run and wherever the previous run stopped.

The idea: derive each step from the state that exists, not from what the previous run meant to do. Read the current state, compare it to the goal, and apply only the difference. A repeat then finds nothing left to do.

Anything a run leaves behind, such as a lock, a temporary file, a half-written record, or a claimed job, must be recognizable as stale by the next run. Judge staleness by evidence that stays true wherever the previous run could have stopped, not only in the common case. For example, write to a temporary path and rename it into place, or compare artifacts by content instead of by creation order.

The test, for every state-mutating operation:

  1. What happens if this runs twice in a row?
  2. What happens if the previous run crashed at every possible point?
  3. Does re-execution converge to the same end state?

If any answer is "it depends on what state was left behind," the operation needs a reconciliation step.

04 同仓库更多 Skills