FA-7641 / WebSocket and browser transport policies / Open access
Sse empty id clears the reconnection event identifier · case 01
Sse empty id clears the reconnection event identifier.
ROOT CAUSE
The faulty implementation uses `value if present else old` for the sse-empty-id-clears-the-reconnection-event-identifier decision.
VERIFIED REPAIR
Apply the explicit sse-empty-id-clears-the-reconnection-event-identifier contract, including the tested boundary and negative cases.
Unsuccessful approach: The attempted repair uses `value if present and value and "\x00" not in value else old` and still violates a separate fixture.
Case contract
Given old, present, value, sse empty id clears the reconnection event identifier. Return the protocol decision or transformed value; fields are validated and fixtures state boundary outcomes.
Why this case matters
This deterministic websocket and browser transport policies model isolates the sse-empty-id-clears-the-reconnection-event-identifier policy at a network component boundary.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
import ipaddress
import re
from urllib.parse import urlsplit, urljoin
N = 1
observations = []
def solve(old, present, value):
return value if present else old
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
_fixtures = ["check('fixture 1', solve('a', True, ''), '')", "check('fixture 2', solve('a', True, 'b\\x00c'), 'a')", "check('fixture 3', solve('a', False, 'b'), 'a')", "check('fixture 4', solve('a', True, 'b'), 'b')"]
for _line in _fixtures[N % len(_fixtures):] + _fixtures[:N % len(_fixtures)]:
exec(_line)
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 |
|---|---|---|---|
| fixture 2 | b c | a | Failed |
| fixture 3 | a | a | Passed |
| fixture 4 | b | b | Passed |
| fixture 1 | | | Passed |
SHA-256 / 41768343e8304eb94862c10c270549a24598a434f11501db371d73ccfb01c24c
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
import ipaddress
import re
from urllib.parse import urlsplit, urljoin
N = 1
observations = []
def solve(old, present, value):
return value if present and value and "\x00" not in value else old
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
_fixtures = ["check('fixture 1', solve('a', True, ''), '')", "check('fixture 2', solve('a', True, 'b\\x00c'), 'a')", "check('fixture 3', solve('a', False, 'b'), 'a')", "check('fixture 4', solve('a', True, 'b'), 'b')"]
for _line in _fixtures[N % len(_fixtures):] + _fixtures[:N % len(_fixtures)]:
exec(_line)
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 |
|---|---|---|---|
| fixture 2 | a | a | Passed |
| fixture 3 | a | a | Passed |
| fixture 4 | b | b | Passed |
| fixture 1 | a | | Failed |
SHA-256 / 97692157a861aa7d25e559d97c005d8a04a3ff2f937f38fd00be25572406a768
3 / The verified repair
Exit 0"""Failure Map reference implementation. Python standard library only."""
import json
import ipaddress
import re
from urllib.parse import urlsplit, urljoin
N = 1
observations = []
def solve(old, present, value):
return value if present and "\x00" not in value else old
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
_fixtures = ["check('fixture 1', solve('a', True, ''), '')", "check('fixture 2', solve('a', True, 'b\\x00c'), 'a')", "check('fixture 3', solve('a', False, 'b'), 'a')", "check('fixture 4', solve('a', True, 'b'), 'b')"]
for _line in _fixtures[N % len(_fixtures):] + _fixtures[:N % len(_fixtures)]:
exec(_line)
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 |
|---|---|---|---|
| fixture 2 | a | a | Passed |
| fixture 3 | a | a | Passed |
| fixture 4 | b | b | Passed |
| fixture 1 | | | Passed |
SHA-256 / 1f45cffcb6e9b2b15d6daa1d649da08dcf11d73a129c1a5a4f8a774249bd0cb8
Verification & scope
Bounded deterministic policy model over validated inputs; not a complete protocol stack or an interoperability claim. The five variants rotate the same explicit fixture set. 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:38:13.936837+00:00.
Case digest / 388daf4e59013b571420d209bd2c1e699b9ced73023a93b2c37bba6f3538a268