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

Inverse linear interpolation · case 01

The interval origin is not removed.

Discrete calculus● Open access↗
FA-6402

Inverse linear interpolation · case 02

The interval origin is not removed.

Discrete calculus◈ Members↗
FA-6403

Inverse linear interpolation · case 03

The interval origin is not removed.

Discrete calculus◈ Members↗
FA-6404

Inverse linear interpolation · case 04

The interval origin is not removed.

Discrete calculus◈ Members↗
FA-6405

Inverse linear interpolation · case 05

The interval origin is not removed.

Discrete calculus◈ Members↗
FA-6406

Linear extrapolation last slope · case 01

Last-value persistence discards the final slope.

Discrete calculus● Open access↗
FA-6407

Linear extrapolation last slope · case 02

Last-value persistence discards the final slope.

Discrete calculus◈ Members↗
FA-6408

Linear extrapolation last slope · case 03

Last-value persistence discards the final slope.

Discrete calculus◈ Members↗
FA-6409

Linear extrapolation last slope · case 04

Last-value persistence discards the final slope.

Discrete calculus◈ Members↗
FA-6410

Linear extrapolation last slope · case 05

Last-value persistence discards the final slope.

Discrete calculus◈ Members↗
FA-6411

Quadratic sequence extrapolation · case 01

Linear extrapolation omits second differences.

Discrete calculus● Open access↗
FA-6412

Quadratic sequence extrapolation · case 02

Linear extrapolation omits second differences.

Discrete calculus◈ Members↗
FA-6413

Quadratic sequence extrapolation · case 03

Linear extrapolation omits second differences.

Discrete calculus◈ Members↗
FA-6414

Quadratic sequence extrapolation · case 04

Linear extrapolation omits second differences.

Discrete calculus◈ Members↗
FA-6415

Quadratic sequence extrapolation · case 05

Linear extrapolation omits second differences.

Discrete calculus◈ Members↗
FA-6416

Finite impulse valid convolution · case 01

Unreversed kernel computes correlation instead of convolution.

Discrete calculus● Open access↗
FA-6417

Finite impulse valid convolution · case 02

Unreversed kernel computes correlation instead of convolution.

Discrete calculus◈ Members↗
FA-6418

Finite impulse valid convolution · case 03

Unreversed kernel computes correlation instead of convolution.

Discrete calculus◈ Members↗
FA-6419

Finite impulse valid convolution · case 04

Unreversed kernel computes correlation instead of convolution.

Discrete calculus◈ Members↗
FA-6420

Finite impulse valid convolution · case 05

Unreversed kernel computes correlation instead of convolution.

Discrete calculus◈ Members↗
FA-6421

Valid cross correlation · case 01

Kernel reversal changes correlation into convolution.

Discrete calculus● Open access↗
FA-6422

Valid cross correlation · case 02

Kernel reversal changes correlation into convolution.

Discrete calculus◈ Members↗
FA-6423

Valid cross correlation · case 03

Kernel reversal changes correlation into convolution.

Discrete calculus◈ Members↗
FA-6424

Valid cross correlation · case 04

Kernel reversal changes correlation into convolution.

Discrete calculus◈ Members↗
FA-6425

Valid cross correlation · case 05

Kernel reversal changes correlation into convolution.

Discrete calculus◈ Members↗
FA-6426

Discrete total variation · case 01

Net displacement cancels intermediate variation.

Discrete calculus● Open access↗
FA-6427

Discrete total variation · case 02

Net displacement cancels intermediate variation.

Discrete calculus◈ Members↗
FA-6428

Discrete total variation · case 03

Net displacement cancels intermediate variation.

Discrete calculus◈ Members↗
FA-6429

Discrete total variation · case 04

Net displacement cancels intermediate variation.

Discrete calculus◈ Members↗
FA-6430

Discrete total variation · case 05

Net displacement cancels intermediate variation.

Discrete calculus◈ Members↗
FA-6431

Piecewise linear slope sequence · case 01

The sample spacing is ignored.

Discrete calculus● Open access↗
FA-6432

Piecewise linear slope sequence · case 02

The sample spacing is ignored.

Discrete calculus◈ Members↗
FA-6433

Piecewise linear slope sequence · case 03

The sample spacing is ignored.

Discrete calculus◈ Members↗
FA-6434

Piecewise linear slope sequence · case 04

The sample spacing is ignored.

Discrete calculus◈ Members↗
FA-6435

Piecewise linear slope sequence · case 05

The sample spacing is ignored.

