Fast general-purpose in-memory LZ77 compression algorithm. Achieves 480-600 MB/s compression and 2800-3800 MB/s decompression with better ratios than LZ4. Educational implementation of the hash-table-based approach.
| Property | Value |
|---|---|
| Category | Compression Algorithms |
| Sub-category | Dictionary-based (LZ77) |
| Security status | 🎓 Educational Only |
| Complexity | Intermediate |
| Inventor | Aleksey Vaneev |
| Year | 2023 |
| Origin | 🇷🇺 Russia |
| Source | algorithms/compression/lzav.js |
Status: 🎓 Educational Only
No vulnerabilities are recorded for this implementation.
5 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Empty input
| Field | Value |
|---|---|
input |
(empty) |
expected |
00000000 |
Vector 2 — Single byte 0x41
| Field | Value |
|---|---|
input |
41 |
expected |
01000000360141 |
Vector 3 — Simple repetition - AAAA (too short for mref=6 match)
| Field | Value |
|---|---|
input |
41414141 |
expected |
(empty) |
Vector 4 — Pattern repetition - ABCABC (too short for mref=6 match)
| Field | Value |
|---|---|
input |
414243414243 |
expected |
(empty) |
Vector 5 — Real text - Hello World! (no match, too short)
| Field | Value |
|---|---|
input |
48656c6c6f20576f726c6421 |
expected |
(empty) |