FAILURE MAP

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 ↗
100840Executable case variants
20168Distinct failure mechanisms
302520Executed implementations
20168Open-access cases

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

Python · Standard library
REFERENCEFAILURE MECHANISMDOMAINACCESS
FA-49401

Pcm silence run packets: unknown tag · case 01

An unknown metadata packet terminates subsequent PCM data.

PCM sample encoding● Open access↗
FA-49402

Pcm silence run packets: unknown tag · case 02

An unknown metadata packet terminates subsequent PCM data.

PCM sample encoding◈ Members↗
FA-49403

Pcm silence run packets: unknown tag · case 03

An unknown metadata packet terminates subsequent PCM data.

PCM sample encoding◈ Members↗
FA-49404

Pcm silence run packets: unknown tag · case 04

An unknown metadata packet terminates subsequent PCM data.

PCM sample encoding◈ Members↗
FA-49405

Pcm silence run packets: unknown tag · case 05

An unknown metadata packet terminates subsequent PCM data.

PCM sample encoding◈ Members↗
FA-49406

Pcm silence run packets: limit slice · case 01

A bounded decode retains the latest tail instead of earliest samples.

PCM sample encoding● Open access↗
FA-49407

Pcm silence run packets: limit slice · case 02

A bounded decode retains the latest tail instead of earliest samples.

PCM sample encoding◈ Members↗
FA-49408

Pcm silence run packets: limit slice · case 03

A bounded decode retains the latest tail instead of earliest samples.

PCM sample encoding◈ Members↗
FA-49409

Pcm silence run packets: limit slice · case 04

A bounded decode retains the latest tail instead of earliest samples.

PCM sample encoding◈ Members↗
FA-49410

Pcm silence run packets: limit slice · case 05

A bounded decode retains the latest tail instead of earliest samples.

PCM sample encoding◈ Members↗
FA-49411

Pcm silence run packets: audio extension · case 01

Literal PCM sample packets become nested arrays.

PCM sample encoding● Open access↗
FA-49412

Pcm silence run packets: audio extension · case 02

Literal PCM sample packets become nested arrays.

PCM sample encoding◈ Members↗
FA-49413

Pcm silence run packets: audio extension · case 03

Literal PCM sample packets become nested arrays.

PCM sample encoding◈ Members↗
FA-49414

Pcm silence run packets: audio extension · case 04

Literal PCM sample packets become nested arrays.

PCM sample encoding◈ Members↗
FA-49415

Pcm silence run packets: audio extension · case 05

Literal PCM sample packets become nested arrays.

PCM sample encoding◈ Members↗
FA-49416

Pcm sparse impulses: default code · case 01

Unspecified PCM positions are initialized with the wrong silence code.

PCM sample encoding● Open access↗
FA-49417

Pcm sparse impulses: default code · case 02

Unspecified PCM positions are initialized with the wrong silence code.

PCM sample encoding◈ Members↗
FA-49418

Pcm sparse impulses: default code · case 03

Unspecified PCM positions are initialized with the wrong silence code.

PCM sample encoding◈ Members↗
FA-49419

Pcm sparse impulses: default code · case 04

Unspecified PCM positions are initialized with the wrong silence code.

PCM sample encoding◈ Members↗
FA-49420

Pcm sparse impulses: default code · case 05

Unspecified PCM positions are initialized with the wrong silence code.

PCM sample encoding◈ Members↗
FA-49421

Pcm sparse impulses: negative index · case 01

Negative event positions wrap to the end of the Python sample array.

PCM sample encoding● Open access↗
FA-49422

Pcm sparse impulses: negative index · case 02

Negative event positions wrap to the end of the Python sample array.

PCM sample encoding◈ Members↗
FA-49423

Pcm sparse impulses: negative index · case 03

Negative event positions wrap to the end of the Python sample array.

PCM sample encoding◈ Members↗
FA-49424

Pcm sparse impulses: negative index · case 04

Negative event positions wrap to the end of the Python sample array.

PCM sample encoding◈ Members↗
FA-49425

