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
Run decoding rebases positions without rebasing run ends · case 01
Run decoding rebases positions without rebasing run ends.
Run decoding rebases positions without rebasing run ends · case 02
Run decoding rebases positions without rebasing run ends.
Run decoding rebases positions without rebasing run ends · case 03
Run decoding rebases positions without rebasing run ends.
Run decoding rebases positions without rebasing run ends · case 04
Run decoding rebases positions without rebasing run ends.
Run decoding rebases positions without rebasing run ends · case 05
Run decoding rebases positions without rebasing run ends.
An exclusive run end is treated as its last included position · case 01
An exclusive run end is treated as its last included position.
An exclusive run end is treated as its last included position · case 02
An exclusive run end is treated as its last included position.
An exclusive run end is treated as its last included position · case 03
An exclusive run end is treated as its last included position.
An exclusive run end is treated as its last included position · case 04
An exclusive run end is treated as its last included position.
An exclusive run end is treated as its last included position · case 05
An exclusive run end is treated as its last included position.
Decoded run values use a logical-row address · case 01
Decoded run values use a logical-row address.
Decoded run values use a logical-row address · case 02
Decoded run values use a logical-row address.
Decoded run values use a logical-row address · case 03
Decoded run values use a logical-row address.
Decoded run values use a logical-row address · case 04
Decoded run values use a logical-row address.
Decoded run values use a logical-row address · case 05
Decoded run values use a logical-row address.
Run validity is addressed by the slice-local row · case 01
Run validity is addressed by the slice-local row.
Run validity is addressed by the slice-local row · case 02
Run validity is addressed by the slice-local row.
Run validity is addressed by the slice-local row · case 03
Run validity is addressed by the slice-local row.
Run validity is addressed by the slice-local row · case 04
Run validity is addressed by the slice-local row.
Run validity is addressed by the slice-local row · case 05
Run validity is addressed by the slice-local row.
A null run is replaced by its hidden payload · case 01
A null run is replaced by its hidden payload.
A null run is replaced by its hidden payload · case 02
A null run is replaced by its hidden payload.
A null run is replaced by its hidden payload · case 03
A null run is replaced by its hidden payload.
A null run is replaced by its hidden payload · case 04
A null run is replaced by its hidden payload.
A null run is replaced by its hidden payload · case 05
A null run is replaced by its hidden payload.
Only one output is retained per decoded run value · case 01
Only one output is retained per decoded run value.
Only one output is retained per decoded run value · case 02
Only one output is retained per decoded run value.
Only one output is retained per decoded run value · case 03
Only one output is retained per decoded run value.
Only one output is retained per decoded run value · case 04
Only one output is retained per decoded run value.
Only one output is retained per decoded run value · case 05
Only one output is retained per decoded run value.
List gather sorts its physical row selection · case 01
List gather sorts its physical row selection.
List gather sorts its physical row selection · case 02
List gather sorts its physical row selection.
List gather sorts its physical row selection · case 03
List gather sorts its physical row selection.
List gather sorts its physical row selection · case 04
List gather sorts its physical row selection.
List gather sorts its physical row selection · case 05
List gather sorts its physical row selection.
A list slice starts at zero in the shared child buffer · case 01
A list slice starts at zero in the shared child buffer.
A list slice starts at zero in the shared child buffer · case 02
A list slice starts at zero in the shared child buffer.
A list slice starts at zero in the shared child buffer · case 03
A list slice starts at zero in the shared child buffer.
A list slice starts at zero in the shared child buffer · case 04
A list slice starts at zero in the shared child buffer.
A list slice starts at zero in the shared child buffer · case 05
A list slice starts at zero in the shared child buffer.
A list slice ends at the next parent ordinal · case 01
A list slice ends at the next parent ordinal.
A list slice ends at the next parent ordinal · case 02
A list slice ends at the next parent ordinal.
A list slice ends at the next parent ordinal · case 03
A list slice ends at the next parent ordinal.
A list slice ends at the next parent ordinal · case 04
A list slice ends at the next parent ordinal.
A list slice ends at the next parent ordinal · case 05
A list slice ends at the next parent ordinal.
Nested list decoding ignores child validity · case 01
Nested list decoding ignores child validity.
Nested list decoding ignores child validity · case 02
Nested list decoding ignores child validity.
Nested list decoding ignores child validity · case 03
Nested list decoding ignores child validity.
Nested list decoding ignores child validity · case 04
Nested list decoding ignores child validity.
Nested list decoding ignores child validity · case 05
Nested list decoding ignores child validity.
A null list exposes its physically retained child values · case 01
A null list exposes its physically retained child values.
A null list exposes its physically retained child values · case 02
A null list exposes its physically retained child values.
A null list exposes its physically retained child values · case 03
A null list exposes its physically retained child values.
A null list exposes its physically retained child values · case 04
A null list exposes its physically retained child values.
A null list exposes its physically retained child values · case 05
A null list exposes its physically retained child values.
Empty valid lists are converted into absent rows · case 01
Empty valid lists are converted into absent rows.
Empty valid lists are converted into absent rows · case 02
Empty valid lists are converted into absent rows.
Empty valid lists are converted into absent rows · case 03
Empty valid lists are converted into absent rows.
Empty valid lists are converted into absent rows · case 04
Empty valid lists are converted into absent rows.
Empty valid lists are converted into absent rows · case 05
Empty valid lists are converted into absent rows.
Struct projection ignores a gathered row selection · case 01
Struct projection ignores a gathered row selection.
Struct projection ignores a gathered row selection · case 02
Struct projection ignores a gathered row selection.
Struct projection ignores a gathered row selection · case 03
Struct projection ignores a gathered row selection.
Struct projection ignores a gathered row selection · case 04
Struct projection ignores a gathered row selection.
Struct projection ignores a gathered row selection · case 05
Struct projection ignores a gathered row selection.
Struct projection sorts requested fields by storage name · case 01
Struct projection sorts requested fields by storage name.
Struct projection sorts requested fields by storage name · case 02
Struct projection sorts requested fields by storage name.
Struct projection sorts requested fields by storage name · case 03
Struct projection sorts requested fields by storage name.
Struct projection sorts requested fields by storage name · case 04
Struct projection sorts requested fields by storage name.
Struct projection sorts requested fields by storage name · case 05
Struct projection sorts requested fields by storage name.
Struct projection treats absent fields as fatal for every field · case 01
Struct projection treats absent fields as fatal for every field.
Struct projection treats absent fields as fatal for every field · case 02
Struct projection treats absent fields as fatal for every field.
Struct projection treats absent fields as fatal for every field · case 03
Struct projection treats absent fields as fatal for every field.
Struct projection treats absent fields as fatal for every field · case 04
Struct projection treats absent fields as fatal for every field.
Struct projection treats absent fields as fatal for every field · case 05
Struct projection treats absent fields as fatal for every field.
A struct field exposes values beneath null field lanes · case 01
A struct field exposes values beneath null field lanes.
A struct field exposes values beneath null field lanes · case 02
A struct field exposes values beneath null field lanes.
A struct field exposes values beneath null field lanes · case 03
A struct field exposes values beneath null field lanes.
A struct field exposes values beneath null field lanes · case 04
A struct field exposes values beneath null field lanes.
A struct field exposes values beneath null field lanes · case 05
A struct field exposes values beneath null field lanes.
A projected struct field broadcasts its first lane · case 01
A projected struct field broadcasts its first lane.
A projected struct field broadcasts its first lane · case 02
A projected struct field broadcasts its first lane.
A projected struct field broadcasts its first lane · case 03
A projected struct field broadcasts its first lane.
A projected struct field broadcasts its first lane · case 04
A projected struct field broadcasts its first lane.
A projected struct field broadcasts its first lane · case 05
A projected struct field broadcasts its first lane.
Child validity replaces the containing struct validity · case 01
Child validity replaces the containing struct validity.
Child validity replaces the containing struct validity · case 02
Child validity replaces the containing struct validity.
Child validity replaces the containing struct validity · case 03
Child validity replaces the containing struct validity.
Child validity replaces the containing struct validity · case 04
Child validity replaces the containing struct validity.
Child validity replaces the containing struct validity · case 05
Child validity replaces the containing struct validity.
Dense union gather sorts logical row addresses · case 01
Dense union gather sorts logical row addresses.
Dense union gather sorts logical row addresses · case 02
Dense union gather sorts logical row addresses.
Dense union gather sorts logical row addresses · case 03
Dense union gather sorts logical row addresses.
Dense union gather sorts logical row addresses · case 04
Dense union gather sorts logical row addresses.
Dense union gather sorts logical row addresses · case 05
Dense union gather sorts logical row addresses.
Dense union decoding reuses the first row tag · case 01
Dense union decoding reuses the first row tag.
Dense union decoding reuses the first row tag · case 02
Dense union decoding reuses the first row tag.
Dense union decoding reuses the first row tag · case 03
Dense union decoding reuses the first row tag.
Dense union decoding reuses the first row tag · case 04
Dense union decoding reuses the first row tag.
Dense union decoding reuses the first row tag · case 05
Dense union decoding reuses the first row tag.
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 ↗