FA-15607 / Numerics / Member archive
Gf2 field multiplication: irreducible polynomial reduction · case 02
The exact gf2 field multiplication result violates the stated contract at irreducible polynomial reduction.
Case contract
Input [a,b,irreducible polynomial bitmask], nonnegative field elements; return carryless product reduced by that monic polynomial.
Why this case matters
Exact discrete arithmetic with observable algorithmic state; no floating point approximation is used.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| explicit oracle 0 | -1 | 1 | Failed |
MEMBER ARCHIVE
The complete case is available to members.
This record includes three runnable implementations, regression fixtures, execution results, and source hashes.
Member access is invitation-based. Sign in with your invited account to inspect the sources.
Sign in to the archive ↗