FAILURE MAP
← Case archive

FA-45161 / Data systems / Open access

Dictionary equality decodes the right code with the left dictionary · case 01

Dictionary equality decodes the right code with the left dictionary.

Verified by executionVariant 1 · 7 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

dictionary-comparison: Dictionary equality decodes the right code with the left dictionary.

THE FAILURE

dictionary-comparison: Dictionary equality decodes the right code with the left dictionary.

Unsuccessful approach: Using the left code in the right domain remains invalid.

Case contract

Compare two dictionary vectors row by row using decoded values, not local codes. Null validity yields UNKNOWN(None), including two null lanes. Dictionary entries themselves are ordinary integer values. Output follows the supplied pair selection order.

Why this case matters

A bounded deterministic data engine model makes representation and changelog faults reproducible.

1 / The failure

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(d):
    try:
        ad,ac,av,bd,bc,bv,pairs=d
        out=[]
        for ai,bi in pairs:
            if not av[ai] or not bv[bi]: out.append(None); continue
            a=ad[ac[ai]]
            b=ad[bc[bi]]
            out.append(a==b)
        return out
    except (IndexError, KeyError, ValueError, StopIteration) as exc:
        return {"representation_error": type(exc).__name__}
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
if N == 1:
    check('different codebooks', solve([[1, 2], [0, 1], [True, True], [2, 1], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[1], [0], [False], [1], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[1], [0], [False], [1], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[1, 2], [0, 1], [True, False], [1, 2], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[1, 2], [0, 1], [True, True], [1, 2], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[1], [0], [True], [1], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[1], [0], [True], [1], [0], [True], []]), [])
elif N == 2:
    check('different codebooks', solve([[2, 3], [0, 1], [True, True], [3, 2], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[2], [0], [False], [2], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[2], [0], [False], [2], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[2, 3], [0, 1], [True, False], [2, 3], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[2, 3], [0, 1], [True, True], [2, 3], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[2], [0], [True], [2], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[2], [0], [True], [2], [0], [True], []]), [])
elif N == 3:
    check('different codebooks', solve([[3, 4], [0, 1], [True, True], [4, 3], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[3], [0], [False], [3], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[3], [0], [False], [3], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[3, 4], [0, 1], [True, False], [3, 4], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[3, 4], [0, 1], [True, True], [3, 4], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[3], [0], [True], [3], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[3], [0], [True], [3], [0], [True], []]), [])
elif N == 4:
    check('different codebooks', solve([[4, 5], [0, 1], [True, True], [5, 4], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[4], [0], [False], [4], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[4], [0], [False], [4], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[4, 5], [0, 1], [True, False], [4, 5], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[4, 5], [0, 1], [True, True], [4, 5], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[4], [0], [True], [4], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[4], [0], [True], [4], [0], [True], []]), [])
elif N == 5:
    check('different codebooks', solve([[5, 6], [0, 1], [True, True], [6, 5], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[5], [0], [False], [5], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[5], [0], [False], [5], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[5, 6], [0, 1], [True, False], [5, 6], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[5, 6], [0, 1], [True, True], [5, 6], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[5], [0], [True], [5], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[5], [0], [True], [5], [0], [True], []]), [])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
Boundary fixtureActualExpectedOutcome
different codebooks[False, True, False][True, False, True]Failed
unknown left[None][None]Passed
both unknown[None][None]Passed
pair validity[False, None][False, None]Passed
order[False, True][False, True]Passed
repeat[True, True][True, True]Passed
empty pairs[][]Passed

SHA-256 / dc795f5421ebbcc247992ce129266eb614e7227443382b265560c65acd51a934

2 / The unsuccessful fix

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(d):
    try:
        ad,ac,av,bd,bc,bv,pairs=d
        out=[]
        for ai,bi in pairs:
            if not av[ai] or not bv[bi]: out.append(None); continue
            a=ad[ac[ai]]
            b=bd[ac[ai]]
            out.append(a==b)
        return out
    except (IndexError, KeyError, ValueError, StopIteration) as exc:
        return {"representation_error": type(exc).__name__}
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
if N == 1:
    check('different codebooks', solve([[1, 2], [0, 1], [True, True], [2, 1], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[1], [0], [False], [1], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[1], [0], [False], [1], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[1, 2], [0, 1], [True, False], [1, 2], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[1, 2], [0, 1], [True, True], [1, 2], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[1], [0], [True], [1], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[1], [0], [True], [1], [0], [True], []]), [])
elif N == 2:
    check('different codebooks', solve([[2, 3], [0, 1], [True, True], [3, 2], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[2], [0], [False], [2], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[2], [0], [False], [2], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[2, 3], [0, 1], [True, False], [2, 3], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[2, 3], [0, 1], [True, True], [2, 3], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[2], [0], [True], [2], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[2], [0], [True], [2], [0], [True], []]), [])
elif N == 3:
    check('different codebooks', solve([[3, 4], [0, 1], [True, True], [4, 3], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[3], [0], [False], [3], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[3], [0], [False], [3], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[3, 4], [0, 1], [True, False], [3, 4], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[3, 4], [0, 1], [True, True], [3, 4], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[3], [0], [True], [3], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[3], [0], [True], [3], [0], [True], []]), [])
elif N == 4:
    check('different codebooks', solve([[4, 5], [0, 1], [True, True], [5, 4], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[4], [0], [False], [4], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[4], [0], [False], [4], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[4, 5], [0, 1], [True, False], [4, 5], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[4, 5], [0, 1], [True, True], [4, 5], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[4], [0], [True], [4], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[4], [0], [True], [4], [0], [True], []]), [])
elif N == 5:
    check('different codebooks', solve([[5, 6], [0, 1], [True, True], [6, 5], [0, 1], [True, True], [[0, 1], [0, 0], [1, 0]]]), [True, False, True])
    check('unknown left', solve([[5], [0], [False], [5], [0], [True], [[0, 0]]]), [None])
    check('both unknown', solve([[5], [0], [False], [5], [0], [False], [[0, 0]]]), [None])
    check('pair validity', solve([[5, 6], [0, 1], [True, False], [5, 6], [0, 1], [False, True], [[0, 1], [1, 0]]]), [False, None])
    check('order', solve([[5, 6], [0, 1], [True, True], [5, 6], [0, 1], [True, True], [[1, 0], [0, 0]]]), [False, True])
    check('repeat', solve([[5], [0], [True], [5], [0], [True], [[0, 0], [0, 0]]]), [True, True])
    check('empty pairs', solve([[5], [0], [True], [5], [0], [True], []]), [])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
Boundary fixtureActualExpectedOutcome
different codebooks[False, False, False][True, False, True]Failed
unknown left[None][None]Passed
both unknown[None][None]Passed
pair validity[True, None][False, None]Failed
order[True, True][False, True]Failed
repeat[True, True][True, True]Passed
empty pairs[][]Passed

SHA-256 / 196b3401bb5a07a845a0ac9413d9c50d0a88167109b9607b01b1c3b3df9665a4

HELD IN THE MEMBER ARCHIVE

The verified repair and its recorded checks are member-only.

This mechanism has 7 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.

Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.

Member access is invitation-based. Sign in with your invited account to inspect the repair.

Sign in to the archive ↗

Verification & scope

Offline stipulated semantics over valid small inputs; no performance, concurrency, or production-engine conformance claim. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.

Observations recorded using Python 3.12.14 at 2026-09-29T14:44:19.462551+00:00.

Case digest / 89c1b1f05d22ab7830ec18ede4b5e2f87101667f7b5540ca0c45b6f7909f7b80