FAILURE MAP
← Case archive

FA-27381 / HTTP ranges / Open access

A persisted partial-response cache record keeps byte coverage and revision metadata intact: persistent records cannot assign the same byte to two fragments · case 01

A persisted partial-response cache record keeps byte coverage and revision metadata intact: persistent records cannot assign the same byte to two fragments.

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

ROOT CAUSE

The partial-cache-record-duplicate-ownership decision uses wire=x if len(wire)<10 or any(not 0<=b<=255 for b in wire): return None if wire[:2]!=[82,71]: return None if wire[2]!=1: return None if wire[3]!=0: return None if sum(wire[:-1])%256!=wire[-1]: return None generation=wire[4]*256+wire[5] total=wire[6]*256+wire[7] count=wire[8] pos=9 parts=[] owned=set() for _ in range(count): if pos+3>len(wire)-1: return None offset=wire[pos]*256+wire[pos+1] size=wire[pos+2] pos+=3 if pos+size>len(wire)-1 or offset+size>total: return None if False: return None owned.update(range(offset,offset+size)) parts.append([offset,''.join(chr(b) for b in wire[pos:pos+size])]) pos+=size if pos!=len(wire)-1: return None return [generation,total,parts].

VERIFIED REPAIR

Apply the bounded decision exactly: wire=x if len(wire)<10 or any(not 0<=b<=255 for b in wire): return None if wire[:2]!=[82,71]: return None if wire[2]!=1: return None if wire[3]!=0: return None if sum(wire[:-1])%256!=wire[-1]: return None generation=wire[4]*256+wire[5] total=wire[6]*256+wire[7] count=wire[8] pos=9 parts=[] owned=set() for _ in range(count): if pos+3>len(wire)-1: return None offset=wire[pos]*256+wire[pos+1] size=wire[pos+2] pos+=3 if pos+size>len(wire)-1 or offset+size>total: return None if any(i in owned for i in range(offset,offset+size)): return None owned.update(range(offset,offset+size)) parts.append([offset,''.join(chr(b) for b in wire[pos:pos+size])]) pos+=size if pos!=len(wire)-1: return None return [generation,total,parts]

Unsuccessful approach: The partial repair uses wire=x if len(wire)<10 or any(not 0<=b<=255 for b in wire): return None if wire[:2]!=[82,71]: return None if wire[2]!=1: return None if wire[3]!=0: return None if sum(wire[:-1])%256!=wire[-1]: return None generation=wire[4]*256+wire[5] total=wire[6]*256+wire[7] count=wire[8] pos=9 parts=[] owned=set() for _ in range(count): if pos+3>len(wire)-1: return None offset=wire[pos]*256+wire[pos+1] size=wire[pos+2] pos+=3 if pos+size>len(wire)-1 or offset+size>total: return None if all(i in owned for i in range(offset,offset+size)) and size>1: return None owned.update(range(offset,offset+size)) parts.append([offset,''.join(chr(b) for b in wire[pos:pos+size])]) pos+=size if pos!=len(wire)-1: return None return [generation,total,parts], which still violates the stated contract.

Case contract

Decode this stipulated local binary cache envelope: magic RG, version1, flags0, two-byte big-endian generation, two-byte big-endian complete length, one-byte fragment count, then fragments [two-byte big-endian offset,one-byte count,ASCII payload], followed by one checksum byte equal to sum of preceding bytes modulo256. Reject malformed envelopes, bytes outside0..255, trailing bytes, overlapping fragment ownership, or spans outside complete length. Return [generation,total,[[offset,payload],...]]. This is an invented bounded persistence format, not a public protocol.

Why this case matters

Range responses combine representation identity, conditional requests, framing, and partial-object state.

1 / The failure

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

