Re^10: Faster Luhn Check Digit Calculation?

Algorithm::LUHN supports some odd inputs

That module may attempt to extend the purpose and use of the algorithm to inputs for which it was never designed; but in doing so, it invalidates itself and the algorithm.

Ie. The purpose of the algorithm is to catch 2 digit transposition errors in numeric identifiers; trying to extend that mathematics to non-numerics invalidates that purpose.

Eg. The use of Mod 9, on alpha data that has a 26 character alphabet means that some (34% of) combinations of 2-digits transpositions will not be detected.

Rules to live by:Don't perpetuate other people's bullshit.

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". The enemy of (IT) success is complexity.

In the absence of evidence, opinion is indistinguishable from prejudice. Suck that fhit

Comment on Re^10: Faster Luhn Check Digit Calculation?

Replies are listed 'Best First'.
Re^11: Faster Luhn Check Digit Calculation? by kschwab (Vicar) on Dec 02, 2018 at 23:02 UTC
The module docs read like Standard & Poor's decided to do that, not the original module author, but I digress.	[reply]