Async state consistency

Async State Consistency

Use for language-neutral component state whose asynchronous work can race with clear, invalidation, expiry, refresh, another publication, or a direct caller.

Contract First

Before proposing a repair:

1. Name the authoritative state holder and every path that can return, publish, replay, or repopulate it: observers, late subscribers, warm cache, one-shot calls, memoization, request coalescing, persistence, and derived projections.
2. Model lifecycle states explicitly. Keep initial or unknown distinct from Available(empty), and define invalidated, error, stale, and retry outcomes only where the contract needs them.
3. Name each ownership domain: global invalidation generation, keyed/domain generation, ordinary publication revision, operation identity, and any dependency revisions.
4. Choose and name the supersession policy for competing work: latest-start-wins or latest-success-wins. Define what happens to older work when a newer attempt fails or is cancelled.
5. Choose a separate same-generation admission policy: join/coalesce one shared operation, queue/serialize distinct attempts, or run independently.
6. For shared work, distinguish cancellation of one waiter from cancellation requested for the shared entry, and define when that entry stops being joinable.
7. Define the direct caller outcome when its work is rejected: authoritative reread, declared stale/retry/cancellation, or another explicit result.
8. Separate read-time freshness from active expiry. Elapsed time alone is not an observer emission trigger; name the timer, refresh, lifecycle, scheduler, or storage signal that re-evaluates state.

Preserve State Meaning

• Preserve lifecycle discriminators through every projection. Do not map initial or invalidated to a valid domain value.
• Match projection modality to its inputs. A synchronous projection cannot depend on asynchronously unavailable state; pre-resolve it at an owned boundary or expose an asynchronous contract.
• Make late-subscriber replay semantics explicit. A cleared value cannot remain current merely because a replay container retained it.
• Do not encode a required authority transition only as a transient value in an equality-conflating observable. If an invalidation followed by an equal-payload replacement must restart or fence consumers, include a monotonic epoch in the retained snapshot or provide an equivalent lossless revision receipt at the decision boundary. Payload equality is not authority equality.
• Treat a source-issued ownership token as opaque authority evidence. Carry the exact token value, or a lossless wrapper around it, through projections and commit fences. Do not reconstruct it from exposed counters or a synthetic owner; that can erase identity and fields added by the authority source.

Map Authority

Build a compact table with one row per read, write, replay, and notification path:

path | candidate value | ownership evidence | invalidation domain |
linearization point | caller/subscriber outcome

Include every outer and inner coordination layer on the public entry-to-publication path: mutex, actor, queue, single-flight, coalescer, cache, memo, retained observer state, persistence layer, and projection.

Order And Linearize

• Keep invalidation generation separate from ordinary publication sequence. A clear revokes earlier work; a newer same-domain publication supersedes an older completion without implying Invalidated. Advance publication ownership at reservation for latest-start-wins, or at successful commit for latest-success-wins; do not mix the policies implicitly.
• Capture ownership before asynchronous work, then validate it at the final state/cache commit. Validation and commit must be one atomic or serialized transition against same-domain invalidation and publishers.
• Treat replay reads symmetrically. Read the candidate value and its authority from one atomic/serialized snapshot, or use a stamped snapshot and retry when the revision changes. Reading a value and validating it later is a read-side check-to-use race.
• Always validate the global or owning-domain revision. An empty dependency list must not pass vacuously unless the value is explicitly independent of invalidation.
• Atomically commit only owned data plus an owner-local, non-delivering emission revision or intent. The serialized owner must not run subscriber callbacks, user-supplied predicates or factories, or delivery that can synchronously resume or reenter, block, suspend, or apply backpressure. Run those outside the owner and revalidate authority before committing results computed by user code. Across durable boundaries, use an equivalent ordered, idempotent notification record.
• Cancellation is cooperative, not authority. Work that ignores cancellation still needs the same commit and caller-result guards.
• Treat shared-entry join eligibility as separate from commit authority and work termination. Cancelling one waiter must not detach otherwise healthy shared work. When cancellation is requested for the shared entry itself, atomically mark that exact membership non-joinable or detach it before a later admission can select it, even if the work has not terminated. Give a replacement entry a distinct identity, and let late completion or cleanup remove membership only while that identity still matches. Cancellation alone does not revoke commit authority; use the declared supersession and invalidation fences.
• Shared-work admission must linearize against invalidation. In one atomic or serialized transition, read the current owning generation and either join a matching joinable entry or install the new entry. Do not validate authority, release ownership, then mutate the in-flight registry.
• When invalidation wins, apply the liveness rule at every outer and inner coordination layer on the component's public path. Each mutex, actor, queue, single-flight, or coalescer must detach revoked work or otherwise allow current-generation progress. A later caller must neither join nor wait behind revoked work even when it ignores cancellation. Keep this bypass generation-scoped: preserve the declared same-generation join, queue, serialization, coalescing, and publication-order policies.
• A rejected completion must not return its candidate as current to a one-shot caller. Reread authority or return the declared stale/retry/cancellation outcome.
• Ownership rejection alone must not emit or persist Error or Invalidated.