N = 1
observations = []
def solve(x):
    wire=x
    if len(wire)<10 or any(not 0<=b<=255 for b in wire): return None
    if wire[:2]!=[82,71]: return None
    if wire[2]!=1: return None
    if wire[3]!=0: return None
    if sum(wire[:-1])%256!=wire[-1]: return None
    generation=wire[4]*256+wire[5]
    total=wire[6]*256+wire[7]
    count=wire[8]
    pos=9
    parts=[]
    owned=set()
    for _ in range(count):
        if pos+3>len(wire)-1: return None
        offset=wire[pos]*256+wire[pos+1]
        size=wire[pos+2]
        pos+=3
        if pos+size>len(wire)-1 or offset+size>total: return None
        if False: return None
        owned.update(range(offset,offset+size))
        parts.append([offset,''.join(chr(b) for b in wire[pos:pos+size])])
        pos+=size
    if pos!=len(wire)-1: return None
    return [generation,total,parts]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('duplicate-ownership fixture 0', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,1,N,1,2,2,0,0,2,97,98,1,0,2,99,100])))), json.loads(json.dumps([256+N,258,[[0,'ab'],[256,'cd']]])))
check('duplicate-ownership fixture 1', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,0,0])))), json.loads(json.dumps([0,0,[]])))
check('duplicate-ownership fixture 2', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,1,0,3,1,0,1,2,98,99])))), json.loads(json.dumps([1,3,[[1,'bc']]])))
check('duplicate-ownership fixture 3', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,70,1,0,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 4', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,2,0,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 5', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,1,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 6', json.loads(json.dumps(solve([82,71,1,0,0,0,0,0,0,0]))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 7', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,1,1,0,0,2,97,98])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 8', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,2,2,0,0,1,97,0,0,1,97])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 9', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,0,0,99])))), json.loads(json.dumps(None)))
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
duplicate-ownership fixture 0[257, 258, [[0, 'ab'], [256, 'cd']]][257, 258, [[0, 'ab'], [256, 'cd']]]Passed
duplicate-ownership fixture 1[0, 0, []][0, 0, []]Passed
duplicate-ownership fixture 2[1, 3, [[1, 'bc']]][1, 3, [[1, 'bc']]]Passed
duplicate-ownership fixture 3NoneNonePassed
duplicate-ownership fixture 4NoneNonePassed
duplicate-ownership fixture 5NoneNonePassed
duplicate-ownership fixture 6NoneNonePassed
duplicate-ownership fixture 7NoneNonePassed
duplicate-ownership fixture 8[0, 2, [[0, 'a'], [0, 'a']]]NoneFailed
duplicate-ownership fixture 9NoneNonePassed

SHA-256 / c85f4afad08340400ab8e56872b42202c5245e95ba10455171e3735b90618f3b

2 / The unsuccessful fix

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

N = 1
observations = []
def solve(x):
    wire=x
    if len(wire)<10 or any(not 0<=b<=255 for b in wire): return None
    if wire[:2]!=[82,71]: return None
    if wire[2]!=1: return None
    if wire[3]!=0: return None
    if sum(wire[:-1])%256!=wire[-1]: return None
    generation=wire[4]*256+wire[5]
    total=wire[6]*256+wire[7]
    count=wire[8]
    pos=9
    parts=[]
    owned=set()
    for _ in range(count):
        if pos+3>len(wire)-1: return None
        offset=wire[pos]*256+wire[pos+1]
        size=wire[pos+2]
        pos+=3
        if pos+size>len(wire)-1 or offset+size>total: return None
        if all(i in owned for i in range(offset,offset+size)) and size>1: return None
        owned.update(range(offset,offset+size))
        parts.append([offset,''.join(chr(b) for b in wire[pos:pos+size])])
        pos+=size
    if pos!=len(wire)-1: return None
    return [generation,total,parts]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('duplicate-ownership fixture 0', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,1,N,1,2,2,0,0,2,97,98,1,0,2,99,100])))), json.loads(json.dumps([256+N,258,[[0,'ab'],[256,'cd']]])))