Pcm sparse impulses: negative index · case 05

Negative event positions wrap to the end of the Python sample array.

PCM sample encoding◈ Members↗
FA-49426

Pcm sparse impulses: last sample bound · case 01

Final in-range impulse is excluded.

PCM sample encoding● Open access↗
FA-49427

Pcm sparse impulses: last sample bound · case 02

Final in-range impulse is excluded.

PCM sample encoding◈ Members↗
FA-49428

Pcm sparse impulses: last sample bound · case 03

Final in-range impulse is excluded.

PCM sample encoding◈ Members↗
FA-49429

Pcm sparse impulses: last sample bound · case 04

Final in-range impulse is excluded.

PCM sample encoding◈ Members↗
FA-49430

Pcm sparse impulses: last sample bound · case 05

Final in-range impulse is excluded.

PCM sample encoding◈ Members↗
FA-49431

Pcm sparse impulses: duplicate event · case 01

Repeated sample events are summed rather than last-writer replaced.

PCM sample encoding● Open access↗
FA-49432

Pcm sparse impulses: duplicate event · case 02

Repeated sample events are summed rather than last-writer replaced.

PCM sample encoding◈ Members↗
FA-49433

Pcm sparse impulses: duplicate event · case 03

Repeated sample events are summed rather than last-writer replaced.

PCM sample encoding◈ Members↗
FA-49434

Pcm sparse impulses: duplicate event · case 04

Repeated sample events are summed rather than last-writer replaced.

PCM sample encoding◈ Members↗
FA-49435

Pcm sparse impulses: duplicate event · case 05

Repeated sample events are summed rather than last-writer replaced.

PCM sample encoding◈ Members↗
FA-49436

Pcm sparse impulses: sample amplitude · case 01

Absolute PCM event values are interpreted as offsets from silence.

PCM sample encoding● Open access↗
FA-49437

Pcm sparse impulses: sample amplitude · case 02

Absolute PCM event values are interpreted as offsets from silence.

PCM sample encoding◈ Members↗
FA-49438

Pcm sparse impulses: sample amplitude · case 03

Absolute PCM event values are interpreted as offsets from silence.

PCM sample encoding◈ Members↗
FA-49439

Pcm sparse impulses: sample amplitude · case 04

Absolute PCM event values are interpreted as offsets from silence.

PCM sample encoding◈ Members↗
FA-49440

Pcm sparse impulses: sample amplitude · case 05

Absolute PCM event values are interpreted as offsets from silence.

PCM sample encoding◈ Members↗
FA-49441

Pcm progressive refinement: coarse scale · case 01

Progressive PCM scales coarse samples by bit count instead of bit weight.

PCM sample encoding● Open access↗
FA-49442

Pcm progressive refinement: coarse scale · case 02

Progressive PCM scales coarse samples by bit count instead of bit weight.

PCM sample encoding◈ Members↗
FA-49443

Pcm progressive refinement: coarse scale · case 03

Progressive PCM scales coarse samples by bit count instead of bit weight.

PCM sample encoding◈ Members↗
FA-49444

Pcm progressive refinement: coarse scale · case 04

Progressive PCM scales coarse samples by bit count instead of bit weight.

PCM sample encoding◈ Members↗
FA-49445

Pcm progressive refinement: coarse scale · case 05

Progressive PCM scales coarse samples by bit count instead of bit weight.

PCM sample encoding◈ Members↗
FA-49446

Pcm progressive refinement: residual address · case 01

Every sample reuses the first refinement residual.

PCM sample encoding● Open access↗
FA-49447

Pcm progressive refinement: residual address · case 02

Every sample reuses the first refinement residual.

PCM sample encoding◈ Members↗
FA-49448

Pcm progressive refinement: residual address · case 03

Every sample reuses the first refinement residual.

PCM sample encoding◈ Members↗
FA-49449

Pcm progressive refinement: residual address · case 04

Every sample reuses the first refinement residual.

PCM sample encoding◈ Members↗
FA-49450

Pcm progressive refinement: residual address · case 05

Every sample reuses the first refinement residual.

