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
Block lookup treats logical head as having a wrapped predecessor · case 01
Block lookup treats logical head as having a wrapped predecessor.
Block lookup treats logical head as having a wrapped predecessor · case 02
Block lookup treats logical head as having a wrapped predecessor.
Block lookup treats logical head as having a wrapped predecessor · case 03
Block lookup treats logical head as having a wrapped predecessor.
Block lookup treats logical head as having a wrapped predecessor · case 04
Block lookup treats logical head as having a wrapped predecessor.
Block lookup treats logical head as having a wrapped predecessor · case 05
Block lookup treats logical head as having a wrapped predecessor.
Block lookup omits the final valid successor · case 01
Block lookup omits the final valid successor.
Block lookup omits the final valid successor · case 02
Block lookup omits the final valid successor.
Block lookup omits the final valid successor · case 03
Block lookup omits the final valid successor.
Block lookup omits the final valid successor · case 04
Block lookup omits the final valid successor.
Block lookup omits the final valid successor · case 05
Block lookup omits the final valid successor.
Cross-splice includes the exclusive slice endpoint · case 01
Cross-splice includes the exclusive slice endpoint.
Cross-splice includes the exclusive slice endpoint · case 02
Cross-splice includes the exclusive slice endpoint.
Cross-splice includes the exclusive slice endpoint · case 03
Cross-splice includes the exclusive slice endpoint.
Cross-splice includes the exclusive slice endpoint · case 04
Cross-splice includes the exclusive slice endpoint.
Cross-splice includes the exclusive slice endpoint · case 05
Cross-splice includes the exclusive slice endpoint.
Cross-splice checks the incoming range without resident occupancy · case 01
Cross-splice checks the incoming range without resident occupancy.
Cross-splice checks the incoming range without resident occupancy · case 02
Cross-splice checks the incoming range without resident occupancy.
Cross-splice checks the incoming range without resident occupancy · case 03
Cross-splice checks the incoming range without resident occupancy.
Cross-splice checks the incoming range without resident occupancy · case 04
Cross-splice checks the incoming range without resident occupancy.
Cross-splice checks the incoming range without resident occupancy · case 05
Cross-splice checks the incoming range without resident occupancy.
Cross-splice copies nodes without unlinking the source range · case 01
Cross-splice copies nodes without unlinking the source range.
Cross-splice copies nodes without unlinking the source range · case 02
Cross-splice copies nodes without unlinking the source range.
Cross-splice copies nodes without unlinking the source range · case 03
Cross-splice copies nodes without unlinking the source range.
Cross-splice copies nodes without unlinking the source range · case 04
Cross-splice copies nodes without unlinking the source range.
Cross-splice copies nodes without unlinking the source range · case 05
Cross-splice copies nodes without unlinking the source range.
Cross-splice inserts after the designated gap · case 01
Cross-splice inserts after the designated gap.
Cross-splice inserts after the designated gap · case 02
Cross-splice inserts after the designated gap.
Cross-splice inserts after the designated gap · case 03
Cross-splice inserts after the designated gap.
Cross-splice inserts after the designated gap · case 04
Cross-splice inserts after the designated gap.
Cross-splice inserts after the designated gap · case 05
Cross-splice inserts after the designated gap.
Cross-splice reports source length as transferred length · case 01
Cross-splice reports source length as transferred length.
Cross-splice reports source length as transferred length · case 02
Cross-splice reports source length as transferred length.
Cross-splice reports source length as transferred length · case 03
Cross-splice reports source length as transferred length.
Cross-splice reports source length as transferred length · case 04
Cross-splice reports source length as transferred length.
Cross-splice reports source length as transferred length · case 05
Cross-splice reports source length as transferred length.
Self-splice reorders a destination gap inside its source · case 01
Self-splice reorders a destination gap inside its source.
Self-splice reorders a destination gap inside its source · case 02
Self-splice reorders a destination gap inside its source.
Self-splice reorders a destination gap inside its source · case 03
Self-splice reorders a destination gap inside its source.
Self-splice reorders a destination gap inside its source · case 04
Self-splice reorders a destination gap inside its source.
Self-splice reorders a destination gap inside its source · case 05
Self-splice reorders a destination gap inside its source.
Self-splice extracts the range from its successor boundary · case 01
Self-splice extracts the range from its successor boundary.
Self-splice extracts the range from its successor boundary · case 02
Self-splice extracts the range from its successor boundary.
Self-splice extracts the range from its successor boundary · case 03
Self-splice extracts the range from its successor boundary.
Self-splice extracts the range from its successor boundary · case 04
Self-splice extracts the range from its successor boundary.
Self-splice extracts the range from its successor boundary · case 05
Self-splice extracts the range from its successor boundary.
Self-splice retains the final moved node in its old location · case 01
Self-splice retains the final moved node in its old location.
Self-splice retains the final moved node in its old location · case 02
Self-splice retains the final moved node in its old location.
Self-splice retains the final moved node in its old location · case 03
Self-splice retains the final moved node in its old location.
Self-splice retains the final moved node in its old location · case 04
Self-splice retains the final moved node in its old location.
Self-splice retains the final moved node in its old location · case 05
Self-splice retains the final moved node in its old location.
Self-splice forgets destination displacement caused by removal · case 01
Self-splice forgets destination displacement caused by removal.
Self-splice forgets destination displacement caused by removal · case 02
Self-splice forgets destination displacement caused by removal.
Self-splice forgets destination displacement caused by removal · case 03
Self-splice forgets destination displacement caused by removal.
Self-splice forgets destination displacement caused by removal · case 04
Self-splice forgets destination displacement caused by removal.
Self-splice forgets destination displacement caused by removal · case 05
Self-splice forgets destination displacement caused by removal.
Self-splice reverses the moved block · case 01
Self-splice reverses the moved block.
Self-splice reverses the moved block · case 02
Self-splice reverses the moved block.
Self-splice reverses the moved block · case 03
Self-splice reverses the moved block.
Self-splice reverses the moved block · case 04
Self-splice reverses the moved block.
Self-splice reverses the moved block · case 05
Self-splice reverses the moved block.
Deque partition deduplicates accepted elements · case 01
Deque partition deduplicates accepted elements.
Deque partition deduplicates accepted elements · case 02
Deque partition deduplicates accepted elements.
Deque partition deduplicates accepted elements · case 03
Deque partition deduplicates accepted elements.
Deque partition deduplicates accepted elements · case 04
Deque partition deduplicates accepted elements.
Deque partition deduplicates accepted elements · case 05
Deque partition deduplicates accepted elements.
Deque partition gathers rejected elements backwards · case 01
Deque partition gathers rejected elements backwards.
Deque partition gathers rejected elements backwards · case 02
Deque partition gathers rejected elements backwards.
Deque partition gathers rejected elements backwards · case 03
Deque partition gathers rejected elements backwards.
Deque partition gathers rejected elements backwards · case 04
Deque partition gathers rejected elements backwards.
Deque partition gathers rejected elements backwards · case 05
Deque partition gathers rejected elements backwards.
Deque partition puts rejected values before accepted values · case 01
Deque partition puts rejected values before accepted values.
Deque partition puts rejected values before accepted values · case 02
Deque partition puts rejected values before accepted values.
Deque partition puts rejected values before accepted values · case 03
Deque partition puts rejected values before accepted values.
Deque partition puts rejected values before accepted values · case 04
Deque partition puts rejected values before accepted values.
Deque partition puts rejected values before accepted values · case 05
Deque partition puts rejected values before accepted values.
Deque partition sets its boundary to the rejected count · case 01
Deque partition sets its boundary to the rejected count.
Deque partition sets its boundary to the rejected count · case 02
Deque partition sets its boundary to the rejected count.
Deque partition sets its boundary to the rejected count · case 03
Deque partition sets its boundary to the rejected count.
Deque partition sets its boundary to the rejected count · case 04
Deque partition sets its boundary to the rejected count.
Deque partition sets its boundary to the rejected count · case 05
Deque partition sets its boundary to the rejected count.
Partition returns the pre-partition deque as its rejected view · case 01
Partition returns the pre-partition deque as its rejected view.
Partition returns the pre-partition deque as its rejected view · case 02
Partition returns the pre-partition deque as its rejected view.
Partition returns the pre-partition deque as its rejected view · case 03
Partition returns the pre-partition deque as its rejected view.
Partition returns the pre-partition deque as its rejected view · case 04
Partition returns the pre-partition deque as its rejected view.
Partition returns the pre-partition deque as its rejected view · case 05
Partition returns the pre-partition deque as its rejected view.
Deque coalescing compares the first run instead of the last · case 01
Deque coalescing compares the first run instead of the last.
Deque coalescing compares the first run instead of the last · case 02
Deque coalescing compares the first run instead of the last.
Deque coalescing compares the first run instead of the last · case 03
Deque coalescing compares the first run instead of the last.
Deque coalescing compares the first run instead of the last · case 04
Deque coalescing compares the first run instead of the last.
Deque coalescing compares the first run instead of the last · case 05
Deque coalescing compares the first run instead of the last.
Deque coalescing replaces a repeated run length with one · case 01
Deque coalescing replaces a repeated run length with one.
Deque coalescing replaces a repeated run length with one · case 02
Deque coalescing replaces a repeated run length with one.
Deque coalescing replaces a repeated run length with one · case 03
Deque coalescing replaces a repeated run length with one.
Deque coalescing replaces a repeated run length with one · case 04
Deque coalescing replaces a repeated run length with one.
Deque coalescing replaces a repeated run length with one · case 05
Deque coalescing replaces a repeated run length with one.
Deque coalescing starts fresh runs at zero · case 01
Deque coalescing starts fresh runs at zero.
Deque coalescing starts fresh runs at zero · case 02
Deque coalescing starts fresh runs at zero.
Deque coalescing starts fresh runs at zero · case 03
Deque coalescing starts fresh runs at zero.
Deque coalescing starts fresh runs at zero · case 04
Deque coalescing starts fresh runs at zero.
Deque coalescing starts fresh runs at zero · case 05
Deque coalescing starts fresh runs at zero.
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 ↗