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
Hypergeometric numerator · case 01
Independent selection counts are added instead of multiplied.
Hypergeometric numerator · case 02
Independent selection counts are added instead of multiplied.
Hypergeometric numerator · case 03
Independent selection counts are added instead of multiplied.
Hypergeometric numerator · case 04
Independent selection counts are added instead of multiplied.
Hypergeometric numerator · case 05
Independent selection counts are added instead of multiplied.
Birthday distinct assignments · case 01
Colliding assignments remain in the sample count.
Birthday distinct assignments · case 02
Colliding assignments remain in the sample count.
Birthday distinct assignments · case 03
Colliding assignments remain in the sample count.
Birthday distinct assignments · case 04
Colliding assignments remain in the sample count.
Birthday distinct assignments · case 05
Colliding assignments remain in the sample count.
Tournament round robin games · case 01
Each game is counted from both participating teams.
Tournament round robin games · case 02
Each game is counted from both participating teams.
Tournament round robin games · case 03
Each game is counted from both participating teams.
Tournament round robin games · case 04
Each game is counted from both participating teams.
Tournament round robin games · case 05
Each game is counted from both participating teams.
Full binary tree leaf identity · case 01
Outgoing child links are confused with leaves.
Full binary tree leaf identity · case 02
Outgoing child links are confused with leaves.
Full binary tree leaf identity · case 03
Outgoing child links are confused with leaves.
Full binary tree leaf identity · case 04
Outgoing child links are confused with leaves.
Full binary tree leaf identity · case 05
Outgoing child links are confused with leaves.
Perfect binary tree total nodes · case 01
The root-at-height-zero convention is shifted by one.
Perfect binary tree total nodes · case 02
The root-at-height-zero convention is shifted by one.
Perfect binary tree total nodes · case 03
The root-at-height-zero convention is shifted by one.
Perfect binary tree total nodes · case 04
The root-at-height-zero convention is shifted by one.
Perfect binary tree total nodes · case 05
The root-at-height-zero convention is shifted by one.
Nonadjacent subset count fixed size · case 01
Selections containing adjacent positions are not excluded.
Nonadjacent subset count fixed size · case 02
Selections containing adjacent positions are not excluded.
Nonadjacent subset count fixed size · case 03
Selections containing adjacent positions are not excluded.
Nonadjacent subset count fixed size · case 04
Selections containing adjacent positions are not excluded.
Nonadjacent subset count fixed size · case 05
Selections containing adjacent positions are not excluded.
Binary strings no adjacent ones · case 01
All bit strings are counted despite the adjacency constraint.
Binary strings no adjacent ones · case 02
All bit strings are counted despite the adjacency constraint.
Binary strings no adjacent ones · case 03
All bit strings are counted despite the adjacency constraint.
Binary strings no adjacent ones · case 04
All bit strings are counted despite the adjacency constraint.
Binary strings no adjacent ones · case 05
All bit strings are counted despite the adjacency constraint.
Even subset count · case 01
Odd-cardinality subsets are included.
Even subset count · case 02
Odd-cardinality subsets are included.
Even subset count · case 03
Odd-cardinality subsets are included.
Even subset count · case 04
Odd-cardinality subsets are included.
Even subset count · case 05
Odd-cardinality subsets are included.
Cumulative binomial count · case 01
An exact-cardinality count replaces a cumulative count.
Cumulative binomial count · case 02
An exact-cardinality count replaces a cumulative count.
Cumulative binomial count · case 03
An exact-cardinality count replaces a cumulative count.
Cumulative binomial count · case 04
An exact-cardinality count replaces a cumulative count.
Cumulative binomial count · case 05
An exact-cardinality count replaces a cumulative count.
Ordered distinct triples · case 01
Repeated members are allowed within a triple.
Ordered distinct triples · case 02
Repeated members are allowed within a triple.
Ordered distinct triples · case 03
Repeated members are allowed within a triple.
Ordered distinct triples · case 04
Repeated members are allowed within a triple.
Ordered distinct triples · case 05
Repeated members are allowed within a triple.
Balanced ternary digit value · case 01
Most-significant-first balanced ternary is evaluated backwards.
Balanced ternary digit value · case 02
Most-significant-first balanced ternary is evaluated backwards.
Balanced ternary digit value · case 03
Most-significant-first balanced ternary is evaluated backwards.
Balanced ternary digit value · case 04
Most-significant-first balanced ternary is evaluated backwards.
Balanced ternary digit value · case 05
Most-significant-first balanced ternary is evaluated backwards.
Factoradic digit value · case 01
Decimal positional weights replace factorial weights.
Factoradic digit value · case 02
Decimal positional weights replace factorial weights.
Factoradic digit value · case 03
Decimal positional weights replace factorial weights.
Factoradic digit value · case 04
Decimal positional weights replace factorial weights.
Factoradic digit value · case 05
Decimal positional weights replace factorial weights.
Oriented triangle double area · case 01
The determinant adds its cross terms instead of subtracting.
Oriented triangle double area · case 02
The determinant adds its cross terms instead of subtracting.
Oriented triangle double area · case 03
The determinant adds its cross terms instead of subtracting.
Oriented triangle double area · case 04
The determinant adds its cross terms instead of subtracting.
Oriented triangle double area · case 05
The determinant adds its cross terms instead of subtracting.
Triangle area base height · case 01
A triangle is assigned the enclosing parallelogram area.
Triangle area base height · case 02
A triangle is assigned the enclosing parallelogram area.
Triangle area base height · case 03
A triangle is assigned the enclosing parallelogram area.
Triangle area base height · case 04
A triangle is assigned the enclosing parallelogram area.
Triangle area base height · case 05
A triangle is assigned the enclosing parallelogram area.
Rectangle intersection area · case 01
Separated axis extents are multiplied as negative lengths.
Rectangle intersection area · case 02
Separated axis extents are multiplied as negative lengths.
Rectangle intersection area · case 03
Separated axis extents are multiplied as negative lengths.
Rectangle intersection area · case 04
Separated axis extents are multiplied as negative lengths.
Rectangle intersection area · case 05
Separated axis extents are multiplied as negative lengths.
Rectangle union area · case 01
Overlapping area is counted twice.
Rectangle union area · case 02
Overlapping area is counted twice.
Rectangle union area · case 03
Overlapping area is counted twice.
Rectangle union area · case 04
Overlapping area is counted twice.
Rectangle union area · case 05
Overlapping area is counted twice.
Squared point distance · case 01
Manhattan distance replaces squared Euclidean distance.
Squared point distance · case 02
Manhattan distance replaces squared Euclidean distance.
Squared point distance · case 03
Manhattan distance replaces squared Euclidean distance.
Squared point distance · case 04
Manhattan distance replaces squared Euclidean distance.
Squared point distance · case 05
Manhattan distance replaces squared Euclidean distance.
Manhattan point distance · case 01
Taking one final absolute value permits coordinate cancellation.
Manhattan point distance · case 02
Taking one final absolute value permits coordinate cancellation.
Manhattan point distance · case 03
Taking one final absolute value permits coordinate cancellation.
Manhattan point distance · case 04
Taking one final absolute value permits coordinate cancellation.
Manhattan point distance · case 05
Taking one final absolute value permits coordinate cancellation.
Chebyshev point distance · case 01
Summing coordinates uses the Manhattan norm.
Chebyshev point distance · case 02
Summing coordinates uses the Manhattan norm.
Chebyshev point distance · case 03
Summing coordinates uses the Manhattan norm.
Chebyshev point distance · case 04
Summing coordinates uses the Manhattan norm.
Chebyshev point distance · case 05
Summing coordinates uses the Manhattan norm.
Circle area divided by pi · case 01
Circumference scaling is used for an area.
Circle area divided by pi · case 02
Circumference scaling is used for an area.
Circle area divided by pi · case 03
Circumference scaling is used for an area.
Circle area divided by pi · case 04
Circumference scaling is used for an area.
Circle area divided by pi · case 05
Circumference scaling is used for an area.
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 ↗