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
Replacing an entry double-counts its existing cache weight · case 01
Replacing an entry double-counts its existing cache weight.
Replacing an entry double-counts its existing cache weight · case 02
Replacing an entry double-counts its existing cache weight.
Replacing an entry double-counts its existing cache weight · case 03
Replacing an entry double-counts its existing cache weight.
Replacing an entry double-counts its existing cache weight · case 04
Replacing an entry double-counts its existing cache weight.
Replacing an entry double-counts its existing cache weight · case 05
Replacing an entry double-counts its existing cache weight.
An uncacheable oversized value flushes unrelated cache entries · case 01
An uncacheable oversized value flushes unrelated cache entries.
An uncacheable oversized value flushes unrelated cache entries · case 02
An uncacheable oversized value flushes unrelated cache entries.
An uncacheable oversized value flushes unrelated cache entries · case 03
An uncacheable oversized value flushes unrelated cache entries.
An uncacheable oversized value flushes unrelated cache entries · case 04
An uncacheable oversized value flushes unrelated cache entries.
An uncacheable oversized value flushes unrelated cache entries · case 05
An uncacheable oversized value flushes unrelated cache entries.
A cached negative lookup is mistaken for a miss · case 01
A cached negative lookup is mistaken for a miss.
A cached negative lookup is mistaken for a miss · case 02
A cached negative lookup is mistaken for a miss.
A cached negative lookup is mistaken for a miss · case 03
A cached negative lookup is mistaken for a miss.
A cached negative lookup is mistaken for a miss · case 04
A cached negative lookup is mistaken for a miss.
A cached negative lookup is mistaken for a miss · case 05
A cached negative lookup is mistaken for a miss.
Creating a record leaves its cached absence visible · case 01
Creating a record leaves its cached absence visible.
Creating a record leaves its cached absence visible · case 02
Creating a record leaves its cached absence visible.
Creating a record leaves its cached absence visible · case 03
Creating a record leaves its cached absence visible.
Creating a record leaves its cached absence visible · case 04
Creating a record leaves its cached absence visible.
Creating a record leaves its cached absence visible · case 05
Creating a record leaves its cached absence visible.
A newly requested cached key is evicted before its hit updates recency · case 01
A newly requested cached key is evicted before its hit updates recency.
A newly requested cached key is evicted before its hit updates recency · case 02
A newly requested cached key is evicted before its hit updates recency.
A newly requested cached key is evicted before its hit updates recency · case 03
A newly requested cached key is evicted before its hit updates recency.
A newly requested cached key is evicted before its hit updates recency · case 04
A newly requested cached key is evicted before its hit updates recency.
A newly requested cached key is evicted before its hit updates recency · case 05
A newly requested cached key is evicted before its hit updates recency.
LFU eviction breaks equal-frequency ties by key name · case 01
LFU eviction breaks equal-frequency ties by key name.
LFU eviction breaks equal-frequency ties by key name · case 02
LFU eviction breaks equal-frequency ties by key name.
LFU eviction breaks equal-frequency ties by key name · case 03
LFU eviction breaks equal-frequency ties by key name.
LFU eviction breaks equal-frequency ties by key name · case 04
LFU eviction breaks equal-frequency ties by key name.
LFU eviction breaks equal-frequency ties by key name · case 05
LFU eviction breaks equal-frequency ties by key name.
A successful read resets LFU frequency instead of accumulating it · case 01
A successful read resets LFU frequency instead of accumulating it.
A successful read resets LFU frequency instead of accumulating it · case 02
A successful read resets LFU frequency instead of accumulating it.
A successful read resets LFU frequency instead of accumulating it · case 03
A successful read resets LFU frequency instead of accumulating it.
A successful read resets LFU frequency instead of accumulating it · case 04
A successful read resets LFU frequency instead of accumulating it.
A successful read resets LFU frequency instead of accumulating it · case 05
A successful read resets LFU frequency instead of accumulating it.
Eviction discards a dirty value without writing it back · case 01
Eviction discards a dirty value without writing it back.
Eviction discards a dirty value without writing it back · case 02
Eviction discards a dirty value without writing it back.
Eviction discards a dirty value without writing it back · case 03
Eviction discards a dirty value without writing it back.
Eviction discards a dirty value without writing it back · case 04
Eviction discards a dirty value without writing it back.
Eviction discards a dirty value without writing it back · case 05
Eviction discards a dirty value without writing it back.
A failed flush marks its cache entry clean · case 01
A failed flush marks its cache entry clean.
A failed flush marks its cache entry clean · case 02
A failed flush marks its cache entry clean.
A failed flush marks its cache entry clean · case 03
A failed flush marks its cache entry clean.
A failed flush marks its cache entry clean · case 04
A failed flush marks its cache entry clean.
A failed flush marks its cache entry clean · case 05
A failed flush marks its cache entry clean.
Completion of an old flush clears a newer dirty update · case 01
Completion of an old flush clears a newer dirty update.
Completion of an old flush clears a newer dirty update · case 02
Completion of an old flush clears a newer dirty update.
Completion of an old flush clears a newer dirty update · case 03
Completion of an old flush clears a newer dirty update.
Completion of an old flush clears a newer dirty update · case 04
Completion of an old flush clears a newer dirty update.
Completion of an old flush clears a newer dirty update · case 05
Completion of an old flush clears a newer dirty update.
Replacing a dirty value with a read result silently loses pending writes · case 01
Replacing a dirty value with a read result silently loses pending writes.
Replacing a dirty value with a read result silently loses pending writes · case 02
Replacing a dirty value with a read result silently loses pending writes.
Replacing a dirty value with a read result silently loses pending writes · case 03
Replacing a dirty value with a read result silently loses pending writes.
Replacing a dirty value with a read result silently loses pending writes · case 04
Replacing a dirty value with a read result silently loses pending writes.
Replacing a dirty value with a read result silently loses pending writes · case 05
Replacing a dirty value with a read result silently loses pending writes.
Tag invalidation keeps entries sharing only one requested tag · case 01
Tag invalidation keeps entries sharing only one requested tag.
Tag invalidation keeps entries sharing only one requested tag · case 02
Tag invalidation keeps entries sharing only one requested tag.
Tag invalidation keeps entries sharing only one requested tag · case 03
Tag invalidation keeps entries sharing only one requested tag.
Tag invalidation keeps entries sharing only one requested tag · case 04
Tag invalidation keeps entries sharing only one requested tag.
Tag invalidation keeps entries sharing only one requested tag · case 05
Tag invalidation keeps entries sharing only one requested tag.
Replacing entry tags leaves obsolete reverse-index membership · case 01
Replacing entry tags leaves obsolete reverse-index membership.
Replacing entry tags leaves obsolete reverse-index membership · case 02
Replacing entry tags leaves obsolete reverse-index membership.
Replacing entry tags leaves obsolete reverse-index membership · case 03
Replacing entry tags leaves obsolete reverse-index membership.
Replacing entry tags leaves obsolete reverse-index membership · case 04
Replacing entry tags leaves obsolete reverse-index membership.
Replacing entry tags leaves obsolete reverse-index membership · case 05
Replacing entry tags leaves obsolete reverse-index membership.
A cache namespace purge deletes similarly prefixed namespaces · case 01
A cache namespace purge deletes similarly prefixed namespaces.
A cache namespace purge deletes similarly prefixed namespaces · case 02
A cache namespace purge deletes similarly prefixed namespaces.
A cache namespace purge deletes similarly prefixed namespaces · case 03
A cache namespace purge deletes similarly prefixed namespaces.
A cache namespace purge deletes similarly prefixed namespaces · case 04
A cache namespace purge deletes similarly prefixed namespaces.
A cache namespace purge deletes similarly prefixed namespaces · case 05
A cache namespace purge deletes similarly prefixed namespaces.
An old fetch repopulates a cache after invalidation · case 01
An old fetch repopulates a cache after invalidation.
An old fetch repopulates a cache after invalidation · case 02
An old fetch repopulates a cache after invalidation.
An old fetch repopulates a cache after invalidation · case 03
An old fetch repopulates a cache after invalidation.
An old fetch repopulates a cache after invalidation · case 04
An old fetch repopulates a cache after invalidation.
An old fetch repopulates a cache after invalidation · case 05
An old fetch repopulates a cache after invalidation.
Representation identity ignores one of the selected request headers · case 01
Representation identity ignores one of the selected request headers.
Representation identity ignores one of the selected request headers · case 02
Representation identity ignores one of the selected request headers.
Representation identity ignores one of the selected request headers · case 03
Representation identity ignores one of the selected request headers.
Representation identity ignores one of the selected request headers · case 04
Representation identity ignores one of the selected request headers.
Representation identity ignores one of the selected request headers · case 05
Representation identity ignores one of the selected request headers.
Invalidating an empty-header variant also removes the absent-header variant · case 01
Invalidating an empty-header variant also removes the absent-header variant.
Invalidating an empty-header variant also removes the absent-header variant · case 02
Invalidating an empty-header variant also removes the absent-header variant.
Invalidating an empty-header variant also removes the absent-header variant · case 03
Invalidating an empty-header variant also removes the absent-header variant.
Invalidating an empty-header variant also removes the absent-header variant · case 04
Invalidating an empty-header variant also removes the absent-header variant.
Invalidating an empty-header variant also removes the absent-header variant · case 05
Invalidating an empty-header variant also removes the absent-header variant.
Updating one cached representation removes sibling variants · case 01
Updating one cached representation removes sibling variants.
Updating one cached representation removes sibling variants · case 02
Updating one cached representation removes sibling variants.
Updating one cached representation removes sibling variants · case 03
Updating one cached representation removes sibling variants.
Updating one cached representation removes sibling variants · case 04
Updating one cached representation removes sibling variants.
Updating one cached representation removes sibling variants · case 05
Updating one cached representation removes sibling variants.
A not-modified revalidation response replaces the cached body with an empty payload · case 01
A not-modified revalidation response replaces the cached body with an empty payload.
A not-modified revalidation response replaces the cached body with an empty payload · case 02
A not-modified revalidation response replaces the cached body with an empty payload.
A not-modified revalidation response replaces the cached body with an empty payload · case 03
A not-modified revalidation response replaces the cached body with an empty payload.
A not-modified revalidation response replaces the cached body with an empty payload · case 04
A not-modified revalidation response replaces the cached body with an empty payload.
A not-modified revalidation response replaces the cached body with an empty payload · case 05
A not-modified revalidation response replaces the cached body with an empty payload.
A refresh failure destroys a still-usable stale cache entry · case 01
A refresh failure destroys a still-usable stale cache entry.
A refresh failure destroys a still-usable stale cache entry · case 02
A refresh failure destroys a still-usable stale cache entry.
A refresh failure destroys a still-usable stale cache entry · case 03
A refresh failure destroys a still-usable stale cache entry.
A refresh failure destroys a still-usable stale cache entry · case 04
A refresh failure destroys a still-usable stale cache entry.
A refresh failure destroys a still-usable stale cache entry · case 05
A refresh failure destroys a still-usable stale cache entry.
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 ↗