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
Maximum subarray block summary: A new block peak replaces a better earlier peak. · case 01
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: A new block peak replaces a better earlier peak. · case 02
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: A new block peak replaces a better earlier peak. · case 03
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: A new block peak replaces a better earlier peak. · case 04
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: A new block peak replaces a better earlier peak. · case 05
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The local interval loop excludes the terminal observation. · case 01
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The local interval loop excludes the terminal observation. · case 02
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The local interval loop excludes the terminal observation. · case 03
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The local interval loop excludes the terminal observation. · case 04
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The local interval loop excludes the terminal observation. · case 05
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The prefix extension reads the already updated total. · case 01
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The prefix extension reads the already updated total. · case 02
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The prefix extension reads the already updated total. · case 03
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The prefix extension reads the already updated total. · case 04
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: The prefix extension reads the already updated total. · case 05
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: Summaries are merged in sorted block-total order. · case 01
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: Summaries are merged in sorted block-total order. · case 02
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: Summaries are merged in sorted block-total order. · case 03
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: Summaries are merged in sorted block-total order. · case 04
The reduction disagrees with its explicit aggregation oracle.
Maximum subarray block summary: Summaries are merged in sorted block-total order. · case 05
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The run crossing the block boundary is omitted. · case 01
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The run crossing the block boundary is omitted. · case 02
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The run crossing the block boundary is omitted. · case 03
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The run crossing the block boundary is omitted. · case 04
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The run crossing the block boundary is omitted. · case 05
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The prefix continues growing after a previous block already broke it. · case 01
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The prefix continues growing after a previous block already broke it. · case 02
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The prefix continues growing after a previous block already broke it. · case 03
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The prefix continues growing after a previous block already broke it. · case 04
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The prefix continues growing after a previous block already broke it. · case 05
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An entirely positive incoming block replaces the old suffix. · case 01
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An entirely positive incoming block replaces the old suffix. · case 02
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An entirely positive incoming block replaces the old suffix. · case 03
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An entirely positive incoming block replaces the old suffix. · case 04
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An entirely positive incoming block replaces the old suffix. · case 05
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An empty block clears the ongoing suffix. · case 01
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An empty block clears the ongoing suffix. · case 02
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An empty block clears the ongoing suffix. · case 03
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An empty block clears the ongoing suffix. · case 04
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: An empty block clears the ongoing suffix. · case 05
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: Zero is counted as a positive observation. · case 01
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: Zero is counted as a positive observation. · case 02
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: Zero is counted as a positive observation. · case 03
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: Zero is counted as a positive observation. · case 04
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: Zero is counted as a positive observation. · case 05
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: A nonpositive item leaves the local run counter intact. · case 01
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: A nonpositive item leaves the local run counter intact. · case 02
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: A nonpositive item leaves the local run counter intact. · case 03
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: A nonpositive item leaves the local run counter intact. · case 04
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: A nonpositive item leaves the local run counter intact. · case 05
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The all-positive state is replaced by the incoming block flag. · case 01
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The all-positive state is replaced by the incoming block flag. · case 02
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The all-positive state is replaced by the incoming block flag. · case 03
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The all-positive state is replaced by the incoming block flag. · case 04
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The all-positive state is replaced by the incoming block flag. · case 05
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The suffix scan starts at the left edge. · case 01
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The suffix scan starts at the left edge. · case 02
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The suffix scan starts at the left edge. · case 03
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The suffix scan starts at the left edge. · case 04
The reduction disagrees with its explicit aggregation oracle.
Positive run block summary: The suffix scan starts at the left edge. · case 05
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail consumes compressed rows in arrival order. · case 01
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail consumes compressed rows in arrival order. · case 02
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail consumes compressed rows in arrival order. · case 03
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail consumes compressed rows in arrival order. · case 04
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail consumes compressed rows in arrival order. · case 05
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A terminal frequency bin contributes its whole mass. · case 01
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A terminal frequency bin contributes its whole mass. · case 02
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A terminal frequency bin contributes its whole mass. · case 03
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A terminal frequency bin contributes its whole mass. · case 04
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A terminal frequency bin contributes its whole mass. · case 05
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail budget decreases by one row rather than selected multiplicity. · case 01
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail budget decreases by one row rather than selected multiplicity. · case 02
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail budget decreases by one row rather than selected multiplicity. · case 03
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail budget decreases by one row rather than selected multiplicity. · case 04
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The tail budget decreases by one row rather than selected multiplicity. · case 05
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The selected bin contributes its value once. · case 01
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The selected bin contributes its value once. · case 02
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The selected bin contributes its value once. · case 03
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The selected bin contributes its value once. · case 04
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: The selected bin contributes its value once. · case 05
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Budget is allowed below zero and later bins subtract selected mass. · case 01
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Budget is allowed below zero and later bins subtract selected mass. · case 02
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Budget is allowed below zero and later bins subtract selected mass. · case 03
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Budget is allowed below zero and later bins subtract selected mass. · case 04
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Budget is allowed below zero and later bins subtract selected mass. · case 05
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Largest values are selected for a lower-tail request. · case 01
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Largest values are selected for a lower-tail request. · case 02
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Largest values are selected for a lower-tail request. · case 03
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Largest values are selected for a lower-tail request. · case 04
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Largest values are selected for a lower-tail request. · case 05
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Repeated support rows overwrite each other before selection. · case 01
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Repeated support rows overwrite each other before selection. · case 02
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Repeated support rows overwrite each other before selection. · case 03
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Repeated support rows overwrite each other before selection. · case 04
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: Repeated support rows overwrite each other before selection. · case 05
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A zero remaining budget still consumes one observation. · case 01
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A zero remaining budget still consumes one observation. · case 02
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A zero remaining budget still consumes one observation. · case 03
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A zero remaining budget still consumes one observation. · case 04
The reduction disagrees with its explicit aggregation oracle.
Frequency lower tail sum: A zero remaining budget still consumes one observation. · case 05
The reduction disagrees with its explicit aggregation oracle.
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 ↗