LZ77 parsing (hash-chain match finder, 32 KiB window, 3-258 byte matches) whose flag/literal/length/distance channels are entropy-coded with logistic-domain context mixing over a shared binary arithmetic coder. Ported to be byte-for-byte identical to CompressionWorkbench’s reduced BB_Csc reference block.
| Property | Value |
|---|---|
| Category | Compression Algorithms |
| Sub-category | LZ77 + Context Mixing |
| Security status | 🎓 Educational Only |
| Complexity | Expert |
| Inventor | Fu Siyuan (concept); reduced clean-room reimplementation |
| Year | 2012 |
| Origin | 🇨🇳 China |
| Source | algorithms/compression/csc.js |
Status: 🎓 Educational Only
No vulnerabilities are recorded for this implementation.
4 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Empty data test
| Field | Value |
|---|---|
input |
(empty) |
expected |
00000000 |
Vector 2 — Single byte test
| Field | Value |
|---|---|
input |
41 |
expected |
(empty) |
Vector 3 — Mixed alphanumeric data
| Field | Value |
|---|---|
input |
54686520717569636b2062726f776e20 666f78206a756d7073206f7665722074 6865206c617a7920646f67 |
expected |
(empty) |
Vector 4 — Repetitive text compression
| Field | Value |
|---|---|
input |
616263616263616263616263616263616263 |
expected |
(empty) |