LAB / 042

Durable delivery and history recovery

17 scenarios and 193 child-process records. An unkeyed receiver duplicates the effect after a delivery crash; all three history recovery boundaries retain whole turns.

Completed ·

EXPERIMENT RESULT

GitHub ↗

01 / QUESTION

17 scenarios and 193 child-process records. An unkeyed receiver duplicates the effect after a delivery crash; all three history recovery boundaries retain whole turns.

METHOD

Freeze the protocol, execute it, independently audit raw records, then recheck an export from the Git commit.

RESULT

17 scenarios and 193 child-process records. An unkeyed receiver duplicates the effect after a delivery crash; all three history recovery boundaries retain whole turns.

OBSERVATIONS

17 scenarios and 193 child-process records. An unkeyed receiver duplicates the effect after a delivery crash; all three history recovery boundaries retain whole turns.

CONCLUSION

Read the three question-led tutorials, including negative results and validation boundaries.

LIMITATIONS

Journal-as-business-state, loopback HTTP and cooperative process locks; no live model, power-loss proof or cross-host exactly-once guarantee.

REPRODUCE

Each article provides a pinned revision, fresh output directory, run and audit commands. Execute the shared protocol once.

KEEP EXPLORING

Related content

  1. Tutorials

    Durable idempotency: commit identity and result together

    Use a framed journal, process crashes and 99 truncated prefixes to explain durable idempotency.

    10 MINPublished
  2. Tutorials

    Outbox delivery: local durability is not remote exactly-once

    Compare keyed and unkeyed receivers to separate lost replies, missing receipts and duplicate remote effects.

    10 MINPublished
  3. Tutorials

    Conversation recovery: reconcile intent, receipt and whole turn

    Halt the JVM at three commit boundaries and rebuild whole-turn history from durable facts.

    10 MINPublished
  4. PROJECT / 002

    Java LLM Practice

    Reproducible Java conversation, retry and persistence boundaries, alongside attention, cache-cost and quantization-error experiments.

    Building

← Back to index