FA-48051 / Delimited text / Open access
An absolute value is interpreted as another delta · case 01
A structured table violates the declared record or column contract.
ROOT CAUSE
An absolute marker fails to reset the running base.
THE FAILURE
An absolute marker fails to reset the running base.
Unsuccessful approach: Ignoring later absolute payloads also leaves the wrong base.
Case contract
Decode two-column semicolon rows. A first row must contain absolute ASCII integer cells prefixed =. Later cells may use signed integer deltas prefixed + or -, or =absolute. A caret copies prior column value. Return numeric rows. Empty tokens and noncanonical nondecimal tokens reject.
Why this case matters
Delimited interchange needs explicit framing, schema and field semantics at ingestion and emission boundaries.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
def _vary(value):
if value == '@END': return 3 + 4*N
if isinstance(value, str): return value.replace('@', 'cell' * N)
if isinstance(value, list): return [_vary(x) for x in value]
if isinstance(value, dict): return {_vary(k): _vary(v) for k,v in value.items()}
return value
N = 1
observations = []
def solve(data):
rows, previous = [], None
for line in data:
cells = line.split(';')
if len(cells) != 2: return None
row = []
for i, cell in enumerate(cells):
if cell == '^':
if previous is None: return None
value = previous[i]
else:
if not cell or cell[0] not in '=+-': return None
digits = cell[1:]
if not digits.isascii() or not digits.isdecimal(): return None
amount = int(digits)
if cell[0] == '=': value = amount + (previous[i] if previous is not None else 0)
else:
if previous is None: return None
value = previous[i] + (amount if cell[0] == '+' else -amount)
row.append(value)
rows.append(row)
previous = row
return rows
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('deltas', solve(_vary(['=10;=20', '+3;-2', '-1;+4'])), _vary([[10, 20], [13, 18], [12, 22]]))
check('absolute reset', solve(_vary(['=10;=20', '=1;^', '+2;+3'])), _vary([[10, 20], [1, 20], [3, 23]]))
check('initial delta', solve(_vary(['+1;=2'])), _vary(None))
check('initial copy', solve(_vary(['^;=2'])), _vary(None))
check('bad amount', solve(_vary(['=a;=2'])), _vary(None))
check('empty amount', solve(_vary(['=;=2'])), _vary(None))
check('empty table', solve(_vary([])), _vary([]))
check('zero deltas', solve(_vary(['=0;=1', '+0;-0'])), _vary([[0, 1], [0, 1]]))
check('variant delta magnitude', solve(['='+str(N)+';=2','+3;-1']), [[N,2],[N+3,1]])
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 fixture | Actual | Expected | Outcome |
|---|---|---|---|
| deltas | [[10, 20], [13, 18], [12, 22]] | [[10, 20], [13, 18], [12, 22]] | Passed |
| absolute reset | [[10, 20], [11, 20], [13, 23]] | [[10, 20], [1, 20], [3, 23]] | Failed |
| initial delta | None | None | Passed |
| initial copy | None | None | Passed |
| bad amount | None | None | Passed |
| empty amount | None | None | Passed |
| empty table | [] | [] | Passed |
| zero deltas | [[0, 1], [0, 1]] | [[0, 1], [0, 1]] | Passed |
| variant delta magnitude | [[1, 2], [4, 1]] | [[1, 2], [4, 1]] | Passed |
SHA-256 / ee358a7622985aa9a8221aaea2e6137e05c9f82c9a827973a76cd511776ca13b
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
def _vary(value):
if value == '@END': return 3 + 4*N
if isinstance(value, str): return value.replace('@', 'cell' * N)
if isinstance(value, list): return [_vary(x) for x in value]
if isinstance(value, dict): return {_vary(k): _vary(v) for k,v in value.items()}
return value
N = 1
observations = []
def solve(data):
rows, previous = [], None
for line in data:
cells = line.split(';')
if len(cells) != 2: return None
row = []
for i, cell in enumerate(cells):
if cell == '^':
if previous is None: return None
value = previous[i]
else:
if not cell or cell[0] not in '=+-': return None
digits = cell[1:]
if not digits.isascii() or not digits.isdecimal(): return None
amount = int(digits)
if cell[0] == '=': value = previous[i] if previous is not None else amount
else:
if previous is None: return None
value = previous[i] + (amount if cell[0] == '+' else -amount)
row.append(value)
rows.append(row)
previous = row
return rows
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('deltas', solve(_vary(['=10;=20', '+3;-2', '-1;+4'])), _vary([[10, 20], [13, 18], [12, 22]]))
check('absolute reset', solve(_vary(['=10;=20', '=1;^', '+2;+3'])), _vary([[10, 20], [1, 20], [3, 23]]))
check('initial delta', solve(_vary(['+1;=2'])), _vary(None))
check('initial copy', solve(_vary(['^;=2'])), _vary(None))
check('bad amount', solve(_vary(['=a;=2'])), _vary(None))
check('empty amount', solve(_vary(['=;=2'])), _vary(None))
check('empty table', solve(_vary([])), _vary([]))
check('zero deltas', solve(_vary(['=0;=1', '+0;-0'])), _vary([[0, 1], [0, 1]]))
check('variant delta magnitude', solve(['='+str(N)+';=2','+3;-1']), [[N,2],[N+3,1]])
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 fixture | Actual | Expected | Outcome |
|---|---|---|---|
| deltas | [[10, 20], [13, 18], [12, 22]] | [[10, 20], [13, 18], [12, 22]] | Passed |
| absolute reset | [[10, 20], [10, 20], [12, 23]] | [[10, 20], [1, 20], [3, 23]] | Failed |
| initial delta | None | None | Passed |
| initial copy | None | None | Passed |
| bad amount | None | None | Passed |
| empty amount | None | None | Passed |
| empty table | [] | [] | Passed |
| zero deltas | [[0, 1], [0, 1]] | [[0, 1], [0, 1]] | Passed |
| variant delta magnitude | [[1, 2], [4, 1]] | [[1, 2], [4, 1]] | Passed |
SHA-256 / 7dca7cf038b98d3da8abf4da46e262302867071dc9496bb63558f8ecd6850d98
HELD IN THE MEMBER ARCHIVE
The verified repair and its recorded checks are member-only.
This mechanism has 9 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
Deterministic bounded in-memory model. No claim of complete CSV or external format conformance. 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:47.351431+00:00.
Case digest / 0942b298cb1e35ea29866e1bd49f1d434833b42d59391e6d1e515d5547e8cec6