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
Pcm two tap predictor: residual sign · case 01
Adaptive PCM residual nibble is interpreted as sign magnitude.
Pcm two tap predictor: residual sign · case 02
Adaptive PCM residual nibble is interpreted as sign magnitude.
Pcm two tap predictor: residual sign · case 03
Adaptive PCM residual nibble is interpreted as sign magnitude.
Pcm two tap predictor: residual sign · case 04
Adaptive PCM residual nibble is interpreted as sign magnitude.
Pcm two tap predictor: residual sign · case 05
Adaptive PCM residual nibble is interpreted as sign magnitude.
Pcm two tap predictor: delta scale · case 01
Delta scale is incorrectly applied to the predicted PCM level.
Pcm two tap predictor: delta scale · case 02
Delta scale is incorrectly applied to the predicted PCM level.
Pcm two tap predictor: delta scale · case 03
Delta scale is incorrectly applied to the predicted PCM level.
Pcm two tap predictor: delta scale · case 04
Delta scale is incorrectly applied to the predicted PCM level.
Pcm two tap predictor: delta scale · case 05
Delta scale is incorrectly applied to the predicted PCM level.
Pcm two tap predictor: history shift · case 01
Both predictor taps retain the newest decoded sample.
Pcm two tap predictor: history shift · case 02
Both predictor taps retain the newest decoded sample.
Pcm two tap predictor: history shift · case 03
Both predictor taps retain the newest decoded sample.
Pcm two tap predictor: history shift · case 04
Both predictor taps retain the newest decoded sample.
Pcm two tap predictor: history shift · case 05
Both predictor taps retain the newest decoded sample.
Pcm adaptation table: signed code index · case 01
PCM adaptation table lookup discards a significant nibble index bit.
Pcm adaptation table: signed code index · case 02
PCM adaptation table lookup discards a significant nibble index bit.
Pcm adaptation table: signed code index · case 03
PCM adaptation table lookup discards a significant nibble index bit.
Pcm adaptation table: signed code index · case 04
PCM adaptation table lookup discards a significant nibble index bit.
Pcm adaptation table: signed code index · case 05
PCM adaptation table lookup discards a significant nibble index bit.
Pcm adaptation table: current delta · case 01
Adaptation always scales the minimum rather than evolving delta.
Pcm adaptation table: current delta · case 02
Adaptation always scales the minimum rather than evolving delta.
Pcm adaptation table: current delta · case 03
Adaptation always scales the minimum rather than evolving delta.
Pcm adaptation table: current delta · case 04
Adaptation always scales the minimum rather than evolving delta.
Pcm adaptation table: current delta · case 05
Adaptation always scales the minimum rather than evolving delta.
Pcm adaptation table: fixed point scale · case 01
Adaptation factor uses the wrong binary fixed-point denominator.
Pcm adaptation table: fixed point scale · case 02
Adaptation factor uses the wrong binary fixed-point denominator.
Pcm adaptation table: fixed point scale · case 03
Adaptation factor uses the wrong binary fixed-point denominator.
Pcm adaptation table: fixed point scale · case 04
Adaptation factor uses the wrong binary fixed-point denominator.
Pcm adaptation table: fixed point scale · case 05
Adaptation factor uses the wrong binary fixed-point denominator.
Pcm adaptation table: minimum step · case 01
Quiet residuals shrink PCM step below the stipulated minimum.
Pcm adaptation table: minimum step · case 02
Quiet residuals shrink PCM step below the stipulated minimum.
Pcm adaptation table: minimum step · case 03
Quiet residuals shrink PCM step below the stipulated minimum.
Pcm adaptation table: minimum step · case 04
Quiet residuals shrink PCM step below the stipulated minimum.
Pcm adaptation table: minimum step · case 05
Quiet residuals shrink PCM step below the stipulated minimum.
Pcm adaptation table: returned state · case 01
Packet continuation resets adaptive delta to its lower bound.
Pcm adaptation table: returned state · case 02
Packet continuation resets adaptive delta to its lower bound.
Pcm adaptation table: returned state · case 03
Packet continuation resets adaptive delta to its lower bound.
Pcm adaptation table: returned state · case 04
Packet continuation resets adaptive delta to its lower bound.
Pcm adaptation table: returned state · case 05
Packet continuation resets adaptive delta to its lower bound.
Pcm mulaw code selection: bias before segment · case 01
Mu-law segment selection omits reconstruction bias.
Pcm mulaw code selection: bias before segment · case 02
Mu-law segment selection omits reconstruction bias.
Pcm mulaw code selection: bias before segment · case 03
Mu-law segment selection omits reconstruction bias.
Pcm mulaw code selection: bias before segment · case 04
Mu-law segment selection omits reconstruction bias.
Pcm mulaw code selection: bias before segment · case 05
Mu-law segment selection omits reconstruction bias.
Pcm mulaw code selection: segment boundary · case 01
An exact companding segment boundary stays in the lower segment.
Pcm mulaw code selection: segment boundary · case 02
An exact companding segment boundary stays in the lower segment.
Pcm mulaw code selection: segment boundary · case 03
An exact companding segment boundary stays in the lower segment.
Pcm mulaw code selection: segment boundary · case 04
An exact companding segment boundary stays in the lower segment.
Pcm mulaw code selection: segment boundary · case 05
An exact companding segment boundary stays in the lower segment.
Pcm mulaw code selection: mantissa shift · case 01
Mu-law mantissa extraction leaves three discarded precision bits.
Pcm mulaw code selection: mantissa shift · case 02
Mu-law mantissa extraction leaves three discarded precision bits.
Pcm mulaw code selection: mantissa shift · case 03
Mu-law mantissa extraction leaves three discarded precision bits.
Pcm mulaw code selection: mantissa shift · case 04
Mu-law mantissa extraction leaves three discarded precision bits.
Pcm mulaw code selection: mantissa shift · case 05
Mu-law mantissa extraction leaves three discarded precision bits.
Pcm mulaw code selection: polarity code · case 01
Companded PCM polarity bit uses the inverse convention.
Pcm mulaw code selection: polarity code · case 02
Companded PCM polarity bit uses the inverse convention.
Pcm mulaw code selection: polarity code · case 03
Companded PCM polarity bit uses the inverse convention.
Pcm mulaw code selection: polarity code · case 04
Companded PCM polarity bit uses the inverse convention.
Pcm mulaw code selection: polarity code · case 05
Companded PCM polarity bit uses the inverse convention.
Pcm mulaw code selection: wire complement · case 01
The companded output omits wire complement.
Pcm mulaw code selection: wire complement · case 02
The companded output omits wire complement.
Pcm mulaw code selection: wire complement · case 03
The companded output omits wire complement.
Pcm mulaw code selection: wire complement · case 04
The companded output omits wire complement.
Pcm mulaw code selection: wire complement · case 05
The companded output omits wire complement.
Pcm alaw code selection: negative magnitude rule · case 01
A-law negative input omits its complement offset at quantization boundaries.
Pcm alaw code selection: negative magnitude rule · case 02
A-law negative input omits its complement offset at quantization boundaries.
Pcm alaw code selection: negative magnitude rule · case 03
A-law negative input omits its complement offset at quantization boundaries.
Pcm alaw code selection: negative magnitude rule · case 04
A-law negative input omits its complement offset at quantization boundaries.
Pcm alaw code selection: negative magnitude rule · case 05
A-law negative input omits its complement offset at quantization boundaries.
Pcm alaw code selection: input resolution · case 01
A-law input reduction keeps one extra precision bit.
Pcm alaw code selection: input resolution · case 02
A-law input reduction keeps one extra precision bit.
Pcm alaw code selection: input resolution · case 03
A-law input reduction keeps one extra precision bit.
Pcm alaw code selection: input resolution · case 04
A-law input reduction keeps one extra precision bit.
Pcm alaw code selection: input resolution · case 05
A-law input reduction keeps one extra precision bit.
Pcm alaw code selection: small segment shift · case 01
The first segment uses the general exponent rule instead of its special mantissa shift.
Pcm alaw code selection: small segment shift · case 02
The first segment uses the general exponent rule instead of its special mantissa shift.
Pcm alaw code selection: small segment shift · case 03
The first segment uses the general exponent rule instead of its special mantissa shift.
Pcm alaw code selection: small segment shift · case 04
The first segment uses the general exponent rule instead of its special mantissa shift.
Pcm alaw code selection: small segment shift · case 05
The first segment uses the general exponent rule instead of its special mantissa shift.
Pcm alaw code selection: segment transition · case 01
Exact segment thresholds select the previous code segment.
Pcm alaw code selection: segment transition · case 02
Exact segment thresholds select the previous code segment.
Pcm alaw code selection: segment transition · case 03
Exact segment thresholds select the previous code segment.
Pcm alaw code selection: segment transition · case 04
Exact segment thresholds select the previous code segment.
Pcm alaw code selection: segment transition · case 05
Exact segment thresholds select the previous code segment.
Pcm alaw code selection: alternating wire mask · case 01
A-law code omits alternating-bit transmission mask.
Pcm alaw code selection: alternating wire mask · case 02
A-law code omits alternating-bit transmission mask.
Pcm alaw code selection: alternating wire mask · case 03
A-law code omits alternating-bit transmission mask.
Pcm alaw code selection: alternating wire mask · case 04
A-law code omits alternating-bit transmission mask.
Pcm alaw code selection: alternating wire mask · case 05
A-law code omits alternating-bit transmission mask.
Pcm nonlinear reconstruction table: negative code rejection · case 01
Negative PCM codewords index from the end of a calibration table.
Pcm nonlinear reconstruction table: negative code rejection · case 02
Negative PCM codewords index from the end of a calibration table.
Pcm nonlinear reconstruction table: negative code rejection · case 03
Negative PCM codewords index from the end of a calibration table.
Pcm nonlinear reconstruction table: negative code rejection · case 04
Negative PCM codewords index from the end of a calibration table.
Pcm nonlinear reconstruction table: negative code rejection · case 05
Negative PCM codewords index from the end of a calibration table.
Pcm nonlinear reconstruction table: last code valid · case 01
The final reconstruction code is rejected as if the table endpoint were exclusive.
Pcm nonlinear reconstruction table: last code valid · case 02
The final reconstruction code is rejected as if the table endpoint were exclusive.
Pcm nonlinear reconstruction table: last code valid · case 03
The final reconstruction code is rejected as if the table endpoint were exclusive.
Pcm nonlinear reconstruction table: last code valid · case 04
The final reconstruction code is rejected as if the table endpoint were exclusive.
Pcm nonlinear reconstruction table: last code valid · case 05
The final reconstruction code is rejected as if the table endpoint were exclusive.
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 ↗