PCM sample encoding◈ Members↗
FA-49451

Pcm progressive refinement: missing refinement · case 01

Absent refinement bits are replaced with maximum positive low bits.

PCM sample encoding● Open access↗
FA-49452

Pcm progressive refinement: missing refinement · case 02

Absent refinement bits are replaced with maximum positive low bits.

PCM sample encoding◈ Members↗
FA-49453

Pcm progressive refinement: missing refinement · case 03

Absent refinement bits are replaced with maximum positive low bits.

PCM sample encoding◈ Members↗
FA-49454

Pcm progressive refinement: missing refinement · case 04

Absent refinement bits are replaced with maximum positive low bits.

PCM sample encoding◈ Members↗
FA-49455

Pcm progressive refinement: missing refinement · case 05

Absent refinement bits are replaced with maximum positive low bits.

PCM sample encoding◈ Members↗
FA-49456

Pcm progressive refinement: residual mask · case 01

A one-bit boundary mask replaces the low-bit refinement mask.

PCM sample encoding● Open access↗
FA-49457

Pcm progressive refinement: residual mask · case 02

A one-bit boundary mask replaces the low-bit refinement mask.

PCM sample encoding◈ Members↗
FA-49458

Pcm progressive refinement: residual mask · case 03

A one-bit boundary mask replaces the low-bit refinement mask.

PCM sample encoding◈ Members↗
FA-49459

Pcm progressive refinement: residual mask · case 04

A one-bit boundary mask replaces the low-bit refinement mask.

PCM sample encoding◈ Members↗
FA-49460

Pcm progressive refinement: residual mask · case 05

A one-bit boundary mask replaces the low-bit refinement mask.

PCM sample encoding◈ Members↗
FA-49461

Pcm progressive refinement: signed coarse compose · case 01

Negative coarse PCM loses its sign before refinement.

PCM sample encoding● Open access↗
FA-49462

Pcm progressive refinement: signed coarse compose · case 02

Negative coarse PCM loses its sign before refinement.

PCM sample encoding◈ Members↗
FA-49463

Pcm progressive refinement: signed coarse compose · case 03

Negative coarse PCM loses its sign before refinement.

PCM sample encoding◈ Members↗
FA-49464

Pcm progressive refinement: signed coarse compose · case 04

Negative coarse PCM loses its sign before refinement.

PCM sample encoding◈ Members↗
FA-49465

Pcm progressive refinement: signed coarse compose · case 05

Negative coarse PCM loses its sign before refinement.

PCM sample encoding◈ Members↗
FA-49466

Riff pcm data spans: chunk header skip · case 01

PCM byte spans include the RIFF-style chunk header.

PCM sample encoding● Open access↗
FA-49467

Riff pcm data spans: chunk header skip · case 02

PCM byte spans include the RIFF-style chunk header.

PCM sample encoding◈ Members↗
FA-49468

Riff pcm data spans: chunk header skip · case 03

PCM byte spans include the RIFF-style chunk header.

PCM sample encoding◈ Members↗
FA-49469

Riff pcm data spans: chunk header skip · case 04

PCM byte spans include the RIFF-style chunk header.

PCM sample encoding◈ Members↗
FA-49470

Riff pcm data spans: chunk header skip · case 05

PCM byte spans include the RIFF-style chunk header.

PCM sample encoding◈ Members↗
FA-49471

Riff pcm data spans: odd padding · case 01

Odd metadata chunks shift later PCM spans when pad bytes are omitted.

PCM sample encoding● Open access↗
FA-49472

Riff pcm data spans: odd padding · case 02

Odd metadata chunks shift later PCM spans when pad bytes are omitted.

PCM sample encoding◈ Members↗
FA-49473

Riff pcm data spans: odd padding · case 03

Odd metadata chunks shift later PCM spans when pad bytes are omitted.

PCM sample encoding◈ Members↗
FA-49474

Riff pcm data spans: odd padding · case 04

Odd metadata chunks shift later PCM spans when pad bytes are omitted.

PCM sample encoding◈ Members↗
FA-49475

