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-11601

Dictionary clear codes retain stale learned phrases · case 01

Dictionary clear codes retain stale learned phrases.

Compression format semantics● Open access↗
FA-11602

Dictionary clear codes retain stale learned phrases · case 02

Dictionary clear codes retain stale learned phrases.

Compression format semantics◈ Members↗
FA-11603

Dictionary clear codes retain stale learned phrases · case 03

Dictionary clear codes retain stale learned phrases.

Compression format semantics◈ Members↗
FA-11604

Dictionary clear codes retain stale learned phrases · case 04

Dictionary clear codes retain stale learned phrases.

Compression format semantics◈ Members↗
FA-11605

Dictionary clear codes retain stale learned phrases · case 05

Dictionary clear codes retain stale learned phrases.

Compression format semantics◈ Members↗
FA-11606

Canonical Huffman codes advance without shifting at length changes · case 01

Canonical Huffman codes advance without shifting at length changes.

Compression format semantics● Open access↗
FA-11607

Canonical Huffman codes advance without shifting at length changes · case 02

Canonical Huffman codes advance without shifting at length changes.

Compression format semantics◈ Members↗
FA-11608

Canonical Huffman codes advance without shifting at length changes · case 03

Canonical Huffman codes advance without shifting at length changes.

Compression format semantics◈ Members↗
FA-11609

Canonical Huffman codes advance without shifting at length changes · case 04

Canonical Huffman codes advance without shifting at length changes.

Compression format semantics◈ Members↗
FA-11610

Canonical Huffman codes advance without shifting at length changes · case 05

Canonical Huffman codes advance without shifting at length changes.

Compression format semantics◈ Members↗
FA-11611

Bit reservoir loses codes that cross byte boundaries · case 01

Bit reservoir loses codes that cross byte boundaries.

Compression format semantics● Open access↗
FA-11612

Bit reservoir loses codes that cross byte boundaries · case 02

Bit reservoir loses codes that cross byte boundaries.

Compression format semantics◈ Members↗
FA-11613

Bit reservoir loses codes that cross byte boundaries · case 03

Bit reservoir loses codes that cross byte boundaries.

Compression format semantics◈ Members↗
FA-11614

Bit reservoir loses codes that cross byte boundaries · case 04

Bit reservoir loses codes that cross byte boundaries.

Compression format semantics◈ Members↗
FA-11615

Bit reservoir loses codes that cross byte boundaries · case 05

Bit reservoir loses codes that cross byte boundaries.

Compression format semantics◈ Members↗
FA-11616

Padding bits are decoded as extra compressed symbols · case 01

Padding bits are decoded as extra compressed symbols.

Compression format semantics● Open access↗
FA-11617

Padding bits are decoded as extra compressed symbols · case 02

Padding bits are decoded as extra compressed symbols.

Compression format semantics◈ Members↗
FA-11618

Padding bits are decoded as extra compressed symbols · case 03

Padding bits are decoded as extra compressed symbols.

Compression format semantics◈ Members↗
FA-11619

Padding bits are decoded as extra compressed symbols · case 04

Padding bits are decoded as extra compressed symbols.

Compression format semantics◈ Members↗
FA-11620

Padding bits are decoded as extra compressed symbols · case 05

Padding bits are decoded as extra compressed symbols.

Compression format semantics◈ Members↗
FA-11621

Delta decompression carries a predictor across independent blocks · case 01

Delta decompression carries a predictor across independent blocks.

Compression format semantics● Open access↗
FA-11622

Delta decompression carries a predictor across independent blocks · case 02

Delta decompression carries a predictor across independent blocks.

Compression format semantics◈ Members↗
FA-11623

Delta decompression carries a predictor across independent blocks · case 03

Delta decompression carries a predictor across independent blocks.

Compression format semantics◈ Members↗
FA-11624

Delta decompression carries a predictor across independent blocks · case 04

Delta decompression carries a predictor across independent blocks.

Compression format semantics◈ Members↗
FA-11625

