FA-72567 / Check-digit algorithms / Member archive

MOD 11,10 keeps a zero intermediate sum · case 02

Payloads whose running sum hits a multiple of ten get the wrong check digit.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

ISO 7064 MOD 11,10 hybrid check digit generation for a nonempty ASCII digit payload (else None). Start with p = 10; for each digit p = ((p + d) mod 10, with 0 replaced by 10) * 2 mod 11; the check digit is (11 - p) mod 10.

Why this case matters

Tax and personal identification numbers (for example OIB-style identifiers) use the hybrid MOD 11,10 system.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
regression ["6279939841"]	`4`	`2`	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.