Random Optimistic Lock Conflict Fixture Generator

Description

Construct synthetic client read/write version traces, retaining cached reads, successful version increments and state-preserving stale-write rejections.

A protocol fixture is local test data representing headers, messages, identifiers, or request decisions. Serialization and parsing can be checked without contacting a server, while authentication, delivery, and actual client behavior require separate tests.

Construct synthetic client read/write version traces, retaining cached reads, successful version increments and state-preserving stale-write rejections.

When to use this tool

Use this generator to create reproducible optimistic lock conflict fixture cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.

How to use the tool and how it works

Supply clients, initialVersion, initialValue, values, operations, count in the field shapes below. Set seed when you need an explicit replay.
Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
Read initialReads, trace, finalVersion, finalValue, pretty. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Initialize every client's cached read version, then sample reads or writes. Reads refresh only that client's cache; writes succeed only when cached and current versions match, incrementing the server version and changing its value without refreshing the writer's cache.^[1]

Input field	Meaning and units	Accepted input
clients	Clients	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 128.; minimum items 1; maximum items 8.
initialVersion	Initial Version	Required. Safe integer; minimum 0.
initialValue	Initial Value	Required. Text; maximum UTF-16 length 65536.
values	Values	Required. Array of Text; maximum UTF-16 length 65536.; minimum items 1; maximum items 16.
operations	Operations	Required. Array of Text; one of "read", "write".; minimum items 1; maximum items 2.
count	Requested count; the mechanics explain whether one draw expands into several returned records.	Required. Safe integer; minimum 1; maximum 32.
seed	Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed.	Optional. Safe integer.

Output field	Interpretation	Returned shape
initialReads	Initial Reads	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 8.
initialReads[].client	Client	Required. Text; maximum UTF-16 length 65536.
initialReads[].version	Version	Required. Safe integer.
trace	Trace	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32.
trace[].client	Client	Required. Text; maximum UTF-16 length 65536.
trace[].operation	Operation	Required. Text; maximum UTF-16 length 65536.
trace[].expectedVersion	Expected Version	Required. Safe integer.
trace[].versionBefore	Version Before	Required. Safe integer.
trace[].versionAfter	Version After	Required. Safe integer.
trace[].valueBefore	Value Before	Required. Text; maximum UTF-16 length 65536.
trace[].valueAfter	Value After	Required. Text; maximum UTF-16 length 65536.
trace[].accepted	Accepted	Required. Boolean.
finalVersion	Final Version	Required. Safe integer.
finalValue	Final Value	Required. Text; maximum UTF-16 length 65536.
pretty	Pretty	Required. Text; maximum UTF-16 length 65536.
randomness	Replay metadata: source is seed or context; seed is the normalized 32-bit seed or null for a context source.	Required. Object; no unknown keys.
randomness.seed	Optional numeric replay seed; normalization and precedence are explained below.	Required. Safe integer. or Null.
randomness.source	Source	Required. Text; one of "context", "seed".

An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.

json

{
  "input": {
    "clients": [
      "a",
      "b"
    ],
    "initialVersion": 0,
    "initialValue": "old",
    "values": [
      "new"
    ],
    "operations": [
      "write"
    ],
    "count": 2,
    "seed": 42
  },
  "output": {
    "initialReads": [
      {
        "client": "a",
        "version": 0
      },
      {
        "client": "b",
        "version": 0
      }
    ],
    "trace": [
      {
        "client": "b",
        "operation": "write",
        "expectedVersion": 0,
        "versionBefore": 0,
        "versionAfter": 1,
        "valueBefore": "old",
        "valueAfter": "new",
        "accepted": true
      },
      {
        "client": "b",
        "operation": "write",
        "expectedVersion": 0,
        "versionBefore": 1,
        "versionAfter": 1,
        "valueBefore": "new",
        "valueAfter": "new",
        "accepted": false
      }
    ],
    "finalVersion": 1,
    "finalValue": "new",
    "pretty": "{\n  \"version\": 1,\n  \"value\": \"new\"\n}\n",
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

A successful write can therefore be followed by a stale write from the same client until it reads again. This is a sequential model of optimistic conflicts, not a database or network transaction.
A replay requires the same complete input and implementation. Randomized construction does not guarantee uniform coverage of every feasible output; finite samples can repeat unless a distinct-selection rule is explicitly stated.
The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.

Alternative or Complementary methods

For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.

References

Tool behavior and example: Random Optimistic Lock Conflict Fixture Generator — tool.io

Similar or alternative tools

Random HTML Attribute Quoting Corpus Generator
Compose bounded benign start-tag source with caller text, delegated five-character entity escaping, feasible double/single/unquoted/Boolean attribute forms, and duplicate attributes; retain the lexical parser's raw character references and first-duplicate rule, not DOM-decoded values, sanitization, or HTML conformance certification.
Random HTML Boolean Attribute Fixture Generator
Construct supported Boolean-attribute spellings with lexical parser outputs, separate presence-based interpretation and author-spelling keys, including the nonconforming false-value control.