FA-98645 / Model quantization arithmetic / Member archive

Quantization: Affine codes multiply by scale before rounding · case 05

Affine quantized codes are too large when scale exceeds one.

Member previewVariant 5 · 3 implementations · 6 checks per implementation

Case contract

Affine scalar values are divided by positive scale, shifted by zero point, then clipped inclusively to [lo,hi]; round-to-even is used. Inputs follow this explicit integer toy contract; ties use Python round-to-even where rounding is required.

Why this case matters

This deterministic model isolates one quantization arithmetic contract from tensor storage and runtime kernels.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
interior	`[7, -7]`	`[7, 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.