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
Deque range swap returns destination length as source length · case 01
Deque range swap returns destination length as source length.
Deque range swap returns destination length as source length · case 02
Deque range swap returns destination length as source length.
Deque range swap returns destination length as source length · case 03
Deque range swap returns destination length as source length.
Deque range swap returns destination length as source length · case 04
Deque range swap returns destination length as source length.
Deque range swap returns destination length as source length · case 05
Deque range swap returns destination length as source length.
Sorted deque insertion places new ties before existing ties · case 01
Sorted deque insertion places new ties before existing ties.
Sorted deque insertion places new ties before existing ties · case 02
Sorted deque insertion places new ties before existing ties.
Sorted deque insertion places new ties before existing ties · case 03
Sorted deque insertion places new ties before existing ties.
Sorted deque insertion places new ties before existing ties · case 04
Sorted deque insertion places new ties before existing ties.
Sorted deque insertion places new ties before existing ties · case 05
Sorted deque insertion places new ties before existing ties.
Sorted deque insertion places a new maximum before the old maximum · case 01
Sorted deque insertion places a new maximum before the old maximum.
Sorted deque insertion places a new maximum before the old maximum · case 02
Sorted deque insertion places a new maximum before the old maximum.
Sorted deque insertion places a new maximum before the old maximum · case 03
Sorted deque insertion places a new maximum before the old maximum.
Sorted deque insertion places a new maximum before the old maximum · case 04
Sorted deque insertion places a new maximum before the old maximum.
Sorted deque insertion places a new maximum before the old maximum · case 05
Sorted deque insertion places a new maximum before the old maximum.
Sorted deque insertion stores only the key and loses payload · case 01
Sorted deque insertion stores only the key and loses payload.
Sorted deque insertion stores only the key and loses payload · case 02
Sorted deque insertion stores only the key and loses payload.
Sorted deque insertion stores only the key and loses payload · case 03
Sorted deque insertion stores only the key and loses payload.
Sorted deque insertion stores only the key and loses payload · case 04
Sorted deque insertion stores only the key and loses payload.
Sorted deque insertion stores only the key and loses payload · case 05
Sorted deque insertion stores only the key and loses payload.
Sorted deque insertion overwrites the first greater element · case 01
Sorted deque insertion overwrites the first greater element.
Sorted deque insertion overwrites the first greater element · case 02
Sorted deque insertion overwrites the first greater element.
Sorted deque insertion overwrites the first greater element · case 03
Sorted deque insertion overwrites the first greater element.
Sorted deque insertion overwrites the first greater element · case 04
Sorted deque insertion overwrites the first greater element.
Sorted deque insertion overwrites the first greater element · case 05
Sorted deque insertion overwrites the first greater element.
Sorted deque insertion reports prefix length as shifted length · case 01
Sorted deque insertion reports prefix length as shifted length.
Sorted deque insertion reports prefix length as shifted length · case 02
Sorted deque insertion reports prefix length as shifted length.
Sorted deque insertion reports prefix length as shifted length · case 03
Sorted deque insertion reports prefix length as shifted length.
Sorted deque insertion reports prefix length as shifted length · case 04
Sorted deque insertion reports prefix length as shifted length.
Sorted deque insertion reports prefix length as shifted length · case 05
Sorted deque insertion reports prefix length as shifted length.
New deque reservation records all free slots instead of its granted request · case 01
New deque reservation records all free slots instead of its granted request.
New deque reservation records all free slots instead of its granted request · case 02
New deque reservation records all free slots instead of its granted request.
New deque reservation records all free slots instead of its granted request · case 03
New deque reservation records all free slots instead of its granted request.
New deque reservation records all free slots instead of its granted request · case 04
New deque reservation records all free slots instead of its granted request.
New deque reservation records all free slots instead of its granted request · case 05
New deque reservation records all free slots instead of its granted request.
Deque reservation commit accepts a negative initialized prefix length · case 01
Deque reservation commit accepts a negative initialized prefix length.
Deque reservation commit accepts a negative initialized prefix length · case 02
Deque reservation commit accepts a negative initialized prefix length.
Deque reservation commit accepts a negative initialized prefix length · case 03
Deque reservation commit accepts a negative initialized prefix length.
Deque reservation commit accepts a negative initialized prefix length · case 04
Deque reservation commit accepts a negative initialized prefix length.
Deque reservation commit accepts a negative initialized prefix length · case 05
Deque reservation commit accepts a negative initialized prefix length.
Header canonicalization happens after binding · case 01
A structured table violates the declared record or column contract.
Header canonicalization happens after binding · case 02
A structured table violates the declared record or column contract.
Header canonicalization happens after binding · case 03
A structured table violates the declared record or column contract.
Header canonicalization happens after binding · case 04
A structured table violates the declared record or column contract.
Header canonicalization happens after binding · case 05
A structured table violates the declared record or column contract.
An unnamed column becomes a dictionary key · case 01
A structured table violates the declared record or column contract.
An unnamed column becomes a dictionary key · case 02
A structured table violates the declared record or column contract.
An unnamed column becomes a dictionary key · case 03
A structured table violates the declared record or column contract.
An unnamed column becomes a dictionary key · case 04
A structured table violates the declared record or column contract.
An unnamed column becomes a dictionary key · case 05
A structured table violates the declared record or column contract.
Canonical duplicate columns overwrite each other · case 01
A structured table violates the declared record or column contract.
Canonical duplicate columns overwrite each other · case 02
A structured table violates the declared record or column contract.
Canonical duplicate columns overwrite each other · case 03
A structured table violates the declared record or column contract.
Canonical duplicate columns overwrite each other · case 04
A structured table violates the declared record or column contract.
Canonical duplicate columns overwrite each other · case 05
A structured table violates the declared record or column contract.
A user column occupies the overflow namespace · case 01
A structured table violates the declared record or column contract.
A user column occupies the overflow namespace · case 02
A structured table violates the declared record or column contract.
A user column occupies the overflow namespace · case 03
A structured table violates the declared record or column contract.
A user column occupies the overflow namespace · case 04
A structured table violates the declared record or column contract.
A user column occupies the overflow namespace · case 05
A structured table violates the declared record or column contract.
Zipping columns silently discards missing or surplus values · case 01
A structured table violates the declared record or column contract.
Zipping columns silently discards missing or surplus values · case 02
A structured table violates the declared record or column contract.
Zipping columns silently discards missing or surplus values · case 03
A structured table violates the declared record or column contract.
Zipping columns silently discards missing or surplus values · case 04
A structured table violates the declared record or column contract.
Zipping columns silently discards missing or surplus values · case 05
A structured table violates the declared record or column contract.
Blank table separators become empty records · case 01
A structured table violates the declared record or column contract.
Blank table separators become empty records · case 02
A structured table violates the declared record or column contract.
Blank table separators become empty records · case 03
A structured table violates the declared record or column contract.
Blank table separators become empty records · case 04
A structured table violates the declared record or column contract.
Blank table separators become empty records · case 05
A structured table violates the declared record or column contract.
The first data row is skipped as another header · case 01
A structured table violates the declared record or column contract.
The first data row is skipped as another header · case 02
A structured table violates the declared record or column contract.
The first data row is skipped as another header · case 03
A structured table violates the declared record or column contract.
The first data row is skipped as another header · case 04
A structured table violates the declared record or column contract.
The first data row is skipped as another header · case 05
A structured table violates the declared record or column contract.
A data row sharing the first header cell disappears · case 01
A structured table violates the declared record or column contract.
A data row sharing the first header cell disappears · case 02
A structured table violates the declared record or column contract.
A data row sharing the first header cell disappears · case 03
A structured table violates the declared record or column contract.
A data row sharing the first header cell disappears · case 04
A structured table violates the declared record or column contract.
A data row sharing the first header cell disappears · case 05
A structured table violates the declared record or column contract.
Repeated-header imports accept ambiguous initial schema · case 01
A structured table violates the declared record or column contract.
Repeated-header imports accept ambiguous initial schema · case 02
A structured table violates the declared record or column contract.
Repeated-header imports accept ambiguous initial schema · case 03
A structured table violates the declared record or column contract.
Repeated-header imports accept ambiguous initial schema · case 04
A structured table violates the declared record or column contract.
Repeated-header imports accept ambiguous initial schema · case 05
A structured table violates the declared record or column contract.
Repeated-header filtering hides ragged body rows · case 01
A structured table violates the declared record or column contract.
Repeated-header filtering hides ragged body rows · case 02
A structured table violates the declared record or column contract.
Repeated-header filtering hides ragged body rows · case 03
A structured table violates the declared record or column contract.
Repeated-header filtering hides ragged body rows · case 04
A structured table violates the declared record or column contract.
Repeated-header filtering hides ragged body rows · case 05
A structured table violates the declared record or column contract.
TSV control escapes are kept as literal letters · case 01
A structured table violates the declared record or column contract.
TSV control escapes are kept as literal letters · case 02
A structured table violates the declared record or column contract.
TSV control escapes are kept as literal letters · case 03
A structured table violates the declared record or column contract.
TSV control escapes are kept as literal letters · case 04
A structured table violates the declared record or column contract.
TSV control escapes are kept as literal letters · case 05
A structured table violates the declared record or column contract.
One TSV escape captures the following ordinary character · case 01
A structured table violates the declared record or column contract.
One TSV escape captures the following ordinary character · case 02
A structured table violates the declared record or column contract.
One TSV escape captures the following ordinary character · case 03
A structured table violates the declared record or column contract.
One TSV escape captures the following ordinary character · case 04
A structured table violates the declared record or column contract.
One TSV escape captures the following ordinary character · case 05
A structured table violates the declared record or column contract.
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 ↗