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
Min-max heap maximum can be either child of the root · case 01
The bounded minmax levels certificate reports an incorrect maximum.
Min-max heap maximum can be either child of the root · case 02
The bounded minmax levels certificate reports an incorrect maximum.
Min-max heap maximum can be either child of the root · case 03
The bounded minmax levels certificate reports an incorrect maximum.
Min-max heap maximum can be either child of the root · case 04
The bounded minmax levels certificate reports an incorrect maximum.
Min-max heap maximum can be either child of the root · case 05
The bounded minmax levels certificate reports an incorrect maximum.
Min-max complete-tree level alternation includes both zero-based child positions · case 01
The bounded minmax levels certificate reports an incorrect edges.
Min-max complete-tree level alternation includes both zero-based child positions · case 02
The bounded minmax levels certificate reports an incorrect edges.
Min-max complete-tree level alternation includes both zero-based child positions · case 03
The bounded minmax levels certificate reports an incorrect edges.
Min-max complete-tree level alternation includes both zero-based child positions · case 04
The bounded minmax levels certificate reports an incorrect edges.
Min-max complete-tree level alternation includes both zero-based child positions · case 05
The bounded minmax levels certificate reports an incorrect edges.
Interval heap admits equal endpoints and a final singleton · case 01
The bounded interval endpoints certificate reports an incorrect reversed.
Interval heap admits equal endpoints and a final singleton · case 02
The bounded interval endpoints certificate reports an incorrect reversed.
Interval heap admits equal endpoints and a final singleton · case 03
The bounded interval endpoints certificate reports an incorrect reversed.
Interval heap admits equal endpoints and a final singleton · case 04
The bounded interval endpoints certificate reports an incorrect reversed.
Interval heap admits equal endpoints and a final singleton · case 05
The bounded interval endpoints certificate reports an incorrect reversed.
Interval heap lower endpoints form a min heap independent of upper endpoints · case 01
The bounded interval endpoints certificate reports an incorrect low order.
Interval heap lower endpoints form a min heap independent of upper endpoints · case 02
The bounded interval endpoints certificate reports an incorrect low order.
Interval heap lower endpoints form a min heap independent of upper endpoints · case 03
The bounded interval endpoints certificate reports an incorrect low order.
Interval heap lower endpoints form a min heap independent of upper endpoints · case 04
The bounded interval endpoints certificate reports an incorrect low order.
Interval heap lower endpoints form a min heap independent of upper endpoints · case 05
The bounded interval endpoints certificate reports an incorrect low order.
Interval heap singleton participates in upper-end heap order · case 01
The bounded interval endpoints certificate reports an incorrect high order.
Interval heap singleton participates in upper-end heap order · case 02
The bounded interval endpoints certificate reports an incorrect high order.
Interval heap singleton participates in upper-end heap order · case 03
The bounded interval endpoints certificate reports an incorrect high order.
Interval heap singleton participates in upper-end heap order · case 04
The bounded interval endpoints certificate reports an incorrect high order.
Interval heap singleton participates in upper-end heap order · case 05
The bounded interval endpoints certificate reports an incorrect high order.
Interval heap minimum is the root lower endpoint · case 01
The bounded interval endpoints certificate reports an incorrect minimum.
Interval heap minimum is the root lower endpoint · case 02
The bounded interval endpoints certificate reports an incorrect minimum.
Interval heap minimum is the root lower endpoint · case 03
The bounded interval endpoints certificate reports an incorrect minimum.
Interval heap minimum is the root lower endpoint · case 04
The bounded interval endpoints certificate reports an incorrect minimum.
Interval heap minimum is the root lower endpoint · case 05
The bounded interval endpoints certificate reports an incorrect minimum.
Interval heap maximum is the root upper endpoint even with a singleton tail · case 01
The bounded interval endpoints certificate reports an incorrect maximum.
Interval heap maximum is the root upper endpoint even with a singleton tail · case 02
The bounded interval endpoints certificate reports an incorrect maximum.
Interval heap maximum is the root upper endpoint even with a singleton tail · case 03
The bounded interval endpoints certificate reports an incorrect maximum.
Interval heap maximum is the root upper endpoint even with a singleton tail · case 04
The bounded interval endpoints certificate reports an incorrect maximum.
Interval heap maximum is the root upper endpoint even with a singleton tail · case 05
The bounded interval endpoints certificate reports an incorrect maximum.
Interval heap logical size counts a final singleton once · case 01
The bounded interval endpoints certificate reports an incorrect members.
Interval heap logical size counts a final singleton once · case 02
The bounded interval endpoints certificate reports an incorrect members.
Interval heap logical size counts a final singleton once · case 03
The bounded interval endpoints certificate reports an incorrect members.
Interval heap logical size counts a final singleton once · case 04
The bounded interval endpoints certificate reports an incorrect members.
Interval heap logical size counts a final singleton once · case 05
The bounded interval endpoints certificate reports an incorrect members.
Interval insertion sorts the completed pair while retaining both values · case 01
The bounded interval insert certificate reports an incorrect completed.
Interval insertion sorts the completed pair while retaining both values · case 02
The bounded interval insert certificate reports an incorrect completed.
Interval insertion sorts the completed pair while retaining both values · case 03
The bounded interval insert certificate reports an incorrect completed.
Interval insertion sorts the completed pair while retaining both values · case 04
The bounded interval insert certificate reports an incorrect completed.
Interval insertion sorts the completed pair while retaining both values · case 05
The bounded interval insert certificate reports an incorrect completed.
Interval insertion crosses the lower heap only below the parent lower bound · case 01
The bounded interval insert certificate reports an incorrect lower.
Interval insertion crosses the lower heap only below the parent lower bound · case 02
The bounded interval insert certificate reports an incorrect lower.
Interval insertion crosses the lower heap only below the parent lower bound · case 03
The bounded interval insert certificate reports an incorrect lower.
Interval insertion crosses the lower heap only below the parent lower bound · case 04
The bounded interval insert certificate reports an incorrect lower.
Interval insertion crosses the lower heap only below the parent lower bound · case 05
The bounded interval insert certificate reports an incorrect lower.
Interval insertion crosses the upper heap only above the parent upper bound · case 01
The bounded interval insert certificate reports an incorrect upper.
Interval insertion crosses the upper heap only above the parent upper bound · case 02
The bounded interval insert certificate reports an incorrect upper.
Interval insertion crosses the upper heap only above the parent upper bound · case 03
The bounded interval insert certificate reports an incorrect upper.
Interval insertion crosses the upper heap only above the parent upper bound · case 04
The bounded interval insert certificate reports an incorrect upper.
Interval insertion crosses the upper heap only above the parent upper bound · case 05
The bounded interval insert certificate reports an incorrect upper.
Interval insertion containment includes both parent endpoints · case 01
The bounded interval insert certificate reports an incorrect contained.
Interval insertion containment includes both parent endpoints · case 02
The bounded interval insert certificate reports an incorrect contained.
Interval insertion containment includes both parent endpoints · case 03
The bounded interval insert certificate reports an incorrect contained.
Interval insertion containment includes both parent endpoints · case 04
The bounded interval insert certificate reports an incorrect contained.
Interval insertion containment includes both parent endpoints · case 05
The bounded interval insert certificate reports an incorrect contained.
Interval insertion displaces the crossed endpoint and none for containment · case 01
The bounded interval insert certificate reports an incorrect displaced.
Interval insertion displaces the crossed endpoint and none for containment · case 02
The bounded interval insert certificate reports an incorrect displaced.
Interval insertion displaces the crossed endpoint and none for containment · case 03
The bounded interval insert certificate reports an incorrect displaced.
Interval insertion displaces the crossed endpoint and none for containment · case 04
The bounded interval insert certificate reports an incorrect displaced.
Interval insertion displaces the crossed endpoint and none for containment · case 05
The bounded interval insert certificate reports an incorrect displaced.
Interval insertion increases element count by one regardless of pair completion · case 01
The bounded interval insert certificate reports an incorrect new size.
Interval insertion increases element count by one regardless of pair completion · case 02
The bounded interval insert certificate reports an incorrect new size.
Interval insertion increases element count by one regardless of pair completion · case 03
The bounded interval insert certificate reports an incorrect new size.
Interval insertion increases element count by one regardless of pair completion · case 04
The bounded interval insert certificate reports an incorrect new size.
Interval insertion increases element count by one regardless of pair completion · case 05
The bounded interval insert certificate reports an incorrect new size.
Winner tournament replay must recompute the immediate parent before its ancestors · case 01
The bounded tournament path certificate reports an incorrect replay.
Winner tournament replay must recompute the immediate parent before its ancestors · case 02
The bounded tournament path certificate reports an incorrect replay.
Winner tournament replay must recompute the immediate parent before its ancestors · case 03
The bounded tournament path certificate reports an incorrect replay.
Winner tournament replay must recompute the immediate parent before its ancestors · case 04
The bounded tournament path certificate reports an incorrect replay.
Winner tournament replay must recompute the immediate parent before its ancestors · case 05
The bounded tournament path certificate reports an incorrect replay.
Winner tournament replay uses opposite parity sibling on either branch · case 01
The bounded tournament path certificate reports an incorrect siblings.
Winner tournament replay uses opposite parity sibling on either branch · case 02
The bounded tournament path certificate reports an incorrect siblings.
Winner tournament replay uses opposite parity sibling on either branch · case 03
The bounded tournament path certificate reports an incorrect siblings.
Winner tournament replay uses opposite parity sibling on either branch · case 04
The bounded tournament path certificate reports an incorrect siblings.
Winner tournament replay uses opposite parity sibling on either branch · case 05
The bounded tournament path certificate reports an incorrect siblings.
Winner tournament uses its internal root rather than a leaf or zero sentinel · case 01
The bounded tournament path certificate reports an incorrect root.
Winner tournament uses its internal root rather than a leaf or zero sentinel · case 02
The bounded tournament path certificate reports an incorrect root.
Winner tournament uses its internal root rather than a leaf or zero sentinel · case 03
The bounded tournament path certificate reports an incorrect root.
Winner tournament uses its internal root rather than a leaf or zero sentinel · case 04
The bounded tournament path certificate reports an incorrect root.
Winner tournament uses its internal root rather than a leaf or zero sentinel · case 05
The bounded tournament path certificate reports an incorrect root.
Winner tournament update pays one match per replay ancestor · case 01
The bounded tournament path certificate reports an incorrect comparisons.
Winner tournament update pays one match per replay ancestor · case 02
The bounded tournament path certificate reports an incorrect comparisons.
Winner tournament update pays one match per replay ancestor · case 03
The bounded tournament path certificate reports an incorrect comparisons.
Winner tournament update pays one match per replay ancestor · case 04
The bounded tournament path certificate reports an incorrect comparisons.
Winner tournament update pays one match per replay ancestor · case 05
The bounded tournament path certificate reports an incorrect comparisons.
Winner tournament leaf update offsets the external slot by leaf capacity · case 01
The bounded tournament path certificate reports an incorrect leaf.
Winner tournament leaf update offsets the external slot by leaf capacity · case 02
The bounded tournament path certificate reports an incorrect leaf.
Winner tournament leaf update offsets the external slot by leaf capacity · case 03
The bounded tournament path certificate reports an incorrect leaf.
Winner tournament leaf update offsets the external slot by leaf capacity · case 04
The bounded tournament path certificate reports an incorrect leaf.
Winner tournament leaf update offsets the external slot by leaf capacity · case 05
The bounded tournament path certificate reports an incorrect leaf.
Winner tournament replay preserves all other leaf payloads · case 01
The bounded tournament path certificate reports an incorrect untouched.
Winner tournament replay preserves all other leaf payloads · case 02
The bounded tournament path certificate reports an incorrect untouched.
Winner tournament replay preserves all other leaf payloads · case 03
The bounded tournament path certificate reports an incorrect untouched.
Winner tournament replay preserves all other leaf payloads · case 04
The bounded tournament path certificate reports an incorrect untouched.
Winner tournament replay preserves all other leaf payloads · case 05
The bounded tournament path certificate reports an incorrect untouched.
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 ↗