FA-7121 / Network routing / Open access

Query route matches any repeated value · case 01

Query route matches any repeated value.

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

ROOT CAUSE

The faulty implementation uses `all(dict(query).get(key) == value for key,value in required.items())` for the query-route-matches-any-repeated-value decision.

VERIFIED REPAIR

Apply the explicit query-route-matches-any-repeated-value contract, including the tested boundary and negative cases.

Unsuccessful approach: The attempted repair uses `any(any(k == key and v == value for k,v in query) for key,value in required.items())` and still violates a separate fixture.

Case contract

Given query, required, query route matches any repeated value. Return the protocol decision or transformed value; fields are validated and fixtures state boundary outcomes.

Why this case matters

This deterministic network routing model isolates the query-route-matches-any-repeated-value 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(query, required):
    return all(dict(query).get(key) == value for key,value in required.items())
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
_fixtures = ["check('fixture 1', solve([('q', 'a'), ('q', 'b')], {'q': 'a'}), True)", "check('fixture 2', solve([('q', 'a')], {'q': 'a', 'page': '1'}), False)", "check('fixture 3', solve([], {}), True)", "check('fixture 4', solve([], {'q': 'a'}), False)"]
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	`False`	`False`	Passed
fixture 3	`True`	`True`	Passed
fixture 4	`False`	`False`	Passed
fixture 1	`False`	`True`	Failed

SHA-256 / 5879173cc7d09d0ec60caf9f7ed6586ae25dd4bc4433bc91d03a876c01322284

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(query, required):
    return any(any(k == key and v == value for k,v in query) for key,value in required.items())
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
_fixtures = ["check('fixture 1', solve([('q', 'a'), ('q', 'b')], {'q': 'a'}), True)", "check('fixture 2', solve([('q', 'a')], {'q': 'a', 'page': '1'}), False)", "check('fixture 3', solve([], {}), True)", "check('fixture 4', solve([], {'q': 'a'}), False)"]
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	`True`	`False`	Failed
fixture 3	`False`	`True`	Failed
fixture 4	`False`	`False`	Passed
fixture 1	`True`	`True`	Passed

SHA-256 / 327e4da4995334d7911462a630117cc61ae6a3df5faaf9e61c0e1f158e621748

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(query, required):
    return all(any(k == key and v == value for k,v in query) for key,value in required.items())
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
_fixtures = ["check('fixture 1', solve([('q', 'a'), ('q', 'b')], {'q': 'a'}), True)", "check('fixture 2', solve([('q', 'a')], {'q': 'a', 'page': '1'}), False)", "check('fixture 3', solve([], {}), True)", "check('fixture 4', solve([], {'q': 'a'}), False)"]
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	`False`	`False`	Passed
fixture 3	`True`	`True`	Passed
fixture 4	`False`	`False`	Passed
fixture 1	`True`	`True`	Passed

SHA-256 / 98b7a4b9bac4f64727e12a11e70c936048c27b53595c9dff032fd07b77e55c97

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:08.543699+00:00.

Case digest / 63de6a4dcbf7a03b0562c79c7f884b8e2fe04036af5a8b403479b41e83e567f8