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 bitplane restore: declared plane bound · case 01
Extra transport planes leak above the PCM field.
Pcm bitplane restore: declared plane bound · case 02
Extra transport planes leak above the PCM field.
Pcm bitplane restore: declared plane bound · case 03
Extra transport planes leak above the PCM field.
Pcm bitplane restore: declared plane bound · case 04
Extra transport planes leak above the PCM field.
Pcm bitplane restore: declared plane bound · case 05
Extra transport planes leak above the PCM field.
Pcm bitplane restore: plane combine · case 01
Each incoming plane overwrites all previously restored signal bits.
Pcm bitplane restore: plane combine · case 02
Each incoming plane overwrites all previously restored signal bits.
Pcm bitplane restore: plane combine · case 03
Each incoming plane overwrites all previously restored signal bits.
Pcm bitplane restore: plane combine · case 04
Each incoming plane overwrites all previously restored signal bits.
Pcm bitplane restore: plane combine · case 05
Each incoming plane overwrites all previously restored signal bits.
Pcm bitplane restore: field sign · case 01
Sign is inferred from a low-order plane instead of reconstructed sample.
Pcm bitplane restore: field sign · case 02
Sign is inferred from a low-order plane instead of reconstructed sample.
Pcm bitplane restore: field sign · case 03
Sign is inferred from a low-order plane instead of reconstructed sample.
Pcm bitplane restore: field sign · case 04
Sign is inferred from a low-order plane instead of reconstructed sample.
Pcm bitplane restore: field sign · case 05
Sign is inferred from a low-order plane instead of reconstructed sample.
Pcm byteplane restore: plane stride · case 01
Each byte plane reuses its first sample byte.
Pcm byteplane restore: plane stride · case 02
Each byte plane reuses its first sample byte.
Pcm byteplane restore: plane stride · case 03
Each byte plane reuses its first sample byte.
Pcm byteplane restore: plane stride · case 04
Each byte plane reuses its first sample byte.
Pcm byteplane restore: plane stride · case 05
Each byte plane reuses its first sample byte.
Pcm byteplane restore: octet weight · case 01
Byte planes are weighted as single-bit planes.
Pcm byteplane restore: octet weight · case 02
Byte planes are weighted as single-bit planes.
Pcm byteplane restore: octet weight · case 03
Byte planes are weighted as single-bit planes.
Pcm byteplane restore: octet weight · case 04
Byte planes are weighted as single-bit planes.
Pcm byteplane restore: octet weight · case 05
Byte planes are weighted as single-bit planes.
Pcm byteplane restore: highest plane · case 01
The sign-containing final plane is omitted.
Pcm byteplane restore: highest plane · case 02
The sign-containing final plane is omitted.
Pcm byteplane restore: highest plane · case 03
The sign-containing final plane is omitted.
Pcm byteplane restore: highest plane · case 04
The sign-containing final plane is omitted.
Pcm byteplane restore: highest plane · case 05
The sign-containing final plane is omitted.
Pcm byteplane restore: sample bound · case 01
The final declared sample is lost.
Pcm byteplane restore: sample bound · case 02
The final declared sample is lost.
Pcm byteplane restore: sample bound · case 03
The final declared sample is lost.
Pcm byteplane restore: sample bound · case 04
The final declared sample is lost.
Pcm byteplane restore: sample bound · case 05
The final declared sample is lost.
Pcm byteplane restore: signed conversion · case 01
Negative plane-assembled words use half the complement modulus.
Pcm byteplane restore: signed conversion · case 02
Negative plane-assembled words use half the complement modulus.
Pcm byteplane restore: signed conversion · case 03
Negative plane-assembled words use half the complement modulus.
Pcm byteplane restore: signed conversion · case 04
Negative plane-assembled words use half the complement modulus.
Pcm byteplane restore: signed conversion · case 05
Negative plane-assembled words use half the complement modulus.
Pcm slot status: validity polarity · case 01
The PCM invalid flag is interpreted as valid.
Pcm slot status: validity polarity · case 02
The PCM invalid flag is interpreted as valid.
Pcm slot status: validity polarity · case 03
The PCM invalid flag is interpreted as valid.
Pcm slot status: validity polarity · case 04
The PCM invalid flag is interpreted as valid.
Pcm slot status: validity polarity · case 05
The PCM invalid flag is interpreted as valid.
Pcm slot status: parity status inclusion · case 01
Parity omits the invalid-status bit carried in the protected slot.
Pcm slot status: parity status inclusion · case 02
Parity omits the invalid-status bit carried in the protected slot.
Pcm slot status: parity status inclusion · case 03
Parity omits the invalid-status bit carried in the protected slot.
Pcm slot status: parity status inclusion · case 04
Parity omits the invalid-status bit carried in the protected slot.
Pcm slot status: parity status inclusion · case 05
Parity omits the invalid-status bit carried in the protected slot.
Pcm slot status: parity location · case 01
The invalid bit is reused as parity.
Pcm slot status: parity location · case 02
The invalid bit is reused as parity.
Pcm slot status: parity location · case 03
The invalid bit is reused as parity.
Pcm slot status: parity location · case 04
The invalid bit is reused as parity.
Pcm slot status: parity location · case 05
The invalid bit is reused as parity.
Pcm slot status: validity gate · case 01
A valid flag bypasses a detected parity error.
Pcm slot status: validity gate · case 02
A valid flag bypasses a detected parity error.
Pcm slot status: validity gate · case 03
A valid flag bypasses a detected parity error.
Pcm slot status: validity gate · case 04
A valid flag bypasses a detected parity error.
Pcm slot status: validity gate · case 05
A valid flag bypasses a detected parity error.
Pcm slot status: payload mask · case 01
Status bits are retained in numerical PCM reconstruction.
Pcm slot status: payload mask · case 02
Status bits are retained in numerical PCM reconstruction.
Pcm slot status: payload mask · case 03
Status bits are retained in numerical PCM reconstruction.
Pcm slot status: payload mask · case 04
Status bits are retained in numerical PCM reconstruction.
Pcm slot status: payload mask · case 05
Status bits are retained in numerical PCM reconstruction.
Pcm frame sequence: sequence modulus · case 01
PCM packet wraparound is interpreted as an old packet.
Pcm frame sequence: sequence modulus · case 02
PCM packet wraparound is interpreted as an old packet.
Pcm frame sequence: sequence modulus · case 03
PCM packet wraparound is interpreted as an old packet.
Pcm frame sequence: sequence modulus · case 04
PCM packet wraparound is interpreted as an old packet.
Pcm frame sequence: sequence modulus · case 05
PCM packet wraparound is interpreted as an old packet.
Pcm frame sequence: gap threshold · case 01
The ambiguous half-cycle packet is accepted as a forward gap.
Pcm frame sequence: gap threshold · case 02
The ambiguous half-cycle packet is accepted as a forward gap.
Pcm frame sequence: gap threshold · case 03
The ambiguous half-cycle packet is accepted as a forward gap.
Pcm frame sequence: gap threshold · case 04
The ambiguous half-cycle packet is accepted as a forward gap.
Pcm frame sequence: gap threshold · case 05
The ambiguous half-cycle packet is accepted as a forward gap.
Pcm frame sequence: gap placeholder · case 01
Missing packet units become valid digital-silence samples.
Pcm frame sequence: gap placeholder · case 02
Missing packet units become valid digital-silence samples.
Pcm frame sequence: gap placeholder · case 03
Missing packet units become valid digital-silence samples.
Pcm frame sequence: gap placeholder · case 04
Missing packet units become valid digital-silence samples.
Pcm frame sequence: gap placeholder · case 05
Missing packet units become valid digital-silence samples.
Pcm frame sequence: gap cursor · case 01
Cursor advances from the old expected sequence after a gap.
Pcm frame sequence: gap cursor · case 02
Cursor advances from the old expected sequence after a gap.
Pcm frame sequence: gap cursor · case 03
Cursor advances from the old expected sequence after a gap.
Pcm frame sequence: gap cursor · case 04
Cursor advances from the old expected sequence after a gap.
Pcm frame sequence: gap cursor · case 05
Cursor advances from the old expected sequence after a gap.
Pcm frame sequence: sequential wrap · case 01
Contiguous PCM packet cursor escapes its sequence field at wrap.
Pcm frame sequence: sequential wrap · case 02
Contiguous PCM packet cursor escapes its sequence field at wrap.
Pcm frame sequence: sequential wrap · case 03
Contiguous PCM packet cursor escapes its sequence field at wrap.
Pcm frame sequence: sequential wrap · case 04
Contiguous PCM packet cursor escapes its sequence field at wrap.
Pcm frame sequence: sequential wrap · case 05
Contiguous PCM packet cursor escapes its sequence field at wrap.
Pcm payload valid prefix: negative declaration · case 01
Negative valid counts trigger Python negative slicing.
Pcm payload valid prefix: negative declaration · case 02
Negative valid counts trigger Python negative slicing.
Pcm payload valid prefix: negative declaration · case 03
Negative valid counts trigger Python negative slicing.
Pcm payload valid prefix: negative declaration · case 04
Negative valid counts trigger Python negative slicing.
Pcm payload valid prefix: negative declaration · case 05
Negative valid counts trigger Python negative slicing.
Pcm payload valid prefix: physical bound · case 01
A short physical payload is reported as containing unavailable samples.
Pcm payload valid prefix: physical bound · case 02
A short physical payload is reported as containing unavailable samples.
Pcm payload valid prefix: physical bound · case 03
A short physical payload is reported as containing unavailable samples.
Pcm payload valid prefix: physical bound · case 04
A short physical payload is reported as containing unavailable samples.
Pcm payload valid prefix: physical bound · case 05
A short physical payload is reported as containing unavailable samples.
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 ↗