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
Beam search: completed pool is capped by discovery order · case 01
completed pool is capped by discovery order.
Beam search: completed pool is capped by discovery order · case 02
completed pool is capped by discovery order.
Beam search: completed pool is capped by discovery order · case 03
completed pool is capped by discovery order.
Beam search: completed pool is capped by discovery order · case 04
completed pool is capped by discovery order.
Beam search: completed pool is capped by discovery order · case 05
completed pool is capped by discovery order.
Beam search: equal beam scores depend on incidental input order · case 01
equal beam scores depend on incidental input order.
Beam search: equal beam scores depend on incidental input order · case 02
equal beam scores depend on incidental input order.
Beam search: equal beam scores depend on incidental input order · case 03
equal beam scores depend on incidental input order.
Beam search: equal beam scores depend on incidental input order · case 04
equal beam scores depend on incidental input order.
Beam search: equal beam scores depend on incidental input order · case 05
equal beam scores depend on incidental input order.
Beam search: duplicate token paths occupy multiple beam slots · case 01
duplicate token paths occupy multiple beam slots.
Beam search: duplicate token paths occupy multiple beam slots · case 02
duplicate token paths occupy multiple beam slots.
Beam search: duplicate token paths occupy multiple beam slots · case 03
duplicate token paths occupy multiple beam slots.
Beam search: duplicate token paths occupy multiple beam slots · case 04
duplicate token paths occupy multiple beam slots.
Beam search: duplicate token paths occupy multiple beam slots · case 05
duplicate token paths occupy multiple beam slots.
Beam search: zero-width search retains one live hypothesis · case 01
zero-width search retains one live hypothesis.
Beam search: zero-width search retains one live hypothesis · case 02
zero-width search retains one live hypothesis.
Beam search: zero-width search retains one live hypothesis · case 03
zero-width search retains one live hypothesis.
Beam search: zero-width search retains one live hypothesis · case 04
zero-width search retains one live hypothesis.
Beam search: zero-width search retains one live hypothesis · case 05
zero-width search retains one live hypothesis.
Beam search: child ancestry points to sorted candidate position rather than source parent · case 01
child ancestry points to sorted candidate position rather than source parent.
Beam search: child ancestry points to sorted candidate position rather than source parent · case 02
child ancestry points to sorted candidate position rather than source parent.
Beam search: child ancestry points to sorted candidate position rather than source parent · case 03
child ancestry points to sorted candidate position rather than source parent.
Beam search: child ancestry points to sorted candidate position rather than source parent · case 04
child ancestry points to sorted candidate position rather than source parent.
Beam search: child ancestry points to sorted candidate position rather than source parent · case 05
child ancestry points to sorted candidate position rather than source parent.
Beam search: completed paths are expanded again as live beams · case 01
completed paths are expanded again as live beams.
Beam search: completed paths are expanded again as live beams · case 02
completed paths are expanded again as live beams.
Beam search: completed paths are expanded again as live beams · case 03
completed paths are expanded again as live beams.
Beam search: completed paths are expanded again as live beams · case 04
completed paths are expanded again as live beams.
Beam search: completed paths are expanded again as live beams · case 05
completed paths are expanded again as live beams.
Beam search: length counter advances for prompt positions · case 01
length counter advances for prompt positions.
Beam search: length counter advances for prompt positions · case 02
length counter advances for prompt positions.
Beam search: length counter advances for prompt positions · case 03
length counter advances for prompt positions.
Beam search: length counter advances for prompt positions · case 04
length counter advances for prompt positions.
Beam search: length counter advances for prompt positions · case 05
length counter advances for prompt positions.
Beam search: beam stopping ignores the best normalized score a live path can still reach · case 01
beam stopping ignores the best normalized score a live path can still reach.
Beam search: beam stopping ignores the best normalized score a live path can still reach · case 02
beam stopping ignores the best normalized score a live path can still reach.
Beam search: beam stopping ignores the best normalized score a live path can still reach · case 03
beam stopping ignores the best normalized score a live path can still reach.
Beam search: beam stopping ignores the best normalized score a live path can still reach · case 04
beam stopping ignores the best normalized score a live path can still reach.
Beam search: beam stopping ignores the best normalized score a live path can still reach · case 05
beam stopping ignores the best normalized score a live path can still reach.
Absolute positions map relative to the cache origin · case 01
Writes land at an absolute index instead of an index relative to the cache origin.
Absolute positions map relative to the cache origin · case 02
Writes land at an absolute index instead of an index relative to the cache origin.
Absolute positions map relative to the cache origin · case 03
Writes land at an absolute index instead of an index relative to the cache origin.
Absolute positions map relative to the cache origin · case 04
Writes land at an absolute index instead of an index relative to the cache origin.
Absolute positions map relative to the cache origin · case 05
Writes land at an absolute index instead of an index relative to the cache origin.
Ring writes wrap at capacity · case 01
A cache write past the final slot escapes the circular buffer.
Ring writes wrap at capacity · case 02
A cache write past the final slot escapes the circular buffer.
Ring writes wrap at capacity · case 03
A cache write past the final slot escapes the circular buffer.
Ring writes wrap at capacity · case 04
A cache write past the final slot escapes the circular buffer.
Ring writes wrap at capacity · case 05
A cache write past the final slot escapes the circular buffer.
Ring slots are read in logical order · case 01
Physical slot order is returned as if it were chronological order.
Ring slots are read in logical order · case 02
Physical slot order is returned as if it were chronological order.
Ring slots are read in logical order · case 03
Physical slot order is returned as if it were chronological order.
Ring slots are read in logical order · case 04
Physical slot order is returned as if it were chronological order.
Ring slots are read in logical order · case 05
Physical slot order is returned as if it were chronological order.
Paged cache position selects the correct block · case 01
A logical position at a page boundary is assigned to the preceding block.
Paged cache position selects the correct block · case 02
A logical position at a page boundary is assigned to the preceding block.
Paged cache position selects the correct block · case 03
A logical position at a page boundary is assigned to the preceding block.
Paged cache position selects the correct block · case 04
A logical position at a page boundary is assigned to the preceding block.
Paged cache position selects the correct block · case 05
A logical position at a page boundary is assigned to the preceding block.
Paged cache resolves through the sequence block table · case 01
A logical page is represented by its local offset instead of the physical slot in that page.
Paged cache resolves through the sequence block table · case 02
A logical page is represented by its local offset instead of the physical slot in that page.
Paged cache resolves through the sequence block table · case 03
A logical page is represented by its local offset instead of the physical slot in that page.
Paged cache resolves through the sequence block table · case 04
A logical page is represented by its local offset instead of the physical slot in that page.
Paged cache resolves through the sequence block table · case 05
A logical page is represented by its local offset instead of the physical slot in that page.
Left padding does not consume logical positions · case 01
Position IDs include the leading pad cells.
Left padding does not consume logical positions · case 02
Position IDs include the leading pad cells.
Left padding does not consume logical positions · case 03
Position IDs include the leading pad cells.
Left padding does not consume logical positions · case 04
Position IDs include the leading pad cells.
Left padding does not consume logical positions · case 05
Position IDs include the leading pad cells.
Append rejects a discontinuous logical position · case 01
A skipped position is silently written as if it followed the cache tail.
Append rejects a discontinuous logical position · case 02
A skipped position is silently written as if it followed the cache tail.
Append rejects a discontinuous logical position · case 03
A skipped position is silently written as if it followed the cache tail.
Append rejects a discontinuous logical position · case 04
A skipped position is silently written as if it followed the cache tail.
Append rejects a discontinuous logical position · case 05
A skipped position is silently written as if it followed the cache tail.
Packed segments reset logical positions at boundaries · case 01
A new packed sequence inherits the prior segment’s final position.
Packed segments reset logical positions at boundaries · case 02
A new packed sequence inherits the prior segment’s final position.
Packed segments reset logical positions at boundaries · case 03
A new packed sequence inherits the prior segment’s final position.
Packed segments reset logical positions at boundaries · case 04
A new packed sequence inherits the prior segment’s final position.
Packed segments reset logical positions at boundaries · case 05
A new packed sequence inherits the prior segment’s final position.
Beam cache rows follow selected parent beams · case 01
Child beams inherit cache rows in their previous row order.
Beam cache rows follow selected parent beams · case 02
Child beams inherit cache rows in their previous row order.
Beam cache rows follow selected parent beams · case 03
Child beams inherit cache rows in their previous row order.
Beam cache rows follow selected parent beams · case 04
Child beams inherit cache rows in their previous row order.
Beam cache rows follow selected parent beams · case 05
Child beams inherit cache rows in their previous row order.
Sliding eviction retains one stale position · case 01
A key just outside the trailing window remains in the cache.
Sliding eviction retains one stale position · case 02
A key just outside the trailing window remains in the cache.
Sliding eviction retains one stale position · case 03
A key just outside the trailing window remains in the cache.
Sliding eviction retains one stale position · case 04
A key just outside the trailing window remains in the cache.
Sliding eviction retains one stale position · case 05
A key just outside the trailing window remains in the cache.
Sink tokens survive rolling-window eviction · case 01
Eviction removes the initial sink positions along with stale middle positions.
Sink tokens survive rolling-window eviction · case 02
Eviction removes the initial sink positions along with stale middle positions.
Sink tokens survive rolling-window eviction · case 03
Eviction removes the initial sink positions along with stale middle positions.
Sink tokens survive rolling-window eviction · case 04
Eviction removes the initial sink positions along with stale middle positions.
Sink tokens survive rolling-window eviction · case 05
Eviction removes the initial sink positions along with stale middle positions.
Prefix reuse reports the common token prefix length · case 01
Reuse stops at the first differing token but reports the final sequence length.
Prefix reuse reports the common token prefix length · case 02
Reuse stops at the first differing token but reports the final sequence length.
Prefix reuse reports the common token prefix length · case 03
Reuse stops at the first differing token but reports the final sequence length.
Prefix reuse reports the common token prefix length · case 04
Reuse stops at the first differing token but reports the final sequence length.
Prefix reuse reports the common token prefix length · case 05
Reuse stops at the first differing token but reports the final sequence length.
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 ↗