About Luhn Checksum
The Luhn mod N algorithm using the english alphabet. The Luhn mod N algorithm is an extension to the Luhn algorithm (also known as mod 10 algorithm) that allows it to work with sequences of values in any even-numbered base. This can be useful when a check digit is required to validate an identification string composed of letters, a combination of letters and digits or any arbitrary set of N characters where N is divisible by 2.
Input: text. Output: text.
Format reference: Luhn Checksum background and specification
Example
Use “Try example” to load this public sample and its settings, then run it.
Settings used in this example
| Parameter | Example value | Input and choices |
|---|---|---|
| Radix | 2 | Number |
Input
01
Result
Checksum: 1 Checkdigit: 1 Luhn Validated String: 011
Parameters
| Parameter | Default value | Input and choices |
|---|---|---|
| Radix | 10 | Number |
Before interpreting the result
Use a checksum to compare exact bytes against a trusted digest. Choose a password hashing function for passwords and a MAC for keyed authentication. MD5 and SHA-1 are unsuitable for new security-sensitive designs.
How to use this page
- Paste your input or open a local file.
- Adjust tool options if needed, then choose Run tool.
- Copy the result or download the original output bytes.
Inputs and results are not added to the public catalogue or saved in the URL. Processing happens in your browser; HTTP Request and DNS over HTTPS send the requests you explicitly run. Files up to 128 MiB can be opened; decompression and image tools may have smaller processing limits. Large results have a shortened preview. Text and HTML downloads use UTF-8; binary downloads preserve output bytes. Pasted text follows browser newline handling; open a file when exact input bytes matter.