Understand the failure.
Verify the repair.
Small, reproducible software failures. The broken implementation, the fix that didn’t work, and the one that passed—preserved together.
Explore the cases ↓How results are verified ↗WHAT THE ARCHIVE CONTAINS
100840 executable cases. 20168 are open.
Every case records the implementation that fails, the fix that did not work, and the repair that passed its checks—with recorded outputs and source hashes. This release adds 100840 cases across 20168 failure mechanisms and 254 domains.
The open tier gives you the failure and the unsuccessful fix for one case in every mechanism. The remaining 80672 cases, 5 variants per mechanism, are member-only: the verified repair, its recorded checks, and the full fixture suite are held in the member archive. Read the methodology ↗
A RECORD OF WHAT WENT WRONG
Browse the archive / 100840
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order · case 01
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order.
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order · case 02
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order.
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order · case 03
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order.
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order · case 04
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order.
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order · case 05
A packed-object origin maps logical byte requests to immutable backing objects: out-of-order ranges retain their requested byte order.
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload · case 01
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload.
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload · case 02
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload.
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload · case 03
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload.
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload · case 04
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload.
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload · case 05
A packed-object origin maps logical byte requests to immutable backing objects: a hole cannot be silently dropped from a requested payload.
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes · case 01
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes.
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes · case 02
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes.
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes · case 03
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes.
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes · case 04
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes.
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes · case 05
A packed-object origin maps logical byte requests to immutable backing objects: overlapping extent ownership is rejected even for identical bytes.
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles · case 01
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles.
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles · case 02
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles.
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles · case 03
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles.
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles · case 04
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles.
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles · case 05
A packed-object origin maps logical byte requests to immutable backing objects: zero-length map entries do not dereference backing handles.
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions · case 01
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions.
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions · case 02
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions.
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions · case 03
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions.
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions · case 04
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions.
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions · case 05
A packed-object origin maps logical byte requests to immutable backing objects: negative logical mappings cannot create valid object positions.
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets · case 01
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets.
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets · case 02
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets.
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets · case 03
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets.
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets · case 04
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets.
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets · case 05
A packed-object origin maps logical byte requests to immutable backing objects: Python negative indices cannot stand in for physical object offsets.
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans · case 01
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans.
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans · case 02
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans.
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans · case 03
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans.
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans · case 04
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans.
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans · case 05
A packed-object origin maps logical byte requests to immutable backing objects: negative mapped counts are invalid rather than empty spans.
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists · case 01
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists.
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists · case 02
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists.
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists · case 03
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists.
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists · case 04
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists.
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists · case 05
A packed-object origin maps logical byte requests to immutable backing objects: a short backing object invalidates even a requested prefix that exists.
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer · case 01
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer.
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer · case 02
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer.
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer · case 03
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer.
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer · case 04
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer.
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer · case 05
Partial cache admission publishes complete requested fragments atomically: a second range admission cannot replace an active writer.
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission · case 01
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission.
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission · case 02
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission.
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission · case 03
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission.
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission · case 04
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission.
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission · case 05
Partial cache admission publishes complete requested fragments atomically: a stale subrequest cannot contribute to a different admission.
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells · case 01
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells.
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells · case 02
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells.
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells · case 03
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells.
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells · case 04
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells.
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells · case 05
Partial cache admission publishes complete requested fragments atomically: unexpected origin bytes do not count as admitted requested cells.
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission · case 01
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission.
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission · case 02
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission.
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission · case 03
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission.
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission · case 04
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission.
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission · case 05
Partial cache admission publishes complete requested fragments atomically: a contradicting duplicate fragment invalidates admission.
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission · case 01
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission.
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission · case 02
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission.
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission · case 03
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission.
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission · case 04
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission.
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission · case 05
Partial cache admission publishes complete requested fragments atomically: a completion signal must belong to the active range admission.
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived · case 01
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived.
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived · case 02
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived.
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived · case 03
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived.
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived · case 04
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived.
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived · case 05
Partial cache admission publishes complete requested fragments atomically: a prefix does not prove every promised range cell arrived.
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object · case 01
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object.
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object · case 02
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object.
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object · case 03
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object.
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object · case 04
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object.
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object · case 05
Partial cache admission publishes complete requested fragments atomically: commit removes old-generation cells outside the new sparse object.
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot · case 01
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot.
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot · case 02
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot.
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot · case 03
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot.
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot · case 04
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot.
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot · case 05
Partial cache admission publishes complete requested fragments atomically: successful admission releases the active transaction slot.
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission · case 01
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission.
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission · case 02
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission.
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission · case 03
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission.
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission · case 04
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission.
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission · case 05
Partial cache admission publishes complete requested fragments atomically: an old subrequest abort cannot cancel a newer admission.
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation · case 01
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation.
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation · case 02
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation.
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation · case 03
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation.
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation · case 04
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation.
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation · case 05
Partial cache admission publishes complete requested fragments atomically: readers do not see an incomplete staged range generation.
A client serializes a typed range request plan: closed selectors preserve both endpoints · case 01
A client serializes a typed range request plan: closed selectors preserve both endpoints.
A client serializes a typed range request plan: closed selectors preserve both endpoints · case 02
A client serializes a typed range request plan: closed selectors preserve both endpoints.
A client serializes a typed range request plan: closed selectors preserve both endpoints · case 03
A client serializes a typed range request plan: closed selectors preserve both endpoints.
A client serializes a typed range request plan: closed selectors preserve both endpoints · case 04
A client serializes a typed range request plan: closed selectors preserve both endpoints.
A client serializes a typed range request plan: closed selectors preserve both endpoints · case 05
A client serializes a typed range request plan: closed selectors preserve both endpoints.
A client serializes a typed range request plan: open selectors keep an empty final component · case 01
A client serializes a typed range request plan: open selectors keep an empty final component.
A client serializes a typed range request plan: open selectors keep an empty final component · case 02
A client serializes a typed range request plan: open selectors keep an empty final component.
A client serializes a typed range request plan: open selectors keep an empty final component · case 03
A client serializes a typed range request plan: open selectors keep an empty final component.
A client serializes a typed range request plan: open selectors keep an empty final component · case 04
A client serializes a typed range request plan: open selectors keep an empty final component.
A client serializes a typed range request plan: open selectors keep an empty final component · case 05
A client serializes a typed range request plan: open selectors keep an empty final component.
INSPECTABLE BY DESIGN
Every result has a runnable source.
Runnable implementations with recorded outputs, source hashes, and explicit contracts. Related variants share a failure mechanism and belong together in evaluation splits.
Read the methodology ↗