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
ULP distance returns signed separation · case 01
ULP distance returns signed separation.
ULP distance returns signed separation · case 02
ULP distance returns signed separation.
ULP distance returns signed separation · case 03
ULP distance returns signed separation.
ULP distance returns signed separation · case 04
ULP distance returns signed separation.
ULP distance returns signed separation · case 05
ULP distance returns signed separation.
Subtracting one erases a tiny square-root increment · case 01
Subtracting one erases a tiny square-root increment.
Subtracting one erases a tiny square-root increment · case 02
Subtracting one erases a tiny square-root increment.
Subtracting one erases a tiny square-root increment · case 03
Subtracting one erases a tiny square-root increment.
Subtracting one erases a tiny square-root increment · case 04
Subtracting one erases a tiny square-root increment.
Subtracting one erases a tiny square-root increment · case 05
Subtracting one erases a tiny square-root increment.
Square-root increment silently clamps invalid radicands · case 01
Square-root increment silently clamps invalid radicands.
Square-root increment silently clamps invalid radicands · case 02
Square-root increment silently clamps invalid radicands.
Square-root increment silently clamps invalid radicands · case 03
Square-root increment silently clamps invalid radicands.
Square-root increment silently clamps invalid radicands · case 04
Square-root increment silently clamps invalid radicands.
Square-root increment silently clamps invalid radicands · case 05
Square-root increment silently clamps invalid radicands.
Square-root endpoint is assigned positive one · case 01
Square-root endpoint is assigned positive one.
Square-root endpoint is assigned positive one · case 02
Square-root endpoint is assigned positive one.
Square-root endpoint is assigned positive one · case 03
Square-root endpoint is assigned positive one.
Square-root endpoint is assigned positive one · case 04
Square-root endpoint is assigned positive one.
Square-root endpoint is assigned positive one · case 05
Square-root endpoint is assigned positive one.
Square-root increment loses the sign of exact negative zero · case 01
Square-root increment loses the sign of exact negative zero.
Square-root increment loses the sign of exact negative zero · case 02
Square-root increment loses the sign of exact negative zero.
Square-root increment loses the sign of exact negative zero · case 03
Square-root increment loses the sign of exact negative zero.
Square-root increment loses the sign of exact negative zero · case 04
Square-root increment loses the sign of exact negative zero.
Square-root increment loses the sign of exact negative zero · case 05
Square-root increment loses the sign of exact negative zero.
Rationalized square-root increment uses the wrong conjugate · case 01
Rationalized square-root increment uses the wrong conjugate.
Rationalized square-root increment uses the wrong conjugate · case 02
Rationalized square-root increment uses the wrong conjugate.
Rationalized square-root increment uses the wrong conjugate · case 03
Rationalized square-root increment uses the wrong conjugate.
Rationalized square-root increment uses the wrong conjugate · case 04
Rationalized square-root increment uses the wrong conjugate.
Rationalized square-root increment uses the wrong conjugate · case 05
Rationalized square-root increment uses the wrong conjugate.
Complementary log exponentials subtract near unity · case 01
Complementary log exponentials subtract near unity.
Complementary log exponentials subtract near unity · case 02
Complementary log exponentials subtract near unity.
Complementary log exponentials subtract near unity · case 03
Complementary log exponentials subtract near unity.
Complementary log exponentials subtract near unity · case 04
Complementary log exponentials subtract near unity.
Complementary log exponentials subtract near unity · case 05
Complementary log exponentials subtract near unity.
Complementary log exponentials lose the distant tail · case 01
Complementary log exponentials lose the distant tail.
Complementary log exponentials lose the distant tail · case 02
Complementary log exponentials lose the distant tail.
Complementary log exponentials lose the distant tail · case 03
Complementary log exponentials lose the distant tail.
Complementary log exponentials lose the distant tail · case 04
Complementary log exponentials lose the distant tail.
Complementary log exponentials lose the distant tail · case 05
Complementary log exponentials lose the distant tail.
Complementary log exponentials select unstable branches · case 01
Complementary log exponentials select unstable branches.
Complementary log exponentials select unstable branches · case 02
Complementary log exponentials select unstable branches.
Complementary log exponentials select unstable branches · case 03
Complementary log exponentials select unstable branches.
Complementary log exponentials select unstable branches · case 04
Complementary log exponentials select unstable branches.
Complementary log exponentials select unstable branches · case 05
Complementary log exponentials select unstable branches.
Complementary logarithm assigns a finite value at zero · case 01
Complementary logarithm assigns a finite value at zero.
Complementary logarithm assigns a finite value at zero · case 02
Complementary logarithm assigns a finite value at zero.
Complementary logarithm assigns a finite value at zero · case 03
Complementary logarithm assigns a finite value at zero.
Complementary logarithm assigns a finite value at zero · case 04
Complementary logarithm assigns a finite value at zero.
Complementary logarithm assigns a finite value at zero · case 05
Complementary logarithm assigns a finite value at zero.
Complementary logarithm reflects positive input into its domain · case 01
Complementary logarithm reflects positive input into its domain.
Complementary logarithm reflects positive input into its domain · case 02
Complementary logarithm reflects positive input into its domain.
Complementary logarithm reflects positive input into its domain · case 03
Complementary logarithm reflects positive input into its domain.
Complementary logarithm reflects positive input into its domain · case 04
Complementary logarithm reflects positive input into its domain.
Complementary logarithm reflects positive input into its domain · case 05
Complementary logarithm reflects positive input into its domain.
Softplus materializes a large positive exponential · case 01
Softplus materializes a large positive exponential.
Softplus materializes a large positive exponential · case 02
Softplus materializes a large positive exponential.
Softplus materializes a large positive exponential · case 03
Softplus materializes a large positive exponential.
Softplus materializes a large positive exponential · case 04
Softplus materializes a large positive exponential.
Softplus materializes a large positive exponential · case 05
Softplus materializes a large positive exponential.
Softplus adds one before taking the logarithm · case 01
Softplus adds one before taking the logarithm.
Softplus adds one before taking the logarithm · case 02
Softplus adds one before taking the logarithm.
Softplus adds one before taking the logarithm · case 03
Softplus adds one before taking the logarithm.
Softplus adds one before taking the logarithm · case 04
Softplus adds one before taking the logarithm.
Softplus adds one before taking the logarithm · case 05
Softplus adds one before taking the logarithm.
Softplus evaluates the wrong stabilized branch · case 01
Softplus evaluates the wrong stabilized branch.
Softplus evaluates the wrong stabilized branch · case 02
Softplus evaluates the wrong stabilized branch.
Softplus evaluates the wrong stabilized branch · case 03
Softplus evaluates the wrong stabilized branch.
Softplus evaluates the wrong stabilized branch · case 04
Softplus evaluates the wrong stabilized branch.
Softplus evaluates the wrong stabilized branch · case 05
Softplus evaluates the wrong stabilized branch.
Positive softplus drops its linear asymptote · case 01
Positive softplus drops its linear asymptote.
Positive softplus drops its linear asymptote · case 02
Positive softplus drops its linear asymptote.
Positive softplus drops its linear asymptote · case 03
Positive softplus drops its linear asymptote.
Positive softplus drops its linear asymptote · case 04
Positive softplus drops its linear asymptote.
Positive softplus drops its linear asymptote · case 05
Positive softplus drops its linear asymptote.
Negative softplus uses a reflected exponential · case 01
Negative softplus uses a reflected exponential.
Negative softplus uses a reflected exponential · case 02
Negative softplus uses a reflected exponential.
Negative softplus uses a reflected exponential · case 03
Negative softplus uses a reflected exponential.
Negative softplus uses a reflected exponential · case 04
Negative softplus uses a reflected exponential.
Negative softplus uses a reflected exponential · case 05
Negative softplus uses a reflected exponential.
Sigmoid exponentiates the large magnitude of a negative input · case 01
Sigmoid exponentiates the large magnitude of a negative input.
Sigmoid exponentiates the large magnitude of a negative input · case 02
Sigmoid exponentiates the large magnitude of a negative input.
Sigmoid exponentiates the large magnitude of a negative input · case 03
Sigmoid exponentiates the large magnitude of a negative input.
Sigmoid exponentiates the large magnitude of a negative input · case 04
Sigmoid exponentiates the large magnitude of a negative input.
Sigmoid exponentiates the large magnitude of a negative input · case 05
Sigmoid exponentiates the large magnitude of a negative input.
Sigmoid computes its negative tail as a complement · case 01
Sigmoid computes its negative tail as a complement.
Sigmoid computes its negative tail as a complement · case 02
Sigmoid computes its negative tail as a complement.
Sigmoid computes its negative tail as a complement · case 03
Sigmoid computes its negative tail as a complement.
Sigmoid computes its negative tail as a complement · case 04
Sigmoid computes its negative tail as a complement.
Sigmoid computes its negative tail as a complement · case 05
Sigmoid computes its negative tail as a complement.
Sigmoid reuses the negative-branch numerator on positive inputs · case 01
Sigmoid reuses the negative-branch numerator on positive inputs.
Sigmoid reuses the negative-branch numerator on positive inputs · case 02
Sigmoid reuses the negative-branch numerator on positive inputs.
Sigmoid reuses the negative-branch numerator on positive inputs · case 03
Sigmoid reuses the negative-branch numerator on positive inputs.
Sigmoid reuses the negative-branch numerator on positive inputs · case 04
Sigmoid reuses the negative-branch numerator on positive inputs.
Sigmoid reuses the negative-branch numerator on positive inputs · case 05
Sigmoid reuses the negative-branch numerator on positive inputs.
Sigmoid omits one from the negative-branch normalizer · case 01
Sigmoid omits one from the negative-branch normalizer.
Sigmoid omits one from the negative-branch normalizer · case 02
Sigmoid omits one from the negative-branch normalizer.
Sigmoid omits one from the negative-branch normalizer · case 03
Sigmoid omits one from the negative-branch normalizer.
Sigmoid omits one from the negative-branch normalizer · case 04
Sigmoid omits one from the negative-branch normalizer.
Sigmoid omits one from the negative-branch normalizer · case 05
Sigmoid omits one from the negative-branch normalizer.
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 ↗