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 degree table capacity covers the largest degree index rather than occupied count · case 01
The bounded fibonacci degree table certificate reports an incorrect capacity.
Fibonacci degree table capacity covers the largest degree index rather than occupied count · case 02
The bounded fibonacci degree table certificate reports an incorrect capacity.
Fibonacci degree table capacity covers the largest degree index rather than occupied count · case 03
The bounded fibonacci degree table certificate reports an incorrect capacity.
Fibonacci degree table capacity covers the largest degree index rather than occupied count · case 04
The bounded fibonacci degree table certificate reports an incorrect capacity.
Fibonacci degree table capacity covers the largest degree index rather than occupied count · case 05
The bounded fibonacci degree table certificate reports an incorrect capacity.
Fibonacci consolidation counts every equal-degree link including the first · case 01
The bounded fibonacci degree table certificate reports an incorrect carry steps.
Fibonacci consolidation counts every equal-degree link including the first · case 02
The bounded fibonacci degree table certificate reports an incorrect carry steps.
Fibonacci consolidation counts every equal-degree link including the first · case 03
The bounded fibonacci degree table certificate reports an incorrect carry steps.
Fibonacci consolidation counts every equal-degree link including the first · case 04
The bounded fibonacci degree table certificate reports an incorrect carry steps.
Fibonacci consolidation counts every equal-degree link including the first · case 05
The bounded fibonacci degree table certificate reports an incorrect carry steps.
Pairing cut preserves siblings on both sides of the removed node · case 01
The bounded pairing cut splice certificate reports an incorrect children.
Pairing cut preserves siblings on both sides of the removed node · case 02
The bounded pairing cut splice certificate reports an incorrect children.
Pairing cut preserves siblings on both sides of the removed node · case 03
The bounded pairing cut splice certificate reports an incorrect children.
Pairing cut preserves siblings on both sides of the removed node · case 04
The bounded pairing cut splice certificate reports an incorrect children.
Pairing cut preserves siblings on both sides of the removed node · case 05
The bounded pairing cut splice certificate reports an incorrect children.
Pairing cut replaces the parent first-child pointer only when necessary · case 01
The bounded pairing cut splice certificate reports an incorrect first.
Pairing cut replaces the parent first-child pointer only when necessary · case 02
The bounded pairing cut splice certificate reports an incorrect first.
Pairing cut replaces the parent first-child pointer only when necessary · case 03
The bounded pairing cut splice certificate reports an incorrect first.
Pairing cut replaces the parent first-child pointer only when necessary · case 04
The bounded pairing cut splice certificate reports an incorrect first.
Pairing cut replaces the parent first-child pointer only when necessary · case 05
The bounded pairing cut splice certificate reports an incorrect first.
Pairing cut successor points to the preceding sibling or parent according to cut position · case 01
The bounded pairing cut splice certificate reports an incorrect successor previous.
Pairing cut successor points to the preceding sibling or parent according to cut position · case 02
The bounded pairing cut splice certificate reports an incorrect successor previous.
Pairing cut successor points to the preceding sibling or parent according to cut position · case 03
The bounded pairing cut splice certificate reports an incorrect successor previous.
Pairing cut successor points to the preceding sibling or parent according to cut position · case 04
The bounded pairing cut splice certificate reports an incorrect successor previous.
Pairing cut successor points to the preceding sibling or parent according to cut position · case 05
The bounded pairing cut splice certificate reports an incorrect successor previous.
Pairing cut predecessor bypasses the removed child to its successor · case 01
The bounded pairing cut splice certificate reports an incorrect predecessor next.
Pairing cut predecessor bypasses the removed child to its successor · case 02
The bounded pairing cut splice certificate reports an incorrect predecessor next.
Pairing cut predecessor bypasses the removed child to its successor · case 03
The bounded pairing cut splice certificate reports an incorrect predecessor next.
Pairing cut predecessor bypasses the removed child to its successor · case 04
The bounded pairing cut splice certificate reports an incorrect predecessor next.
Pairing cut predecessor bypasses the removed child to its successor · case 05
The bounded pairing cut splice certificate reports an incorrect predecessor next.
Pairing cut promotes the detached subtree while retaining existing roots · case 01
The bounded pairing cut splice certificate reports an incorrect roots.
Pairing cut promotes the detached subtree while retaining existing roots · case 02
The bounded pairing cut splice certificate reports an incorrect roots.
Pairing cut promotes the detached subtree while retaining existing roots · case 03
The bounded pairing cut splice certificate reports an incorrect roots.
Pairing cut promotes the detached subtree while retaining existing roots · case 04
The bounded pairing cut splice certificate reports an incorrect roots.
Pairing cut promotes the detached subtree while retaining existing roots · case 05
The bounded pairing cut splice certificate reports an incorrect roots.
Pairing cut clears sibling links before melding the detached subtree · case 01
The bounded pairing cut splice certificate reports an incorrect detached.
Pairing cut clears sibling links before melding the detached subtree · case 02
The bounded pairing cut splice certificate reports an incorrect detached.
Pairing cut clears sibling links before melding the detached subtree · case 03
The bounded pairing cut splice certificate reports an incorrect detached.
Pairing cut clears sibling links before melding the detached subtree · case 04
The bounded pairing cut splice certificate reports an incorrect detached.
Pairing cut clears sibling links before melding the detached subtree · case 05
The bounded pairing cut splice certificate reports an incorrect detached.
Min-max trickle promotes the selected grandchild rather than its parent · case 01
The bounded minmax grandchild step certificate reports an incorrect root key.
Min-max trickle promotes the selected grandchild rather than its parent · case 02
The bounded minmax grandchild step certificate reports an incorrect root key.
Min-max trickle promotes the selected grandchild rather than its parent · case 03
The bounded minmax grandchild step certificate reports an incorrect root key.
Min-max trickle promotes the selected grandchild rather than its parent · case 04
The bounded minmax grandchild step certificate reports an incorrect root key.
Min-max trickle promotes the selected grandchild rather than its parent · case 05
The bounded minmax grandchild step certificate reports an incorrect root key.
Min-max trickle repairs the displaced key against the intervening max-level parent · case 01
The bounded minmax grandchild step certificate reports an incorrect grandchild key.
Min-max trickle repairs the displaced key against the intervening max-level parent · case 02
The bounded minmax grandchild step certificate reports an incorrect grandchild key.
Min-max trickle repairs the displaced key against the intervening max-level parent · case 03
The bounded minmax grandchild step certificate reports an incorrect grandchild key.
Min-max trickle repairs the displaced key against the intervening max-level parent · case 04
The bounded minmax grandchild step certificate reports an incorrect grandchild key.
Min-max trickle repairs the displaced key against the intervening max-level parent · case 05
The bounded minmax grandchild step certificate reports an incorrect grandchild key.
Min-max trickle changes the parent only on a cross-level order violation · case 01
The bounded minmax grandchild step certificate reports an incorrect parent key.
Min-max trickle changes the parent only on a cross-level order violation · case 02
The bounded minmax grandchild step certificate reports an incorrect parent key.
Min-max trickle changes the parent only on a cross-level order violation · case 03
The bounded minmax grandchild step certificate reports an incorrect parent key.
Min-max trickle changes the parent only on a cross-level order violation · case 04
The bounded minmax grandchild step certificate reports an incorrect parent key.
Min-max trickle changes the parent only on a cross-level order violation · case 05
The bounded minmax grandchild step certificate reports an incorrect parent key.
Min-max grandchild descent uses the opposite inequality for its parent correction · case 01
The bounded minmax grandchild step certificate reports an incorrect correction.
Min-max grandchild descent uses the opposite inequality for its parent correction · case 02
The bounded minmax grandchild step certificate reports an incorrect correction.
Min-max grandchild descent uses the opposite inequality for its parent correction · case 03
The bounded minmax grandchild step certificate reports an incorrect correction.
Min-max grandchild descent uses the opposite inequality for its parent correction · case 04
The bounded minmax grandchild step certificate reports an incorrect correction.
Min-max grandchild descent uses the opposite inequality for its parent correction · case 05
The bounded minmax grandchild step certificate reports an incorrect correction.
Min-max trickle performs grandchild exchange before optional parent correction · case 01
The bounded minmax grandchild step certificate reports an incorrect trace.
Min-max trickle performs grandchild exchange before optional parent correction · case 02
The bounded minmax grandchild step certificate reports an incorrect trace.
Min-max trickle performs grandchild exchange before optional parent correction · case 03
The bounded minmax grandchild step certificate reports an incorrect trace.
Min-max trickle performs grandchild exchange before optional parent correction · case 04
The bounded minmax grandchild step certificate reports an incorrect trace.
Min-max trickle performs grandchild exchange before optional parent correction · case 05
The bounded minmax grandchild step certificate reports an incorrect trace.
Min-max cross-level correction conserves duplicate keys across all three nodes · case 01
The bounded minmax grandchild step certificate reports an incorrect multiset.
Min-max cross-level correction conserves duplicate keys across all three nodes · case 02
The bounded minmax grandchild step certificate reports an incorrect multiset.
Min-max cross-level correction conserves duplicate keys across all three nodes · case 03
The bounded minmax grandchild step certificate reports an incorrect multiset.
Min-max cross-level correction conserves duplicate keys across all three nodes · case 04
The bounded minmax grandchild step certificate reports an incorrect multiset.
Min-max cross-level correction conserves duplicate keys across all three nodes · case 05
The bounded minmax grandchild step certificate reports an incorrect multiset.
Interval delete chooses the requested tail endpoint while respecting singleton tails · case 01
The bounded interval pop end certificate reports an incorrect replacement.
Interval delete chooses the requested tail endpoint while respecting singleton tails · case 02
The bounded interval pop end certificate reports an incorrect replacement.
Interval delete chooses the requested tail endpoint while respecting singleton tails · case 03
The bounded interval pop end certificate reports an incorrect replacement.
Interval delete chooses the requested tail endpoint while respecting singleton tails · case 04
The bounded interval pop end certificate reports an incorrect replacement.
Interval delete chooses the requested tail endpoint while respecting singleton tails · case 05
The bounded interval pop end certificate reports an incorrect replacement.
Interval delete retains the unremoved endpoint instead of deleting or retaining the whole pair · case 01
The bounded interval pop end certificate reports an incorrect remaining.
Interval delete retains the unremoved endpoint instead of deleting or retaining the whole pair · case 02
The bounded interval pop end certificate reports an incorrect remaining.
Interval delete retains the unremoved endpoint instead of deleting or retaining the whole pair · case 03
The bounded interval pop end certificate reports an incorrect remaining.
Interval delete retains the unremoved endpoint instead of deleting or retaining the whole pair · case 04
The bounded interval pop end certificate reports an incorrect remaining.
Interval delete retains the unremoved endpoint instead of deleting or retaining the whole pair · case 05
The bounded interval pop end certificate reports an incorrect remaining.
Interval delete counts one removed member even when the last node survives · case 01
The bounded interval pop end certificate reports an incorrect size.
Interval delete counts one removed member even when the last node survives · case 02
The bounded interval pop end certificate reports an incorrect size.
Interval delete counts one removed member even when the last node survives · case 03
The bounded interval pop end certificate reports an incorrect size.
Interval delete counts one removed member even when the last node survives · case 04
The bounded interval pop end certificate reports an incorrect size.
Interval delete counts one removed member even when the last node survives · case 05
The bounded interval pop end certificate reports an incorrect size.
Interval delete reports whether the resulting final interval is incomplete · case 01
The bounded interval pop end certificate reports an incorrect singleton.
Interval delete reports whether the resulting final interval is incomplete · case 02
The bounded interval pop end certificate reports an incorrect singleton.
Interval delete reports whether the resulting final interval is incomplete · case 03
The bounded interval pop end certificate reports an incorrect singleton.
Interval delete reports whether the resulting final interval is incomplete · case 04
The bounded interval pop end certificate reports an incorrect singleton.
Interval delete reports whether the resulting final interval is incomplete · case 05
The bounded interval pop end certificate reports an incorrect singleton.
Interval tail survivor is the opposite endpoint of the requested removal · case 01
The bounded interval pop end certificate reports an incorrect survivor.
Interval tail survivor is the opposite endpoint of the requested removal · case 02
The bounded interval pop end certificate reports an incorrect survivor.
Interval tail survivor is the opposite endpoint of the requested removal · case 03
The bounded interval pop end certificate reports an incorrect survivor.
Interval tail survivor is the opposite endpoint of the requested removal · case 04
The bounded interval pop end certificate reports an incorrect survivor.
Interval tail survivor is the opposite endpoint of the requested removal · case 05
The bounded interval pop end certificate reports an incorrect survivor.
Interval tail removal drops an array node only when its last endpoint is removed · case 01
The bounded interval pop end certificate reports an incorrect nodes.
Interval tail removal drops an array node only when its last endpoint is removed · case 02
The bounded interval pop end certificate reports an incorrect nodes.
Interval tail removal drops an array node only when its last endpoint is removed · case 03
The bounded interval pop end certificate reports an incorrect nodes.
Interval tail removal drops an array node only when its last endpoint is removed · case 04
The bounded interval pop end certificate reports an incorrect nodes.
Interval tail removal drops an array node only when its last endpoint is removed · case 05
The bounded interval pop end certificate reports an incorrect nodes.
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 ↗