FAILURE MAP
← Case archive

FA-45036 / Data systems / Open access

Cross-batch resume carries the old row offset into the next batch · case 01

Cross-batch resume carries the old row offset into the next batch.

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

ROOT CAUSE

batch-resume-cursor: Cross-batch resume carries the old row offset into the next batch.

THE FAILURE

batch-resume-cursor: Cross-batch resume carries the old row offset into the next batch.

Unsuccessful approach: Subtracting one still skips rows after longer batches.

Case contract

Fetch at most quota rows from a sequence of batches starting at [batch-index,row-offset]. Skip exhausted and empty batches, return the emitted rows and a canonical next cursor, and mark exhaustion as [number-of-batches,0]. Quota zero preserves a normalized cursor.

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:
        batches,batch,offset,quota=d
        out=[]
        while batch<len(batches) and offset>=len(batches[batch]):
            batch+=1; offset=0
        while quota>0 and batch<len(batches):
            out.append(batches[batch][offset])
            offset+=1; quota-=1
            while batch<len(batches) and offset>=len(batches[batch]):
                batch+=1; offset=1
        return [out,[batch,offset]]
    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('partial current batch', solve([[[1, 2, 3]], 0, 1, 1]), [[2], [0, 2]])
    check('cross empty batches', solve([[[1], [], [], [2, 3]], 0, 0, 2]), [[1, 2], [3, 1]])
    check('initial exhausted', solve([[[], [], [1, 2]], 0, 0, 1]), [[1], [2, 1]])
    check('resume past long batch', solve([[[1, 2], [3, 4]], 0, 0, 3]), [[1, 2, 3], [1, 1]])
    check('all exhausted', solve([[[1]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[1, 2]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[1, 2, 3, 4]], 0, 0, 2]), [[1, 2], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
elif N == 2:
    check('partial current batch', solve([[[2, 3, 4]], 0, 1, 1]), [[3], [0, 2]])
    check('cross empty batches', solve([[[2], [], [], [3, 4]], 0, 0, 2]), [[2, 3], [3, 1]])
    check('initial exhausted', solve([[[], [], [2, 3]], 0, 0, 1]), [[2], [2, 1]])
    check('resume past long batch', solve([[[2, 3], [4, 5]], 0, 0, 3]), [[2, 3, 4], [1, 1]])
    check('all exhausted', solve([[[2]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[2, 3]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[2, 3, 4, 5]], 0, 0, 2]), [[2, 3], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
elif N == 3:
    check('partial current batch', solve([[[3, 4, 5]], 0, 1, 1]), [[4], [0, 2]])
    check('cross empty batches', solve([[[3], [], [], [4, 5]], 0, 0, 2]), [[3, 4], [3, 1]])
    check('initial exhausted', solve([[[], [], [3, 4]], 0, 0, 1]), [[3], [2, 1]])
    check('resume past long batch', solve([[[3, 4], [5, 6]], 0, 0, 3]), [[3, 4, 5], [1, 1]])
    check('all exhausted', solve([[[3]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[3, 4]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[3, 4, 5, 6]], 0, 0, 2]), [[3, 4], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
elif N == 4:
    check('partial current batch', solve([[[4, 5, 6]], 0, 1, 1]), [[5], [0, 2]])
    check('cross empty batches', solve([[[4], [], [], [5, 6]], 0, 0, 2]), [[4, 5], [3, 1]])
    check('initial exhausted', solve([[[], [], [4, 5]], 0, 0, 1]), [[4], [2, 1]])
    check('resume past long batch', solve([[[4, 5], [6, 7]], 0, 0, 3]), [[4, 5, 6], [1, 1]])
    check('all exhausted', solve([[[4]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[4, 5]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[4, 5, 6, 7]], 0, 0, 2]), [[4, 5], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
elif N == 5:
    check('partial current batch', solve([[[5, 6, 7]], 0, 1, 1]), [[6], [0, 2]])
    check('cross empty batches', solve([[[5], [], [], [6, 7]], 0, 0, 2]), [[5, 6], [3, 1]])
    check('initial exhausted', solve([[[], [], [5, 6]], 0, 0, 1]), [[5], [2, 1]])
    check('resume past long batch', solve([[[5, 6], [7, 8]], 0, 0, 3]), [[5, 6, 7], [1, 1]])
    check('all exhausted', solve([[[5]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[5, 6]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[5, 6, 7, 8]], 0, 0, 2]), [[5, 6], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
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
partial current batch[[2], [0, 2]][[2], [0, 2]]Passed
cross empty batches[[1, 3], [4, 1]][[1, 2], [3, 1]]Failed
initial exhausted[[1], [2, 1]][[1], [2, 1]]Passed
resume past long batch[[1, 2, 4], [2, 1]][[1, 2, 3], [1, 1]]Failed
all exhausted[[], [1, 0]][[], [1, 0]]Passed
zero quota[[], [0, 1]][[], [0, 1]]Passed
within long batch[[1, 2], [0, 2]][[1, 2], [0, 2]]Passed
empty stream[[], [0, 0]][[], [0, 0]]Passed

SHA-256 / e58ceb9f56a80973a12b3be75cf86205265890fbaf0ca93df4df17e48bc4076e

2 / The unsuccessful fix

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

N = 1
observations = []
def solve(d):
    try:
        batches,batch,offset,quota=d
        out=[]
        while batch<len(batches) and offset>=len(batches[batch]):
            batch+=1; offset=0
        while quota>0 and batch<len(batches):
            out.append(batches[batch][offset])
            offset+=1; quota-=1
            while batch<len(batches) and offset>=len(batches[batch]):
                batch+=1; offset=max(0,offset-1)
        return [out,[batch,offset]]
    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('partial current batch', solve([[[1, 2, 3]], 0, 1, 1]), [[2], [0, 2]])
    check('cross empty batches', solve([[[1], [], [], [2, 3]], 0, 0, 2]), [[1, 2], [3, 1]])
    check('initial exhausted', solve([[[], [], [1, 2]], 0, 0, 1]), [[1], [2, 1]])
    check('resume past long batch', solve([[[1, 2], [3, 4]], 0, 0, 3]), [[1, 2, 3], [1, 1]])
    check('all exhausted', solve([[[1]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[1, 2]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[1, 2, 3, 4]], 0, 0, 2]), [[1, 2], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
elif N == 2:
    check('partial current batch', solve([[[2, 3, 4]], 0, 1, 1]), [[3], [0, 2]])
    check('cross empty batches', solve([[[2], [], [], [3, 4]], 0, 0, 2]), [[2, 3], [3, 1]])
    check('initial exhausted', solve([[[], [], [2, 3]], 0, 0, 1]), [[2], [2, 1]])
    check('resume past long batch', solve([[[2, 3], [4, 5]], 0, 0, 3]), [[2, 3, 4], [1, 1]])
    check('all exhausted', solve([[[2]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[2, 3]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[2, 3, 4, 5]], 0, 0, 2]), [[2, 3], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
elif N == 3:
    check('partial current batch', solve([[[3, 4, 5]], 0, 1, 1]), [[4], [0, 2]])
    check('cross empty batches', solve([[[3], [], [], [4, 5]], 0, 0, 2]), [[3, 4], [3, 1]])
    check('initial exhausted', solve([[[], [], [3, 4]], 0, 0, 1]), [[3], [2, 1]])
    check('resume past long batch', solve([[[3, 4], [5, 6]], 0, 0, 3]), [[3, 4, 5], [1, 1]])
    check('all exhausted', solve([[[3]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[3, 4]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[3, 4, 5, 6]], 0, 0, 2]), [[3, 4], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
elif N == 4:
    check('partial current batch', solve([[[4, 5, 6]], 0, 1, 1]), [[5], [0, 2]])
    check('cross empty batches', solve([[[4], [], [], [5, 6]], 0, 0, 2]), [[4, 5], [3, 1]])
    check('initial exhausted', solve([[[], [], [4, 5]], 0, 0, 1]), [[4], [2, 1]])
    check('resume past long batch', solve([[[4, 5], [6, 7]], 0, 0, 3]), [[4, 5, 6], [1, 1]])
    check('all exhausted', solve([[[4]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[4, 5]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[4, 5, 6, 7]], 0, 0, 2]), [[4, 5], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
elif N == 5:
    check('partial current batch', solve([[[5, 6, 7]], 0, 1, 1]), [[6], [0, 2]])
    check('cross empty batches', solve([[[5], [], [], [6, 7]], 0, 0, 2]), [[5, 6], [3, 1]])
    check('initial exhausted', solve([[[], [], [5, 6]], 0, 0, 1]), [[5], [2, 1]])
    check('resume past long batch', solve([[[5, 6], [7, 8]], 0, 0, 3]), [[5, 6, 7], [1, 1]])
    check('all exhausted', solve([[[5]], 0, 1, 3]), [[], [1, 0]])
    check('zero quota', solve([[[5, 6]], 0, 1, 0]), [[], [0, 1]])
    check('within long batch', solve([[[5, 6, 7, 8]], 0, 0, 2]), [[5, 6], [0, 2]])
    check('empty stream', solve([[], 0, 0, 2]), [[], [0, 0]])
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
partial current batch[[2], [0, 2]][[2], [0, 2]]Passed
cross empty batches[[1, 2], [3, 1]][[1, 2], [3, 1]]Passed
initial exhausted[[1], [2, 1]][[1], [2, 1]]Passed
resume past long batch[[1, 2, 4], [2, 1]][[1, 2, 3], [1, 1]]Failed
all exhausted[[], [1, 0]][[], [1, 0]]Passed
zero quota[[], [0, 1]][[], [0, 1]]Passed
within long batch[[1, 2], [0, 2]][[1, 2], [0, 2]]Passed
empty stream[[], [0, 0]][[], [0, 0]]Passed

SHA-256 / 2eacb739f33e3976decd11f90bd5f37a8d47ff61a4b926623e67670d0f1ec77d

HELD IN THE MEMBER ARCHIVE

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

This mechanism has 8 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:18.307400+00:00.

Case digest / 9650800f81d8bed5db250bdfe40c5ce007dfb06d5a3949073611917b9a3934a5