{"abstract":"The conflict resolution operation is admitted even though replicas execute different resolver versions.","category":"Replication","checks":9,"contract":"Return a Boolean admission decision for admit a conflict resolution result. The record r must satisfy all of: set(r['parent_coverage'][0]) <= set(r['parent_coverage'][1]); all(a >= b for a,b in zip(r['clock_dominance'][0],r['clock_dominance'][1])); len(set(r['resolver_version'])) == 1; tuple(r['new_dot'][0]) not in [tuple(x) for x in r['new_dot'][1]]; r['result_domain'] >= 0. Extra tracing fields are ignored; validation does not mutate the record.","evaluation_group":"xd-conflict-resolution","failed_approach":"Adding the resolver version check repairs the reported defect, but replacing the adjacent new dot check loses that independent invariant.","family":"xd-conflict-resolution-resolver_version","id":"FA-636","implementations":{"attempt":{"sha256":"faf42feaa97be464b98dc78a6d6d4536f44e04d01f8f179ca3d424f9e7cad7fd","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (set(r['parent_coverage'][0]) <= set(r['parent_coverage'][1])) and (all(a >= b for a,b in zip(r['clock_dominance'][0],r['clock_dominance'][1]))) and (len(set(r['resolver_version'])) == 1) and (r['result_domain'] >= 0)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'parent_coverage': [['a', 'b'], ['a', 'b', 'c']], 'clock_dominance': [[3, 4], [2, 4]], 'resolver_version': [3, 3, 3], 'new_dot': [['a', 4], [['a', 3]]], 'result_domain': 0}\ncheck('valid operation', solve(r), True)\ncheck('The resolution omits a known conflicting parent', solve(dict(r, **{'parent_coverage': [['a', 'b'], ['a']]})), False)\ncheck('The resolved clock regresses a parent component', solve(dict(r, **{'clock_dominance': [[3, 3], [2, 4]]})), False)\ncheck('Replicas execute different resolver versions', solve(dict(r, **{'resolver_version': [3, 2, 3]})), False)\ncheck('Resolution reuses an existing causal operation dot', solve(dict(r, **{'new_dot': [['a', 3], [['a', 3]]]})), False)\ncheck('A merge result violates the application value constraint', solve(dict(r, **{'result_domain': -1})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'parent_coverage': [['a', 'b'], ['a']], 'clock_dominance': [[3, 3], [2, 4]], 'resolver_version': [3, 2, 3], 'new_dot': [['a', 3], [['a', 3]]], 'result_domain': -1}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), False)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"e3ebf3c0aee9d55a8c1dc4e12382caa8aaededc2d85c6f698a73d6b6fb1869e7","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (set(r['parent_coverage'][0]) <= set(r['parent_coverage'][1])) and (all(a >= b for a,b in zip(r['clock_dominance'][0],r['clock_dominance'][1]))) and (tuple(r['new_dot'][0]) not in [tuple(x) for x in r['new_dot'][1]]) and (r['result_domain'] >= 0)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'parent_coverage': [['a', 'b'], ['a', 'b', 'c']], 'clock_dominance': [[3, 4], [2, 4]], 'resolver_version': [3, 3, 3], 'new_dot': [['a', 4], [['a', 3]]], 'result_domain': 0}\ncheck('valid operation', solve(r), True)\ncheck('The resolution omits a known conflicting parent', solve(dict(r, **{'parent_coverage': [['a', 'b'], ['a']]})), False)\ncheck('The resolved clock regresses a parent component', solve(dict(r, **{'clock_dominance': [[3, 3], [2, 4]]})), False)\ncheck('Replicas execute different resolver versions', solve(dict(r, **{'resolver_version': [3, 2, 3]})), False)\ncheck('Resolution reuses an existing causal operation dot', solve(dict(r, **{'new_dot': [['a', 3], [['a', 3]]]})), False)\ncheck('A merge result violates the application value constraint', solve(dict(r, **{'result_domain': -1})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'parent_coverage': [['a', 'b'], ['a']], 'clock_dominance': [[3, 3], [2, 4]], 'resolver_version': [3, 2, 3], 'new_dot': [['a', 3], [['a', 3]]], 'result_domain': -1}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), False)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"fixed":{"sha256":"fd9bde29ab767e645725d066a6025b043cf80350f0ad83f5559ff1b1b200a994","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (set(r['parent_coverage'][0]) <= set(r['parent_coverage'][1])) and (all(a >= b for a,b in zip(r['clock_dominance'][0],r['clock_dominance'][1]))) and (len(set(r['resolver_version'])) == 1) and (tuple(r['new_dot'][0]) not in [tuple(x) for x in r['new_dot'][1]]) and (r['result_domain'] >= 0)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'parent_coverage': [['a', 'b'], ['a', 'b', 'c']], 'clock_dominance': [[3, 4], [2, 4]], 'resolver_version': [3, 3, 3], 'new_dot': [['a', 4], [['a', 3]]], 'result_domain': 0}\ncheck('valid operation', solve(r), True)\ncheck('The resolution omits a known conflicting parent', solve(dict(r, **{'parent_coverage': [['a', 'b'], ['a']]})), False)\ncheck('The resolved clock regresses a parent component', solve(dict(r, **{'clock_dominance': [[3, 3], [2, 4]]})), False)\ncheck('Replicas execute different resolver versions', solve(dict(r, **{'resolver_version': [3, 2, 3]})), False)\ncheck('Resolution reuses an existing causal operation dot', solve(dict(r, **{'new_dot': [['a', 3], [['a', 3]]]})), False)\ncheck('A merge result violates the application value constraint', solve(dict(r, **{'result_domain': -1})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'parent_coverage': [['a', 'b'], ['a']], 'clock_dominance': [[3, 3], [2, 4]], 'resolver_version': [3, 2, 3], 'new_dot': [['a', 3], [['a', 3]]], 'result_domain': -1}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), False)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":" 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.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"xd-conflict-resolution-resolver_version","generated_at":"2026-09-29T14:36:54.850098+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A deterministic local contract for replication. Each negative fixture violates exactly one invariant. No transport timing, persistence, cryptographic verification, or full protocol implementation is claimed.","repair":"Require len(set(r['resolver_version'])) == 1 together with every other stated precondition before accepting the operation.","root_cause":"The admission path omits the resolver version invariant while validating the other operation preconditions.","sha256":"6fc521d383cc9807f282ad758a40be20a0c11e5a576f5a0028bc9bdf5dad3f92","title":"Admit a conflict resolution result: Replicas execute different resolver versions · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":34.705,"exit_code":1,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"The resolution omits a known conflicting parent","expected":false,"passed":true},{"actual":false,"check":"The resolved clock regresses a parent component","expected":false,"passed":true},{"actual":false,"check":"Replicas execute different resolver versions","expected":false,"passed":true},{"actual":true,"check":"Resolution reuses an existing causal operation dot","expected":false,"passed":false},{"actual":false,"check":"A merge result violates the application value constraint","expected":false,"passed":true},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"The resolution omits a known conflicting parent\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"The resolved clock regresses a parent component\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Replicas execute different resolver versions\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Resolution reuses an existing causal operation dot\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"A merge result violates the application value constraint\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":33.651,"exit_code":1,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"The resolution omits a known conflicting parent","expected":false,"passed":true},{"actual":false,"check":"The resolved clock regresses a parent component","expected":false,"passed":true},{"actual":true,"check":"Replicas execute different resolver versions","expected":false,"passed":false},{"actual":false,"check":"Resolution reuses an existing causal operation dot","expected":false,"passed":true},{"actual":false,"check":"A merge result violates the application value constraint","expected":false,"passed":true},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"The resolution omits a known conflicting parent\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"The resolved clock regresses a parent component\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Replicas execute different resolver versions\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"Resolution reuses an existing causal operation dot\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A merge result violates the application value constraint\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":37.699,"exit_code":0,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"The resolution omits a known conflicting parent","expected":false,"passed":true},{"actual":false,"check":"The resolved clock regresses a parent component","expected":false,"passed":true},{"actual":false,"check":"Replicas execute different resolver versions","expected":false,"passed":true},{"actual":false,"check":"Resolution reuses an existing causal operation dot","expected":false,"passed":true},{"actual":false,"check":"A merge result violates the application value constraint","expected":false,"passed":true},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"The resolution omits a known conflicting parent\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"The resolved clock regresses a parent component\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Replicas execute different resolver versions\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Resolution reuses an existing causal operation dot\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"A merge result violates the application value constraint\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}