Delta decompression carries a predictor across independent blocks · case 05

Delta decompression carries a predictor across independent blocks.

Compression format semantics◈ Members↗
FA-11626

Burrows-Wheeler inversion ignores the primary row · case 01

Burrows-Wheeler inversion ignores the primary row.

Compression format semantics● Open access↗
FA-11627

Burrows-Wheeler inversion ignores the primary row · case 02

Burrows-Wheeler inversion ignores the primary row.

Compression format semantics◈ Members↗
FA-11628

Burrows-Wheeler inversion ignores the primary row · case 03

Burrows-Wheeler inversion ignores the primary row.

Compression format semantics◈ Members↗
FA-11629

Burrows-Wheeler inversion ignores the primary row · case 04

Burrows-Wheeler inversion ignores the primary row.

Compression format semantics◈ Members↗
FA-11630

Burrows-Wheeler inversion ignores the primary row · case 05

Burrows-Wheeler inversion ignores the primary row.

Compression format semantics◈ Members↗
FA-11631

Move-to-front decoder updates the wrong position · case 01

Move-to-front decoder updates the wrong position.

Compression format semantics● Open access↗
FA-11632

Move-to-front decoder updates the wrong position · case 02

Move-to-front decoder updates the wrong position.

Compression format semantics◈ Members↗
FA-11633

Move-to-front decoder updates the wrong position · case 03

Move-to-front decoder updates the wrong position.

Compression format semantics◈ Members↗
FA-11634

Move-to-front decoder updates the wrong position · case 04

Move-to-front decoder updates the wrong position.

Compression format semantics◈ Members↗
FA-11635

Move-to-front decoder updates the wrong position · case 05

Move-to-front decoder updates the wrong position.

Compression format semantics◈ Members↗
FA-11636

Bounded run packets silently discard overflow · case 01

Bounded run packets silently discard overflow.

Compression format semantics● Open access↗
FA-11637

Bounded run packets silently discard overflow · case 02

Bounded run packets silently discard overflow.

Compression format semantics◈ Members↗
FA-11638

Bounded run packets silently discard overflow · case 03

Bounded run packets silently discard overflow.

Compression format semantics◈ Members↗
FA-11639

Bounded run packets silently discard overflow · case 04

Bounded run packets silently discard overflow.

Compression format semantics◈ Members↗
FA-11640

Bounded run packets silently discard overflow · case 05

Bounded run packets silently discard overflow.

Compression format semantics◈ Members↗
FA-11641

Combining attacks bypasses per-hit armor · case 01

Combining attacks bypasses per-hit armor.

Game simulation rules● Open access↗
FA-11642

Combining attacks bypasses per-hit armor · case 02

Combining attacks bypasses per-hit armor.

Game simulation rules◈ Members↗
FA-11643

Combining attacks bypasses per-hit armor · case 03

Combining attacks bypasses per-hit armor.

Game simulation rules◈ Members↗
FA-11644

Combining attacks bypasses per-hit armor · case 04

Combining attacks bypasses per-hit armor.

Game simulation rules◈ Members↗
FA-11645

Combining attacks bypasses per-hit armor · case 05

Combining attacks bypasses per-hit armor.

Game simulation rules◈ Members↗
FA-11646

Sequential combat suppresses a defeated fighter’s committed strike · case 01

Sequential combat suppresses a defeated fighter’s committed strike.

Game simulation rules● Open access↗
FA-11647

Sequential combat suppresses a defeated fighter’s committed strike · case 02

Sequential combat suppresses a defeated fighter’s committed strike.

Game simulation rules◈ Members↗
FA-11648

Sequential combat suppresses a defeated fighter’s committed strike · case 03

Sequential combat suppresses a defeated fighter’s committed strike.

Game simulation rules◈ Members↗
FA-11649

Sequential combat suppresses a defeated fighter’s committed strike · case 04

Sequential combat suppresses a defeated fighter’s committed strike.

Game simulation rules◈ Members↗
FA-11650

