FA-825 / Queues / Member archive

Move a poison message to a dead-letter queue: Dead-letter transfer loses the original message identity · case 05

The queue dead letter operation is admitted even though dead-letter transfer loses the original message identity.

Member previewVariant 5 · 3 implementations · 9 checks per implementation

Case contract

Return a Boolean admission decision for move a poison message to a dead-letter queue. The record r must satisfy all of: r['attempt_threshold'][0] >= r['attempt_threshold'][1]; r['destination_exists'] is True; r['transfer_persisted'] is True; r['cycle_detection'][0] not in r['cycle_detection'][1]; r['original_identity'][0] == r['original_identity'][1]. Extra tracing fields are ignored; validation does not mutate the record.

Why this case matters

A deterministic local contract for queues. Each negative fixture violates exactly one invariant. No transport timing, persistence, cryptographic verification, or full protocol implementation is claimed.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
Dead-letter transfer loses the original message identity	`true`	`false`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.