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
Retractable central summary: Each insertion overwrites all accumulated central scatter. · case 01
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Each insertion overwrites all accumulated central scatter. · case 02
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Each insertion overwrites all accumulated central scatter. · case 03
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Each insertion overwrites all accumulated central scatter. · case 04
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Each insertion overwrites all accumulated central scatter. · case 05
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Every removal resets scatter, even when multiple observations survive. · case 01
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Every removal resets scatter, even when multiple observations survive. · case 02
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Every removal resets scatter, even when multiple observations survive. · case 03
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Every removal resets scatter, even when multiple observations survive. · case 04
The reduction disagrees with its explicit aggregation oracle.
Retractable central summary: Every removal resets scatter, even when multiple observations survive. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The initial level is zero instead of the first observation. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The initial level is zero instead of the first observation. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The initial level is zero instead of the first observation. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The initial level is zero instead of the first observation. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The initial level is zero instead of the first observation. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The previous level uses alpha rather than its complement. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The previous level uses alpha rather than its complement. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The previous level uses alpha rather than its complement. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The previous level uses alpha rather than its complement. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The previous level uses alpha rather than its complement. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The new observation receives the historical weight. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The new observation receives the historical weight. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The new observation receives the historical weight. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The new observation receives the historical weight. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The new observation receives the historical weight. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Every update uses the first observation instead of the recursive level. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Every update uses the first observation instead of the recursive level. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Every update uses the first observation instead of the recursive level. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Every update uses the first observation instead of the recursive level. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Every update uses the first observation instead of the recursive level. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The update is multiplied by alpha after already weighting the observation. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The update is multiplied by alpha after already weighting the observation. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The update is multiplied by alpha after already weighting the observation. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The update is multiplied by alpha after already weighting the observation. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The update is multiplied by alpha after already weighting the observation. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Observations are consumed from newest to oldest. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Observations are consumed from newest to oldest. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Observations are consumed from newest to oldest. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Observations are consumed from newest to oldest. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Observations are consumed from newest to oldest. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The mixing fraction is truncated before use. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The mixing fraction is truncated before use. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The mixing fraction is truncated before use. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The mixing fraction is truncated before use. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The mixing fraction is truncated before use. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The recursive level is truncated after every update. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The recursive level is truncated after every update. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The recursive level is truncated after every update. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The recursive level is truncated after every update. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The recursive level is truncated after every update. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The final sample is omitted from the recursion. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The final sample is omitted from the recursion. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The final sample is omitted from the recursion. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The final sample is omitted from the recursion. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: The final sample is omitted from the recursion. · case 05
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Recursive initialization is replaced by a normalized zero-origin exponential average. · case 01
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Recursive initialization is replaced by a normalized zero-origin exponential average. · case 02
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Recursive initialization is replaced by a normalized zero-origin exponential average. · case 03
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Recursive initialization is replaced by a normalized zero-origin exponential average. · case 04
The reduction disagrees with its explicit aggregation oracle.
Recursive exponential level: Recursive initialization is replaced by a normalized zero-origin exponential average. · case 05
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Decay age is the event arrival index rather than elapsed timestamp distance. · case 01
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Decay age is the event arrival index rather than elapsed timestamp distance. · case 02
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Decay age is the event arrival index rather than elapsed timestamp distance. · case 03
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Decay age is the event arrival index rather than elapsed timestamp distance. · case 04
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Decay age is the event arrival index rather than elapsed timestamp distance. · case 05
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: The exponential kernel amplifies historical contributions. · case 01
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: The exponential kernel amplifies historical contributions. · case 02
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: The exponential kernel amplifies historical contributions. · case 03
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: The exponential kernel amplifies historical contributions. · case 04
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: The exponential kernel amplifies historical contributions. · case 05
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: All values are combined and assigned the oldest timestamp. · case 01
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: All values are combined and assigned the oldest timestamp. · case 02
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: All values are combined and assigned the oldest timestamp. · case 03
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: All values are combined and assigned the oldest timestamp. · case 04
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: All values are combined and assigned the oldest timestamp. · case 05
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Events exactly at query time are excluded. · case 01
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Events exactly at query time are excluded. · case 02
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Events exactly at query time are excluded. · case 03
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Events exactly at query time are excluded. · case 04
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Events exactly at query time are excluded. · case 05
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Future events are clamped to zero age and included. · case 01
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Future events are clamped to zero age and included. · case 02
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Future events are clamped to zero age and included. · case 03
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Future events are clamped to zero age and included. · case 04
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Future events are clamped to zero age and included. · case 05
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Simultaneous contributions overwrite instead of accumulating. · case 01
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Simultaneous contributions overwrite instead of accumulating. · case 02
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Simultaneous contributions overwrite instead of accumulating. · case 03
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Simultaneous contributions overwrite instead of accumulating. · case 04
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Simultaneous contributions overwrite instead of accumulating. · case 05
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Each decayed contribution is integer-truncated. · case 01
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Each decayed contribution is integer-truncated. · case 02
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Each decayed contribution is integer-truncated. · case 03
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Each decayed contribution is integer-truncated. · case 04
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Each decayed contribution is integer-truncated. · case 05
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Current contributions are decayed once before entering the result. · case 01
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Current contributions are decayed once before entering the result. · case 02
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Current contributions are decayed once before entering the result. · case 03
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Current contributions are decayed once before entering the result. · case 04
The reduction disagrees with its explicit aggregation oracle.
Timestamp half decayed mass: Current contributions are decayed once before entering the result. · case 05
The reduction disagrees with its explicit aggregation oracle.
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 ↗