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
Leaving zero increments its old signed encoding · case 01
Leaving zero increments its old signed encoding.
Leaving zero increments its old signed encoding · case 02
Leaving zero increments its old signed encoding.
Leaving zero increments its old signed encoding · case 03
Leaving zero increments its old signed encoding.
Leaving zero increments its old signed encoding · case 04
Leaving zero increments its old signed encoding.
Leaving zero increments its old signed encoding · case 05
Leaving zero increments its old signed encoding.
Positive adjacency always increments the encoding · case 01
Positive adjacency always increments the encoding.
Positive adjacency always increments the encoding · case 02
Positive adjacency always increments the encoding.
Positive adjacency always increments the encoding · case 03
Positive adjacency always increments the encoding.
Positive adjacency always increments the encoding · case 04
Positive adjacency always increments the encoding.
Positive adjacency always increments the encoding · case 05
Positive adjacency always increments the encoding.
Negative adjacency uses unsigned monotonic order · case 01
Negative adjacency uses unsigned monotonic order.
Negative adjacency uses unsigned monotonic order · case 02
Negative adjacency uses unsigned monotonic order.
Negative adjacency uses unsigned monotonic order · case 03
Negative adjacency uses unsigned monotonic order.
Negative adjacency uses unsigned monotonic order · case 04
Negative adjacency uses unsigned monotonic order.
Negative adjacency uses unsigned monotonic order · case 05
Negative adjacency uses unsigned monotonic order.
ULP lookup reports NaN as infinity · case 01
ULP lookup reports NaN as infinity.
ULP lookup reports NaN as infinity · case 02
ULP lookup reports NaN as infinity.
ULP lookup reports NaN as infinity · case 03
ULP lookup reports NaN as infinity.
ULP lookup reports NaN as infinity · case 04
ULP lookup reports NaN as infinity.
ULP lookup reports NaN as infinity · case 05
ULP lookup reports NaN as infinity.
ULP lookup assigns a finite spacing to infinity · case 01
ULP lookup assigns a finite spacing to infinity.
ULP lookup assigns a finite spacing to infinity · case 02
ULP lookup assigns a finite spacing to infinity.
ULP lookup assigns a finite spacing to infinity · case 03
ULP lookup assigns a finite spacing to infinity.
ULP lookup assigns a finite spacing to infinity · case 04
ULP lookup assigns a finite spacing to infinity.
ULP lookup assigns a finite spacing to infinity · case 05
ULP lookup assigns a finite spacing to infinity.
Zero ULP is rounded to zero · case 01
Zero ULP is rounded to zero.
Zero ULP is rounded to zero · case 02
Zero ULP is rounded to zero.
Zero ULP is rounded to zero · case 03
Zero ULP is rounded to zero.
Zero ULP is rounded to zero · case 04
Zero ULP is rounded to zero.
Zero ULP is rounded to zero · case 05
Zero ULP is rounded to zero.
ULP uses the exponent of the next binade · case 01
ULP uses the exponent of the next binade.
ULP uses the exponent of the next binade · case 02
ULP uses the exponent of the next binade.
ULP uses the exponent of the next binade · case 03
ULP uses the exponent of the next binade.
ULP uses the exponent of the next binade · case 04
ULP uses the exponent of the next binade.
ULP uses the exponent of the next binade · case 05
ULP uses the exponent of the next binade.
ULP scaling underflows below the subnormal spacing · case 01
ULP scaling underflows below the subnormal spacing.
ULP scaling underflows below the subnormal spacing · case 02
ULP scaling underflows below the subnormal spacing.
ULP scaling underflows below the subnormal spacing · case 03
ULP scaling underflows below the subnormal spacing.
ULP scaling underflows below the subnormal spacing · case 04
ULP scaling underflows below the subnormal spacing.
ULP scaling underflows below the subnormal spacing · case 05
ULP scaling underflows below the subnormal spacing.
An inexact result ignores sticky-only residue · case 01
An inexact result ignores sticky-only residue.
An inexact result ignores sticky-only residue · case 02
An inexact result ignores sticky-only residue.
An inexact result ignores sticky-only residue · case 03
An inexact result ignores sticky-only residue.
An inexact result ignores sticky-only residue · case 04
An inexact result ignores sticky-only residue.
An inexact result ignores sticky-only residue · case 05
An inexact result ignores sticky-only residue.
Nearest-even rounding ignores retained parity · case 01
Nearest-even rounding ignores retained parity.
Nearest-even rounding ignores retained parity · case 02
Nearest-even rounding ignores retained parity.
Nearest-even rounding ignores retained parity · case 03
Nearest-even rounding ignores retained parity.
Nearest-even rounding ignores retained parity · case 04
Nearest-even rounding ignores retained parity.
Nearest-even rounding ignores retained parity · case 05
Nearest-even rounding ignores retained parity.
Nearest rounding treats any discarded bit as above-half · case 01
Nearest rounding treats any discarded bit as above-half.
Nearest rounding treats any discarded bit as above-half · case 02
Nearest rounding treats any discarded bit as above-half.
Nearest rounding treats any discarded bit as above-half · case 03
Nearest rounding treats any discarded bit as above-half.
Nearest rounding treats any discarded bit as above-half · case 04
Nearest rounding treats any discarded bit as above-half.
Nearest rounding treats any discarded bit as above-half · case 05
Nearest rounding treats any discarded bit as above-half.
Nearest rounding loses the round bit after a guard · case 01
Nearest rounding loses the round bit after a guard.
Nearest rounding loses the round bit after a guard · case 02
Nearest rounding loses the round bit after a guard.
Nearest rounding loses the round bit after a guard · case 03
Nearest rounding loses the round bit after a guard.
Nearest rounding loses the round bit after a guard · case 04
Nearest rounding loses the round bit after a guard.
Nearest rounding loses the round bit after a guard · case 05
Nearest rounding loses the round bit after a guard.
Nearest rounding loses sticky residue after a guard · case 01
Nearest rounding loses sticky residue after a guard.
Nearest rounding loses sticky residue after a guard · case 02
Nearest rounding loses sticky residue after a guard.
Nearest rounding loses sticky residue after a guard · case 03
Nearest rounding loses sticky residue after a guard.
Nearest rounding loses sticky residue after a guard · case 04
Nearest rounding loses sticky residue after a guard.
Nearest rounding loses sticky residue after a guard · case 05
Nearest rounding loses sticky residue after a guard.
Nearest-away incorrectly follows ties-to-even · case 01
Nearest-away incorrectly follows ties-to-even.
Nearest-away incorrectly follows ties-to-even · case 02
Nearest-away incorrectly follows ties-to-even.
Nearest-away incorrectly follows ties-to-even · case 03
Nearest-away incorrectly follows ties-to-even.
Nearest-away incorrectly follows ties-to-even · case 04
Nearest-away incorrectly follows ties-to-even.
Nearest-away incorrectly follows ties-to-even · case 05
Nearest-away incorrectly follows ties-to-even.
Rounding upward increments negative magnitudes · case 01
Rounding upward increments negative magnitudes.
Rounding upward increments negative magnitudes · case 02
Rounding upward increments negative magnitudes.
Rounding upward increments negative magnitudes · case 03
Rounding upward increments negative magnitudes.
Rounding upward increments negative magnitudes · case 04
Rounding upward increments negative magnitudes.
Rounding upward increments negative magnitudes · case 05
Rounding upward increments negative magnitudes.
Rounding downward increments positive magnitudes · case 01
Rounding downward increments positive magnitudes.
Rounding downward increments positive magnitudes · case 02
Rounding downward increments positive magnitudes.
Rounding downward increments positive magnitudes · case 03
Rounding downward increments positive magnitudes.
Rounding downward increments positive magnitudes · case 04
Rounding downward increments positive magnitudes.
Rounding downward increments positive magnitudes · case 05
Rounding downward increments positive magnitudes.
Truncation applies the nearest rounding increment · case 01
Truncation applies the nearest rounding increment.
Truncation applies the nearest rounding increment · case 02
Truncation applies the nearest rounding increment.
Truncation applies the nearest rounding increment · case 03
Truncation applies the nearest rounding increment.
Truncation applies the nearest rounding increment · case 04
Truncation applies the nearest rounding increment.
Truncation applies the nearest rounding increment · case 05
Truncation applies the nearest rounding increment.
Rounding increments after applying the negative sign · case 01
Rounding increments after applying the negative sign.
Rounding increments after applying the negative sign · case 02
Rounding increments after applying the negative sign.
Rounding increments after applying the negative sign · case 03
Rounding increments after applying the negative sign.
Rounding increments after applying the negative sign · case 04
Rounding increments after applying the negative sign.
Rounding increments after applying the negative sign · case 05
Rounding increments after applying the negative sign.
Encoding flushes signed zero to positive zero · case 01
Encoding flushes signed zero to positive zero.
Encoding flushes signed zero to positive zero · case 02
Encoding flushes signed zero to positive zero.
Encoding flushes signed zero to positive zero · case 03
Encoding flushes signed zero to positive zero.
Encoding flushes signed zero to positive zero · case 04
Encoding flushes signed zero to positive zero.
Encoding flushes signed zero to positive zero · case 05
Encoding flushes signed zero to positive zero.
Overflow uses the largest finite value as its threshold · case 01
Overflow uses the largest finite value as its threshold.
Overflow uses the largest finite value as its threshold · case 02
Overflow uses the largest finite value as its threshold.
Overflow uses the largest finite value as its threshold · case 03
Overflow uses the largest finite value as its threshold.
Overflow uses the largest finite value as its threshold · case 04
Overflow uses the largest finite value as its threshold.
Overflow uses the largest finite value as its threshold · case 05
Overflow uses the largest finite value as its threshold.
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 ↗