Discrete calculus◈ Members↗
FA-6436

Discrete laplacian periodic · case 01

The center stencil coefficient lacks its factor of two.

Discrete calculus● Open access↗
FA-6437

Discrete laplacian periodic · case 02

The center stencil coefficient lacks its factor of two.

Discrete calculus◈ Members↗
FA-6438

Discrete laplacian periodic · case 03

The center stencil coefficient lacks its factor of two.

Discrete calculus◈ Members↗
FA-6439

Discrete laplacian periodic · case 04

The center stencil coefficient lacks its factor of two.

Discrete calculus◈ Members↗
FA-6440

Discrete laplacian periodic · case 05

The center stencil coefficient lacks its factor of two.

Discrete calculus◈ Members↗
FA-6441

Binomial forward difference order three · case 01

The binomial stencil coefficients are replaced with unit alternation.

Discrete calculus● Open access↗
FA-6442

Binomial forward difference order three · case 02

The binomial stencil coefficients are replaced with unit alternation.

Discrete calculus◈ Members↗
FA-6443

Binomial forward difference order three · case 03

The binomial stencil coefficients are replaced with unit alternation.

Discrete calculus◈ Members↗
FA-6444

Binomial forward difference order three · case 04

The binomial stencil coefficients are replaced with unit alternation.

Discrete calculus◈ Members↗
FA-6445

Binomial forward difference order three · case 05

The binomial stencil coefficients are replaced with unit alternation.

Discrete calculus◈ Members↗
FA-6446

Newton step quadratic root · case 01

The reciprocal correction is returned without averaging the current iterate.

Discrete calculus● Open access↗
FA-6447

Newton step quadratic root · case 02

The reciprocal correction is returned without averaging the current iterate.

Discrete calculus◈ Members↗
FA-6448

Newton step quadratic root · case 03

The reciprocal correction is returned without averaging the current iterate.

Discrete calculus◈ Members↗
FA-6449

Newton step quadratic root · case 04

The reciprocal correction is returned without averaging the current iterate.

Discrete calculus◈ Members↗
FA-6450

Newton step quadratic root · case 05

The reciprocal correction is returned without averaging the current iterate.

Discrete calculus◈ Members↗
FA-6451

Secant root step rational · case 01

The interpolation correction omits the x span.

Discrete calculus● Open access↗
FA-6452

Secant root step rational · case 02

The interpolation correction omits the x span.

Discrete calculus◈ Members↗
FA-6453

Secant root step rational · case 03

The interpolation correction omits the x span.

Discrete calculus◈ Members↗
FA-6454

Secant root step rational · case 04

The interpolation correction omits the x span.

Discrete calculus◈ Members↗
FA-6455

Secant root step rational · case 05

The interpolation correction omits the x span.

Discrete calculus◈ Members↗
FA-6456

Newton divided difference two · case 01

Uniform-grid second differences are applied to nonuniform nodes.

Discrete calculus● Open access↗
FA-6457

Newton divided difference two · case 02

Uniform-grid second differences are applied to nonuniform nodes.

Discrete calculus◈ Members↗
FA-6458

Newton divided difference two · case 03

Uniform-grid second differences are applied to nonuniform nodes.

Discrete calculus◈ Members↗
FA-6459

Newton divided difference two · case 04

Uniform-grid second differences are applied to nonuniform nodes.

Discrete calculus◈ Members↗
FA-6460

Newton divided difference two · case 05

Uniform-grid second differences are applied to nonuniform nodes.

Discrete calculus◈ Members↗
FA-6461

Composite midpoint cell integral · case 01

The cell width is omitted.

Discrete calculus● Open access↗
FA-6462

Composite midpoint cell integral · case 02

The cell width is omitted.

Discrete calculus◈ Members↗
FA-6463

Composite midpoint cell integral · case 03

The cell width is omitted.

Discrete calculus◈ Members↗
FA-6464

Composite midpoint cell integral · case 04

The cell width is omitted.

Discrete calculus◈ Members↗
FA-6465

Composite midpoint cell integral · case 05

The cell width is omitted.

Discrete calculus◈ Members↗
FA-6466

Discrete energy squared norm · case 01

Squaring the total allows cancellation between samples.

Discrete calculus● Open access↗
FA-6467

Discrete energy squared norm · case 02

Squaring the total allows cancellation between samples.

Discrete calculus◈ Members↗
FA-6468

Discrete energy squared norm · case 03

Squaring the total allows cancellation between samples.

Discrete calculus◈ Members↗
FA-6469