Do not hold a lock across remote or slow work merely to gain consistency. Usually only authority capture, snapshot acceptance, combined shared-work admission, and the final commit need a linearization point.

Deterministic Proof

Use controllable gates, barriers, latches, virtual time, or a controlled scheduler. Sleeps and scheduler luck are not race proof.

• Give every controlled operation identity-bound receipts and assert their required partial order. A gate release or continuation resume proves only released(A). When the schedule requires late A to traverse the guarded path, require released(A) < decision(A) from the real post-await commit or caller-outcome path. A finally marker is only terminated(A) and cannot substitute for that post-release decision receipt.
• Attach instrumentation before the controlled schedule and assert the complete ordered emission and caller-result trace through a closed observation horizon. Instrument commit and enqueue surfaces, then drain or acknowledge every controlled output queue after the last enqueue opportunity. A forbidden transient followed by a safe terminal state still fails.
• Include a permitted control schedule, such as fresh post-invalidation work, so an empty trace or disconnected probe cannot pass vacuously.
• State the proof boundary: these receipts prove only the enumerated interleavings and instrumented surfaces. Platform scheduler behavior, memory ordering, and claims over all possible races need appropriate runtime stress, race detection, model checking, or platform evidence.

At minimum, cover:

• late collection after invalidation;
• work started before invalidation and completed afterward;
• same-domain A then B with B completing first;
• A held at the final pre-commit boundary while B wins, and while clear wins;
• both linearization winners: A commits before clear, and clear commits before A;
• a one-shot A rejected after B, including A's direct caller result;
• a replay read held between candidate capture and authority validation while clear wins, including the empty-dependency case;
• revoked A held blocked while post-invalidation B first passes a layer-local gate, then separately runs through the component's public entry point and reaches authoritative publication before A is released; an inner-layer unit proof alone is insufficient; cover per-caller versus shared-work cancellation;
• both shared-work admission winners by gating immediately before the whole atomic admission attempt; for compare-and-set, a speculative snapshot may be captured first, then CAS the combined generation-and-membership snapshot by requiring the expected generation while installing membership; retry on mismatch; also run a same-generation pair that preserves the declared admission policy;
• cancel one waiter while shared work remains healthy and prove the entry keeps its declared join behavior; separately gate a new caller immediately before admission and run shared-entry-cancellation-first and admission-first. When shared-entry cancellation wins, the nonterminal entry is already non-joinable, the new caller uses a distinct eligible identity, and late cleanup of the old identity cannot remove the replacement;
• A starts, B starts, B fails or is cancelled, then A completes under both the declared latest-start-wins and latest-success-wins policies;
• keyed invalidation that leaves unrelated-key work valid, plus global clear;
• invalidate and immediately replace with an equal payload without draining an equality-conflating observer; the authority epoch still changes and revoked work remains fenced;
• carry a source-issued authority token through every projection and fence; tokens that share exposed counters but differ in source-defined authority or identity fields are compared by the source token contract, without consumer-side reconstruction;
• TTL next-read behavior separately from active subscriber emissions;
• blocked delivery followed by reentrant subscriber code, and user-supplied predicate or factory hooks that perform nested mutation before the outer operation revalidates;
• failure between mutation and notification when those are separate surfaces.

Use references/async-state-consistency.md for state, authority, and race matrices.

Output

Report the state contract, authority map, failing interleaving, chosen linearization point, minimal repair, deterministic proof schedules, and any path whose authority remains unverified.

Boundaries

• UI rendering, loading visuals, and interaction state belong to UI skills.
• Timer, lifecycle, deployment, and storage-signal discovery belongs to architecture-runtime-topology.
• Turn an accepted invariant into CI policy with architecture-fitness-functions.
• Use platform skills for framework APIs, source placement, and test harnesses.
• Distributed consensus, replicated databases, and generic async performance need their own specialist workflow.