Sequential combat suppresses a defeated fighter’s committed strike · case 05

Sequential combat suppresses a defeated fighter’s committed strike.

Game simulation rules◈ Members↗
FA-11651

Returning a rook restores a forfeited castling right · case 01

Returning a rook restores a forfeited castling right.

Game simulation rules● Open access↗
FA-11652

Returning a rook restores a forfeited castling right · case 02

Returning a rook restores a forfeited castling right.

Game simulation rules◈ Members↗
FA-11653

Returning a rook restores a forfeited castling right · case 03

Returning a rook restores a forfeited castling right.

Game simulation rules◈ Members↗
FA-11654

Returning a rook restores a forfeited castling right · case 04

Returning a rook restores a forfeited castling right.

Game simulation rules◈ Members↗
FA-11655

Returning a rook restores a forfeited castling right · case 05

Returning a rook restores a forfeited castling right.

Game simulation rules◈ Members↗
FA-11656

Reapplying poison extends a nonstacking effect additively · case 01

Reapplying poison extends a nonstacking effect additively.

Game simulation rules● Open access↗
FA-11657

Reapplying poison extends a nonstacking effect additively · case 02

Reapplying poison extends a nonstacking effect additively.

Game simulation rules◈ Members↗
FA-11658

Reapplying poison extends a nonstacking effect additively · case 03

Reapplying poison extends a nonstacking effect additively.

Game simulation rules◈ Members↗
FA-11659

Reapplying poison extends a nonstacking effect additively · case 04

Reapplying poison extends a nonstacking effect additively.

Game simulation rules◈ Members↗
FA-11660

Reapplying poison extends a nonstacking effect additively · case 05

Reapplying poison extends a nonstacking effect additively.

Game simulation rules◈ Members↗
FA-11661

A queued bonus turn schedules an eliminated player · case 01

A queued bonus turn schedules an eliminated player.

Game simulation rules● Open access↗
FA-11662

A queued bonus turn schedules an eliminated player · case 02

A queued bonus turn schedules an eliminated player.

Game simulation rules◈ Members↗
FA-11663

A queued bonus turn schedules an eliminated player · case 03

A queued bonus turn schedules an eliminated player.

Game simulation rules◈ Members↗
FA-11664

A queued bonus turn schedules an eliminated player · case 04

A queued bonus turn schedules an eliminated player.

Game simulation rules◈ Members↗
FA-11665

A queued bonus turn schedules an eliminated player · case 05

A queued bonus turn schedules an eliminated player.

Game simulation rules◈ Members↗
FA-11666

A full winning board is classified as a draw · case 01

A full winning board is classified as a draw.

Game simulation rules● Open access↗
FA-11667

A full winning board is classified as a draw · case 02

A full winning board is classified as a draw.

Game simulation rules◈ Members↗
FA-11668

A full winning board is classified as a draw · case 03

A full winning board is classified as a draw.

Game simulation rules◈ Members↗
FA-11669

A full winning board is classified as a draw · case 04

A full winning board is classified as a draw.

Game simulation rules◈ Members↗
FA-11670

A full winning board is classified as a draw · case 05

A full winning board is classified as a draw.

Game simulation rules◈ Members↗
FA-11671

Multiple aces force an avoidable blackjack bust · case 01

Multiple aces force an avoidable blackjack bust.

Game simulation rules● Open access↗
FA-11672

Multiple aces force an avoidable blackjack bust · case 02

Multiple aces force an avoidable blackjack bust.

Game simulation rules◈ Members↗
FA-11673

Multiple aces force an avoidable blackjack bust · case 03

Multiple aces force an avoidable blackjack bust.

Game simulation rules◈ Members↗
FA-11674

Multiple aces force an avoidable blackjack bust · case 04

Multiple aces force an avoidable blackjack bust.

Game simulation rules◈ Members↗
FA-11675

Multiple aces force an avoidable blackjack bust · case 05

Multiple aces force an avoidable blackjack bust.

