Simple modulo-10 checksum for digit sequences. Sums all digits and returns remainder when divided by 10. Basic error detection for barcodes and identification numbers.
| Property | Value |
|---|---|
| Category | Checksums |
| Sub-category | Modular Arithmetic |
| Security status | 🎓 Educational Only |
| Complexity | Beginner |
| Inventor | Unknown (fundamental technique) |
| Year | 1960 |
| Origin | Not specified |
| Source | algorithms/checksum/modulo.js |
Status: 🎓 Educational Only
No vulnerabilities are recorded for this implementation.
3 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Simple digit sum
Source: Modulo-10 calculation
| Field | Value |
|---|---|
input |
313233 |
expected |
06 |
Vector 2 — Sum with overflow
Source: Modulo-10 with carry
| Field | Value |
|---|---|
input |
393837 |
expected |
04 |
Vector 3 — Long digit sequence
Source: Modulo-10 calculation
| Field | Value |
|---|---|
input |
31323334353637383930 |
expected |
05 |