Fast lossless compression algorithm designed for ZFS filesystem. Simple LZ77 variant with fixed 1024-byte sliding window and 3-byte minimum match. Optimized for speed over compression ratio.
| Property | Value |
|---|---|
| Category | Compression Algorithms |
| Sub-category | Dictionary-based |
| Security status | Not classified |
| Complexity | Intermediate |
| Inventor | Jeff Bonwick |
| Year | 2005 |
| Origin | 🇺🇸 United States |
| Source | algorithms/compression/lzjb.js |
Status: not classified — treat as unverified.
No vulnerabilities are recorded for this implementation.
6 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — All literals - no compression (ABCD)
| Field | Value |
|---|---|
input |
41424344 |
expected |
040000000041424344 |
Vector 2 — Simple repetition - AAAA (4 A’s)
| Field | Value |
|---|---|
input |
41414141 |
expected |
0400000002414000 |
Vector 3 — Pattern ABCABC (6 bytes with match)
| Field | Value |
|---|---|
input |
414243414243 |
expected |
0600000008414243c000 |
Vector 4 — Long repetition - AAAAAAAA (8 A’s)
| Field | Value |
|---|---|
input |
4141414141414141 |
expected |
0800000002414400 |
Vector 5 — Mixed pattern - Hello
| Field | Value |
|---|---|
input |
48656c6c6f |
expected |
050000000048656c6c6f |
Vector 6 — Repetitive data showing compression (ABABABABAB)
| Field | Value |
|---|---|
input |
41424142414241424142 |
expected |
0a0000000441428500 |