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
Binomial link increments rank once rather than summing ranks · case 01
The bounded binomial link certificate reports an incorrect new rank.
Binomial link increments rank once rather than summing ranks · case 02
The bounded binomial link certificate reports an incorrect new rank.
Binomial link increments rank once rather than summing ranks · case 03
The bounded binomial link certificate reports an incorrect new rank.
Binomial link increments rank once rather than summing ranks · case 04
The bounded binomial link certificate reports an incorrect new rank.
Binomial link increments rank once rather than summing ranks · case 05
The bounded binomial link certificate reports an incorrect new rank.
Binomial link prepends the loser root rather than its children · case 01
The bounded binomial link certificate reports an incorrect children.
Binomial link prepends the loser root rather than its children · case 02
The bounded binomial link certificate reports an incorrect children.
Binomial link prepends the loser root rather than its children · case 03
The bounded binomial link certificate reports an incorrect children.
Binomial link prepends the loser root rather than its children · case 04
The bounded binomial link certificate reports an incorrect children.
Binomial link prepends the loser root rather than its children · case 05
The bounded binomial link certificate reports an incorrect children.
Binomial link changes only the demoted root parent · case 01
The bounded binomial link certificate reports an incorrect parent updates.
Binomial link changes only the demoted root parent · case 02
The bounded binomial link certificate reports an incorrect parent updates.
Binomial link changes only the demoted root parent · case 03
The bounded binomial link certificate reports an incorrect parent updates.
Binomial link changes only the demoted root parent · case 04
The bounded binomial link certificate reports an incorrect parent updates.
Binomial link changes only the demoted root parent · case 05
The bounded binomial link certificate reports an incorrect parent updates.
Binomial link removes the loser from the root collection · case 01
The bounded binomial link certificate reports an incorrect root set.
Binomial link removes the loser from the root collection · case 02
The bounded binomial link certificate reports an incorrect root set.
Binomial link removes the loser from the root collection · case 03
The bounded binomial link certificate reports an incorrect root set.
Binomial link removes the loser from the root collection · case 04
The bounded binomial link certificate reports an incorrect root set.
Binomial link removes the loser from the root collection · case 05
The bounded binomial link certificate reports an incorrect root set.
Binomial carry defers the first pair when three equal ranks are pending · case 01
The bounded binomial carry certificate reports an incorrect link now.
Binomial carry defers the first pair when three equal ranks are pending · case 02
The bounded binomial carry certificate reports an incorrect link now.
Binomial carry defers the first pair when three equal ranks are pending · case 03
The bounded binomial carry certificate reports an incorrect link now.
Binomial carry defers the first pair when three equal ranks are pending · case 04
The bounded binomial carry certificate reports an incorrect link now.
Binomial carry defers the first pair when three equal ranks are pending · case 05
The bounded binomial carry certificate reports an incorrect link now.
Binomial carry reads the cursor rank rather than the list head · case 01
The bounded binomial carry certificate reports an incorrect current.
Binomial carry reads the cursor rank rather than the list head · case 02
The bounded binomial carry certificate reports an incorrect current.
Binomial carry reads the cursor rank rather than the list head · case 03
The bounded binomial carry certificate reports an incorrect current.
Binomial carry reads the cursor rank rather than the list head · case 04
The bounded binomial carry certificate reports an incorrect current.
Binomial carry reads the cursor rank rather than the list head · case 05
The bounded binomial carry certificate reports an incorrect current.
Binomial carry advances one rank even when the old rank is zero · case 01
The bounded binomial carry certificate reports an incorrect carry rank.
Binomial carry advances one rank even when the old rank is zero · case 02
The bounded binomial carry certificate reports an incorrect carry rank.
Binomial carry advances one rank even when the old rank is zero · case 03
The bounded binomial carry certificate reports an incorrect carry rank.
Binomial carry advances one rank even when the old rank is zero · case 04
The bounded binomial carry certificate reports an incorrect carry rank.
Binomial carry advances one rank even when the old rank is zero · case 05
The bounded binomial carry certificate reports an incorrect carry rank.
Binomial carry consumes precisely the linked pair · case 01
The bounded binomial carry certificate reports an incorrect suffix.
Binomial carry consumes precisely the linked pair · case 02
The bounded binomial carry certificate reports an incorrect suffix.
Binomial carry consumes precisely the linked pair · case 03
The bounded binomial carry certificate reports an incorrect suffix.
Binomial carry consumes precisely the linked pair · case 04
The bounded binomial carry certificate reports an incorrect suffix.
Binomial carry consumes precisely the linked pair · case 05
The bounded binomial carry certificate reports an incorrect suffix.
Binomial triple deferral compares the third rank rather than just its presence · case 01
The bounded binomial carry certificate reports an incorrect defer.
Binomial triple deferral compares the third rank rather than just its presence · case 02
The bounded binomial carry certificate reports an incorrect defer.
Binomial triple deferral compares the third rank rather than just its presence · case 03
The bounded binomial carry certificate reports an incorrect defer.
Binomial triple deferral compares the third rank rather than just its presence · case 04
The bounded binomial carry certificate reports an incorrect defer.
Binomial triple deferral compares the third rank rather than just its presence · case 05
The bounded binomial carry certificate reports an incorrect defer.
Binomial carry links the adjacent equal rank rather than the tail · case 01
The bounded binomial carry certificate reports an incorrect partner.
Binomial carry links the adjacent equal rank rather than the tail · case 02
The bounded binomial carry certificate reports an incorrect partner.
Binomial carry links the adjacent equal rank rather than the tail · case 03
The bounded binomial carry certificate reports an incorrect partner.
Binomial carry links the adjacent equal rank rather than the tail · case 04
The bounded binomial carry certificate reports an incorrect partner.
Binomial carry links the adjacent equal rank rather than the tail · case 05
The bounded binomial carry certificate reports an incorrect partner.
Binomial extraction reverses child rank order rather than sorting by priority · case 01
The bounded binomial extract certificate reports an incorrect promoted.
Binomial extraction reverses child rank order rather than sorting by priority · case 02
The bounded binomial extract certificate reports an incorrect promoted.
Binomial extraction reverses child rank order rather than sorting by priority · case 03
The bounded binomial extract certificate reports an incorrect promoted.
Binomial extraction reverses child rank order rather than sorting by priority · case 04
The bounded binomial extract certificate reports an incorrect promoted.
Binomial extraction reverses child rank order rather than sorting by priority · case 05
The bounded binomial extract certificate reports an incorrect promoted.
Binomial extraction clears every promoted child parent · case 01
The bounded binomial extract certificate reports an incorrect parents.
Binomial extraction clears every promoted child parent · case 02
The bounded binomial extract certificate reports an incorrect parents.
Binomial extraction clears every promoted child parent · case 03
The bounded binomial extract certificate reports an incorrect parents.
Binomial extraction clears every promoted child parent · case 04
The bounded binomial extract certificate reports an incorrect parents.
Binomial extraction clears every promoted child parent · case 05
The bounded binomial extract certificate reports an incorrect parents.
Binomial extraction removes one member while preserving child subtrees · case 01
The bounded binomial extract certificate reports an incorrect size delta.
Binomial extraction removes one member while preserving child subtrees · case 02
The bounded binomial extract certificate reports an incorrect size delta.
Binomial extraction removes one member while preserving child subtrees · case 03
The bounded binomial extract certificate reports an incorrect size delta.
Binomial extraction removes one member while preserving child subtrees · case 04
The bounded binomial extract certificate reports an incorrect size delta.
Binomial extraction removes one member while preserving child subtrees · case 05
The bounded binomial extract certificate reports an incorrect size delta.
Binomial extraction recomputes minimum across old and promoted roots · case 01
The bounded binomial extract certificate reports an incorrect minimum.
Binomial extraction recomputes minimum across old and promoted roots · case 02
The bounded binomial extract certificate reports an incorrect minimum.
Binomial extraction recomputes minimum across old and promoted roots · case 03
The bounded binomial extract certificate reports an incorrect minimum.
Binomial extraction recomputes minimum across old and promoted roots · case 04
The bounded binomial extract certificate reports an incorrect minimum.
Binomial extraction recomputes minimum across old and promoted roots · case 05
The bounded binomial extract certificate reports an incorrect minimum.
Binomial extraction preserves rank collisions for later consolidation · case 01
The bounded binomial extract certificate reports an incorrect merge ranks.
Binomial extraction preserves rank collisions for later consolidation · case 02
The bounded binomial extract certificate reports an incorrect merge ranks.
Binomial extraction preserves rank collisions for later consolidation · case 03
The bounded binomial extract certificate reports an incorrect merge ranks.
Binomial extraction preserves rank collisions for later consolidation · case 04
The bounded binomial extract certificate reports an incorrect merge ranks.
Binomial extraction preserves rank collisions for later consolidation · case 05
The bounded binomial extract certificate reports an incorrect merge ranks.
Binomial extraction invalidates only the removed root handle · case 01
The bounded binomial extract certificate reports an incorrect live handles.
Binomial extraction invalidates only the removed root handle · case 02
The bounded binomial extract certificate reports an incorrect live handles.
Binomial extraction invalidates only the removed root handle · case 03
The bounded binomial extract certificate reports an incorrect live handles.
Binomial extraction invalidates only the removed root handle · case 04
The bounded binomial extract certificate reports an incorrect live handles.
Binomial extraction invalidates only the removed root handle · case 05
The bounded binomial extract certificate reports an incorrect live handles.
Fibonacci cut removes the selected sibling rather than the first or entire ring · case 01
The bounded fibonacci cut certificate reports an incorrect parent children.
Fibonacci cut removes the selected sibling rather than the first or entire ring · case 02
The bounded fibonacci cut certificate reports an incorrect parent children.
Fibonacci cut removes the selected sibling rather than the first or entire ring · case 03
The bounded fibonacci cut certificate reports an incorrect parent children.
Fibonacci cut removes the selected sibling rather than the first or entire ring · case 04
The bounded fibonacci cut certificate reports an incorrect parent children.
Fibonacci cut removes the selected sibling rather than the first or entire ring · case 05
The bounded fibonacci cut certificate reports an incorrect parent children.
Fibonacci cut preserves existing roots and appends the cut child · case 01
The bounded fibonacci cut certificate reports an incorrect root append.
Fibonacci cut preserves existing roots and appends the cut child · case 02
The bounded fibonacci cut certificate reports an incorrect root append.
Fibonacci cut preserves existing roots and appends the cut child · case 03
The bounded fibonacci cut certificate reports an incorrect root append.
Fibonacci cut preserves existing roots and appends the cut child · case 04
The bounded fibonacci cut certificate reports an incorrect root append.
Fibonacci cut preserves existing roots and appends the cut child · case 05
The bounded fibonacci cut certificate reports an incorrect root append.
Fibonacci cut decrements the parent degree exactly once · case 01
The bounded fibonacci cut certificate reports an incorrect degree.
Fibonacci cut decrements the parent degree exactly once · case 02
The bounded fibonacci cut certificate reports an incorrect degree.
Fibonacci cut decrements the parent degree exactly once · case 03
The bounded fibonacci cut certificate reports an incorrect degree.
Fibonacci cut decrements the parent degree exactly once · case 04
The bounded fibonacci cut certificate reports an incorrect degree.
Fibonacci cut decrements the parent degree exactly once · case 05
The bounded fibonacci cut certificate reports an incorrect degree.
Fibonacci cut clears the promoted child parent rather than self-parenting · case 01
The bounded fibonacci cut certificate reports an incorrect child parent.
Fibonacci cut clears the promoted child parent rather than self-parenting · case 02
The bounded fibonacci cut certificate reports an incorrect child parent.
Fibonacci cut clears the promoted child parent rather than self-parenting · case 03
The bounded fibonacci cut certificate reports an incorrect child parent.
Fibonacci cut clears the promoted child parent rather than self-parenting · case 04
The bounded fibonacci cut certificate reports an incorrect child parent.
Fibonacci cut clears the promoted child parent rather than self-parenting · case 05
The bounded fibonacci cut certificate reports an incorrect child parent.
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 ↗