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
Fibonacci cut clears loss history even for a promoted internal node · case 01
The bounded fibonacci cut certificate reports an incorrect mark.
Fibonacci cut clears loss history even for a promoted internal node · case 02
The bounded fibonacci cut certificate reports an incorrect mark.
Fibonacci cut clears loss history even for a promoted internal node · case 03
The bounded fibonacci cut certificate reports an incorrect mark.
Fibonacci cut clears loss history even for a promoted internal node · case 04
The bounded fibonacci cut certificate reports an incorrect mark.
Fibonacci cut clears loss history even for a promoted internal node · case 05
The bounded fibonacci cut certificate reports an incorrect mark.
Fibonacci cut preserves the promoted subtree without absorbing its former parent · case 01
The bounded fibonacci cut certificate reports an incorrect descendants.
Fibonacci cut preserves the promoted subtree without absorbing its former parent · case 02
The bounded fibonacci cut certificate reports an incorrect descendants.
Fibonacci cut preserves the promoted subtree without absorbing its former parent · case 03
The bounded fibonacci cut certificate reports an incorrect descendants.
Fibonacci cut preserves the promoted subtree without absorbing its former parent · case 04
The bounded fibonacci cut certificate reports an incorrect descendants.
Fibonacci cut preserves the promoted subtree without absorbing its former parent · case 05
The bounded fibonacci cut certificate reports an incorrect descendants.
Fibonacci cascading cut stops at the first unmarked ancestor · case 01
The bounded fibonacci cascade certificate reports an incorrect cuts.
Fibonacci cascading cut stops at the first unmarked ancestor · case 02
The bounded fibonacci cascade certificate reports an incorrect cuts.
Fibonacci cascading cut stops at the first unmarked ancestor · case 03
The bounded fibonacci cascade certificate reports an incorrect cuts.
Fibonacci cascading cut stops at the first unmarked ancestor · case 04
The bounded fibonacci cascade certificate reports an incorrect cuts.
Fibonacci cascading cut stops at the first unmarked ancestor · case 05
The bounded fibonacci cascade certificate reports an incorrect cuts.
Fibonacci cascade never marks a root · case 01
The bounded fibonacci cascade certificate reports an incorrect new mark.
Fibonacci cascade never marks a root · case 02
The bounded fibonacci cascade certificate reports an incorrect new mark.
Fibonacci cascade never marks a root · case 03
The bounded fibonacci cascade certificate reports an incorrect new mark.
Fibonacci cascade never marks a root · case 04
The bounded fibonacci cascade certificate reports an incorrect new mark.
Fibonacci cascade never marks a root · case 05
The bounded fibonacci cascade certificate reports an incorrect new mark.
Fibonacci cascade clears each promoted ancestor mark including the last cut · case 01
The bounded fibonacci cascade certificate reports an incorrect cleared.
Fibonacci cascade clears each promoted ancestor mark including the last cut · case 02
The bounded fibonacci cascade certificate reports an incorrect cleared.
Fibonacci cascade clears each promoted ancestor mark including the last cut · case 03
The bounded fibonacci cascade certificate reports an incorrect cleared.
Fibonacci cascade clears each promoted ancestor mark including the last cut · case 04
The bounded fibonacci cascade certificate reports an incorrect cleared.
Fibonacci cascade clears each promoted ancestor mark including the last cut · case 05
The bounded fibonacci cascade certificate reports an incorrect cleared.
Fibonacci cascade counts the stopping ancestor without scanning above it · case 01
The bounded fibonacci cascade certificate reports an incorrect visits.
Fibonacci cascade counts the stopping ancestor without scanning above it · case 02
The bounded fibonacci cascade certificate reports an incorrect visits.
Fibonacci cascade counts the stopping ancestor without scanning above it · case 03
The bounded fibonacci cascade certificate reports an incorrect visits.
Fibonacci cascade counts the stopping ancestor without scanning above it · case 04
The bounded fibonacci cascade certificate reports an incorrect visits.
Fibonacci cascade counts the stopping ancestor without scanning above it · case 05
The bounded fibonacci cascade certificate reports an incorrect visits.
Fibonacci cascade promotes marked nonroots only · case 01
The bounded fibonacci cascade certificate reports an incorrect promoted count.
Fibonacci cascade promotes marked nonroots only · case 02
The bounded fibonacci cascade certificate reports an incorrect promoted count.
Fibonacci cascade promotes marked nonroots only · case 03
The bounded fibonacci cascade certificate reports an incorrect promoted count.
Fibonacci cascade promotes marked nonroots only · case 04
The bounded fibonacci cascade certificate reports an incorrect promoted count.
Fibonacci cascade promotes marked nonroots only · case 05
The bounded fibonacci cascade certificate reports an incorrect promoted count.
Fibonacci cascade potential includes one new root and one cleared mark per cut · case 01
The bounded fibonacci cascade certificate reports an incorrect potential delta.
Fibonacci cascade potential includes one new root and one cleared mark per cut · case 02
The bounded fibonacci cascade certificate reports an incorrect potential delta.
Fibonacci cascade potential includes one new root and one cleared mark per cut · case 03
The bounded fibonacci cascade certificate reports an incorrect potential delta.
Fibonacci cascade potential includes one new root and one cleared mark per cut · case 04
The bounded fibonacci cascade certificate reports an incorrect potential delta.
Fibonacci cascade potential includes one new root and one cleared mark per cut · case 05
The bounded fibonacci cascade certificate reports an incorrect potential delta.
Pairing first pass consumes disjoint pairs beginning at the first child · case 01
The bounded pairing pass certificate reports an incorrect pairs.
Pairing first pass consumes disjoint pairs beginning at the first child · case 02
The bounded pairing pass certificate reports an incorrect pairs.
Pairing first pass consumes disjoint pairs beginning at the first child · case 03
The bounded pairing pass certificate reports an incorrect pairs.
Pairing first pass consumes disjoint pairs beginning at the first child · case 04
The bounded pairing pass certificate reports an incorrect pairs.
Pairing first pass consumes disjoint pairs beginning at the first child · case 05
The bounded pairing pass certificate reports an incorrect pairs.
Pairing pass selects each pair by priority rather than child id · case 01
The bounded pairing pass certificate reports an incorrect winners.
Pairing pass selects each pair by priority rather than child id · case 02
The bounded pairing pass certificate reports an incorrect winners.
Pairing pass selects each pair by priority rather than child id · case 03
The bounded pairing pass certificate reports an incorrect winners.
Pairing pass selects each pair by priority rather than child id · case 04
The bounded pairing pass certificate reports an incorrect winners.
Pairing pass selects each pair by priority rather than child id · case 05
The bounded pairing pass certificate reports an incorrect winners.
Pairing pass attaches the actual losing root when the right child wins · case 01
The bounded pairing pass certificate reports an incorrect losers.
Pairing pass attaches the actual losing root when the right child wins · case 02
The bounded pairing pass certificate reports an incorrect losers.
Pairing pass attaches the actual losing root when the right child wins · case 03
The bounded pairing pass certificate reports an incorrect losers.
Pairing pass attaches the actual losing root when the right child wins · case 04
The bounded pairing pass certificate reports an incorrect losers.
Pairing pass attaches the actual losing root when the right child wins · case 05
The bounded pairing pass certificate reports an incorrect losers.
Pairing pass carries only an unpaired final child · case 01
The bounded pairing pass certificate reports an incorrect carry.
Pairing pass carries only an unpaired final child · case 02
The bounded pairing pass certificate reports an incorrect carry.
Pairing pass carries only an unpaired final child · case 03
The bounded pairing pass certificate reports an incorrect carry.
Pairing pass carries only an unpaired final child · case 04
The bounded pairing pass certificate reports an incorrect carry.
Pairing pass carries only an unpaired final child · case 05
The bounded pairing pass certificate reports an incorrect carry.
Pairing second pass folds from the right including an odd carry · case 01
The bounded pairing pass certificate reports an incorrect fold order.
Pairing second pass folds from the right including an odd carry · case 02
The bounded pairing pass certificate reports an incorrect fold order.
Pairing second pass folds from the right including an odd carry · case 03
The bounded pairing pass certificate reports an incorrect fold order.
Pairing second pass folds from the right including an odd carry · case 04
The bounded pairing pass certificate reports an incorrect fold order.
Pairing second pass folds from the right including an odd carry · case 05
The bounded pairing pass certificate reports an incorrect fold order.
Pairing delete-min accounts for both pairing and accumulation comparisons · case 01
The bounded pairing pass certificate reports an incorrect comparisons.
Pairing delete-min accounts for both pairing and accumulation comparisons · case 02
The bounded pairing pass certificate reports an incorrect comparisons.
Pairing delete-min accounts for both pairing and accumulation comparisons · case 03
The bounded pairing pass certificate reports an incorrect comparisons.
Pairing delete-min accounts for both pairing and accumulation comparisons · case 04
The bounded pairing pass certificate reports an incorrect comparisons.
Pairing delete-min accounts for both pairing and accumulation comparisons · case 05
The bounded pairing pass certificate reports an incorrect comparisons.
Leftist unwind swaps only when the returned right rank exceeds the left rank · case 01
The bounded leftist meld step certificate reports an incorrect left id.
Leftist unwind swaps only when the returned right rank exceeds the left rank · case 02
The bounded leftist meld step certificate reports an incorrect left id.
Leftist unwind swaps only when the returned right rank exceeds the left rank · case 03
The bounded leftist meld step certificate reports an incorrect left id.
Leftist unwind swaps only when the returned right rank exceeds the left rank · case 04
The bounded leftist meld step certificate reports an incorrect left id.
Leftist unwind swaps only when the returned right rank exceeds the left rank · case 05
The bounded leftist meld step certificate reports an incorrect left id.
Leftist unwind retains both subtrees when restoring orientation · case 01
The bounded leftist meld step certificate reports an incorrect right id.
Leftist unwind retains both subtrees when restoring orientation · case 02
The bounded leftist meld step certificate reports an incorrect right id.
Leftist unwind retains both subtrees when restoring orientation · case 03
The bounded leftist meld step certificate reports an incorrect right id.
Leftist unwind retains both subtrees when restoring orientation · case 04
The bounded leftist meld step certificate reports an incorrect right id.
Leftist unwind retains both subtrees when restoring orientation · case 05
The bounded leftist meld step certificate reports an incorrect right id.
Leftist unwind derives rank from the shorter oriented right subtree · case 01
The bounded leftist meld step certificate reports an incorrect npl.
Leftist unwind derives rank from the shorter oriented right subtree · case 02
The bounded leftist meld step certificate reports an incorrect npl.
Leftist unwind derives rank from the shorter oriented right subtree · case 03
The bounded leftist meld step certificate reports an incorrect npl.
Leftist unwind derives rank from the shorter oriented right subtree · case 04
The bounded leftist meld step certificate reports an incorrect npl.
Leftist unwind derives rank from the shorter oriented right subtree · case 05
The bounded leftist meld step certificate reports an incorrect npl.
Leftist unwind counts the root and both disjoint subtrees · case 01
The bounded leftist meld step certificate reports an incorrect size.
Leftist unwind counts the root and both disjoint subtrees · case 02
The bounded leftist meld step certificate reports an incorrect size.
Leftist unwind counts the root and both disjoint subtrees · case 03
The bounded leftist meld step certificate reports an incorrect size.
Leftist unwind counts the root and both disjoint subtrees · case 04
The bounded leftist meld step certificate reports an incorrect size.
Leftist unwind counts the root and both disjoint subtrees · case 05
The bounded leftist meld step certificate reports an incorrect size.
Leftist unwind preserves equal-rank child orientation · case 01
The bounded leftist meld step certificate reports an incorrect swap.
Leftist unwind preserves equal-rank child orientation · case 02
The bounded leftist meld step certificate reports an incorrect swap.
Leftist unwind preserves equal-rank child orientation · case 03
The bounded leftist meld step certificate reports an incorrect swap.
Leftist unwind preserves equal-rank child orientation · case 04
The bounded leftist meld step certificate reports an incorrect swap.
Leftist unwind preserves equal-rank child orientation · case 05
The bounded leftist meld step certificate reports an incorrect swap.
Leftist meld rewrites both surviving child parent links toward the chosen root · case 01
The bounded leftist meld step certificate reports an incorrect parent assignments.
Leftist meld rewrites both surviving child parent links toward the chosen root · case 02
The bounded leftist meld step certificate reports an incorrect parent assignments.
Leftist meld rewrites both surviving child parent links toward the chosen root · case 03
The bounded leftist meld step certificate reports an incorrect parent assignments.
Leftist meld rewrites both surviving child parent links toward the chosen root · case 04
The bounded leftist meld step certificate reports an incorrect parent assignments.
Leftist meld rewrites both surviving child parent links toward the chosen root · case 05
The bounded leftist meld step certificate reports an incorrect parent assignments.
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 ↗