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
Reverse bookmark mapping includes the exclusive stop · case 01
Reverse bookmark mapping includes the exclusive stop.
Reverse bookmark mapping includes the exclusive stop · case 02
Reverse bookmark mapping includes the exclusive stop.
Reverse bookmark mapping includes the exclusive stop · case 03
Reverse bookmark mapping includes the exclusive stop.
Reverse bookmark mapping includes the exclusive stop · case 04
Reverse bookmark mapping includes the exclusive stop.
Reverse bookmark mapping includes the exclusive stop · case 05
Reverse bookmark mapping includes the exclusive stop.
Reverse returns bookmark mappings in new traversal order · case 01
Reverse returns bookmark mappings in new traversal order.
Reverse returns bookmark mappings in new traversal order · case 02
Reverse returns bookmark mappings in new traversal order.
Reverse returns bookmark mappings in new traversal order · case 03
Reverse returns bookmark mappings in new traversal order.
Reverse returns bookmark mappings in new traversal order · case 04
Reverse returns bookmark mappings in new traversal order.
Reverse returns bookmark mappings in new traversal order · case 05
Reverse returns bookmark mappings in new traversal order.
Deque reorder accepts duplicated indices as a permutation · case 01
Deque reorder accepts duplicated indices as a permutation.
Deque reorder accepts duplicated indices as a permutation · case 02
Deque reorder accepts duplicated indices as a permutation.
Deque reorder accepts duplicated indices as a permutation · case 03
Deque reorder accepts duplicated indices as a permutation.
Deque reorder accepts duplicated indices as a permutation · case 04
Deque reorder accepts duplicated indices as a permutation.
Deque reorder accepts duplicated indices as a permutation · case 05
Deque reorder accepts duplicated indices as a permutation.
Deque reorder sorts its supplied permutation before applying it · case 01
Deque reorder sorts its supplied permutation before applying it.
Deque reorder sorts its supplied permutation before applying it · case 02
Deque reorder sorts its supplied permutation before applying it.
Deque reorder sorts its supplied permutation before applying it · case 03
Deque reorder sorts its supplied permutation before applying it.
Deque reorder sorts its supplied permutation before applying it · case 04
Deque reorder sorts its supplied permutation before applying it.
Deque reorder sorts its supplied permutation before applying it · case 05
Deque reorder sorts its supplied permutation before applying it.
Bookmark reorder writes the forward permutation as its inverse · case 01
Bookmark reorder writes the forward permutation as its inverse.
Bookmark reorder writes the forward permutation as its inverse · case 02
Bookmark reorder writes the forward permutation as its inverse.
Bookmark reorder writes the forward permutation as its inverse · case 03
Bookmark reorder writes the forward permutation as its inverse.
Bookmark reorder writes the forward permutation as its inverse · case 04
Bookmark reorder writes the forward permutation as its inverse.
Bookmark reorder writes the forward permutation as its inverse · case 05
Bookmark reorder writes the forward permutation as its inverse.
Bookmark reorder allocates one extra inverse entry · case 01
Bookmark reorder allocates one extra inverse entry.
Bookmark reorder allocates one extra inverse entry · case 02
Bookmark reorder allocates one extra inverse entry.
Bookmark reorder allocates one extra inverse entry · case 03
Bookmark reorder allocates one extra inverse entry.
Bookmark reorder allocates one extra inverse entry · case 04
Bookmark reorder allocates one extra inverse entry.
Bookmark reorder allocates one extra inverse entry · case 05
Bookmark reorder allocates one extra inverse entry.
Rejected deque reorder clears the original data · case 01
Rejected deque reorder clears the original data.
Rejected deque reorder clears the original data · case 02
Rejected deque reorder clears the original data.
Rejected deque reorder clears the original data · case 03
Rejected deque reorder clears the original data.
Rejected deque reorder clears the original data · case 04
Rejected deque reorder clears the original data.
Rejected deque reorder clears the original data · case 05
Rejected deque reorder clears the original data.
Deque uniqueness clears seen identities after each item · case 01
Deque uniqueness clears seen identities after each item.
Deque uniqueness clears seen identities after each item · case 02
Deque uniqueness clears seen identities after each item.
Deque uniqueness clears seen identities after each item · case 03
Deque uniqueness clears seen identities after each item.
Deque uniqueness clears seen identities after each item · case 04
Deque uniqueness clears seen identities after each item.
Deque uniqueness clears seen identities after each item · case 05
Deque uniqueness clears seen identities after each item.
Deque uniqueness reports duplicate values instead of removed positions · case 01
Deque uniqueness reports duplicate values instead of removed positions.
Deque uniqueness reports duplicate values instead of removed positions · case 02
Deque uniqueness reports duplicate values instead of removed positions.
Deque uniqueness reports duplicate values instead of removed positions · case 03
Deque uniqueness reports duplicate values instead of removed positions.
Deque uniqueness reports duplicate values instead of removed positions · case 04
Deque uniqueness reports duplicate values instead of removed positions.
Deque uniqueness reports duplicate values instead of removed positions · case 05
Deque uniqueness reports duplicate values instead of removed positions.
Deque uniqueness prepends each first occurrence · case 01
Deque uniqueness prepends each first occurrence.
Deque uniqueness prepends each first occurrence · case 02
Deque uniqueness prepends each first occurrence.
Deque uniqueness prepends each first occurrence · case 03
Deque uniqueness prepends each first occurrence.
Deque uniqueness prepends each first occurrence · case 04
Deque uniqueness prepends each first occurrence.
Deque uniqueness prepends each first occurrence · case 05
Deque uniqueness prepends each first occurrence.
Deque uniqueness treats zero as never seen · case 01
Deque uniqueness treats zero as never seen.
Deque uniqueness treats zero as never seen · case 02
Deque uniqueness treats zero as never seen.
Deque uniqueness treats zero as never seen · case 03
Deque uniqueness treats zero as never seen.
Deque uniqueness treats zero as never seen · case 04
Deque uniqueness treats zero as never seen.
Deque uniqueness treats zero as never seen · case 05
Deque uniqueness treats zero as never seen.
Deque uniqueness accidentally returns duplicate positions as survivors · case 01
Deque uniqueness accidentally returns duplicate positions as survivors.
Deque uniqueness accidentally returns duplicate positions as survivors · case 02
Deque uniqueness accidentally returns duplicate positions as survivors.
Deque uniqueness accidentally returns duplicate positions as survivors · case 03
Deque uniqueness accidentally returns duplicate positions as survivors.
Deque uniqueness accidentally returns duplicate positions as survivors · case 04
Deque uniqueness accidentally returns duplicate positions as survivors.
Deque uniqueness accidentally returns duplicate positions as survivors · case 05
Deque uniqueness accidentally returns duplicate positions as survivors.
Block split leaves the boundary value in both blocks · case 01
Block split leaves the boundary value in both blocks.
Block split leaves the boundary value in both blocks · case 02
Block split leaves the boundary value in both blocks.
Block split leaves the boundary value in both blocks · case 03
Block split leaves the boundary value in both blocks.
Block split leaves the boundary value in both blocks · case 04
Block split leaves the boundary value in both blocks.
Block split leaves the boundary value in both blocks · case 05
Block split leaves the boundary value in both blocks.
Block split omits its first right-side value · case 01
Block split omits its first right-side value.
Block split omits its first right-side value · case 02
Block split omits its first right-side value.
Block split omits its first right-side value · case 03
Block split omits its first right-side value.
Block split omits its first right-side value · case 04
Block split omits its first right-side value.
Block split omits its first right-side value · case 05
Block split omits its first right-side value.
Block split renames the block still held by existing handles · case 01
Block split renames the block still held by existing handles.
Block split renames the block still held by existing handles · case 02
Block split renames the block still held by existing handles.
Block split renames the block still held by existing handles · case 03
Block split renames the block still held by existing handles.
Block split renames the block still held by existing handles · case 04
Block split renames the block still held by existing handles.
Block split renames the block still held by existing handles · case 05
Block split renames the block still held by existing handles.
Block split aliases both halves to the same block identity · case 01
Block split aliases both halves to the same block identity.
Block split aliases both halves to the same block identity · case 02
Block split aliases both halves to the same block identity.
Block split aliases both halves to the same block identity · case 03
Block split aliases both halves to the same block identity.
Block split aliases both halves to the same block identity · case 04
Block split aliases both halves to the same block identity.
Block split aliases both halves to the same block identity · case 05
Block split aliases both halves to the same block identity.
Block split leaves directory cache generation unchanged · case 01
Block split leaves directory cache generation unchanged.
Block split leaves directory cache generation unchanged · case 02
Block split leaves directory cache generation unchanged.
Block split leaves directory cache generation unchanged · case 03
Block split leaves directory cache generation unchanged.
Block split leaves directory cache generation unchanged · case 04
Block split leaves directory cache generation unchanged.
Block split leaves directory cache generation unchanged · case 05
Block split leaves directory cache generation unchanged.
Block split counts block descriptors as logical entries · case 01
Block split counts block descriptors as logical entries.
Block split counts block descriptors as logical entries · case 02
Block split counts block descriptors as logical entries.
Block split counts block descriptors as logical entries · case 03
Block split counts block descriptors as logical entries.
Block split counts block descriptors as logical entries · case 04
Block split counts block descriptors as logical entries.
Block split counts block descriptors as logical entries · case 05
Block split counts block descriptors as logical entries.
Block split publishes its right block before its left block · case 01
Block split publishes its right block before its left block.
Block split publishes its right block before its left block · case 02
Block split publishes its right block before its left block.
Block split publishes its right block before its left block · case 03
Block split publishes its right block before its left block.
Block split publishes its right block before its left block · case 04
Block split publishes its right block before its left block.
Block split publishes its right block before its left block · case 05
Block split publishes its right block before its left block.
Adjacent block merge ignores left block occupancy · case 01
Adjacent block merge ignores left block occupancy.
Adjacent block merge ignores left block occupancy · case 02
Adjacent block merge ignores left block occupancy.
Adjacent block merge ignores left block occupancy · case 03
Adjacent block merge ignores left block occupancy.
Adjacent block merge ignores left block occupancy · case 04
Adjacent block merge ignores left block occupancy.
Adjacent block merge ignores left block occupancy · case 05
Adjacent block merge ignores left block occupancy.
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 ↗