Riff pcm data spans: odd padding · case 05

Odd metadata chunks shift later PCM spans when pad bytes are omitted.

PCM sample encoding◈ Members↗
FA-49476

Riff pcm data spans: format order · case 01

PCM data is exposed before a format declaration is available.

PCM sample encoding● Open access↗
FA-49477

Riff pcm data spans: format order · case 02

PCM data is exposed before a format declaration is available.

PCM sample encoding◈ Members↗
FA-49478

Riff pcm data spans: format order · case 03

PCM data is exposed before a format declaration is available.

PCM sample encoding◈ Members↗
FA-49479

Riff pcm data spans: format order · case 04

PCM data is exposed before a format declaration is available.

PCM sample encoding◈ Members↗
FA-49480

Riff pcm data spans: format order · case 05

PCM data is exposed before a format declaration is available.

PCM sample encoding◈ Members↗
FA-49481

Riff pcm data spans: data only · case 01

Unknown chunks after format are presented as PCM sample spans.

PCM sample encoding● Open access↗
FA-49482

Riff pcm data spans: data only · case 02

Unknown chunks after format are presented as PCM sample spans.

PCM sample encoding◈ Members↗
FA-49483

Riff pcm data spans: data only · case 03

Unknown chunks after format are presented as PCM sample spans.

PCM sample encoding◈ Members↗
FA-49484

Riff pcm data spans: data only · case 04

Unknown chunks after format are presented as PCM sample spans.

PCM sample encoding◈ Members↗
FA-49485

Riff pcm data spans: data only · case 05

Unknown chunks after format are presented as PCM sample spans.

PCM sample encoding◈ Members↗
FA-49486

Riff pcm data spans: append data chunks · case 01

Later PCM chunks overwrite earlier sample spans.

PCM sample encoding● Open access↗
FA-49487

Riff pcm data spans: append data chunks · case 02

Later PCM chunks overwrite earlier sample spans.

PCM sample encoding◈ Members↗
FA-49488

Riff pcm data spans: append data chunks · case 03

Later PCM chunks overwrite earlier sample spans.

PCM sample encoding◈ Members↗
FA-49489

Riff pcm data spans: append data chunks · case 04

Later PCM chunks overwrite earlier sample spans.

PCM sample encoding◈ Members↗
FA-49490

Riff pcm data spans: append data chunks · case 05

Later PCM chunks overwrite earlier sample spans.

PCM sample encoding◈ Members↗
FA-49491

Aiff pcm offset block: offset origin · case 01

PCM sound offset is measured before the sound-data preamble.

PCM sample encoding● Open access↗
FA-49492

Aiff pcm offset block: offset origin · case 02

PCM sound offset is measured before the sound-data preamble.

PCM sample encoding◈ Members↗
FA-49493

Aiff pcm offset block: offset origin · case 03

PCM sound offset is measured before the sound-data preamble.

PCM sample encoding◈ Members↗
FA-49494

Aiff pcm offset block: offset origin · case 04

PCM sound offset is measured before the sound-data preamble.

PCM sample encoding◈ Members↗
FA-49495

Aiff pcm offset block: offset origin · case 05

PCM sound offset is measured before the sound-data preamble.

PCM sample encoding◈ Members↗
FA-49496

Aiff pcm offset block: usable subtraction · case 01

Sound-data metadata bytes are counted as samples.

PCM sample encoding● Open access↗
FA-49497

Aiff pcm offset block: usable subtraction · case 02

Sound-data metadata bytes are counted as samples.

PCM sample encoding◈ Members↗
FA-49498

Aiff pcm offset block: usable subtraction · case 03

Sound-data metadata bytes are counted as samples.

PCM sample encoding◈ Members↗
FA-49499

Aiff pcm offset block: usable subtraction · case 04

Sound-data metadata bytes are counted as samples.

PCM sample encoding◈ Members↗
FA-49500

Aiff pcm offset block: usable subtraction · case 05

Sound-data metadata bytes are counted as samples.

PCM sample encoding◈ Members↗

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 ↗