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
Loser tree exhausted sentinels cannot win on their stale key · case 01
The bounded loser match certificate reports an incorrect winner.
Loser tree exhausted sentinels cannot win on their stale key · case 02
The bounded loser match certificate reports an incorrect winner.
Loser tree exhausted sentinels cannot win on their stale key · case 03
The bounded loser match certificate reports an incorrect winner.
Loser tree exhausted sentinels cannot win on their stale key · case 04
The bounded loser match certificate reports an incorrect winner.
Loser tree exhausted sentinels cannot win on their stale key · case 05
The bounded loser match certificate reports an incorrect winner.
Loser tree internal node stores the losing run rather than the winner · case 01
The bounded loser match certificate reports an incorrect stored loser.
Loser tree internal node stores the losing run rather than the winner · case 02
The bounded loser match certificate reports an incorrect stored loser.
Loser tree internal node stores the losing run rather than the winner · case 03
The bounded loser match certificate reports an incorrect stored loser.
Loser tree internal node stores the losing run rather than the winner · case 04
The bounded loser match certificate reports an incorrect stored loser.
Loser tree internal node stores the losing run rather than the winner · case 05
The bounded loser match certificate reports an incorrect stored loser.
Loser tree counts a key comparison only when both runs are active · case 01
The bounded loser match certificate reports an incorrect comparisons.
Loser tree counts a key comparison only when both runs are active · case 02
The bounded loser match certificate reports an incorrect comparisons.
Loser tree counts a key comparison only when both runs are active · case 03
The bounded loser match certificate reports an incorrect comparisons.
Loser tree counts a key comparison only when both runs are active · case 04
The bounded loser match certificate reports an incorrect comparisons.
Loser tree counts a key comparison only when both runs are active · case 05
The bounded loser match certificate reports an incorrect comparisons.
Loser tree exhaustion is explicit and independent of legitimate zero keys · case 01
The bounded loser match certificate reports an incorrect exhausted.
Loser tree exhaustion is explicit and independent of legitimate zero keys · case 02
The bounded loser match certificate reports an incorrect exhausted.
Loser tree exhaustion is explicit and independent of legitimate zero keys · case 03
The bounded loser match certificate reports an incorrect exhausted.
Loser tree exhaustion is explicit and independent of legitimate zero keys · case 04
The bounded loser match certificate reports an incorrect exhausted.
Loser tree exhaustion is explicit and independent of legitimate zero keys · case 05
The bounded loser match certificate reports an incorrect exhausted.
Loser tree output key belongs to the active winner · case 01
The bounded loser match certificate reports an incorrect key.
Loser tree output key belongs to the active winner · case 02
The bounded loser match certificate reports an incorrect key.
Loser tree output key belongs to the active winner · case 03
The bounded loser match certificate reports an incorrect key.
Loser tree output key belongs to the active winner · case 04
The bounded loser match certificate reports an incorrect key.
Loser tree output key belongs to the active winner · case 05
The bounded loser match certificate reports an incorrect key.
Loser tree propagates the winner to the next match rather than the stored loser · case 01
The bounded loser match certificate reports an incorrect continuation.
Loser tree propagates the winner to the next match rather than the stored loser · case 02
The bounded loser match certificate reports an incorrect continuation.
Loser tree propagates the winner to the next match rather than the stored loser · case 03
The bounded loser match certificate reports an incorrect continuation.
Loser tree propagates the winner to the next match rather than the stored loser · case 04
The bounded loser match certificate reports an incorrect continuation.
Loser tree propagates the winner to the next match rather than the stored loser · case 05
The bounded loser match certificate reports an incorrect continuation.
Weak heap distinguished ancestor can be above the ordinary parent · case 01
The bounded weak ancestor certificate reports an incorrect ancestor.
Weak heap distinguished ancestor can be above the ordinary parent · case 02
The bounded weak ancestor certificate reports an incorrect ancestor.
Weak heap distinguished ancestor can be above the ordinary parent · case 03
The bounded weak ancestor certificate reports an incorrect ancestor.
Weak heap distinguished ancestor can be above the ordinary parent · case 04
The bounded weak ancestor certificate reports an incorrect ancestor.
Weak heap distinguished ancestor can be above the ordinary parent · case 05
The bounded weak ancestor certificate reports an incorrect ancestor.
Weak heap ancestor search records climbed nodes from descendant upward · case 01
The bounded weak ancestor certificate reports an incorrect path.
Weak heap ancestor search records climbed nodes from descendant upward · case 02
The bounded weak ancestor certificate reports an incorrect path.
Weak heap ancestor search records climbed nodes from descendant upward · case 03
The bounded weak ancestor certificate reports an incorrect path.
Weak heap ancestor search records climbed nodes from descendant upward · case 04
The bounded weak ancestor certificate reports an incorrect path.
Weak heap ancestor search records climbed nodes from descendant upward · case 05
The bounded weak ancestor certificate reports an incorrect path.
Weak heap ancestor cost counts only orientation-driven climbs · case 01
The bounded weak ancestor certificate reports an incorrect cost.
Weak heap ancestor cost counts only orientation-driven climbs · case 02
The bounded weak ancestor certificate reports an incorrect cost.
Weak heap ancestor cost counts only orientation-driven climbs · case 03
The bounded weak ancestor certificate reports an incorrect cost.
Weak heap ancestor cost counts only orientation-driven climbs · case 04
The bounded weak ancestor certificate reports an incorrect cost.
Weak heap ancestor cost counts only orientation-driven climbs · case 05
The bounded weak ancestor certificate reports an incorrect cost.
Weak heap distinguished-ancestor search retains the stopping child separately · case 01
The bounded weak ancestor certificate reports an incorrect stop.
Weak heap distinguished-ancestor search retains the stopping child separately · case 02
The bounded weak ancestor certificate reports an incorrect stop.
Weak heap distinguished-ancestor search retains the stopping child separately · case 03
The bounded weak ancestor certificate reports an incorrect stop.
Weak heap distinguished-ancestor search retains the stopping child separately · case 04
The bounded weak ancestor certificate reports an incorrect stop.
Weak heap distinguished-ancestor search retains the stopping child separately · case 05
The bounded weak ancestor certificate reports an incorrect stop.
Weak heap stopping orientation belongs to the distinguished ancestor · case 01
The bounded weak ancestor certificate reports an incorrect orientation.
Weak heap stopping orientation belongs to the distinguished ancestor · case 02
The bounded weak ancestor certificate reports an incorrect orientation.
Weak heap stopping orientation belongs to the distinguished ancestor · case 03
The bounded weak ancestor certificate reports an incorrect orientation.
Weak heap stopping orientation belongs to the distinguished ancestor · case 04
The bounded weak ancestor certificate reports an incorrect orientation.
Weak heap stopping orientation belongs to the distinguished ancestor · case 05
The bounded weak ancestor certificate reports an incorrect orientation.
Weak heap direct ancestry depends on reversal bits as well as index parity · case 01
The bounded weak ancestor certificate reports an incorrect direct.
Weak heap direct ancestry depends on reversal bits as well as index parity · case 02
The bounded weak ancestor certificate reports an incorrect direct.
Weak heap direct ancestry depends on reversal bits as well as index parity · case 03
The bounded weak ancestor certificate reports an incorrect direct.
Weak heap direct ancestry depends on reversal bits as well as index parity · case 04
The bounded weak ancestor certificate reports an incorrect direct.
Weak heap direct ancestry depends on reversal bits as well as index parity · case 05
The bounded weak ancestor certificate reports an incorrect direct.
Weak join preserves both exchanged keys instead of overwriting the ancestor · case 01
The bounded weak join certificate reports an incorrect keys.
Weak join preserves both exchanged keys instead of overwriting the ancestor · case 02
The bounded weak join certificate reports an incorrect keys.
Weak join preserves both exchanged keys instead of overwriting the ancestor · case 03
The bounded weak join certificate reports an incorrect keys.
Weak join preserves both exchanged keys instead of overwriting the ancestor · case 04
The bounded weak join certificate reports an incorrect keys.
Weak join preserves both exchanged keys instead of overwriting the ancestor · case 05
The bounded weak join certificate reports an incorrect keys.
Weak join flips only the descendant reversal bit · case 01
The bounded weak join certificate reports an incorrect bits.
Weak join flips only the descendant reversal bit · case 02
The bounded weak join certificate reports an incorrect bits.
Weak join flips only the descendant reversal bit · case 03
The bounded weak join certificate reports an incorrect bits.
Weak join flips only the descendant reversal bit · case 04
The bounded weak join certificate reports an incorrect bits.
Weak join flips only the descendant reversal bit · case 05
The bounded weak join certificate reports an incorrect bits.
Weak join performs a strict improvement swap without reversing equal keys · case 01
The bounded weak join certificate reports an incorrect swapped.
Weak join performs a strict improvement swap without reversing equal keys · case 02
The bounded weak join certificate reports an incorrect swapped.
Weak join performs a strict improvement swap without reversing equal keys · case 03
The bounded weak join certificate reports an incorrect swapped.
Weak join performs a strict improvement swap without reversing equal keys · case 04
The bounded weak join certificate reports an incorrect swapped.
Weak join performs a strict improvement swap without reversing equal keys · case 05
The bounded weak join certificate reports an incorrect swapped.
Weak join winner is local to the two participating nodes · case 01
The bounded weak join certificate reports an incorrect winner key.
Weak join winner is local to the two participating nodes · case 02
The bounded weak join certificate reports an incorrect winner key.
Weak join winner is local to the two participating nodes · case 03
The bounded weak join certificate reports an incorrect winner key.
Weak join winner is local to the two participating nodes · case 04
The bounded weak join certificate reports an incorrect winner key.
Weak join winner is local to the two participating nodes · case 05
The bounded weak join certificate reports an incorrect winner key.
Weak join reports no orientation mutation when no exchange occurs · case 01
The bounded weak join certificate reports an incorrect flipped.
Weak join reports no orientation mutation when no exchange occurs · case 02
The bounded weak join certificate reports an incorrect flipped.
Weak join reports no orientation mutation when no exchange occurs · case 03
The bounded weak join certificate reports an incorrect flipped.
Weak join reports no orientation mutation when no exchange occurs · case 04
The bounded weak join certificate reports an incorrect flipped.
Weak join reports no orientation mutation when no exchange occurs · case 05
The bounded weak join certificate reports an incorrect flipped.
Weak join makes one comparison independently of distance and swap outcome · case 01
The bounded weak join certificate reports an incorrect comparisons.
Weak join makes one comparison independently of distance and swap outcome · case 02
The bounded weak join certificate reports an incorrect comparisons.
Weak join makes one comparison independently of distance and swap outcome · case 03
The bounded weak join certificate reports an incorrect comparisons.
Weak join makes one comparison independently of distance and swap outcome · case 04
The bounded weak join certificate reports an incorrect comparisons.
Weak join makes one comparison independently of distance and swap outcome · case 05
The bounded weak join certificate reports an incorrect comparisons.
Bottom-up heap construction repairs descendants before their parents and excludes leaves · case 01
The bounded bottomup schedule certificate reports an incorrect schedule.
Bottom-up heap construction repairs descendants before their parents and excludes leaves · case 02
The bounded bottomup schedule certificate reports an incorrect schedule.
Bottom-up heap construction repairs descendants before their parents and excludes leaves · case 03
The bounded bottomup schedule certificate reports an incorrect schedule.
Bottom-up heap construction repairs descendants before their parents and excludes leaves · case 04
The bounded bottomup schedule certificate reports an incorrect schedule.
Bottom-up heap construction repairs descendants before their parents and excludes leaves · case 05
The bounded bottomup schedule certificate reports an incorrect schedule.
Complete heap leaf boundary includes the middle node in an odd-size tree · case 01
The bounded bottomup schedule certificate reports an incorrect leaves.
Complete heap leaf boundary includes the middle node in an odd-size tree · case 02
The bounded bottomup schedule certificate reports an incorrect leaves.
Complete heap leaf boundary includes the middle node in an odd-size tree · case 03
The bounded bottomup schedule certificate reports an incorrect leaves.
Complete heap leaf boundary includes the middle node in an odd-size tree · case 04
The bounded bottomup schedule certificate reports an incorrect leaves.
Complete heap leaf boundary includes the middle node in an odd-size tree · case 05
The bounded bottomup schedule certificate reports an incorrect leaves.
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 ↗