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
WKT polygon and multipolygon ring structure: ordinate truncation · case 01
Rings from 3D sources carry elevations and fail closure when only z differs.
WKT polygon and multipolygon ring structure: ordinate truncation · case 02
Rings from 3D sources carry elevations and fail closure when only z differs.
WKT polygon and multipolygon ring structure: ordinate truncation · case 03
Rings from 3D sources carry elevations and fail closure when only z differs.
WKT polygon and multipolygon ring structure: ordinate truncation · case 04
Rings from 3D sources carry elevations and fail closure when only z differs.
WKT polygon and multipolygon ring structure: ordinate truncation · case 05
Rings from 3D sources carry elevations and fail closure when only z differs.
WKT polygon and multipolygon ring structure: empty geometry · case 01
Empty polygons are rejected as malformed.
WKT polygon and multipolygon ring structure: empty geometry · case 02
Empty polygons are rejected as malformed.
WKT polygon and multipolygon ring structure: empty geometry · case 03
Empty polygons are rejected as malformed.
WKT polygon and multipolygon ring structure: empty geometry · case 04
Empty polygons are rejected as malformed.
WKT polygon and multipolygon ring structure: empty geometry · case 05
Empty polygons are rejected as malformed.
WKT polygon and multipolygon ring structure: multipolygon nesting · case 01
Multipolygons are read as one polygon whose rings are polygons.
WKT polygon and multipolygon ring structure: multipolygon nesting · case 02
Multipolygons are read as one polygon whose rings are polygons.
WKT polygon and multipolygon ring structure: multipolygon nesting · case 03
Multipolygons are read as one polygon whose rings are polygons.
WKT polygon and multipolygon ring structure: multipolygon nesting · case 04
Multipolygons are read as one polygon whose rings are polygons.
WKT polygon and multipolygon ring structure: multipolygon nesting · case 05
Multipolygons are read as one polygon whose rings are polygons.
WKT polygon and multipolygon ring structure: keyword case folding · case 01
Lower-case WKT from some databases is rejected.
WKT polygon and multipolygon ring structure: keyword case folding · case 02
Lower-case WKT from some databases is rejected.
WKT polygon and multipolygon ring structure: keyword case folding · case 03
Lower-case WKT from some databases is rejected.
WKT polygon and multipolygon ring structure: keyword case folding · case 04
Lower-case WKT from some databases is rejected.
WKT polygon and multipolygon ring structure: keyword case folding · case 05
Lower-case WKT from some databases is rejected.
WKT polygon and multipolygon ring structure: ring closure check · case 01
Unclosed rings are accepted.
WKT polygon and multipolygon ring structure: ring closure check · case 02
Unclosed rings are accepted.
WKT polygon and multipolygon ring structure: ring closure check · case 03
Unclosed rings are accepted.
WKT polygon and multipolygon ring structure: ring closure check · case 04
Unclosed rings are accepted.
WKT polygon and multipolygon ring structure: ring closure check · case 05
Unclosed rings are accepted.
Bounded face count of an arc-node topology: arc identity · case 01
Parallel arcs enclosing a face are merged and the face disappears.
Bounded face count of an arc-node topology: arc identity · case 02
Parallel arcs enclosing a face are merged and the face disappears.
Bounded face count of an arc-node topology: arc identity · case 03
Parallel arcs enclosing a face are merged and the face disappears.
Bounded face count of an arc-node topology: arc identity · case 04
Parallel arcs enclosing a face are merged and the face disappears.
Bounded face count of an arc-node topology: arc identity · case 05
Parallel arcs enclosing a face are merged and the face disappears.
Bounded face count of an arc-node topology: isolated nodes · case 01
Node counts ignore isolated nodes.
Bounded face count of an arc-node topology: isolated nodes · case 02
Node counts ignore isolated nodes.
Bounded face count of an arc-node topology: isolated nodes · case 03
Node counts ignore isolated nodes.
Bounded face count of an arc-node topology: isolated nodes · case 04
Node counts ignore isolated nodes.
Bounded face count of an arc-node topology: isolated nodes · case 05
Node counts ignore isolated nodes.
Bounded face count of an arc-node topology: euler relation · case 01
Topologies with several disconnected islands report too few faces.
Bounded face count of an arc-node topology: euler relation · case 02
Topologies with several disconnected islands report too few faces.
Bounded face count of an arc-node topology: euler relation · case 03
Topologies with several disconnected islands report too few faces.
Bounded face count of an arc-node topology: euler relation · case 04
Topologies with several disconnected islands report too few faces.
Bounded face count of an arc-node topology: euler relation · case 05
Topologies with several disconnected islands report too few faces.
Bounded face count of an arc-node topology: loop arcs · case 01
Ring-shaped islands closed by a single loop arc lose their face.
Bounded face count of an arc-node topology: loop arcs · case 02
Ring-shaped islands closed by a single loop arc lose their face.
Bounded face count of an arc-node topology: loop arcs · case 03
Ring-shaped islands closed by a single loop arc lose their face.
Bounded face count of an arc-node topology: loop arcs · case 04
Ring-shaped islands closed by a single loop arc lose their face.
Bounded face count of an arc-node topology: loop arcs · case 05
Ring-shaped islands closed by a single loop arc lose their face.
Node degree classification in an arc-node topology: loop end count · case 01
Island rings closed by a single loop arc report their node as a dangle.
Node degree classification in an arc-node topology: loop end count · case 02
Island rings closed by a single loop arc report their node as a dangle.
Node degree classification in an arc-node topology: loop end count · case 03
Island rings closed by a single loop arc report their node as a dangle.
Node degree classification in an arc-node topology: loop end count · case 04
Island rings closed by a single loop arc report their node as a dangle.
Node degree classification in an arc-node topology: loop end count · case 05
Island rings closed by a single loop arc report their node as a dangle.
Node degree classification in an arc-node topology: pseudo node degree · case 01
Four-way junctions are reported as pseudo-nodes.
Node degree classification in an arc-node topology: pseudo node degree · case 02
Four-way junctions are reported as pseudo-nodes.
Node degree classification in an arc-node topology: pseudo node degree · case 03
Four-way junctions are reported as pseudo-nodes.
Node degree classification in an arc-node topology: pseudo node degree · case 04
Four-way junctions are reported as pseudo-nodes.
Node degree classification in an arc-node topology: pseudo node degree · case 05
Four-way junctions are reported as pseudo-nodes.
Node degree classification in an arc-node topology: numeric node ordering · case 01
Node reports come out in input order.
Node degree classification in an arc-node topology: numeric node ordering · case 02
Node reports come out in input order.
Node degree classification in an arc-node topology: numeric node ordering · case 03
Node reports come out in input order.
Node degree classification in an arc-node topology: numeric node ordering · case 04
Node reports come out in input order.
Node degree classification in an arc-node topology: numeric node ordering · case 05
Node reports come out in input order.
Snapping ring vertices to a reference layer: nearest candidate · case 01
Vertices snap to the first reference vertex in range rather than the closest one.
Snapping ring vertices to a reference layer: nearest candidate · case 02
Vertices snap to the first reference vertex in range rather than the closest one.
Snapping ring vertices to a reference layer: nearest candidate · case 03
Vertices snap to the first reference vertex in range rather than the closest one.
Snapping ring vertices to a reference layer: nearest candidate · case 04
Vertices snap to the first reference vertex in range rather than the closest one.
Snapping ring vertices to a reference layer: nearest candidate · case 05
Vertices snap to the first reference vertex in range rather than the closest one.
Snapping ring vertices to a reference layer: squared tolerance · case 01
Snapping reach depends on whether the tolerance is above or below 1.
Snapping ring vertices to a reference layer: squared tolerance · case 02
Snapping reach depends on whether the tolerance is above or below 1.
Snapping ring vertices to a reference layer: squared tolerance · case 03
Snapping reach depends on whether the tolerance is above or below 1.
Snapping ring vertices to a reference layer: squared tolerance · case 04
Snapping reach depends on whether the tolerance is above or below 1.
Snapping ring vertices to a reference layer: squared tolerance · case 05
Snapping reach depends on whether the tolerance is above or below 1.
Snapping ring vertices to a reference layer: post-snap merge · case 01
Snapped rings contain repeated consecutive vertices.
Snapping ring vertices to a reference layer: post-snap merge · case 02
Snapped rings contain repeated consecutive vertices.
Snapping ring vertices to a reference layer: post-snap merge · case 03
Snapped rings contain repeated consecutive vertices.
Snapping ring vertices to a reference layer: post-snap merge · case 04
Snapped rings contain repeated consecutive vertices.
Snapping ring vertices to a reference layer: post-snap merge · case 05
Snapped rings contain repeated consecutive vertices.
Snapping ring vertices to a reference layer: collapse result · case 01
Rings snapped down to a doubled segment are returned as polygons.
Snapping ring vertices to a reference layer: collapse result · case 02
Rings snapped down to a doubled segment are returned as polygons.
Snapping ring vertices to a reference layer: collapse result · case 03
Rings snapped down to a doubled segment are returned as polygons.
Snapping ring vertices to a reference layer: collapse result · case 04
Rings snapped down to a doubled segment are returned as polygons.
Snapping ring vertices to a reference layer: collapse result · case 05
Rings snapped down to a doubled segment are returned as polygons.
Dissolve grouping by attribute and shared edges: null attribute · case 01
Adjacent polygons with missing attributes are dissolved together.
Dissolve grouping by attribute and shared edges: null attribute · case 02
Adjacent polygons with missing attributes are dissolved together.
Dissolve grouping by attribute and shared edges: null attribute · case 03
Adjacent polygons with missing attributes are dissolved together.
Dissolve grouping by attribute and shared edges: null attribute · case 04
Adjacent polygons with missing attributes are dissolved together.
Dissolve grouping by attribute and shared edges: null attribute · case 05
Adjacent polygons with missing attributes are dissolved together.
Dissolve grouping by attribute and shared edges: transitive union · case 01
Chains of same-valued polygons are split into several groups.
Dissolve grouping by attribute and shared edges: transitive union · case 02
Chains of same-valued polygons are split into several groups.
Dissolve grouping by attribute and shared edges: transitive union · case 03
Chains of same-valued polygons are split into several groups.
Dissolve grouping by attribute and shared edges: transitive union · case 04
Chains of same-valued polygons are split into several groups.
Dissolve grouping by attribute and shared edges: transitive union · case 05
Chains of same-valued polygons are split into several groups.
Dissolve grouping by attribute and shared edges: exact key comparison · case 01
Numeric 1 and text "1" zones are merged.
Dissolve grouping by attribute and shared edges: exact key comparison · case 02
Numeric 1 and text "1" zones are merged.
Dissolve grouping by attribute and shared edges: exact key comparison · case 03
Numeric 1 and text "1" zones are merged.
Dissolve grouping by attribute and shared edges: exact key comparison · case 04
Numeric 1 and text "1" zones are merged.
Dissolve grouping by attribute and shared edges: exact key comparison · case 05
Numeric 1 and text "1" zones are merged.
Dissolve grouping by attribute and shared edges: group ordering · case 01
Groups are reported in root order rather than by their first polygon.
Dissolve grouping by attribute and shared edges: group ordering · case 02
Groups are reported in root order rather than by their first polygon.
Dissolve grouping by attribute and shared edges: group ordering · case 03
Groups are reported in root order rather than by their first polygon.
Dissolve grouping by attribute and shared edges: group ordering · case 04
Groups are reported in root order rather than by their first polygon.
Dissolve grouping by attribute and shared edges: group ordering · case 05
Groups are reported in root order rather than by their first polygon.
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 ↗