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
Leftist verifier compares children only with the left child · case 01
The bounded leftist ranks certificate reports an incorrect heap edges.
Leftist verifier compares children only with the left child · case 02
The bounded leftist ranks certificate reports an incorrect heap edges.
Leftist verifier compares children only with the left child · case 03
The bounded leftist ranks certificate reports an incorrect heap edges.
Leftist verifier compares children only with the left child · case 04
The bounded leftist ranks certificate reports an incorrect heap edges.
Leftist verifier compares children only with the left child · case 05
The bounded leftist ranks certificate reports an incorrect heap edges.
Leftist null-path rank is derived from the taller child · case 01
The bounded leftist ranks certificate reports an incorrect rank recurrence.
Leftist null-path rank is derived from the taller child · case 02
The bounded leftist ranks certificate reports an incorrect rank recurrence.
Leftist null-path rank is derived from the taller child · case 03
The bounded leftist ranks certificate reports an incorrect rank recurrence.
Leftist null-path rank is derived from the taller child · case 04
The bounded leftist ranks certificate reports an incorrect rank recurrence.
Leftist null-path rank is derived from the taller child · case 05
The bounded leftist ranks certificate reports an incorrect rank recurrence.
Leftist child swap uses key order instead of null-path ranks · case 01
The bounded leftist ranks certificate reports an incorrect orientation.
Leftist child swap uses key order instead of null-path ranks · case 02
The bounded leftist ranks certificate reports an incorrect orientation.
Leftist child swap uses key order instead of null-path ranks · case 03
The bounded leftist ranks certificate reports an incorrect orientation.
Leftist child swap uses key order instead of null-path ranks · case 04
The bounded leftist ranks certificate reports an incorrect orientation.
Leftist child swap uses key order instead of null-path ranks · case 05
The bounded leftist ranks certificate reports an incorrect orientation.
Leftist leaf accounting includes a unary left branch · case 01
The bounded leftist ranks certificate reports an incorrect leaves.
Leftist leaf accounting includes a unary left branch · case 02
The bounded leftist ranks certificate reports an incorrect leaves.
Leftist leaf accounting includes a unary left branch · case 03
The bounded leftist ranks certificate reports an incorrect leaves.
Leftist leaf accounting includes a unary left branch · case 04
The bounded leftist ranks certificate reports an incorrect leaves.
Leftist leaf accounting includes a unary left branch · case 05
The bounded leftist ranks certificate reports an incorrect leaves.
Leftist orientation audit misses a unary right child · case 01
The bounded leftist ranks certificate reports an incorrect right orphans.
Leftist orientation audit misses a unary right child · case 02
The bounded leftist ranks certificate reports an incorrect right orphans.
Leftist orientation audit misses a unary right child · case 03
The bounded leftist ranks certificate reports an incorrect right orphans.
Leftist orientation audit misses a unary right child · case 04
The bounded leftist ranks certificate reports an incorrect right orphans.
Leftist orientation audit misses a unary right child · case 05
The bounded leftist ranks certificate reports an incorrect right orphans.
Leftist meld work bound counts all nodes instead of right spine · case 01
The bounded leftist ranks certificate reports an incorrect spine length.
Leftist meld work bound counts all nodes instead of right spine · case 02
The bounded leftist ranks certificate reports an incorrect spine length.
Leftist meld work bound counts all nodes instead of right spine · case 03
The bounded leftist ranks certificate reports an incorrect spine length.
Leftist meld work bound counts all nodes instead of right spine · case 04
The bounded leftist ranks certificate reports an incorrect spine length.
Leftist meld work bound counts all nodes instead of right spine · case 05
The bounded leftist ranks certificate reports an incorrect spine length.
Pairing first child is assigned a null previous link · case 01
The bounded pairing siblings certificate reports an incorrect first previous.
Pairing first child is assigned a null previous link · case 02
The bounded pairing siblings certificate reports an incorrect first previous.
Pairing first child is assigned a null previous link · case 03
The bounded pairing siblings certificate reports an incorrect first previous.
Pairing first child is assigned a null previous link · case 04
The bounded pairing siblings certificate reports an incorrect first previous.
Pairing first child is assigned a null previous link · case 05
The bounded pairing siblings certificate reports an incorrect first previous.
Pairing sibling insertion inherits the prior sibling as parent · case 01
The bounded pairing siblings certificate reports an incorrect sibling parent.
Pairing sibling insertion inherits the prior sibling as parent · case 02
The bounded pairing siblings certificate reports an incorrect sibling parent.
Pairing sibling insertion inherits the prior sibling as parent · case 03
The bounded pairing siblings certificate reports an incorrect sibling parent.
Pairing sibling insertion inherits the prior sibling as parent · case 04
The bounded pairing siblings certificate reports an incorrect sibling parent.
Pairing sibling insertion inherits the prior sibling as parent · case 05
The bounded pairing siblings certificate reports an incorrect sibling parent.
Pairing unlink checks the next sibling against its parent · case 01
The bounded pairing siblings certificate reports an incorrect sibling previous.
Pairing unlink checks the next sibling against its parent · case 02
The bounded pairing siblings certificate reports an incorrect sibling previous.
Pairing unlink checks the next sibling against its parent · case 03
The bounded pairing siblings certificate reports an incorrect sibling previous.
Pairing unlink checks the next sibling against its parent · case 04
The bounded pairing siblings certificate reports an incorrect sibling previous.
Pairing unlink checks the next sibling against its parent · case 05
The bounded pairing siblings certificate reports an incorrect sibling previous.
Pairing meld leaves a sibling link on the new root · case 01
The bounded pairing siblings certificate reports an incorrect root links.
Pairing meld leaves a sibling link on the new root · case 02
The bounded pairing siblings certificate reports an incorrect root links.
Pairing meld leaves a sibling link on the new root · case 03
The bounded pairing siblings certificate reports an incorrect root links.
Pairing meld leaves a sibling link on the new root · case 04
The bounded pairing siblings certificate reports an incorrect root links.
Pairing meld leaves a sibling link on the new root · case 05
The bounded pairing siblings certificate reports an incorrect root links.
Pairing heap order is checked across sibling keys · case 01
The bounded pairing siblings certificate reports an incorrect child order.
Pairing heap order is checked across sibling keys · case 02
The bounded pairing siblings certificate reports an incorrect child order.
Pairing heap order is checked across sibling keys · case 03
The bounded pairing siblings certificate reports an incorrect child order.
Pairing heap order is checked across sibling keys · case 04
The bounded pairing siblings certificate reports an incorrect child order.
Pairing heap order is checked across sibling keys · case 05
The bounded pairing siblings certificate reports an incorrect child order.
Pairing degree counts only the first child pointer · case 01
The bounded pairing siblings certificate reports an incorrect degrees.
Pairing degree counts only the first child pointer · case 02
The bounded pairing siblings certificate reports an incorrect degrees.
Pairing degree counts only the first child pointer · case 03
The bounded pairing siblings certificate reports an incorrect degrees.
Pairing degree counts only the first child pointer · case 04
The bounded pairing siblings certificate reports an incorrect degrees.
Pairing degree counts only the first child pointer · case 05
The bounded pairing siblings certificate reports an incorrect degrees.
Radix monotonicity rejects a key equal to the last extraction · case 01
The bounded radix buckets certificate reports an incorrect monotone.
Radix monotonicity rejects a key equal to the last extraction · case 02
The bounded radix buckets certificate reports an incorrect monotone.
Radix monotonicity rejects a key equal to the last extraction · case 03
The bounded radix buckets certificate reports an incorrect monotone.
Radix monotonicity rejects a key equal to the last extraction · case 04
The bounded radix buckets certificate reports an incorrect monotone.
Radix monotonicity rejects a key equal to the last extraction · case 05
The bounded radix buckets certificate reports an incorrect monotone.
Radix bucket placement uses subtraction instead of highest differing bit · case 01
The bounded radix buckets certificate reports an incorrect placement.
Radix bucket placement uses subtraction instead of highest differing bit · case 02
The bounded radix buckets certificate reports an incorrect placement.
Radix bucket placement uses subtraction instead of highest differing bit · case 03
The bounded radix buckets certificate reports an incorrect placement.
Radix bucket placement uses subtraction instead of highest differing bit · case 04
The bounded radix buckets certificate reports an incorrect placement.
Radix bucket placement uses subtraction instead of highest differing bit · case 05
The bounded radix buckets certificate reports an incorrect placement.
Radix zero bucket accepts all keys below the next power of two · case 01
The bounded radix buckets certificate reports an incorrect zero members.
Radix zero bucket accepts all keys below the next power of two · case 02
The bounded radix buckets certificate reports an incorrect zero members.
Radix zero bucket accepts all keys below the next power of two · case 03
The bounded radix buckets certificate reports an incorrect zero members.
Radix zero bucket accepts all keys below the next power of two · case 04
The bounded radix buckets certificate reports an incorrect zero members.
Radix zero bucket accepts all keys below the next power of two · case 05
The bounded radix buckets certificate reports an incorrect zero members.
Radix redistribution chooses the largest occupied bucket · case 01
The bounded radix buckets certificate reports an incorrect next bucket.
Radix redistribution chooses the largest occupied bucket · case 02
The bounded radix buckets certificate reports an incorrect next bucket.
Radix redistribution chooses the largest occupied bucket · case 03
The bounded radix buckets certificate reports an incorrect next bucket.
Radix redistribution chooses the largest occupied bucket · case 04
The bounded radix buckets certificate reports an incorrect next bucket.
Radix redistribution chooses the largest occupied bucket · case 05
The bounded radix buckets certificate reports an incorrect next bucket.
Radix redistribution takes the first bucket entry as its threshold · case 01
The bounded radix buckets certificate reports an incorrect new last.
Radix redistribution takes the first bucket entry as its threshold · case 02
The bounded radix buckets certificate reports an incorrect new last.
Radix redistribution takes the first bucket entry as its threshold · case 03
The bounded radix buckets certificate reports an incorrect new last.
Radix redistribution takes the first bucket entry as its threshold · case 04
The bounded radix buckets certificate reports an incorrect new last.
Radix redistribution takes the first bucket entry as its threshold · case 05
The bounded radix buckets certificate reports an incorrect new last.
Radix width guard accepts the unrepresentable upper endpoint · case 01
The bounded radix buckets certificate reports an incorrect overflow.
Radix width guard accepts the unrepresentable upper endpoint · case 02
The bounded radix buckets certificate reports an incorrect overflow.
Radix width guard accepts the unrepresentable upper endpoint · case 03
The bounded radix buckets certificate reports an incorrect overflow.
Radix width guard accepts the unrepresentable upper endpoint · case 04
The bounded radix buckets certificate reports an incorrect overflow.
Radix width guard accepts the unrepresentable upper endpoint · case 05
The bounded radix buckets certificate reports an incorrect overflow.
Binomial link chooses the lower priority root regardless of identifier · case 01
The bounded binomial link certificate reports an incorrect winner.
Binomial link chooses the lower priority root regardless of identifier · case 02
The bounded binomial link certificate reports an incorrect winner.
Binomial link chooses the lower priority root regardless of identifier · case 03
The bounded binomial link certificate reports an incorrect winner.
Binomial link chooses the lower priority root regardless of identifier · case 04
The bounded binomial link certificate reports an incorrect winner.
Binomial link chooses the lower priority root regardless of identifier · case 05
The bounded binomial link certificate reports an incorrect winner.
Binomial link demotes the root that lost the priority comparison · case 01
The bounded binomial link certificate reports an incorrect loser.
Binomial link demotes the root that lost the priority comparison · case 02
The bounded binomial link certificate reports an incorrect loser.
Binomial link demotes the root that lost the priority comparison · case 03
The bounded binomial link certificate reports an incorrect loser.
Binomial link demotes the root that lost the priority comparison · case 04
The bounded binomial link certificate reports an incorrect loser.
Binomial link demotes the root that lost the priority comparison · case 05
The bounded binomial link certificate reports an incorrect loser.
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 ↗