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
Paged heap children may cross page boundaries and require global indexing · case 01
The bounded paged heap layout certificate reports an incorrect children.
Paged heap children may cross page boundaries and require global indexing · case 02
The bounded paged heap layout certificate reports an incorrect children.
Paged heap children may cross page boundaries and require global indexing · case 03
The bounded paged heap layout certificate reports an incorrect children.
Paged heap children may cross page boundaries and require global indexing · case 04
The bounded paged heap layout certificate reports an incorrect children.
Paged heap children may cross page boundaries and require global indexing · case 05
The bounded paged heap layout certificate reports an incorrect children.
Paged heap page allocation rounds up except at exact capacity multiples · case 01
The bounded paged heap layout certificate reports an incorrect pages.
Paged heap page allocation rounds up except at exact capacity multiples · case 02
The bounded paged heap layout certificate reports an incorrect pages.
Paged heap page allocation rounds up except at exact capacity multiples · case 03
The bounded paged heap layout certificate reports an incorrect pages.
Paged heap page allocation rounds up except at exact capacity multiples · case 04
The bounded paged heap layout certificate reports an incorrect pages.
Paged heap page allocation rounds up except at exact capacity multiples · case 05
The bounded paged heap layout certificate reports an incorrect pages.
Paged heap exact-multiple tail pages are full rather than empty · case 01
The bounded paged heap layout certificate reports an incorrect tail occupancy.
Paged heap exact-multiple tail pages are full rather than empty · case 02
The bounded paged heap layout certificate reports an incorrect tail occupancy.
Paged heap exact-multiple tail pages are full rather than empty · case 03
The bounded paged heap layout certificate reports an incorrect tail occupancy.
Paged heap exact-multiple tail pages are full rather than empty · case 04
The bounded paged heap layout certificate reports an incorrect tail occupancy.
Paged heap exact-multiple tail pages are full rather than empty · case 05
The bounded paged heap layout certificate reports an incorrect tail occupancy.
Paged heap child scan includes every physical page touched by its cross-page children · case 01
The bounded paged heap layout certificate reports an incorrect touched.
Paged heap child scan includes every physical page touched by its cross-page children · case 02
The bounded paged heap layout certificate reports an incorrect touched.
Paged heap child scan includes every physical page touched by its cross-page children · case 03
The bounded paged heap layout certificate reports an incorrect touched.
Paged heap child scan includes every physical page touched by its cross-page children · case 04
The bounded paged heap layout certificate reports an incorrect touched.
Paged heap child scan includes every physical page touched by its cross-page children · case 05
The bounded paged heap layout certificate reports an incorrect touched.
Pointer heap traversal follows breadth-first links rather than allocation order · case 01
The bounded complete tree certificate certificate reports an incorrect visits.
Pointer heap traversal follows breadth-first links rather than allocation order · case 02
The bounded complete tree certificate certificate reports an incorrect visits.
Pointer heap traversal follows breadth-first links rather than allocation order · case 03
The bounded complete tree certificate certificate reports an incorrect visits.
Pointer heap traversal follows breadth-first links rather than allocation order · case 04
The bounded complete tree certificate certificate reports an incorrect visits.
Pointer heap traversal follows breadth-first links rather than allocation order · case 05
The bounded complete tree certificate certificate reports an incorrect visits.
Pointer heap certificate rejects allocated nodes detached from the root · case 01
The bounded complete tree certificate certificate reports an incorrect unreachable.
Pointer heap certificate rejects allocated nodes detached from the root · case 02
The bounded complete tree certificate certificate reports an incorrect unreachable.
Pointer heap certificate rejects allocated nodes detached from the root · case 03
The bounded complete tree certificate certificate reports an incorrect unreachable.
Pointer heap certificate rejects allocated nodes detached from the root · case 04
The bounded complete tree certificate certificate reports an incorrect unreachable.
Pointer heap certificate rejects allocated nodes detached from the root · case 05
The bounded complete tree certificate certificate reports an incorrect unreachable.
Pointer heap traversal records every repeated reference rather than expanding or hiding aliases · case 01
The bounded complete tree certificate certificate reports an incorrect repeated.
Pointer heap traversal records every repeated reference rather than expanding or hiding aliases · case 02
The bounded complete tree certificate certificate reports an incorrect repeated.
Pointer heap traversal records every repeated reference rather than expanding or hiding aliases · case 03
The bounded complete tree certificate certificate reports an incorrect repeated.
Pointer heap traversal records every repeated reference rather than expanding or hiding aliases · case 04
The bounded complete tree certificate certificate reports an incorrect repeated.
Pointer heap traversal records every repeated reference rather than expanding or hiding aliases · case 05
The bounded complete tree certificate certificate reports an incorrect repeated.
Pointer heap completeness requires gap-free conceptual array positions as well as reachability · case 01
The bounded complete tree certificate certificate reports an incorrect complete.
Pointer heap completeness requires gap-free conceptual array positions as well as reachability · case 02
The bounded complete tree certificate certificate reports an incorrect complete.
Pointer heap completeness requires gap-free conceptual array positions as well as reachability · case 03
The bounded complete tree certificate certificate reports an incorrect complete.
Pointer heap completeness requires gap-free conceptual array positions as well as reachability · case 04
The bounded complete tree certificate certificate reports an incorrect complete.
Pointer heap completeness requires gap-free conceptual array positions as well as reachability · case 05
The bounded complete tree certificate certificate reports an incorrect complete.
Pointer heap right-child holes violate completeness while a final left child is legal · case 01
The bounded complete tree certificate certificate reports an incorrect right only.
Pointer heap right-child holes violate completeness while a final left child is legal · case 02
The bounded complete tree certificate certificate reports an incorrect right only.
Pointer heap right-child holes violate completeness while a final left child is legal · case 03
The bounded complete tree certificate certificate reports an incorrect right only.
Pointer heap right-child holes violate completeness while a final left child is legal · case 04
The bounded complete tree certificate certificate reports an incorrect right only.
Pointer heap right-child holes violate completeness while a final left child is legal · case 05
The bounded complete tree certificate certificate reports an incorrect right only.
Pointer heap parent multiplicity counts duplicate child links independently · case 01
The bounded complete tree certificate certificate reports an incorrect incoming.
Pointer heap parent multiplicity counts duplicate child links independently · case 02
The bounded complete tree certificate certificate reports an incorrect incoming.
Pointer heap parent multiplicity counts duplicate child links independently · case 03
The bounded complete tree certificate certificate reports an incorrect incoming.
Pointer heap parent multiplicity counts duplicate child links independently · case 04
The bounded complete tree certificate certificate reports an incorrect incoming.
Pointer heap parent multiplicity counts duplicate child links independently · case 05
The bounded complete tree certificate certificate reports an incorrect incoming.
Tournament padding retains exact powers of two without doubling them · case 01
The bounded tournament padding certificate reports an incorrect capacity.
Tournament padding retains exact powers of two without doubling them · case 02
The bounded tournament padding certificate reports an incorrect capacity.
Tournament padding retains exact powers of two without doubling them · case 03
The bounded tournament padding certificate reports an incorrect capacity.
Tournament padding retains exact powers of two without doubling them · case 04
The bounded tournament padding certificate reports an incorrect capacity.
Tournament padding retains exact powers of two without doubling them · case 05
The bounded tournament padding certificate reports an incorrect capacity.
Tournament padding uses inactive tail leaves rather than numeric zero sentinels · case 01
The bounded tournament padding certificate reports an incorrect leaves.
Tournament padding uses inactive tail leaves rather than numeric zero sentinels · case 02
The bounded tournament padding certificate reports an incorrect leaves.
Tournament padding uses inactive tail leaves rather than numeric zero sentinels · case 03
The bounded tournament padding certificate reports an incorrect leaves.
Tournament padding uses inactive tail leaves rather than numeric zero sentinels · case 04
The bounded tournament padding certificate reports an incorrect leaves.
Tournament padding uses inactive tail leaves rather than numeric zero sentinels · case 05
The bounded tournament padding certificate reports an incorrect leaves.
Tournament inactive padding cannot use a finite incumbent priority · case 01
The bounded tournament padding certificate reports an incorrect champion.
Tournament inactive padding cannot use a finite incumbent priority · case 02
The bounded tournament padding certificate reports an incorrect champion.
Tournament inactive padding cannot use a finite incumbent priority · case 03
The bounded tournament padding certificate reports an incorrect champion.
Tournament inactive padding cannot use a finite incumbent priority · case 04
The bounded tournament padding certificate reports an incorrect champion.
Tournament inactive padding cannot use a finite incumbent priority · case 05
The bounded tournament padding certificate reports an incorrect champion.
Tournament depth counts tree levels rather than total matches · case 01
The bounded tournament padding certificate reports an incorrect rounds.
Tournament depth counts tree levels rather than total matches · case 02
The bounded tournament padding certificate reports an incorrect rounds.
Tournament depth counts tree levels rather than total matches · case 03
The bounded tournament padding certificate reports an incorrect rounds.
Tournament depth counts tree levels rather than total matches · case 04
The bounded tournament padding certificate reports an incorrect rounds.
Tournament depth counts tree levels rather than total matches · case 05
The bounded tournament padding certificate reports an incorrect rounds.
Tournament active leaves occupy original slots before trailing padding · case 01
The bounded tournament padding certificate reports an incorrect active indices.
Tournament active leaves occupy original slots before trailing padding · case 02
The bounded tournament padding certificate reports an incorrect active indices.
Tournament active leaves occupy original slots before trailing padding · case 03
The bounded tournament padding certificate reports an incorrect active indices.
Tournament active leaves occupy original slots before trailing padding · case 04
The bounded tournament padding certificate reports an incorrect active indices.
Tournament active leaves occupy original slots before trailing padding · case 05
The bounded tournament padding certificate reports an incorrect active indices.
Tournament inactive byes incur no key comparisons · case 01
The bounded tournament padding certificate reports an incorrect key comparisons.
Tournament inactive byes incur no key comparisons · case 02
The bounded tournament padding certificate reports an incorrect key comparisons.
Tournament inactive byes incur no key comparisons · case 03
The bounded tournament padding certificate reports an incorrect key comparisons.
Tournament inactive byes incur no key comparisons · case 04
The bounded tournament padding certificate reports an incorrect key comparisons.
Tournament inactive byes incur no key comparisons · case 05
The bounded tournament padding certificate reports an incorrect key comparisons.
Rank-loss recomputation distinguishes equal from unequal child ranks · case 01
The bounded rank loss propagation certificate reports an incorrect computed.
Rank-loss recomputation distinguishes equal from unequal child ranks · case 02
The bounded rank loss propagation certificate reports an incorrect computed.
Rank-loss recomputation distinguishes equal from unequal child ranks · case 03
The bounded rank loss propagation certificate reports an incorrect computed.
Rank-loss recomputation distinguishes equal from unequal child ranks · case 04
The bounded rank loss propagation certificate reports an incorrect computed.
Rank-loss recomputation distinguishes equal from unequal child ranks · case 05
The bounded rank loss propagation certificate reports an incorrect computed.
Rank-loss propagation stops at the first unchanged ancestor · case 01
The bounded rank loss propagation certificate reports an incorrect decreased.
Rank-loss propagation stops at the first unchanged ancestor · case 02
The bounded rank loss propagation certificate reports an incorrect decreased.
Rank-loss propagation stops at the first unchanged ancestor · case 03
The bounded rank loss propagation certificate reports an incorrect decreased.
Rank-loss propagation stops at the first unchanged ancestor · case 04
The bounded rank loss propagation certificate reports an incorrect decreased.
Rank-loss propagation stops at the first unchanged ancestor · case 05
The bounded rank loss propagation certificate reports an incorrect decreased.
Rank-loss propagation identifies its stopping ancestor rather than always reaching the root · case 01
The bounded rank loss propagation certificate reports an incorrect stop.
Rank-loss propagation identifies its stopping ancestor rather than always reaching the root · case 02
The bounded rank loss propagation certificate reports an incorrect stop.
Rank-loss propagation identifies its stopping ancestor rather than always reaching the root · case 03
The bounded rank loss propagation certificate reports an incorrect stop.
Rank-loss propagation identifies its stopping ancestor rather than always reaching the root · case 04
The bounded rank loss propagation certificate reports an incorrect stop.
Rank-loss propagation identifies its stopping ancestor rather than always reaching the root · case 05
The bounded rank loss propagation certificate reports an incorrect stop.
Rank-loss repair preserves unvisited ranks and applies the full local decrease · case 01
The bounded rank loss propagation certificate reports an incorrect prefix ranks.
Rank-loss repair preserves unvisited ranks and applies the full local decrease · case 02
The bounded rank loss propagation certificate reports an incorrect prefix ranks.
Rank-loss repair preserves unvisited ranks and applies the full local decrease · case 03
The bounded rank loss propagation certificate reports an incorrect prefix ranks.
Rank-loss repair preserves unvisited ranks and applies the full local decrease · case 04
The bounded rank loss propagation certificate reports an incorrect prefix ranks.
Rank-loss repair preserves unvisited ranks and applies the full local decrease · case 05
The bounded rank loss propagation certificate reports an incorrect prefix ranks.
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 ↗