{"abstract":"The exact binary field inversion result violates the stated contract at first polynomial Bezout seed.","category":"Numerics","checks":8,"contract":"Input [a,irreducible bitmask], a nonzero with degree below modulus; return multiplicative inverse in binary field. Bounds: modulus degree is between two and six.","evaluation_group":"s3-numerics-binary-field-inversion","failed_approach":"The partial repair a still violates the first polynomial Bezout seed invariant.","family":"s3-numerics-binary-field-inversion-first-polynomial-Bezout-seed","id":"FA-15641","implementations":{"attempt":{"sha256":"0355242c2438809df9ddd9f33d0b92ac58edbfee494466489c3e08d0178aa6b0","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,p=x;u=a;v=p;g1=a;g2=0\n    for _ in range(60):\n     if u==1:break\n     if u==0:return None\n     j=u.bit_length()-v.bit_length()\n     if j<0:\n      u,v=v,u;g1,g2=g2,g1;j=-j\n     u=u^(v<<j)\n     g1=g1^(g2<<j)\n    for _ in range(60):\n     if g1.bit_length()<p.bit_length():break\n     g1=g1^(p<<(g1.bit_length()-p.bit_length()))\n    return g1\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[([1, 7], 1), ([2, 7], 3), ([63, 67], 32), ([3, 7], 2), ([1, 11], 1), ([2, 11], 5), ([3, 11], 6), ([4, 11], 7)], [([2, 7], 3), ([3, 11], 6), ([1, 7], 1), ([63, 67], 32), ([8, 19], 15), ([9, 19], 2), ([10, 19], 12), ([11, 19], 5)], [([3, 7], 2), ([6, 11], 3), ([1, 7], 1), ([63, 67], 32), ([10, 25], 11), ([11, 25], 10), ([12, 25], 2), ([13, 25], 9)], [([1, 11], 1), ([3, 19], 14), ([1, 7], 1), ([63, 67], 32), ([12, 31], 13), ([13, 31], 12), ([14, 31], 11), ([15, 31], 2)], [([2, 11], 5), ([6, 19], 7), ([1, 7], 1), ([63, 67], 32), ([14, 37], 6), ([15, 37], 13), ([16, 37], 11), ([17, 37], 24)]]\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":"822b5e1b300c97bccc2eede326db0ff84288705e695bc352e1ddc0b747fbac20","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,p=x;u=a;v=p;g1=0;g2=0\n    for _ in range(60):\n     if u==1:break\n     if u==0:return None\n     j=u.bit_length()-v.bit_length()\n     if j<0:\n      u,v=v,u;g1,g2=g2,g1;j=-j\n     u=u^(v<<j)\n     g1=g1^(g2<<j)\n    for _ in range(60):\n     if g1.bit_length()<p.bit_length():break\n     g1=g1^(p<<(g1.bit_length()-p.bit_length()))\n    return g1\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[([1, 7], 1), ([2, 7], 3), ([63, 67], 32), ([3, 7], 2), ([1, 11], 1), ([2, 11], 5), ([3, 11], 6), ([4, 11], 7)], [([2, 7], 3), ([3, 11], 6), ([1, 7], 1), ([63, 67], 32), ([8, 19], 15), ([9, 19], 2), ([10, 19], 12), ([11, 19], 5)], [([3, 7], 2), ([6, 11], 3), ([1, 7], 1), ([63, 67], 32), ([10, 25], 11), ([11, 25], 10), ([12, 25], 2), ([13, 25], 9)], [([1, 11], 1), ([3, 19], 14), ([1, 7], 1), ([63, 67], 32), ([12, 31], 13), ([13, 31], 12), ([14, 31], 11), ([15, 31], 2)], [([2, 11], 5), ([6, 19], 7), ([1, 7], 1), ([63, 67], 32), ([14, 37], 6), ([15, 37], 13), ([16, 37], 11), ([17, 37], 24)]]\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"},"fixed":{"sha256":"60642d2df71ac511289e3f63e6ecf001cd7d7d4f2be4a8ef3493b1d170ae9c60","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,p=x;u=a;v=p;g1=1;g2=0\n    for _ in range(60):\n     if u==1:break\n     if u==0:return None\n     j=u.bit_length()-v.bit_length()\n     if j<0:\n      u,v=v,u;g1,g2=g2,g1;j=-j\n     u=u^(v<<j)\n     g1=g1^(g2<<j)\n    for _ in range(60):\n     if g1.bit_length()<p.bit_length():break\n     g1=g1^(p<<(g1.bit_length()-p.bit_length()))\n    return g1\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[([1, 7], 1), ([2, 7], 3), ([63, 67], 32), ([3, 7], 2), ([1, 11], 1), ([2, 11], 5), ([3, 11], 6), ([4, 11], 7)], [([2, 7], 3), ([3, 11], 6), ([1, 7], 1), ([63, 67], 32), ([8, 19], 15), ([9, 19], 2), ([10, 19], 12), ([11, 19], 5)], [([3, 7], 2), ([6, 11], 3), ([1, 7], 1), ([63, 67], 32), ([10, 25], 11), ([11, 25], 10), ([12, 25], 2), ([13, 25], 9)], [([1, 11], 1), ([3, 19], 14), ([1, 7], 1), ([63, 67], 32), ([12, 31], 13), ([13, 31], 12), ([14, 31], 11), ([15, 31], 2)], [([2, 11], 5), ([6, 19], 7), ([1, 7], 1), ([63, 67], 32), ([14, 37], 6), ([15, 37], 13), ([16, 37], 11), ([17, 37], 24)]]\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-binary-field-inversion-first-polynomial-Bezout-seed","generated_at":"2026-09-29T14:39:28.777482+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.","repair":"Use 1 at the first polynomial Bezout seed step.","root_cause":"The first polynomial Bezout seed step uses 0 instead of 1.","sha256":"55a116643c53e680d9ba184874380079c0f70dd545efd53ab58b04b5144d241d","title":"Binary field inversion: first polynomial Bezout seed · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":45.243,"exit_code":1,"observations":[{"actual":1,"check":"explicit oracle 0","expected":1,"passed":true},{"actual":1,"check":"explicit oracle 1","expected":3,"passed":false},{"actual":1,"check":"explicit oracle 2","expected":32,"passed":false},{"actual":1,"check":"explicit oracle 3","expected":2,"passed":false},{"actual":1,"check":"explicit oracle 4","expected":1,"passed":true},{"actual":1,"check":"explicit oracle 5","expected":5,"passed":false},{"actual":1,"check":"explicit oracle 6","expected":6,"passed":false},{"actual":1,"check":"explicit oracle 7","expected":7,"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"explicit oracle 0\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"explicit oracle 1\", \"actual\": 1, \"expected\": 3, \"passed\": false}, {\"check\": \"explicit oracle 2\", \"actual\": 1, \"expected\": 32, \"passed\": false}, {\"check\": \"explicit oracle 3\", \"actual\": 1, \"expected\": 2, \"passed\": false}, {\"check\": \"explicit oracle 4\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"explicit oracle 5\", \"actual\": 1, \"expected\": 5, \"passed\": false}, {\"check\": \"explicit oracle 6\", \"actual\": 1, \"expected\": 6, \"passed\": false}, {\"check\": \"explicit oracle 7\", \"actual\": 1, \"expected\": 7, \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":43.326,"exit_code":1,"observations":[{"actual":0,"check":"explicit oracle 0","expected":1,"passed":false},{"actual":0,"check":"explicit oracle 1","expected":3,"passed":false},{"actual":0,"check":"explicit oracle 2","expected":32,"passed":false},{"actual":0,"check":"explicit oracle 3","expected":2,"passed":false},{"actual":0,"check":"explicit oracle 4","expected":1,"passed":false},{"actual":0,"check":"explicit oracle 5","expected":5,"passed":false},{"actual":0,"check":"explicit oracle 6","expected":6,"passed":false},{"actual":0,"check":"explicit oracle 7","expected":7,"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"explicit oracle 0\", \"actual\": 0, \"expected\": 1, \"passed\": false}, {\"check\": \"explicit oracle 1\", \"actual\": 0, \"expected\": 3, \"passed\": false}, {\"check\": \"explicit oracle 2\", \"actual\": 0, \"expected\": 32, \"passed\": false}, {\"check\": \"explicit oracle 3\", \"actual\": 0, \"expected\": 2, \"passed\": false}, {\"check\": \"explicit oracle 4\", \"actual\": 0, \"expected\": 1, \"passed\": false}, {\"check\": \"explicit oracle 5\", \"actual\": 0, \"expected\": 5, \"passed\": false}, {\"check\": \"explicit oracle 6\", \"actual\": 0, \"expected\": 6, \"passed\": false}, {\"check\": \"explicit oracle 7\", \"actual\": 0, \"expected\": 7, \"passed\": false}], \"passed\": false}\n"},"fixed":{"elapsed_ms":40.935,"exit_code":0,"observations":[{"actual":1,"check":"explicit oracle 0","expected":1,"passed":true},{"actual":3,"check":"explicit oracle 1","expected":3,"passed":true},{"actual":32,"check":"explicit oracle 2","expected":32,"passed":true},{"actual":2,"check":"explicit oracle 3","expected":2,"passed":true},{"actual":1,"check":"explicit oracle 4","expected":1,"passed":true},{"actual":5,"check":"explicit oracle 5","expected":5,"passed":true},{"actual":6,"check":"explicit oracle 6","expected":6,"passed":true},{"actual":7,"check":"explicit oracle 7","expected":7,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"explicit oracle 0\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"explicit oracle 1\", \"actual\": 3, \"expected\": 3, \"passed\": true}, {\"check\": \"explicit oracle 2\", \"actual\": 32, \"expected\": 32, \"passed\": true}, {\"check\": \"explicit oracle 3\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"explicit oracle 4\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"explicit oracle 5\", \"actual\": 5, \"expected\": 5, \"passed\": true}, {\"check\": \"explicit oracle 6\", \"actual\": 6, \"expected\": 6, \"passed\": true}, {\"check\": \"explicit oracle 7\", \"actual\": 7, \"expected\": 7, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}