check('duplicate-ownership fixture 1', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,0,0])))), json.loads(json.dumps([0,0,[]])))
check('duplicate-ownership fixture 2', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,1,0,3,1,0,1,2,98,99])))), json.loads(json.dumps([1,3,[[1,'bc']]])))
check('duplicate-ownership fixture 3', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,70,1,0,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 4', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,2,0,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 5', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,1,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 6', json.loads(json.dumps(solve([82,71,1,0,0,0,0,0,0,0]))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 7', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,1,1,0,0,2,97,98])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 8', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,2,2,0,0,1,97,0,0,1,97])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 9', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,0,0,99])))), json.loads(json.dumps(None)))
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
duplicate-ownership fixture 0[257, 258, [[0, 'ab'], [256, 'cd']]][257, 258, [[0, 'ab'], [256, 'cd']]]Passed
duplicate-ownership fixture 1[0, 0, []][0, 0, []]Passed
duplicate-ownership fixture 2[1, 3, [[1, 'bc']]][1, 3, [[1, 'bc']]]Passed
duplicate-ownership fixture 3NoneNonePassed
duplicate-ownership fixture 4NoneNonePassed
duplicate-ownership fixture 5NoneNonePassed
duplicate-ownership fixture 6NoneNonePassed
duplicate-ownership fixture 7NoneNonePassed
duplicate-ownership fixture 8[0, 2, [[0, 'a'], [0, 'a']]]NoneFailed
duplicate-ownership fixture 9NoneNonePassed

SHA-256 / b1611e1f030535c60942f65ccf6533d6ea9d31c9914fa411c13cab4ff6c43b6f

3 / The verified repair

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

N = 1
observations = []
def solve(x):
    wire=x
    if len(wire)<10 or any(not 0<=b<=255 for b in wire): return None
    if wire[:2]!=[82,71]: return None
    if wire[2]!=1: return None
    if wire[3]!=0: return None
    if sum(wire[:-1])%256!=wire[-1]: return None
    generation=wire[4]*256+wire[5]
    total=wire[6]*256+wire[7]
    count=wire[8]
    pos=9
    parts=[]
    owned=set()
    for _ in range(count):
        if pos+3>len(wire)-1: return None
        offset=wire[pos]*256+wire[pos+1]
        size=wire[pos+2]
        pos+=3
        if pos+size>len(wire)-1 or offset+size>total: return None
        if any(i in owned for i in range(offset,offset+size)): return None
        owned.update(range(offset,offset+size))
        parts.append([offset,''.join(chr(b) for b in wire[pos:pos+size])])
        pos+=size
    if pos!=len(wire)-1: return None
    return [generation,total,parts]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('duplicate-ownership fixture 0', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,1,N,1,2,2,0,0,2,97,98,1,0,2,99,100])))), json.loads(json.dumps([256+N,258,[[0,'ab'],[256,'cd']]])))
check('duplicate-ownership fixture 1', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,0,0])))), json.loads(json.dumps([0,0,[]])))
check('duplicate-ownership fixture 2', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,1,0,3,1,0,1,2,98,99])))), json.loads(json.dumps([1,3,[[1,'bc']]])))
check('duplicate-ownership fixture 3', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,70,1,0,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 4', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,2,0,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 5', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,1,0,0,0,0,0])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 6', json.loads(json.dumps(solve([82,71,1,0,0,0,0,0,0,0]))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 7', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,1,1,0,0,2,97,98])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 8', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,2,2,0,0,1,97,0,0,1,97])))), json.loads(json.dumps(None)))
check('duplicate-ownership fixture 9', json.loads(json.dumps(solve((lambda w:w+[sum(w)%256])([82,71,1,0,0,0,0,0,0,99])))), json.loads(json.dumps(None)))
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
duplicate-ownership fixture 0[257, 258, [[0, 'ab'], [256, 'cd']]][257, 258, [[0, 'ab'], [256, 'cd']]]Passed
duplicate-ownership fixture 1[0, 0, []][0, 0, []]Passed
duplicate-ownership fixture 2[1, 3, [[1, 'bc']]][1, 3, [[1, 'bc']]]Passed
duplicate-ownership fixture 3NoneNonePassed
duplicate-ownership fixture 4NoneNonePassed
duplicate-ownership fixture 5NoneNonePassed
duplicate-ownership fixture 6NoneNonePassed
duplicate-ownership fixture 7NoneNonePassed
duplicate-ownership fixture 8NoneNonePassed
duplicate-ownership fixture 9NoneNonePassed

SHA-256 / d4cf3a59cdd491d000586ee97e7a5fe8f07aec25cd483ace302f4ded7010a455

Verification & scope

Deterministic simplified range service, with stipulated local policies and already parsed trusted inputs; not a complete HTTP implementation. 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:41:24.567075+00:00.

Case digest / e9cd6200446c000494599e256929417ce53b6d11d818f81584f0f76105316827