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
A buy order matches its own owner · case 01
A buy order matches its own owner.
A buy order matches its own owner · case 02
A buy order matches its own owner.
A buy order matches its own owner · case 03
A buy order matches its own owner.
A buy order matches its own owner · case 04
A buy order matches its own owner.
A buy order matches its own owner · case 05
A buy order matches its own owner.
A block request receives a forbidden partial allocation · case 01
A block request receives a forbidden partial allocation.
A block request receives a forbidden partial allocation · case 02
A block request receives a forbidden partial allocation.
A block request receives a forbidden partial allocation · case 03
A block request receives a forbidden partial allocation.
A block request receives a forbidden partial allocation · case 04
A block request receives a forbidden partial allocation.
A block request receives a forbidden partial allocation · case 05
A block request receives a forbidden partial allocation.
Pay-as-bid settlement treats every fill as one unit · case 01
Pay-as-bid settlement treats every fill as one unit.
Pay-as-bid settlement treats every fill as one unit · case 02
Pay-as-bid settlement treats every fill as one unit.
Pay-as-bid settlement treats every fill as one unit · case 03
Pay-as-bid settlement treats every fill as one unit.
Pay-as-bid settlement treats every fill as one unit · case 04
Pay-as-bid settlement treats every fill as one unit.
Pay-as-bid settlement treats every fill as one unit · case 05
Pay-as-bid settlement treats every fill as one unit.
One bidder wins two mutually exclusive package offers · case 01
One bidder wins two mutually exclusive package offers.
One bidder wins two mutually exclusive package offers · case 02
One bidder wins two mutually exclusive package offers.
One bidder wins two mutually exclusive package offers · case 03
One bidder wins two mutually exclusive package offers.
One bidder wins two mutually exclusive package offers · case 04
One bidder wins two mutually exclusive package offers.
One bidder wins two mutually exclusive package offers · case 05
One bidder wins two mutually exclusive package offers.
Equal-price buy and sell limits fail to cross · case 01
Equal-price buy and sell limits fail to cross.
Equal-price buy and sell limits fail to cross · case 02
Equal-price buy and sell limits fail to cross.
Equal-price buy and sell limits fail to cross · case 03
Equal-price buy and sell limits fail to cross.
Equal-price buy and sell limits fail to cross · case 04
Equal-price buy and sell limits fail to cross.
Equal-price buy and sell limits fail to cross · case 05
Equal-price buy and sell limits fail to cross.
Marginal pro-rata allocation loses residual units · case 01
Marginal pro-rata allocation loses residual units.
Marginal pro-rata allocation loses residual units · case 02
Marginal pro-rata allocation loses residual units.
Marginal pro-rata allocation loses residual units · case 03
Marginal pro-rata allocation loses residual units.
Marginal pro-rata allocation loses residual units · case 04
Marginal pro-rata allocation loses residual units.
Marginal pro-rata allocation loses residual units · case 05
Marginal pro-rata allocation loses residual units.
Call clearing chooses peak demand instead of executable volume · case 01
Call clearing chooses peak demand instead of executable volume.
Call clearing chooses peak demand instead of executable volume · case 02
Call clearing chooses peak demand instead of executable volume.
Call clearing chooses peak demand instead of executable volume · case 03
Call clearing chooses peak demand instead of executable volume.
Call clearing chooses peak demand instead of executable volume · case 04
Call clearing chooses peak demand instead of executable volume.
Call clearing chooses peak demand instead of executable volume · case 05
Call clearing chooses peak demand instead of executable volume.
A minimum-fill order is rejected despite sufficient aggregate counterparties · case 01
A minimum-fill order is rejected despite sufficient aggregate counterparties.
A minimum-fill order is rejected despite sufficient aggregate counterparties · case 02
A minimum-fill order is rejected despite sufficient aggregate counterparties.
A minimum-fill order is rejected despite sufficient aggregate counterparties · case 03
A minimum-fill order is rejected despite sufficient aggregate counterparties.
A minimum-fill order is rejected despite sufficient aggregate counterparties · case 04
A minimum-fill order is rejected despite sufficient aggregate counterparties.
A minimum-fill order is rejected despite sufficient aggregate counterparties · case 05
A minimum-fill order is rejected despite sufficient aggregate counterparties.
Truncated rankings change the Borda point scale · case 01
Truncated rankings change the Borda point scale.
Truncated rankings change the Borda point scale · case 02
Truncated rankings change the Borda point scale.
Truncated rankings change the Borda point scale · case 03
Truncated rankings change the Borda point scale.
Truncated rankings change the Borda point scale · case 04
Truncated rankings change the Borda point scale.
Truncated rankings change the Borda point scale · case 05
Truncated rankings change the Borda point scale.
Two omitted candidates acquire a fictitious pairwise preference · case 01
Two omitted candidates acquire a fictitious pairwise preference.
Two omitted candidates acquire a fictitious pairwise preference · case 02
Two omitted candidates acquire a fictitious pairwise preference.
Two omitted candidates acquire a fictitious pairwise preference · case 03
Two omitted candidates acquire a fictitious pairwise preference.
Two omitted candidates acquire a fictitious pairwise preference · case 04
Two omitted candidates acquire a fictitious pairwise preference.
Two omitted candidates acquire a fictitious pairwise preference · case 05
Two omitted candidates acquire a fictitious pairwise preference.
Exhausted ballots prevent a continuing-ballot majority · case 01
Exhausted ballots prevent a continuing-ballot majority.
Exhausted ballots prevent a continuing-ballot majority · case 02
Exhausted ballots prevent a continuing-ballot majority.
Exhausted ballots prevent a continuing-ballot majority · case 03
Exhausted ballots prevent a continuing-ballot majority.
Exhausted ballots prevent a continuing-ballot majority · case 04
Exhausted ballots prevent a continuing-ballot majority.
Exhausted ballots prevent a continuing-ballot majority · case 05
Exhausted ballots prevent a continuing-ballot majority.
A transferred ranking stops at another eliminated candidate · case 01
A transferred ranking stops at another eliminated candidate.
A transferred ranking stops at another eliminated candidate · case 02
A transferred ranking stops at another eliminated candidate.
A transferred ranking stops at another eliminated candidate · case 03
A transferred ranking stops at another eliminated candidate.
A transferred ranking stops at another eliminated candidate · case 04
A transferred ranking stops at another eliminated candidate.
A transferred ranking stops at another eliminated candidate · case 05
A transferred ranking stops at another eliminated candidate.
An exact quotient omits the final quota increment · case 01
An exact quotient omits the final quota increment.
An exact quotient omits the final quota increment · case 02
An exact quotient omits the final quota increment.
An exact quotient omits the final quota increment · case 03
An exact quotient omits the final quota increment.
An exact quotient omits the final quota increment · case 04
An exact quotient omits the final quota increment.
An exact quotient omits the final quota increment · case 05
An exact quotient omits the final quota increment.
Surplus transfer uses ballot count instead of ballot value · case 01
Surplus transfer uses ballot count instead of ballot value.
Surplus transfer uses ballot count instead of ballot value · case 02
Surplus transfer uses ballot count instead of ballot value.
Surplus transfer uses ballot count instead of ballot value · case 03
Surplus transfer uses ballot count instead of ballot value.
Surplus transfer uses ballot count instead of ballot value · case 04
Surplus transfer uses ballot count instead of ballot value.
Surplus transfer uses ballot count instead of ballot value · case 05
Surplus transfer uses ballot count instead of ballot value.
Sequential divisor allocation reuses initial priorities · case 01
Sequential divisor allocation reuses initial priorities.
Sequential divisor allocation reuses initial priorities · case 02
Sequential divisor allocation reuses initial priorities.
Sequential divisor allocation reuses initial priorities · case 03
Sequential divisor allocation reuses initial priorities.
Sequential divisor allocation reuses initial priorities · case 04
Sequential divisor allocation reuses initial priorities.
Sequential divisor allocation reuses initial priorities · case 05
Sequential divisor allocation reuses initial priorities.
A tied rank consumes only one scoring position · case 01
A tied rank consumes only one scoring position.
A tied rank consumes only one scoring position · case 02
A tied rank consumes only one scoring position.
A tied rank consumes only one scoring position · case 03
A tied rank consumes only one scoring position.
A tied rank consumes only one scoring position · case 04
A tied rank consumes only one scoring position.
A tied rank consumes only one scoring position · case 05
A tied rank consumes only one scoring position.
A plurality of pairwise victories is mistaken for beating every opponent · case 01
A plurality of pairwise victories is mistaken for beating every opponent.
A plurality of pairwise victories is mistaken for beating every opponent · case 02
A plurality of pairwise victories is mistaken for beating every opponent.
A plurality of pairwise victories is mistaken for beating every opponent · case 03
A plurality of pairwise victories is mistaken for beating every opponent.
A plurality of pairwise victories is mistaken for beating every opponent · case 04
A plurality of pairwise victories is mistaken for beating every opponent.
A plurality of pairwise victories is mistaken for beating every opponent · case 05
A plurality of pairwise victories is mistaken for beating every opponent.
Locking a ranked pair closes an indirect preference cycle · case 01
Locking a ranked pair closes an indirect preference cycle.
Locking a ranked pair closes an indirect preference cycle · case 02
Locking a ranked pair closes an indirect preference cycle.
Locking a ranked pair closes an indirect preference cycle · case 03
Locking a ranked pair closes an indirect preference cycle.
Locking a ranked pair closes an indirect preference cycle · case 04
Locking a ranked pair closes an indirect preference cycle.
Locking a ranked pair closes an indirect preference cycle · case 05
Locking a ranked pair closes an indirect preference cycle.
Bye selection ignores prior byes · case 01
Bye selection ignores prior byes.
Bye selection ignores prior byes · case 02
Bye selection ignores prior byes.
Bye selection ignores prior byes · case 03
Bye selection ignores prior byes.
Bye selection ignores prior byes · case 04
Bye selection ignores prior byes.
Bye selection ignores prior byes · case 05
Bye selection ignores prior byes.
Greedy pairing strands the final entrants · case 01
Greedy pairing strands the final entrants.
Greedy pairing strands the final entrants · case 02
Greedy pairing strands the final entrants.
Greedy pairing strands the final entrants · case 03
Greedy pairing strands the final entrants.
Greedy pairing strands the final entrants · case 04
Greedy pairing strands the final entrants.
Greedy pairing strands the final entrants · case 05
Greedy pairing strands the final entrants.
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 ↗