FAILURE MAP
← Case archive

FA-27956 / HTTP redirects / Open access

Prepare a redirect replay from a bounded upload cursor: discarded body length · case 01

A body-dropping redirect advertises the old payload length.

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

ROOT CAUSE

The discarded-body-length decision uses 'length'; this violates the stipulated controller policy.

THE FAILURE

The discarded-body-length decision uses 'length'; this violates the stipulated controller policy.

Unsuccessful approach: The partial repair uses '0' and still fails an explicit boundary or control.

Case contract

Prepare a redirect replay from a bounded upload cursor. The explicit fixture inputs and outputs define a bounded offline policy; request identity must accompany the decision.

Why this case matters

Models a redirect controller decision before following a target or exposing a redirect result.

1 / The failure

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json
from urllib.parse import urlsplit, unquote, quote
import posixpath
import re
N = 1
observations = []
def solve(request, cursor, start, length, seekable, consumed, preserved):
    return {'request': request, 'decision': [start if preserved else cursor, max(0, length - (cursor-start)), preserved and consumed and not seekable, length, preserved and seekable and cursor != start]} 
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve('/requests/' + str(N) + '/0', 7, 3, 10, True, True, True), {'request': '/requests/' + str(N) + '/0', 'decision': [3, 6, False, 10, True]})
check('fixture 2', solve('/requests/' + str(N) + '/1', 3, 3, 10, True, False, True), {'request': '/requests/' + str(N) + '/1', 'decision': [3, 10, False, 10, False]})
check('fixture 3', solve('/requests/' + str(N) + '/2', 5, 3, 10, False, True, True), {'request': '/requests/' + str(N) + '/2', 'decision': [3, 8, True, 10, False]})
check('fixture 4', solve('/requests/' + str(N) + '/3', 3, 3, 10, False, False, True), {'request': '/requests/' + str(N) + '/3', 'decision': [3, 10, False, 10, False]})
check('fixture 5', solve('/requests/' + str(N) + '/4', 5, 3, 10, False, True, False), {'request': '/requests/' + str(N) + '/4', 'decision': [5, 8, False, 0, False]})
check('fixture 6', solve('/requests/' + str(N) + '/5', 5, 3, 10, True, True, False), {'request': '/requests/' + str(N) + '/5', 'decision': [5, 8, False, 0, False]})
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
fixture 1{'decision': [3, 6, False, 10, True], 'request': '/requests/1/0'}{'decision': [3, 6, False, 10, True], 'request': '/requests/1/0'}Passed
fixture 2{'decision': [3, 10, False, 10, False], 'request': '/requests/1/1'}{'decision': [3, 10, False, 10, False], 'request': '/requests/1/1'}Passed
fixture 3{'decision': [3, 8, True, 10, False], 'request': '/requests/1/2'}{'decision': [3, 8, True, 10, False], 'request': '/requests/1/2'}Passed
fixture 4{'decision': [3, 10, False, 10, False], 'request': '/requests/1/3'}{'decision': [3, 10, False, 10, False], 'request': '/requests/1/3'}Passed
fixture 5{'decision': [5, 8, False, 10, False], 'request': '/requests/1/4'}{'decision': [5, 8, False, 0, False], 'request': '/requests/1/4'}Failed
fixture 6{'decision': [5, 8, False, 10, False], 'request': '/requests/1/5'}{'decision': [5, 8, False, 0, False], 'request': '/requests/1/5'}Failed

SHA-256 / 679b1418ed8c2d074a6b0b7eeb43e78f1cfa12b33abc6667c1db3cfebd100a41

2 / The unsuccessful fix

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json
from urllib.parse import urlsplit, unquote, quote
import posixpath
import re
N = 1
observations = []
def solve(request, cursor, start, length, seekable, consumed, preserved):
    return {'request': request, 'decision': [start if preserved else cursor, max(0, length - (cursor-start)), preserved and consumed and not seekable, 0, preserved and seekable and cursor != start]} 
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve('/requests/' + str(N) + '/0', 7, 3, 10, True, True, True), {'request': '/requests/' + str(N) + '/0', 'decision': [3, 6, False, 10, True]})
check('fixture 2', solve('/requests/' + str(N) + '/1', 3, 3, 10, True, False, True), {'request': '/requests/' + str(N) + '/1', 'decision': [3, 10, False, 10, False]})
check('fixture 3', solve('/requests/' + str(N) + '/2', 5, 3, 10, False, True, True), {'request': '/requests/' + str(N) + '/2', 'decision': [3, 8, True, 10, False]})
check('fixture 4', solve('/requests/' + str(N) + '/3', 3, 3, 10, False, False, True), {'request': '/requests/' + str(N) + '/3', 'decision': [3, 10, False, 10, False]})
check('fixture 5', solve('/requests/' + str(N) + '/4', 5, 3, 10, False, True, False), {'request': '/requests/' + str(N) + '/4', 'decision': [5, 8, False, 0, False]})
check('fixture 6', solve('/requests/' + str(N) + '/5', 5, 3, 10, True, True, False), {'request': '/requests/' + str(N) + '/5', 'decision': [5, 8, False, 0, False]})
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
fixture 1{'decision': [3, 6, False, 0, True], 'request': '/requests/1/0'}{'decision': [3, 6, False, 10, True], 'request': '/requests/1/0'}Failed
fixture 2{'decision': [3, 10, False, 0, False], 'request': '/requests/1/1'}{'decision': [3, 10, False, 10, False], 'request': '/requests/1/1'}Failed
fixture 3{'decision': [3, 8, True, 0, False], 'request': '/requests/1/2'}{'decision': [3, 8, True, 10, False], 'request': '/requests/1/2'}Failed
fixture 4{'decision': [3, 10, False, 0, False], 'request': '/requests/1/3'}{'decision': [3, 10, False, 10, False], 'request': '/requests/1/3'}Failed
fixture 5{'decision': [5, 8, False, 0, False], 'request': '/requests/1/4'}{'decision': [5, 8, False, 0, False], 'request': '/requests/1/4'}Passed
fixture 6{'decision': [5, 8, False, 0, False], 'request': '/requests/1/5'}{'decision': [5, 8, False, 0, False], 'request': '/requests/1/5'}Passed

SHA-256 / 3637ae63d157fdd7639e0fa87e941ee2efb02324e8a843ee66c8b97c7c1ac238

HELD IN THE MEMBER ARCHIVE

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

This mechanism has 6 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

Stipulated offline redirect policy, not a complete HTTP, browser, URL, cache, or security implementation. Numbered variants vary request correlation identity. 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:29.704735+00:00.

Case digest / 01fe80ade365daf8098dc40b9a156b1673416ea5d564388e4e8c426c42c1b4e3