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
Skew meld puts the recursive merge result on the left even when an old left child exists · case 01
The bounded skew meld step certificate reports an incorrect new left.
Skew meld puts the recursive merge result on the left even when an old left child exists · case 02
The bounded skew meld step certificate reports an incorrect new left.
Skew meld puts the recursive merge result on the left even when an old left child exists · case 03
The bounded skew meld step certificate reports an incorrect new left.
Skew meld puts the recursive merge result on the left even when an old left child exists · case 04
The bounded skew meld step certificate reports an incorrect new left.
Skew meld puts the recursive merge result on the left even when an old left child exists · case 05
The bounded skew meld step certificate reports an incorrect new left.
Skew meld preserves the old left subtree as the new right subtree · case 01
The bounded skew meld step certificate reports an incorrect new right.
Skew meld preserves the old left subtree as the new right subtree · case 02
The bounded skew meld step certificate reports an incorrect new right.
Skew meld preserves the old left subtree as the new right subtree · case 03
The bounded skew meld step certificate reports an incorrect new right.
Skew meld preserves the old left subtree as the new right subtree · case 04
The bounded skew meld step certificate reports an incorrect new right.
Skew meld preserves the old left subtree as the new right subtree · case 05
The bounded skew meld step certificate reports an incorrect new right.
Skew meld size includes both disjoint recursive inputs and the chosen root · case 01
The bounded skew meld step certificate reports an incorrect size.
Skew meld size includes both disjoint recursive inputs and the chosen root · case 02
The bounded skew meld step certificate reports an incorrect size.
Skew meld size includes both disjoint recursive inputs and the chosen root · case 03
The bounded skew meld step certificate reports an incorrect size.
Skew meld size includes both disjoint recursive inputs and the chosen root · case 04
The bounded skew meld step certificate reports an incorrect size.
Skew meld size includes both disjoint recursive inputs and the chosen root · case 05
The bounded skew meld step certificate reports an incorrect size.
Skew meld updates parent links after the unconditional child swap · case 01
The bounded skew meld step certificate reports an incorrect rewrites.
Skew meld updates parent links after the unconditional child swap · case 02
The bounded skew meld step certificate reports an incorrect rewrites.
Skew meld updates parent links after the unconditional child swap · case 03
The bounded skew meld step certificate reports an incorrect rewrites.
Skew meld updates parent links after the unconditional child swap · case 04
The bounded skew meld step certificate reports an incorrect rewrites.
Skew meld updates parent links after the unconditional child swap · case 05
The bounded skew meld step certificate reports an incorrect rewrites.
Skew meld traversal follows swapped structure rather than identifier ordering · case 01
The bounded skew meld step certificate reports an incorrect preorder children.
Skew meld traversal follows swapped structure rather than identifier ordering · case 02
The bounded skew meld step certificate reports an incorrect preorder children.
Skew meld traversal follows swapped structure rather than identifier ordering · case 03
The bounded skew meld step certificate reports an incorrect preorder children.
Skew meld traversal follows swapped structure rather than identifier ordering · case 04
The bounded skew meld step certificate reports an incorrect preorder children.
Skew meld traversal follows swapped structure rather than identifier ordering · case 05
The bounded skew meld step certificate reports an incorrect preorder children.
Skew meld retains a unary subtree instead of misclassifying the winner as a leaf · case 01
The bounded skew meld step certificate reports an incorrect leaf.
Skew meld retains a unary subtree instead of misclassifying the winner as a leaf · case 02
The bounded skew meld step certificate reports an incorrect leaf.
Skew meld retains a unary subtree instead of misclassifying the winner as a leaf · case 03
The bounded skew meld step certificate reports an incorrect leaf.
Skew meld retains a unary subtree instead of misclassifying the winner as a leaf · case 04
The bounded skew meld step certificate reports an incorrect leaf.
Skew meld retains a unary subtree instead of misclassifying the winner as a leaf · case 05
The bounded skew meld step certificate reports an incorrect leaf.
Radix redistribution advances last to the minimum of the selected bucket · case 01
The bounded radix redistribute certificate reports an incorrect threshold.
Radix redistribution advances last to the minimum of the selected bucket · case 02
The bounded radix redistribute certificate reports an incorrect threshold.
Radix redistribution advances last to the minimum of the selected bucket · case 03
The bounded radix redistribute certificate reports an incorrect threshold.
Radix redistribution advances last to the minimum of the selected bucket · case 04
The bounded radix redistribute certificate reports an incorrect threshold.
Radix redistribution advances last to the minimum of the selected bucket · case 05
The bounded radix redistribute certificate reports an incorrect threshold.
Radix redistribution recomputes differing bits against the new threshold · case 01
The bounded radix redistribute certificate reports an incorrect destinations.
Radix redistribution recomputes differing bits against the new threshold · case 02
The bounded radix redistribute certificate reports an incorrect destinations.
Radix redistribution recomputes differing bits against the new threshold · case 03
The bounded radix redistribute certificate reports an incorrect destinations.
Radix redistribution recomputes differing bits against the new threshold · case 04
The bounded radix redistribute certificate reports an incorrect destinations.
Radix redistribution recomputes differing bits against the new threshold · case 05
The bounded radix redistribute certificate reports an incorrect destinations.
Radix redistribution collects every equal-minimum key into bucket zero · case 01
The bounded radix redistribute certificate reports an incorrect zero ids.
Radix redistribution collects every equal-minimum key into bucket zero · case 02
The bounded radix redistribute certificate reports an incorrect zero ids.
Radix redistribution collects every equal-minimum key into bucket zero · case 03
The bounded radix redistribute certificate reports an incorrect zero ids.
Radix redistribution collects every equal-minimum key into bucket zero · case 04
The bounded radix redistribute certificate reports an incorrect zero ids.
Radix redistribution collects every equal-minimum key into bucket zero · case 05
The bounded radix redistribute certificate reports an incorrect zero ids.
Radix redistribution preserves multiplicity of equal priorities · case 01
The bounded radix redistribute certificate reports an incorrect moved.
Radix redistribution preserves multiplicity of equal priorities · case 02
The bounded radix redistribute certificate reports an incorrect moved.
Radix redistribution preserves multiplicity of equal priorities · case 03
The bounded radix redistribute certificate reports an incorrect moved.
Radix redistribution preserves multiplicity of equal priorities · case 04
The bounded radix redistribute certificate reports an incorrect moved.
Radix redistribution preserves multiplicity of equal priorities · case 05
The bounded radix redistribute certificate reports an incorrect moved.
Radix redistribution empties the whole source bucket after repartition · case 01
The bounded radix redistribute certificate reports an incorrect source after.
Radix redistribution empties the whole source bucket after repartition · case 02
The bounded radix redistribute certificate reports an incorrect source after.
Radix redistribution empties the whole source bucket after repartition · case 03
The bounded radix redistribute certificate reports an incorrect source after.
Radix redistribution empties the whole source bucket after repartition · case 04
The bounded radix redistribute certificate reports an incorrect source after.
Radix redistribution empties the whole source bucket after repartition · case 05
The bounded radix redistribute certificate reports an incorrect source after.
Radix redistribution reports the actual highest new bucket including its top differing bit · case 01
The bounded radix redistribute certificate reports an incorrect largest destination.
Radix redistribution reports the actual highest new bucket including its top differing bit · case 02
The bounded radix redistribute certificate reports an incorrect largest destination.
Radix redistribution reports the actual highest new bucket including its top differing bit · case 03
The bounded radix redistribute certificate reports an incorrect largest destination.
Radix redistribution reports the actual highest new bucket including its top differing bit · case 04
The bounded radix redistribute certificate reports an incorrect largest destination.
Radix redistribution reports the actual highest new bucket including its top differing bit · case 05
The bounded radix redistribute certificate reports an incorrect largest destination.
Indexed heap swap preserves the displaced record instead of overwriting it · case 01
The bounded indexed swap certificate reports an incorrect slots.
Indexed heap swap preserves the displaced record instead of overwriting it · case 02
The bounded indexed swap certificate reports an incorrect slots.
Indexed heap swap preserves the displaced record instead of overwriting it · case 03
The bounded indexed swap certificate reports an incorrect slots.
Indexed heap swap preserves the displaced record instead of overwriting it · case 04
The bounded indexed swap certificate reports an incorrect slots.
Indexed heap swap preserves the displaced record instead of overwriting it · case 05
The bounded indexed swap certificate reports an incorrect slots.
Indexed heap swap updates both moved handles in the inverse map · case 01
The bounded indexed swap certificate reports an incorrect positions.
Indexed heap swap updates both moved handles in the inverse map · case 02
The bounded indexed swap certificate reports an incorrect positions.
Indexed heap swap updates both moved handles in the inverse map · case 03
The bounded indexed swap certificate reports an incorrect positions.
Indexed heap swap updates both moved handles in the inverse map · case 04
The bounded indexed swap certificate reports an incorrect positions.
Indexed heap swap updates both moved handles in the inverse map · case 05
The bounded indexed swap certificate reports an incorrect positions.
Indexed heap swap captures the first identity before mutation · case 01
The bounded indexed swap certificate reports an incorrect first moved.
Indexed heap swap captures the first identity before mutation · case 02
The bounded indexed swap certificate reports an incorrect first moved.
Indexed heap swap captures the first identity before mutation · case 03
The bounded indexed swap certificate reports an incorrect first moved.
Indexed heap swap captures the first identity before mutation · case 04
The bounded indexed swap certificate reports an incorrect first moved.
Indexed heap swap captures the first identity before mutation · case 05
The bounded indexed swap certificate reports an incorrect first moved.
Indexed heap swap captures the displaced identity before mutation · case 01
The bounded indexed swap certificate reports an incorrect second moved.
Indexed heap swap captures the displaced identity before mutation · case 02
The bounded indexed swap certificate reports an incorrect second moved.
Indexed heap swap captures the displaced identity before mutation · case 03
The bounded indexed swap certificate reports an incorrect second moved.
Indexed heap swap captures the displaced identity before mutation · case 04
The bounded indexed swap certificate reports an incorrect second moved.
Indexed heap swap captures the displaced identity before mutation · case 05
The bounded indexed swap certificate reports an incorrect second moved.
Indexed self-swap emits no spurious relocation notification · case 01
The bounded indexed swap certificate reports an incorrect changed handles.
Indexed self-swap emits no spurious relocation notification · case 02
The bounded indexed swap certificate reports an incorrect changed handles.
Indexed self-swap emits no spurious relocation notification · case 03
The bounded indexed swap certificate reports an incorrect changed handles.
Indexed self-swap emits no spurious relocation notification · case 04
The bounded indexed swap certificate reports an incorrect changed handles.
Indexed self-swap emits no spurious relocation notification · case 05
The bounded indexed swap certificate reports an incorrect changed handles.
Indexed heap relocation certificate requires a bijection even for self-swap · case 01
The bounded indexed swap certificate reports an incorrect bijective.
Indexed heap relocation certificate requires a bijection even for self-swap · case 02
The bounded indexed swap certificate reports an incorrect bijective.
Indexed heap relocation certificate requires a bijection even for self-swap · case 03
The bounded indexed swap certificate reports an incorrect bijective.
Indexed heap relocation certificate requires a bijection even for self-swap · case 04
The bounded indexed swap certificate reports an incorrect bijective.
Indexed heap relocation certificate requires a bijection even for self-swap · case 05
The bounded indexed swap certificate reports an incorrect bijective.
Heap handle resolution must reject a foreign owner even with matching slot generation · case 01
The bounded handle generation certificate reports an incorrect owners.
Heap handle resolution must reject a foreign owner even with matching slot generation · case 02
The bounded handle generation certificate reports an incorrect owners.
Heap handle resolution must reject a foreign owner even with matching slot generation · case 03
The bounded handle generation certificate reports an incorrect owners.
Heap handle resolution must reject a foreign owner even with matching slot generation · case 04
The bounded handle generation certificate reports an incorrect owners.
Heap handle resolution must reject a foreign owner even with matching slot generation · case 05
The bounded handle generation certificate reports an incorrect owners.
Heap handle slot zero is valid while negative Python indices are not · case 01
The bounded handle generation certificate reports an incorrect bounds.
Heap handle slot zero is valid while negative Python indices are not · case 02
The bounded handle generation certificate reports an incorrect bounds.
Heap handle slot zero is valid while negative Python indices are not · case 03
The bounded handle generation certificate reports an incorrect bounds.
Heap handle slot zero is valid while negative Python indices are not · case 04
The bounded handle generation certificate reports an incorrect bounds.
Heap handle slot zero is valid while negative Python indices are not · case 05
The bounded handle generation certificate reports an incorrect bounds.
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 ↗