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
Recursive query joins frontier values to target rather than source · case 01
Recursive query joins frontier values to target rather than source.
Recursive query joins frontier values to target rather than source · case 02
Recursive query joins frontier values to target rather than source.
Recursive query joins frontier values to target rather than source · case 03
Recursive query joins frontier values to target rather than source.
Recursive query joins frontier values to target rather than source · case 04
Recursive query joins frontier values to target rather than source.
Recursive query joins frontier values to target rather than source · case 05
Recursive query joins frontier values to target rather than source.
Recursive bag evaluation removes repeated values encountered at later depths · case 01
Recursive bag evaluation removes repeated values encountered at later depths.
Recursive bag evaluation removes repeated values encountered at later depths · case 02
Recursive bag evaluation removes repeated values encountered at later depths.
Recursive bag evaluation removes repeated values encountered at later depths · case 03
Recursive bag evaluation removes repeated values encountered at later depths.
Recursive bag evaluation removes repeated values encountered at later depths · case 04
Recursive bag evaluation removes repeated values encountered at later depths.
Recursive bag evaluation removes repeated values encountered at later depths · case 05
Recursive bag evaluation removes repeated values encountered at later depths.
Interval join keeps intervals whose end equals the probe time · case 01
Interval join keeps intervals whose end equals the probe time.
Interval join keeps intervals whose end equals the probe time · case 02
Interval join keeps intervals whose end equals the probe time.
Interval join keeps intervals whose end equals the probe time · case 03
Interval join keeps intervals whose end equals the probe time.
Interval join keeps intervals whose end equals the probe time · case 04
Interval join keeps intervals whose end equals the probe time.
Interval join keeps intervals whose end equals the probe time · case 05
Interval join keeps intervals whose end equals the probe time.
Interval join admits intervals before their start · case 01
Interval join admits intervals before their start.
Interval join admits intervals before their start · case 02
Interval join admits intervals before their start.
Interval join admits intervals before their start · case 03
Interval join admits intervals before their start.
Interval join admits intervals before their start · case 04
Interval join admits intervals before their start.
Interval join admits intervals before their start · case 05
Interval join admits intervals before their start.
Interval join mixes active intervals from unrelated keys · case 01
Interval join mixes active intervals from unrelated keys.
Interval join mixes active intervals from unrelated keys · case 02
Interval join mixes active intervals from unrelated keys.
Interval join mixes active intervals from unrelated keys · case 03
Interval join mixes active intervals from unrelated keys.
Interval join mixes active intervals from unrelated keys · case 04
Interval join mixes active intervals from unrelated keys.
Interval join mixes active intervals from unrelated keys · case 05
Interval join mixes active intervals from unrelated keys.
Interval join emits only the first active matching interval · case 01
Interval join emits only the first active matching interval.
Interval join emits only the first active matching interval · case 02
Interval join emits only the first active matching interval.
Interval join emits only the first active matching interval · case 03
Interval join emits only the first active matching interval.
Interval join emits only the first active matching interval · case 04
Interval join emits only the first active matching interval.
Interval join emits only the first active matching interval · case 05
Interval join emits only the first active matching interval.
Interval join emits intervals by storage order rather than start order · case 01
Interval join emits intervals by storage order rather than start order.
Interval join emits intervals by storage order rather than start order · case 02
Interval join emits intervals by storage order rather than start order.
Interval join emits intervals by storage order rather than start order · case 03
Interval join emits intervals by storage order rather than start order.
Interval join emits intervals by storage order rather than start order · case 04
Interval join emits intervals by storage order rather than start order.
Interval join emits intervals by storage order rather than start order · case 05
Interval join emits intervals by storage order rather than start order.
Interval join emits timestamp in place of probe identity · case 01
Interval join emits timestamp in place of probe identity.
Interval join emits timestamp in place of probe identity · case 02
Interval join emits timestamp in place of probe identity.
Interval join emits timestamp in place of probe identity · case 03
Interval join emits timestamp in place of probe identity.
Interval join emits timestamp in place of probe identity · case 04
Interval join emits timestamp in place of probe identity.
Interval join emits timestamp in place of probe identity · case 05
Interval join emits timestamp in place of probe identity.
Reservation counts occupied slots as available · case 01
Reservation counts occupied slots as available.
Reservation counts occupied slots as available · case 02
Reservation counts occupied slots as available.
Reservation counts occupied slots as available · case 03
Reservation counts occupied slots as available.
Reservation counts occupied slots as available · case 04
Reservation counts occupied slots as available.
Reservation counts occupied slots as available · case 05
Reservation counts occupied slots as available.
Reservation exceeds the available slot budget · case 01
Reservation exceeds the available slot budget.
Reservation exceeds the available slot budget · case 02
Reservation exceeds the available slot budget.
Reservation exceeds the available slot budget · case 03
Reservation exceeds the available slot budget.
Reservation exceeds the available slot budget · case 04
Reservation exceeds the available slot budget.
Reservation exceeds the available slot budget · case 05
Reservation exceeds the available slot budget.
Reservation starts at the head instead of the write cursor · case 01
Reservation starts at the head instead of the write cursor.
Reservation starts at the head instead of the write cursor · case 02
Reservation starts at the head instead of the write cursor.
Reservation starts at the head instead of the write cursor · case 03
Reservation starts at the head instead of the write cursor.
Reservation starts at the head instead of the write cursor · case 04
Reservation starts at the head instead of the write cursor.
Reservation starts at the head instead of the write cursor · case 05
Reservation starts at the head instead of the write cursor.
Reservation treats a wrapping region as contiguous · case 01
Reservation treats a wrapping region as contiguous.
Reservation treats a wrapping region as contiguous · case 02
Reservation treats a wrapping region as contiguous.
Reservation treats a wrapping region as contiguous · case 03
Reservation treats a wrapping region as contiguous.
Reservation treats a wrapping region as contiguous · case 04
Reservation treats a wrapping region as contiguous.
Reservation treats a wrapping region as contiguous · case 05
Reservation treats a wrapping region as contiguous.
Reservation reuses the first span as the wrapped span · case 01
Reservation reuses the first span as the wrapped span.
Reservation reuses the first span as the wrapped span · case 02
Reservation reuses the first span as the wrapped span.
Reservation reuses the first span as the wrapped span · case 03
Reservation reuses the first span as the wrapped span.
Reservation reuses the first span as the wrapped span · case 04
Reservation reuses the first span as the wrapped span.
Reservation reuses the first span as the wrapped span · case 05
Reservation reuses the first span as the wrapped span.
Bulk consume advances across unoccupied slots · case 01
Bulk consume advances across unoccupied slots.
Bulk consume advances across unoccupied slots · case 02
Bulk consume advances across unoccupied slots.
Bulk consume advances across unoccupied slots · case 03
Bulk consume advances across unoccupied slots.
Bulk consume advances across unoccupied slots · case 04
Bulk consume advances across unoccupied slots.
Bulk consume advances across unoccupied slots · case 05
Bulk consume advances across unoccupied slots.
Bulk consume clears slots relative to array zero · case 01
Bulk consume clears slots relative to array zero.
Bulk consume clears slots relative to array zero · case 02
Bulk consume clears slots relative to array zero.
Bulk consume clears slots relative to array zero · case 03
Bulk consume clears slots relative to array zero.
Bulk consume clears slots relative to array zero · case 04
Bulk consume clears slots relative to array zero.
Bulk consume clears slots relative to array zero · case 05
Bulk consume clears slots relative to array zero.
Read cursor escapes the backing allocation after consume · case 01
Read cursor escapes the backing allocation after consume.
Read cursor escapes the backing allocation after consume · case 02
Read cursor escapes the backing allocation after consume.
Read cursor escapes the backing allocation after consume · case 03
Read cursor escapes the backing allocation after consume.
Read cursor escapes the backing allocation after consume · case 04
Read cursor escapes the backing allocation after consume.
Read cursor escapes the backing allocation after consume · case 05
Read cursor escapes the backing allocation after consume.
Consume overwrites occupancy with the consumed length · case 01
Consume overwrites occupancy with the consumed length.
Consume overwrites occupancy with the consumed length · case 02
Consume overwrites occupancy with the consumed length.
Consume overwrites occupancy with the consumed length · case 03
Consume overwrites occupancy with the consumed length.
Consume overwrites occupancy with the consumed length · case 04
Consume overwrites occupancy with the consumed length.
Consume overwrites occupancy with the consumed length · case 05
Consume overwrites occupancy with the consumed length.
Consume flags a boundary-touch as a split memory region · case 01
Consume flags a boundary-touch as a split memory region.
Consume flags a boundary-touch as a split memory region · case 02
Consume flags a boundary-touch as a split memory region.
Consume flags a boundary-touch as a split memory region · case 03
Consume flags a boundary-touch as a split memory region.
Consume flags a boundary-touch as a split memory region · case 04
Consume flags a boundary-touch as a split memory region.
Consume flags a boundary-touch as a split memory region · case 05
Consume flags a boundary-touch as a split memory region.
Growing a wrapped ring copies physical order · case 01
Growing a wrapped ring copies physical order.
Growing a wrapped ring copies physical order · case 02
Growing a wrapped ring copies physical order.
Growing a wrapped ring copies physical order · case 03
Growing a wrapped ring copies physical order.
Growing a wrapped ring copies physical order · case 04
Growing a wrapped ring copies physical order.
Growing a wrapped ring copies physical order · case 05
Growing a wrapped ring copies physical order.
Growth leaves old-capacity slack instead of new-capacity slack · case 01
Growth leaves old-capacity slack instead of new-capacity slack.
Growth leaves old-capacity slack instead of new-capacity slack · case 02
Growth leaves old-capacity slack instead of new-capacity slack.
Growth leaves old-capacity slack instead of new-capacity slack · case 03
Growth leaves old-capacity slack instead of new-capacity slack.
Growth leaves old-capacity slack instead of new-capacity slack · case 04
Growth leaves old-capacity slack instead of new-capacity slack.
Growth leaves old-capacity slack instead of new-capacity slack · case 05
Growth leaves old-capacity slack instead of new-capacity slack.
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 ↗