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
Linearized growth retains the displaced read cursor · case 01
Linearized growth retains the displaced read cursor.
Linearized growth retains the displaced read cursor · case 02
Linearized growth retains the displaced read cursor.
Linearized growth retains the displaced read cursor · case 03
Linearized growth retains the displaced read cursor.
Linearized growth retains the displaced read cursor · case 04
Linearized growth retains the displaced read cursor.
Linearized growth retains the displaced read cursor · case 05
Linearized growth retains the displaced read cursor.
Growth writes the next element at old capacity · case 01
Growth writes the next element at old capacity.
Growth writes the next element at old capacity · case 02
Growth writes the next element at old capacity.
Growth writes the next element at old capacity · case 03
Growth writes the next element at old capacity.
Growth writes the next element at old capacity · case 04
Growth writes the next element at old capacity.
Growth writes the next element at old capacity · case 05
Growth writes the next element at old capacity.
Growth exposes backing capacity as live length · case 01
Growth exposes backing capacity as live length.
Growth exposes backing capacity as live length · case 02
Growth exposes backing capacity as live length.
Growth exposes backing capacity as live length · case 03
Growth exposes backing capacity as live length.
Growth exposes backing capacity as live length · case 04
Growth exposes backing capacity as live length.
Growth exposes backing capacity as live length · case 05
Growth exposes backing capacity as live length.
Shrink uses new capacity as the eviction count · case 01
Shrink uses new capacity as the eviction count.
Shrink uses new capacity as the eviction count · case 02
Shrink uses new capacity as the eviction count.
Shrink uses new capacity as the eviction count · case 03
Shrink uses new capacity as the eviction count.
Shrink uses new capacity as the eviction count · case 04
Shrink uses new capacity as the eviction count.
Shrink uses new capacity as the eviction count · case 05
Shrink uses new capacity as the eviction count.
Shrink reports evicted objects in reverse release order · case 01
Shrink reports evicted objects in reverse release order.
Shrink reports evicted objects in reverse release order · case 02
Shrink reports evicted objects in reverse release order.
Shrink reports evicted objects in reverse release order · case 03
Shrink reports evicted objects in reverse release order.
Shrink reports evicted objects in reverse release order · case 04
Shrink reports evicted objects in reverse release order.
Shrink reports evicted objects in reverse release order · case 05
Shrink reports evicted objects in reverse release order.
Shrink keeps stale evicted references in free slots · case 01
Shrink keeps stale evicted references in free slots.
Shrink keeps stale evicted references in free slots · case 02
Shrink keeps stale evicted references in free slots.
Shrink keeps stale evicted references in free slots · case 03
Shrink keeps stale evicted references in free slots.
Shrink keeps stale evicted references in free slots · case 04
Shrink keeps stale evicted references in free slots.
Shrink keeps stale evicted references in free slots · case 05
Shrink keeps stale evicted references in free slots.
Shrink decrements available capacity by pre-shrink occupancy · case 01
Shrink decrements available capacity by pre-shrink occupancy.
Shrink decrements available capacity by pre-shrink occupancy · case 02
Shrink decrements available capacity by pre-shrink occupancy.
Shrink decrements available capacity by pre-shrink occupancy · case 03
Shrink decrements available capacity by pre-shrink occupancy.
Shrink decrements available capacity by pre-shrink occupancy · case 04
Shrink decrements available capacity by pre-shrink occupancy.
Shrink decrements available capacity by pre-shrink occupancy · case 05
Shrink decrements available capacity by pre-shrink occupancy.
Unlink leaves the predecessor pointing at the detached node · case 01
Unlink leaves the predecessor pointing at the detached node.
Unlink leaves the predecessor pointing at the detached node · case 02
Unlink leaves the predecessor pointing at the detached node.
Unlink leaves the predecessor pointing at the detached node · case 03
Unlink leaves the predecessor pointing at the detached node.
Unlink leaves the predecessor pointing at the detached node · case 04
Unlink leaves the predecessor pointing at the detached node.
Unlink leaves the predecessor pointing at the detached node · case 05
Unlink leaves the predecessor pointing at the detached node.
Unlink leaves a successor back-link pointing to the detached node · case 01
Unlink leaves a successor back-link pointing to the detached node.
Unlink leaves a successor back-link pointing to the detached node · case 02
Unlink leaves a successor back-link pointing to the detached node.
Unlink leaves a successor back-link pointing to the detached node · case 03
Unlink leaves a successor back-link pointing to the detached node.
Unlink leaves a successor back-link pointing to the detached node · case 04
Unlink leaves a successor back-link pointing to the detached node.
Unlink leaves a successor back-link pointing to the detached node · case 05
Unlink leaves a successor back-link pointing to the detached node.
Unlink retains links on the removed intrusive node · case 01
Unlink retains links on the removed intrusive node.
Unlink retains links on the removed intrusive node · case 02
Unlink retains links on the removed intrusive node.
Unlink retains links on the removed intrusive node · case 03
Unlink retains links on the removed intrusive node.
Unlink retains links on the removed intrusive node · case 04
Unlink retains links on the removed intrusive node.
Unlink retains links on the removed intrusive node · case 05
Unlink retains links on the removed intrusive node.
Unlink decrements size by both incident edges · case 01
Unlink decrements size by both incident edges.
Unlink decrements size by both incident edges · case 02
Unlink decrements size by both incident edges.
Unlink decrements size by both incident edges · case 03
Unlink decrements size by both incident edges.
Unlink decrements size by both incident edges · case 04
Unlink decrements size by both incident edges.
Unlink decrements size by both incident edges · case 05
Unlink decrements size by both incident edges.
Reverse traversal starts from the sentinel next link · case 01
Reverse traversal starts from the sentinel next link.
Reverse traversal starts from the sentinel next link · case 02
Reverse traversal starts from the sentinel next link.
Reverse traversal starts from the sentinel next link · case 03
Reverse traversal starts from the sentinel next link.
Reverse traversal starts from the sentinel next link · case 04
Reverse traversal starts from the sentinel next link.
Reverse traversal starts from the sentinel next link · case 05
Reverse traversal starts from the sentinel next link.
Cursor erase drops the successor along with its target · case 01
Cursor erase drops the successor along with its target.
Cursor erase drops the successor along with its target · case 02
Cursor erase drops the successor along with its target.
Cursor erase drops the successor along with its target · case 03
Cursor erase drops the successor along with its target.
Cursor erase drops the successor along with its target · case 04
Cursor erase drops the successor along with its target.
Cursor erase drops the successor along with its target · case 05
Cursor erase drops the successor along with its target.
End cursor is rebound to the first element after erase · case 01
End cursor is rebound to the first element after erase.
End cursor is rebound to the first element after erase · case 02
End cursor is rebound to the first element after erase.
End cursor is rebound to the first element after erase · case 03
End cursor is rebound to the first element after erase.
End cursor is rebound to the first element after erase · case 04
End cursor is rebound to the first element after erase.
End cursor is rebound to the first element after erase · case 05
End cursor is rebound to the first element after erase.
Erase shifts cursors that precede the erased position · case 01
Erase shifts cursors that precede the erased position.
Erase shifts cursors that precede the erased position · case 02
Erase shifts cursors that precede the erased position.
Erase shifts cursors that precede the erased position · case 03
Erase shifts cursors that precede the erased position.
Erase shifts cursors that precede the erased position · case 04
Erase shifts cursors that precede the erased position.
Erase shifts cursors that precede the erased position · case 05
Erase shifts cursors that precede the erased position.
Cursor on an erased interior node becomes end · case 01
Cursor on an erased interior node becomes end.
Cursor on an erased interior node becomes end · case 02
Cursor on an erased interior node becomes end.
Cursor on an erased interior node becomes end · case 03
Cursor on an erased interior node becomes end.
Cursor on an erased interior node becomes end · case 04
Cursor on an erased interior node becomes end.
Cursor on an erased interior node becomes end · case 05
Cursor on an erased interior node becomes end.
Cursor after an erased node retains its old index · case 01
Cursor after an erased node retains its old index.
Cursor after an erased node retains its old index · case 02
Cursor after an erased node retains its old index.
Cursor after an erased node retains its old index · case 03
Cursor after an erased node retains its old index.
Cursor after an erased node retains its old index · case 04
Cursor after an erased node retains its old index.
Cursor after an erased node retains its old index · case 05
Cursor after an erased node retains its old index.
Deque directory uses each block length as an absolute end · case 01
Deque directory uses each block length as an absolute end.
Deque directory uses each block length as an absolute end · case 02
Deque directory uses each block length as an absolute end.
Deque directory uses each block length as an absolute end · case 03
Deque directory uses each block length as an absolute end.
Deque directory uses each block length as an absolute end · case 04
Deque directory uses each block length as an absolute end.
Deque directory uses each block length as an absolute end · case 05
Deque directory uses each block length as an absolute end.
Directory subtracts the current block end from its logical index · case 01
Directory subtracts the current block end from its logical index.
Directory subtracts the current block end from its logical index · case 02
Directory subtracts the current block end from its logical index.
Directory subtracts the current block end from its logical index · case 03
Directory subtracts the current block end from its logical index.
Directory subtracts the current block end from its logical index · case 04
Directory subtracts the current block end from its logical index.
Directory subtracts the current block end from its logical index · case 05
Directory subtracts the current block end from its logical index.
Directory measures an index from the global origin · case 01
Directory measures an index from the global origin.
Directory measures an index from the global origin · case 02
Directory measures an index from the global origin.
Directory measures an index from the global origin · case 03
Directory measures an index from the global origin.
Directory measures an index from the global origin · case 04
Directory measures an index from the global origin.
Directory measures an index from the global origin · case 05
Directory measures an index from the global origin.
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 ↗