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
Heap build level spans use inclusive endpoints without moving zero-based starts · case 01
The bounded bottomup schedule certificate reports an incorrect levels.
Heap build level spans use inclusive endpoints without moving zero-based starts · case 02
The bounded bottomup schedule certificate reports an incorrect levels.
Heap build level spans use inclusive endpoints without moving zero-based starts · case 03
The bounded bottomup schedule certificate reports an incorrect levels.
Heap build level spans use inclusive endpoints without moving zero-based starts · case 04
The bounded bottomup schedule certificate reports an incorrect levels.
Heap build level spans use inclusive endpoints without moving zero-based starts · case 05
The bounded bottomup schedule certificate reports an incorrect levels.
Complete binary heap has one unary internal node only at positive even size · case 01
The bounded bottomup schedule certificate reports an incorrect unpaired parent.
Complete binary heap has one unary internal node only at positive even size · case 02
The bounded bottomup schedule certificate reports an incorrect unpaired parent.
Complete binary heap has one unary internal node only at positive even size · case 03
The bounded bottomup schedule certificate reports an incorrect unpaired parent.
Complete binary heap has one unary internal node only at positive even size · case 04
The bounded bottomup schedule certificate reports an incorrect unpaired parent.
Complete binary heap has one unary internal node only at positive even size · case 05
The bounded bottomup schedule certificate reports an incorrect unpaired parent.
Heap build dependencies connect internal repairs using zero-based parent arithmetic · case 01
The bounded bottomup schedule certificate reports an incorrect dependencies.
Heap build dependencies connect internal repairs using zero-based parent arithmetic · case 02
The bounded bottomup schedule certificate reports an incorrect dependencies.
Heap build dependencies connect internal repairs using zero-based parent arithmetic · case 03
The bounded bottomup schedule certificate reports an incorrect dependencies.
Heap build dependencies connect internal repairs using zero-based parent arithmetic · case 04
The bounded bottomup schedule certificate reports an incorrect dependencies.
Heap build dependencies connect internal repairs using zero-based parent arithmetic · case 05
The bounded bottomup schedule certificate reports an incorrect dependencies.
Heap build repairs exactly the internal nodes rather than every nonroot · case 01
The bounded bottomup schedule certificate reports an incorrect internal count.
Heap build repairs exactly the internal nodes rather than every nonroot · case 02
The bounded bottomup schedule certificate reports an incorrect internal count.
Heap build repairs exactly the internal nodes rather than every nonroot · case 03
The bounded bottomup schedule certificate reports an incorrect internal count.
Heap build repairs exactly the internal nodes rather than every nonroot · case 04
The bounded bottomup schedule certificate reports an incorrect internal count.
Heap build repairs exactly the internal nodes rather than every nonroot · case 05
The bounded bottomup schedule certificate reports an incorrect internal count.
Heap hole descent includes its original vacancy before traversing children · case 01
The bounded hole descent certificate reports an incorrect path.
Heap hole descent includes its original vacancy before traversing children · case 02
The bounded hole descent certificate reports an incorrect path.
Heap hole descent includes its original vacancy before traversing children · case 03
The bounded hole descent certificate reports an incorrect path.
Heap hole descent includes its original vacancy before traversing children · case 04
The bounded hole descent certificate reports an incorrect path.
Heap hole descent includes its original vacancy before traversing children · case 05
The bounded hole descent certificate reports an incorrect path.
Heap hole descent lifts selected child values rather than old parent values · case 01
The bounded hole descent certificate reports an incorrect moved keys.
Heap hole descent lifts selected child values rather than old parent values · case 02
The bounded hole descent certificate reports an incorrect moved keys.
Heap hole descent lifts selected child values rather than old parent values · case 03
The bounded hole descent certificate reports an incorrect moved keys.
Heap hole descent lifts selected child values rather than old parent values · case 04
The bounded hole descent certificate reports an incorrect moved keys.
Heap hole descent lifts selected child values rather than old parent values · case 05
The bounded hole descent certificate reports an incorrect moved keys.
Heap hole terminates on the selected branch rather than the final array slot · case 01
The bounded hole descent certificate reports an incorrect leaf slot.
Heap hole terminates on the selected branch rather than the final array slot · case 02
The bounded hole descent certificate reports an incorrect leaf slot.
Heap hole terminates on the selected branch rather than the final array slot · case 03
The bounded hole descent certificate reports an incorrect leaf slot.
Heap hole terminates on the selected branch rather than the final array slot · case 04
The bounded hole descent certificate reports an incorrect leaf slot.
Heap hole terminates on the selected branch rather than the final array slot · case 05
The bounded hole descent certificate reports an incorrect leaf slot.
Heap hole preserves the displaced original key for the later upward phase · case 01
The bounded hole descent certificate reports an incorrect displaced.
Heap hole preserves the displaced original key for the later upward phase · case 02
The bounded hole descent certificate reports an incorrect displaced.
Heap hole preserves the displaced original key for the later upward phase · case 03
The bounded hole descent certificate reports an incorrect displaced.
Heap hole preserves the displaced original key for the later upward phase · case 04
The bounded hole descent certificate reports an incorrect displaced.
Heap hole preserves the displaced original key for the later upward phase · case 05
The bounded hole descent certificate reports an incorrect displaced.
Heap hole descent preserves all slots outside its selected path · case 01
The bounded hole descent certificate reports an incorrect untouched.
Heap hole descent preserves all slots outside its selected path · case 02
The bounded hole descent certificate reports an incorrect untouched.
Heap hole descent preserves all slots outside its selected path · case 03
The bounded hole descent certificate reports an incorrect untouched.
Heap hole descent preserves all slots outside its selected path · case 04
The bounded hole descent certificate reports an incorrect untouched.
Heap hole descent preserves all slots outside its selected path · case 05
The bounded hole descent certificate reports an incorrect untouched.
Heap hole avoids a sibling comparison when only the left child exists · case 01
The bounded hole descent certificate reports an incorrect comparisons.
Heap hole avoids a sibling comparison when only the left child exists · case 02
The bounded hole descent certificate reports an incorrect comparisons.
Heap hole avoids a sibling comparison when only the left child exists · case 03
The bounded hole descent certificate reports an incorrect comparisons.
Heap hole avoids a sibling comparison when only the left child exists · case 04
The bounded hole descent certificate reports an incorrect comparisons.
Heap hole avoids a sibling comparison when only the left child exists · case 05
The bounded hole descent certificate reports an incorrect comparisons.
Binomial decrease bubbling exchanges handle identity together with priority · case 01
The bounded binomial payload bubble certificate reports an incorrect payloads.
Binomial decrease bubbling exchanges handle identity together with priority · case 02
The bounded binomial payload bubble certificate reports an incorrect payloads.
Binomial decrease bubbling exchanges handle identity together with priority · case 03
The bounded binomial payload bubble certificate reports an incorrect payloads.
Binomial decrease bubbling exchanges handle identity together with priority · case 04
The bounded binomial payload bubble certificate reports an incorrect payloads.
Binomial decrease bubbling exchanges handle identity together with priority · case 05
The bounded binomial payload bubble certificate reports an incorrect payloads.
Binomial decrease updates handle-to-node locations rather than array path offsets · case 01
The bounded binomial payload bubble certificate reports an incorrect locations.
Binomial decrease updates handle-to-node locations rather than array path offsets · case 02
The bounded binomial payload bubble certificate reports an incorrect locations.
Binomial decrease updates handle-to-node locations rather than array path offsets · case 03
The bounded binomial payload bubble certificate reports an incorrect locations.
Binomial decrease updates handle-to-node locations rather than array path offsets · case 04
The bounded binomial payload bubble certificate reports an incorrect locations.
Binomial decrease updates handle-to-node locations rather than array path offsets · case 05
The bounded binomial payload bubble certificate reports an incorrect locations.
Binomial decrease records exchanges upward from the changed leaf · case 01
The bounded binomial payload bubble certificate reports an incorrect swaps.
Binomial decrease records exchanges upward from the changed leaf · case 02
The bounded binomial payload bubble certificate reports an incorrect swaps.
Binomial decrease records exchanges upward from the changed leaf · case 03
The bounded binomial payload bubble certificate reports an incorrect swaps.
Binomial decrease records exchanges upward from the changed leaf · case 04
The bounded binomial payload bubble certificate reports an incorrect swaps.
Binomial decrease records exchanges upward from the changed leaf · case 05
The bounded binomial payload bubble certificate reports an incorrect swaps.
Binomial decrease stops bubbling at the first dominating ancestor · case 01
The bounded binomial payload bubble certificate reports an incorrect changed location.
Binomial decrease stops bubbling at the first dominating ancestor · case 02
The bounded binomial payload bubble certificate reports an incorrect changed location.
Binomial decrease stops bubbling at the first dominating ancestor · case 03
The bounded binomial payload bubble certificate reports an incorrect changed location.
Binomial decrease stops bubbling at the first dominating ancestor · case 04
The bounded binomial payload bubble certificate reports an incorrect changed location.
Binomial decrease stops bubbling at the first dominating ancestor · case 05
The bounded binomial payload bubble certificate reports an incorrect changed location.
Binomial payload bubbling keeps the structural parent chain intact · case 01
The bounded binomial payload bubble certificate reports an incorrect structural nodes.
Binomial payload bubbling keeps the structural parent chain intact · case 02
The bounded binomial payload bubble certificate reports an incorrect structural nodes.
Binomial payload bubbling keeps the structural parent chain intact · case 03
The bounded binomial payload bubble certificate reports an incorrect structural nodes.
Binomial payload bubbling keeps the structural parent chain intact · case 04
The bounded binomial payload bubble certificate reports an incorrect structural nodes.
Binomial payload bubbling keeps the structural parent chain intact · case 05
The bounded binomial payload bubble certificate reports an incorrect structural nodes.
Binomial decreased key need not become the path minimum if an ancestor is smaller · case 01
The bounded binomial payload bubble certificate reports an incorrect minimum.
Binomial decreased key need not become the path minimum if an ancestor is smaller · case 02
The bounded binomial payload bubble certificate reports an incorrect minimum.
Binomial decreased key need not become the path minimum if an ancestor is smaller · case 03
The bounded binomial payload bubble certificate reports an incorrect minimum.
Binomial decreased key need not become the path minimum if an ancestor is smaller · case 04
The bounded binomial payload bubble certificate reports an incorrect minimum.
Binomial decreased key need not become the path minimum if an ancestor is smaller · case 05
The bounded binomial payload bubble certificate reports an incorrect minimum.
Fibonacci consolidation follows a contiguous degree carry chain and stops at a vacant slot · case 01
The bounded fibonacci degree table certificate reports an incorrect collisions.
Fibonacci consolidation follows a contiguous degree carry chain and stops at a vacant slot · case 02
The bounded fibonacci degree table certificate reports an incorrect collisions.
Fibonacci consolidation follows a contiguous degree carry chain and stops at a vacant slot · case 03
The bounded fibonacci degree table certificate reports an incorrect collisions.
Fibonacci consolidation follows a contiguous degree carry chain and stops at a vacant slot · case 04
The bounded fibonacci degree table certificate reports an incorrect collisions.
Fibonacci consolidation follows a contiguous degree carry chain and stops at a vacant slot · case 05
The bounded fibonacci degree table certificate reports an incorrect collisions.
Fibonacci consolidation increases degree once per actual collision · case 01
The bounded fibonacci degree table certificate reports an incorrect final degree.
Fibonacci consolidation increases degree once per actual collision · case 02
The bounded fibonacci degree table certificate reports an incorrect final degree.
Fibonacci consolidation increases degree once per actual collision · case 03
The bounded fibonacci degree table certificate reports an incorrect final degree.
Fibonacci consolidation increases degree once per actual collision · case 04
The bounded fibonacci degree table certificate reports an incorrect final degree.
Fibonacci consolidation increases degree once per actual collision · case 05
The bounded fibonacci degree table certificate reports an incorrect final degree.
Fibonacci consolidation clears consumed degree slots but retains its destination · case 01
The bounded fibonacci degree table certificate reports an incorrect cleared.
Fibonacci consolidation clears consumed degree slots but retains its destination · case 02
The bounded fibonacci degree table certificate reports an incorrect cleared.
Fibonacci consolidation clears consumed degree slots but retains its destination · case 03
The bounded fibonacci degree table certificate reports an incorrect cleared.
Fibonacci consolidation clears consumed degree slots but retains its destination · case 04
The bounded fibonacci degree table certificate reports an incorrect cleared.
Fibonacci consolidation clears consumed degree slots but retains its destination · case 05
The bounded fibonacci degree table certificate reports an incorrect cleared.
Fibonacci consolidation preserves unrelated roots and removes consumed slots · case 01
The bounded fibonacci degree table certificate reports an incorrect occupied.
Fibonacci consolidation preserves unrelated roots and removes consumed slots · case 02
The bounded fibonacci degree table certificate reports an incorrect occupied.
Fibonacci consolidation preserves unrelated roots and removes consumed slots · case 03
The bounded fibonacci degree table certificate reports an incorrect occupied.
Fibonacci consolidation preserves unrelated roots and removes consumed slots · case 04
The bounded fibonacci degree table certificate reports an incorrect occupied.
Fibonacci consolidation preserves unrelated roots and removes consumed slots · case 05
The bounded fibonacci degree table certificate reports an incorrect occupied.
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 ↗