{"abstract":"The exact polynomial composition result violates the stated contract at horner traversal.","category":"Numerics","checks":8,"contract":"Input [A,B] nonempty ascending integer polynomials; return canonical ascending coefficients A(B(t)), zero represented [0].","contract_signature":"x","evaluation_group":"s3-numerics-polynomial-composition","failed_approach":"The partial repair reversed(A[1:]) still violates the horner traversal invariant.","family":"s3-numerics-polynomial-composition-horner-traversal","id":"FA-14621","implementations":{"attempt":{"sha256":"2586dff5a44080066a566267ca76300cfa4679a138a1828dbda24ee70d1191f6","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nimport itertools\nfrom fractions import Fraction\nN = 1\nobservations = []\ndef solve(x):\n    A,B=x\n    r=[0]\n    for a in reversed(A[1:]):\n     t=[0]*(len(r)+len(B)-1)\n     for i,u in enumerate(r):\n      for j,v in enumerate(B):\n       if i+j>=len(t):return None\n       t[i+j]+=u*v\n     t[0]+=a\n     r=t\n    while len(r)>1 and r[-1]==0:r.pop()\n    return r\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[([[-1, -1, 0], [-1, -1]], [0, 1]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, -1, -1], [-1, 0]], [-1]), ([[-1, -1, -1], [-1, 1]], [-1, 1, -1]), ([[-1, -1, -1], [0, -1]], [-1, 1, -1]), ([[-1, -1, -1], [0, 0]], [-1]), ([[-1, -1, -1], [0, 1]], [-1, -1, -1])], [([[-1, -1, 0], [-1, 1]], [0, -1]), ([[-1, -1, -1], [0, -1]], [-1, 1, -1]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, -1, 0], [1, 1]], [-2, -1]), ([[-1, -1, 1], [-1, -1]], [1, 3, 1]), ([[-1, -1, 1], [-1, 0]], [1]), ([[-1, -1, 1], [-1, 1]], [1, -3, 1])], [([[-1, -1, 0], [0, -1]], [-1, 1]), ([[-1, -1, -1], [1, 0]], [-3]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, 0, -1], [1, 0]], [-2]), ([[-1, 0, -1], [1, 1]], [-2, -2, -1]), ([[-1, 0, 0], [-1, -1]], [-1]), ([[-1, 0, 0], [-1, 0]], [-1])], [([[-1, -1, 0], [0, 0]], [-1]), ([[-1, -1, 0], [-1, 0]], [0]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, 0, 1], [1, -1]], [0, -2, 1]), ([[-1, 0, 1], [1, 0]], [0]), ([[-1, 0, 1], [1, 1]], [0, 2, 1]), ([[-1, 1, -1], [-1, -1]], [-3, -3, -1])], [([[-1, -1, 0], [0, 1]], [-1, -1]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, 1, 0], [0, 1]], [-1, 1]), ([[-1, 1, 0], [1, -1]], [0, -1]), ([[-1, 1, 0], [1, 0]], [0]), ([[-1, 1, 0], [1, 1]], [0, 1]), ([[-1, 1, 1], [-1, -1]], [-1, 1, 1])]]\nfor i, (args, expected) in enumerate(fixtures[N-1]):\n    check(\"explicit oracle %d\" % i, solve(args), expected)\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":"8a2e62d06755c39407e8fdfa2c7e51f3e4439d47bcb4e2fa8d0dfa51fe6c979b","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nimport itertools\nfrom fractions import Fraction\nN = 1\nobservations = []\ndef solve(x):\n    A,B=x\n    r=[0]\n    for a in A:\n     t=[0]*(len(r)+len(B)-1)\n     for i,u in enumerate(r):\n      for j,v in enumerate(B):\n       if i+j>=len(t):return None\n       t[i+j]+=u*v\n     t[0]+=a\n     r=t\n    while len(r)>1 and r[-1]==0:r.pop()\n    return r\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[([[-1, -1, 0], [-1, -1]], [0, 1]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, -1, -1], [-1, 0]], [-1]), ([[-1, -1, -1], [-1, 1]], [-1, 1, -1]), ([[-1, -1, -1], [0, -1]], [-1, 1, -1]), ([[-1, -1, -1], [0, 0]], [-1]), ([[-1, -1, -1], [0, 1]], [-1, -1, -1])], [([[-1, -1, 0], [-1, 1]], [0, -1]), ([[-1, -1, -1], [0, -1]], [-1, 1, -1]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, -1, 0], [1, 1]], [-2, -1]), ([[-1, -1, 1], [-1, -1]], [1, 3, 1]), ([[-1, -1, 1], [-1, 0]], [1]), ([[-1, -1, 1], [-1, 1]], [1, -3, 1])], [([[-1, -1, 0], [0, -1]], [-1, 1]), ([[-1, -1, -1], [1, 0]], [-3]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, 0, -1], [1, 0]], [-2]), ([[-1, 0, -1], [1, 1]], [-2, -2, -1]), ([[-1, 0, 0], [-1, -1]], [-1]), ([[-1, 0, 0], [-1, 0]], [-1])], [([[-1, -1, 0], [0, 0]], [-1]), ([[-1, -1, 0], [-1, 0]], [0]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, 0, 1], [1, -1]], [0, -2, 1]), ([[-1, 0, 1], [1, 0]], [0]), ([[-1, 0, 1], [1, 1]], [0, 2, 1]), ([[-1, 1, -1], [-1, -1]], [-3, -3, -1])], [([[-1, -1, 0], [0, 1]], [-1, -1]), ([[-1, -1, -1], [-1, -1]], [-1, -1, -1]), ([[0, 0], [1, 1]], [0]), ([[-1, 1, 0], [0, 1]], [-1, 1]), ([[-1, 1, 0], [1, -1]], [0, -1]), ([[-1, 1, 0], [1, 0]], [0]), ([[-1, 1, 0], [1, 1]], [0, 1]), ([[-1, 1, 1], [-1, -1]], [-1, 1, 1])]]\nfor i, (args, expected) in enumerate(fixtures[N-1]):\n    check(\"explicit oracle %d\" % i, solve(args), expected)\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":"A deterministic bounded teaching model. Inputs are restricted to the explicit contract; this is not a production algebra library. 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":"s3-numerics-polynomial-composition-horner-traversal","generated_at":"2026-09-29T14:39:18.576826+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Exact discrete arithmetic with observable algorithmic state; no floating point approximation is used.","root_cause":"The horner traversal step uses A instead of reversed(A).","sha256":"16943a6e284f6eacafd7295ae4ea088e16675bf2c10241d472e580bea84374e5","title":"Polynomial composition: horner traversal · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":42.897,"exit_code":1,"observations":[{"actual":[-1],"check":"explicit oracle 0","expected":[0,1],"passed":false},{"actual":[0,1],"check":"explicit oracle 1","expected":[-1,-1,-1],"passed":false},{"actual":[0],"check":"explicit oracle 2","expected":[0],"passed":true},{"actual":[0],"check":"explicit oracle 3","expected":[-1],"passed":false},{"actual":[0,-1],"check":"explicit oracle 4","expected":[-1,1,-1],"passed":false},{"actual":[-1,1],"check":"explicit oracle 5","expected":[-1,1,-1],"passed":false},{"actual":[-1],"check":"explicit oracle 6","expected":[-1],"passed":true},{"actual":[-1,-1],"check":"explicit oracle 7","expected":[-1,-1,-1],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"explicit oracle 0\", \"actual\": [-1], \"expected\": [0, 1], \"passed\": false}, {\"check\": \"explicit oracle 1\", \"actual\": [0, 1], \"expected\": [-1, -1, -1], \"passed\": false}, {\"check\": \"explicit oracle 2\", \"actual\": [0], \"expected\": [0], \"passed\": true}, {\"check\": \"explicit oracle 3\", \"actual\": [0], \"expected\": [-1], \"passed\": false}, {\"check\": \"explicit oracle 4\", \"actual\": [0, -1], \"expected\": [-1, 1, -1], \"passed\": false}, {\"check\": \"explicit oracle 5\", \"actual\": [-1, 1], \"expected\": [-1, 1, -1], \"passed\": false}, {\"check\": \"explicit oracle 6\", \"actual\": [-1], \"expected\": [-1], \"passed\": true}, {\"check\": \"explicit oracle 7\", \"actual\": [-1, -1], \"expected\": [-1, -1, -1], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":43.966,"exit_code":1,"observations":[{"actual":[0,-1,-1],"check":"explicit oracle 0","expected":[0,1],"passed":false},{"actual":[-1,-1,-1],"check":"explicit oracle 1","expected":[-1,-1,-1],"passed":true},{"actual":[0],"check":"explicit oracle 2","expected":[0],"passed":true},{"actual":[-1],"check":"explicit oracle 3","expected":[-1],"passed":true},{"actual":[-1,1,-1],"check":"explicit oracle 4","expected":[-1,1,-1],"passed":true},{"actual":[-1,1,-1],"check":"explicit oracle 5","expected":[-1,1,-1],"passed":true},{"actual":[-1],"check":"explicit oracle 6","expected":[-1],"passed":true},{"actual":[-1,-1,-1],"check":"explicit oracle 7","expected":[-1,-1,-1],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"explicit oracle 0\", \"actual\": [0, -1, -1], \"expected\": [0, 1], \"passed\": false}, {\"check\": \"explicit oracle 1\", \"actual\": [-1, -1, -1], \"expected\": [-1, -1, -1], \"passed\": true}, {\"check\": \"explicit oracle 2\", \"actual\": [0], \"expected\": [0], \"passed\": true}, {\"check\": \"explicit oracle 3\", \"actual\": [-1], \"expected\": [-1], \"passed\": true}, {\"check\": \"explicit oracle 4\", \"actual\": [-1, 1, -1], \"expected\": [-1, 1, -1], \"passed\": true}, {\"check\": \"explicit oracle 5\", \"actual\": [-1, 1, -1], \"expected\": [-1, 1, -1], \"passed\": true}, {\"check\": \"explicit oracle 6\", \"actual\": [-1], \"expected\": [-1], \"passed\": true}, {\"check\": \"explicit oracle 7\", \"actual\": [-1, -1, -1], \"expected\": [-1, -1, -1], \"passed\": true}], \"passed\": false}\n"}},"member_only":{"stages":["fixed"],"fields":["implementations.fixed","verification.fixed","harness","repair"],"note":"The verified repair, its recorded checks, the repair description, and the scoring harness are available to members."}}