Fletcher-64 checksum for large datasets and high-performance applications Uses two 32-bit running sums with modulo 4294967295 for enhanced error detection.
| Property | Value |
|---|---|
| Category | Checksums |
| Sub-category | Simple Checksum |
| Security status | 🎓 Educational Only |
| Complexity | Intermediate |
| Inventor | John G. Fletcher |
| Year | 1982 |
| Origin | 🇺🇸 United States |
| Source | algorithms/checksum/fletcher.js |
Status: 🎓 Educational Only
| Issue | Description | Mitigation |
|---|---|---|
| Not Cryptographically Secure | Use cryptographic hash functions (SHA-256, SHA-3) for security purposes | — |
| Collision Vulnerability | Use for error detection only, not for data integrity in security contexts | — |
4 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Empty string
Source: Educational test vector
| Field | Value |
|---|---|
input |
(empty) |
expected |
0000000000000000 |
Vector 2 — String ‘abcde’ - published test vector, last 32-bit word zero-padded
| Field | Value |
|---|---|
input |
6162636465 |
expected |
c8c6c527646362c6 |
Vector 3 — String ‘abcdef’ - published test vector
| Field | Value |
|---|---|
input |
616263646566 |
expected |
c8c72b276463c8c6 |
Vector 4 — String ‘abcdefgh’ - published test vector, exact multiple of the 32-bit word
| Field | Value |
|---|---|
input |
6162636465666768 |
expected |
312e2b28cccac8c6 |