Discrete energy squared norm · case 04

Squaring the total allows cancellation between samples.

Discrete calculus◈ Members↗
FA-6470

Discrete energy squared norm · case 05

Squaring the total allows cancellation between samples.

Discrete calculus◈ Members↗
FA-6471

Autocorrelation zero lag normalized · case 01

Sample count replaces zero-lag energy normalization.

Discrete calculus● Open access↗
FA-6472

Autocorrelation zero lag normalized · case 02

Sample count replaces zero-lag energy normalization.

Discrete calculus◈ Members↗
FA-6473

Autocorrelation zero lag normalized · case 03

Sample count replaces zero-lag energy normalization.

Discrete calculus◈ Members↗
FA-6474

Autocorrelation zero lag normalized · case 04

Sample count replaces zero-lag energy normalization.

Discrete calculus◈ Members↗
FA-6475

Autocorrelation zero lag normalized · case 05

Sample count replaces zero-lag energy normalization.

Discrete calculus◈ Members↗
FA-6476

Gregorian leap century rule · case 01

Divisibility by four ignores the century exception.

Calendar arithmetic● Open access↗
FA-6477

Gregorian leap century rule · case 02

Divisibility by four ignores the century exception.

Calendar arithmetic◈ Members↗
FA-6478

Gregorian leap century rule · case 03

Divisibility by four ignores the century exception.

Calendar arithmetic◈ Members↗
FA-6479

Gregorian leap century rule · case 04

Divisibility by four ignores the century exception.

Calendar arithmetic◈ Members↗
FA-6480

Gregorian leap century rule · case 05

Divisibility by four ignores the century exception.

Calendar arithmetic◈ Members↗
FA-6481

Calendar month length · case 01

A fixed thirty-day model loses long months and leap days.

Calendar arithmetic● Open access↗
FA-6482

Calendar month length · case 02

A fixed thirty-day model loses long months and leap days.

Calendar arithmetic◈ Members↗
FA-6483

Calendar month length · case 03

A fixed thirty-day model loses long months and leap days.

Calendar arithmetic◈ Members↗
FA-6484

Calendar month length · case 04

A fixed thirty-day model loses long months and leap days.

Calendar arithmetic◈ Members↗
FA-6485

Calendar month length · case 05

A fixed thirty-day model loses long months and leap days.

Calendar arithmetic◈ Members↗
FA-6486

Ordinal day of year · case 01

Month lengths are approximated by thirty days.

Calendar arithmetic● Open access↗
FA-6487

Ordinal day of year · case 02

Month lengths are approximated by thirty days.

Calendar arithmetic◈ Members↗
FA-6488

Ordinal day of year · case 03

Month lengths are approximated by thirty days.

Calendar arithmetic◈ Members↗
FA-6489

Ordinal day of year · case 04

Month lengths are approximated by thirty days.

Calendar arithmetic◈ Members↗
FA-6490

Ordinal day of year · case 05

Month lengths are approximated by thirty days.

Calendar arithmetic◈ Members↗
FA-6491

Days until next year exclusive · case 01

A fixed ordinary-year length also excludes the current day incorrectly.

Calendar arithmetic● Open access↗
FA-6492

Days until next year exclusive · case 02

A fixed ordinary-year length also excludes the current day incorrectly.

Calendar arithmetic◈ Members↗
FA-6493

Days until next year exclusive · case 03

A fixed ordinary-year length also excludes the current day incorrectly.

Calendar arithmetic◈ Members↗
FA-6494

Days until next year exclusive · case 04

A fixed ordinary-year length also excludes the current day incorrectly.

Calendar arithmetic◈ Members↗
FA-6495

Days until next year exclusive · case 05

A fixed ordinary-year length also excludes the current day incorrectly.

Calendar arithmetic◈ Members↗
FA-6496

Iso weekday monday one · case 01

A zero-based weekday is returned where Monday is one.

Calendar arithmetic● Open access↗
FA-6497

Iso weekday monday one · case 02

A zero-based weekday is returned where Monday is one.

Calendar arithmetic◈ Members↗
FA-6498

Iso weekday monday one · case 03

A zero-based weekday is returned where Monday is one.

Calendar arithmetic◈ Members↗
FA-6499

Iso weekday monday one · case 04

A zero-based weekday is returned where Monday is one.

Calendar arithmetic◈ Members↗
FA-6500

Iso weekday monday one · case 05

A zero-based weekday is returned where Monday is one.

Calendar arithmetic◈ 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 ↗