Game simulation rules◈ Members↗
FA-11676

A pawn promotes before reaching its final rank · case 01

A pawn promotes before reaching its final rank.

Game simulation rules● Open access↗
FA-11677

A pawn promotes before reaching its final rank · case 02

A pawn promotes before reaching its final rank.

Game simulation rules◈ Members↗
FA-11678

A pawn promotes before reaching its final rank · case 03

A pawn promotes before reaching its final rank.

Game simulation rules◈ Members↗
FA-11679

A pawn promotes before reaching its final rank · case 04

A pawn promotes before reaching its final rank.

Game simulation rules◈ Members↗
FA-11680

A pawn promotes before reaching its final rank · case 05

A pawn promotes before reaching its final rank.

Game simulation rules◈ Members↗
FA-11681

An exploding die consumes rolls belonging to the next die · case 01

An exploding die consumes rolls belonging to the next die.

Game simulation rules● Open access↗
FA-11682

An exploding die consumes rolls belonging to the next die · case 02

An exploding die consumes rolls belonging to the next die.

Game simulation rules◈ Members↗
FA-11683

An exploding die consumes rolls belonging to the next die · case 03

An exploding die consumes rolls belonging to the next die.

Game simulation rules◈ Members↗
FA-11684

An exploding die consumes rolls belonging to the next die · case 04

An exploding die consumes rolls belonging to the next die.

Game simulation rules◈ Members↗
FA-11685

An exploding die consumes rolls belonging to the next die · case 05

An exploding die consumes rolls belonging to the next die.

Game simulation rules◈ Members↗
FA-11686

A defeated flag carrier scores on entering home · case 01

A defeated flag carrier scores on entering home.

Game simulation rules● Open access↗
FA-11687

A defeated flag carrier scores on entering home · case 02

A defeated flag carrier scores on entering home.

Game simulation rules◈ Members↗
FA-11688

A defeated flag carrier scores on entering home · case 03

A defeated flag carrier scores on entering home.

Game simulation rules◈ Members↗
FA-11689

A defeated flag carrier scores on entering home · case 04

A defeated flag carrier scores on entering home.

Game simulation rules◈ Members↗
FA-11690

A defeated flag carrier scores on entering home · case 05

A defeated flag carrier scores on entering home.

Game simulation rules◈ Members↗
FA-11691

Strong components collapse one-way reachability into equivalence · case 01

Strong components collapse one-way reachability into equivalence.

Graph algorithm invariants● Open access↗
FA-11692

Strong components collapse one-way reachability into equivalence · case 02

Strong components collapse one-way reachability into equivalence.

Graph algorithm invariants◈ Members↗
FA-11693

Strong components collapse one-way reachability into equivalence · case 03

Strong components collapse one-way reachability into equivalence.

Graph algorithm invariants◈ Members↗
FA-11694

Strong components collapse one-way reachability into equivalence · case 04

Strong components collapse one-way reachability into equivalence.

Graph algorithm invariants◈ Members↗
FA-11695

Strong components collapse one-way reachability into equivalence · case 05

Strong components collapse one-way reachability into equivalence.

Graph algorithm invariants◈ Members↗
FA-11696

Parallel edges are all removed when testing a single bridge · case 01

Parallel edges are all removed when testing a single bridge.

Graph algorithm invariants● Open access↗
FA-11697

Parallel edges are all removed when testing a single bridge · case 02

Parallel edges are all removed when testing a single bridge.

Graph algorithm invariants◈ Members↗
FA-11698

Parallel edges are all removed when testing a single bridge · case 03

Parallel edges are all removed when testing a single bridge.

Graph algorithm invariants◈ Members↗
FA-11699

Parallel edges are all removed when testing a single bridge · case 04

Parallel edges are all removed when testing a single bridge.

Graph algorithm invariants◈ Members↗
FA-11700

Parallel edges are all removed when testing a single bridge · case 05

Parallel edges are all removed when testing a single bridge.

Graph algorithm invariants◈ 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 ↗