Burrows-Wheeler Transform, Move-to-Front recoding, and an LZMA-style adaptive bit-tree entropy stage (two trees selected by whether the previous rank was zero). Ported to be byte-for-byte identical to CompressionWorkbench’s reduced BB_Bsc reference block.
| Property | Value |
|---|---|
| Category | Compression Algorithms |
| Sub-category | BWT + Entropy Coding |
| Security status | 🎓 Educational Only |
| Complexity | Expert |
| Inventor | Ilya Grebnov (concept); reduced clean-room reimplementation |
| Year | 2009 |
| Origin | 🇷🇺 Russia |
| Source | algorithms/compression/bsc.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 data test
| Field | Value |
|---|---|
input |
(empty) |
expected |
00000000 |
Vector 2 — Single byte test
| Field | Value |
|---|---|
input |
41 |
expected |
(empty) |
Vector 3 — Classic banana example
| Field | Value |
|---|---|
input |
62616e616e61 |
expected |
(empty) |
Vector 4 — Mixed alphanumeric data
| Field | Value |
|---|---|
input |
54686520717569636b2062726f776e20 666f78206a756d7073206f7665722074 6865206c617a7920646f67 |
expected |
(empty) |
Vector 5 — Repetitive text compression
| Field | Value |
|---|---|
input |
616263616263616263616263616263616263 |
expected |
(empty) |