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
Alaw expansion: segment offset · case 01
The first expanded segment omits its fixed offset.
Alaw expansion: segment offset · case 02
The first expanded segment omits its fixed offset.
Alaw expansion: segment offset · case 03
The first expanded segment omits its fixed offset.
Alaw expansion: segment offset · case 04
The first expanded segment omits its fixed offset.
Alaw expansion: segment offset · case 05
The first expanded segment omits its fixed offset.
Alaw expansion: segment shift · case 01
Higher A-law segments receive one extra shift.
Alaw expansion: segment shift · case 02
Higher A-law segments receive one extra shift.
Alaw expansion: segment shift · case 03
Higher A-law segments receive one extra shift.
Alaw expansion: segment shift · case 04
Higher A-law segments receive one extra shift.
Alaw expansion: segment shift · case 05
Higher A-law segments receive one extra shift.
Alaw expansion: polarity bit · case 01
A-law polarity uses the opposite convention from the decoder.
Alaw expansion: polarity bit · case 02
A-law polarity uses the opposite convention from the decoder.
Alaw expansion: polarity bit · case 03
A-law polarity uses the opposite convention from the decoder.
Alaw expansion: polarity bit · case 04
A-law polarity uses the opposite convention from the decoder.
Alaw expansion: polarity bit · case 05
A-law polarity uses the opposite convention from the decoder.
Excess code recenter: wire range clamp · case 01
Invalid wire values wrap into in-range amplitudes.
Excess code recenter: wire range clamp · case 02
Invalid wire values wrap into in-range amplitudes.
Excess code recenter: wire range clamp · case 03
Invalid wire values wrap into in-range amplitudes.
Excess code recenter: wire range clamp · case 04
Invalid wire values wrap into in-range amplitudes.
Excess code recenter: wire range clamp · case 05
Invalid wire values wrap into in-range amplitudes.
Excess code recenter: declared zero · case 01
A calibrated PCM zero code is replaced by a hard-coded midpoint.
Excess code recenter: declared zero · case 02
A calibrated PCM zero code is replaced by a hard-coded midpoint.
Excess code recenter: declared zero · case 03
A calibrated PCM zero code is replaced by a hard-coded midpoint.
Excess code recenter: declared zero · case 04
A calibrated PCM zero code is replaced by a hard-coded midpoint.
Excess code recenter: declared zero · case 05
A calibrated PCM zero code is replaced by a hard-coded midpoint.
Excess code recenter: negative headroom · case 01
Negative available amplitude is inferred from positive headroom.
Excess code recenter: negative headroom · case 02
Negative available amplitude is inferred from positive headroom.
Excess code recenter: negative headroom · case 03
Negative available amplitude is inferred from positive headroom.
Excess code recenter: negative headroom · case 04
Negative available amplitude is inferred from positive headroom.
Excess code recenter: negative headroom · case 05
Negative available amplitude is inferred from positive headroom.
Excess code recenter: positive headroom · case 01
Positive headroom is confused with the silence code.
Excess code recenter: positive headroom · case 02
Positive headroom is confused with the silence code.
Excess code recenter: positive headroom · case 03
Positive headroom is confused with the silence code.
Excess code recenter: positive headroom · case 04
Positive headroom is confused with the silence code.
Excess code recenter: positive headroom · case 05
Positive headroom is confused with the silence code.
Excess code recenter: inclusive wire end · case 01
The invalid code just beyond the field is treated as a valid endpoint.
Excess code recenter: inclusive wire end · case 02
The invalid code just beyond the field is treated as a valid endpoint.
Excess code recenter: inclusive wire end · case 03
The invalid code just beyond the field is treated as a valid endpoint.
Excess code recenter: inclusive wire end · case 04
The invalid code just beyond the field is treated as a valid endpoint.
Excess code recenter: inclusive wire end · case 05
The invalid code just beyond the field is treated as a valid endpoint.
Xor coded pcm: mask operation · case 01
A hardware line-inversion map is applied as a bit-set mask.
Xor coded pcm: mask operation · case 02
A hardware line-inversion map is applied as a bit-set mask.
Xor coded pcm: mask operation · case 03
A hardware line-inversion map is applied as a bit-set mask.
Xor coded pcm: mask operation · case 04
A hardware line-inversion map is applied as a bit-set mask.
Xor coded pcm: mask operation · case 05
A hardware line-inversion map is applied as a bit-set mask.
Xor coded pcm: masked domain · case 01
Out-of-field inversion-mask bits survive field extraction.
Xor coded pcm: masked domain · case 02
Out-of-field inversion-mask bits survive field extraction.
Xor coded pcm: masked domain · case 03
Out-of-field inversion-mask bits survive field extraction.
Xor coded pcm: masked domain · case 04
Out-of-field inversion-mask bits survive field extraction.
Xor coded pcm: masked domain · case 05
Out-of-field inversion-mask bits survive field extraction.
Xor coded pcm: zero detection · case 01
Silence detection uses the encoded electrical bits.
Xor coded pcm: zero detection · case 02
Silence detection uses the encoded electrical bits.
Xor coded pcm: zero detection · case 03
Silence detection uses the encoded electrical bits.
Xor coded pcm: zero detection · case 04
Silence detection uses the encoded electrical bits.
Xor coded pcm: zero detection · case 05
Silence detection uses the encoded electrical bits.
Xor coded pcm: signed field · case 01
Sign is tested before the sign line is uninverted.
Xor coded pcm: signed field · case 02
Sign is tested before the sign line is uninverted.
Xor coded pcm: signed field · case 03
Sign is tested before the sign line is uninverted.
Xor coded pcm: signed field · case 04
Sign is tested before the sign line is uninverted.
Xor coded pcm: signed field · case 05
Sign is tested before the sign line is uninverted.
Xor coded pcm: width mask · case 01
A single boundary bit is used where a contiguous field mask is required.
Xor coded pcm: width mask · case 02
A single boundary bit is used where a contiguous field mask is required.
Xor coded pcm: width mask · case 03
A single boundary bit is used where a contiguous field mask is required.
Xor coded pcm: width mask · case 04
A single boundary bit is used where a contiguous field mask is required.
Xor coded pcm: width mask · case 05
A single boundary bit is used where a contiguous field mask is required.
Pcm byte lane shuffle: lane permutation · case 01
A hardware byte-lane map is sorted instead of honored.
Pcm byte lane shuffle: lane permutation · case 02
A hardware byte-lane map is sorted instead of honored.
Pcm byte lane shuffle: lane permutation · case 03
A hardware byte-lane map is sorted instead of honored.
Pcm byte lane shuffle: lane permutation · case 04
A hardware byte-lane map is sorted instead of honored.
Pcm byte lane shuffle: lane permutation · case 05
A hardware byte-lane map is sorted instead of honored.
Pcm byte lane shuffle: repeat lanes · case 01
Repeated byte-lane entries are deduplicated despite explicit replicated-byte conversion.
Pcm byte lane shuffle: repeat lanes · case 02
Repeated byte-lane entries are deduplicated despite explicit replicated-byte conversion.
Pcm byte lane shuffle: repeat lanes · case 03
Repeated byte-lane entries are deduplicated despite explicit replicated-byte conversion.
Pcm byte lane shuffle: repeat lanes · case 04
Repeated byte-lane entries are deduplicated despite explicit replicated-byte conversion.
Pcm byte lane shuffle: repeat lanes · case 05
Repeated byte-lane entries are deduplicated despite explicit replicated-byte conversion.
Pcm byte lane shuffle: ignored padding · case 01
Pad validation examines selected sample bytes.
Pcm byte lane shuffle: ignored padding · case 02
Pad validation examines selected sample bytes.
Pcm byte lane shuffle: ignored padding · case 03
Pad validation examines selected sample bytes.
Pcm byte lane shuffle: ignored padding · case 04
Pad validation examines selected sample bytes.
Pcm byte lane shuffle: ignored padding · case 05
Pad validation examines selected sample bytes.
Pcm byte lane shuffle: all padding clean · case 01
One clean pad lane hides contamination elsewhere.
Pcm byte lane shuffle: all padding clean · case 02
One clean pad lane hides contamination elsewhere.
Pcm byte lane shuffle: all padding clean · case 03
One clean pad lane hides contamination elsewhere.
Pcm byte lane shuffle: all padding clean · case 04
One clean pad lane hides contamination elsewhere.
Pcm byte lane shuffle: all padding clean · case 05
One clean pad lane hides contamination elsewhere.
Pcm byte lane shuffle: output width · case 01
Converted sample width is reported as input container width.
Pcm byte lane shuffle: output width · case 02
Converted sample width is reported as input container width.
Pcm byte lane shuffle: output width · case 03
Converted sample width is reported as input container width.
Pcm byte lane shuffle: output width · case 04
Converted sample width is reported as input container width.
Pcm byte lane shuffle: output width · case 05
Converted sample width is reported as input container width.
Pcm bitplane restore: plane significance · case 01
Bit planes are assigned reversed amplitude significance.
Pcm bitplane restore: plane significance · case 02
Bit planes are assigned reversed amplitude significance.
Pcm bitplane restore: plane significance · case 03
Bit planes are assigned reversed amplitude significance.
Pcm bitplane restore: plane significance · case 04
Bit planes are assigned reversed amplitude significance.
Pcm bitplane restore: plane significance · case 05
Bit planes are assigned reversed amplitude significance.
Pcm bitplane restore: sample bit offset · case 01
Samples within each PCM bitplane are read in reverse order.
Pcm bitplane restore: sample bit offset · case 02
Samples within each PCM bitplane are read in reverse order.
Pcm bitplane restore: sample bit offset · case 03
Samples within each PCM bitplane are read in reverse order.
Pcm bitplane restore: sample bit offset · case 04
Samples within each PCM bitplane are read in reverse order.
Pcm bitplane restore: sample bit offset · case 05
Samples within each PCM bitplane are read in reverse order.
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 ↗