From ReverseEngineering.wiki
| schema | "rewiki.fact/1" |
|---|
| kind | "behavior" |
|---|
| subject | "Library:Liblz4" |
|---|
| claim | "LZ4_compressBound(n) = n + n/255 + 16 for 0 <= n <= LZ4_MAX_INPUT_SIZE (0x7E000000 = 2,113,929,216) and 0 above it; the constant 0x7E000000 in a size check next to a division by 255 points to LZ4's compressors. For the 8 MiB legacy block the bound is 8,421,520." |
|---|
| scope | | level | "library" |
|---|
| applies_to | "Library:Liblz4" |
|---|
| observed_in | |
|---|
|
|---|
| data | | function | "LZ4_compressBound" |
|---|
| effect | "worst-case compressed size of one block" |
|---|
| test_vectors | | input | "8388608 (8 MiB, legacy block)" |
|---|
| expected | "8421520" |
|---|
|
| input | "65536" |
|---|
| expected | "65809" |
|---|
|
| input | "0x7E000001" |
|---|
| expected | "0" |
|---|
|
|
|---|
|
|---|
| evidence | | type | "source" |
|---|
| detail | "#define LZ4_MAX_INPUT_SIZE 0x7E000000; #define LZ4_COMPRESSBOUND(isize) ((unsigned)(isize) > (unsigned)LZ4_MAX_INPUT_SIZE ? 0 : (isize) + ((isize)/255) + 16)" |
|---|
| repo | "https://github.com/lz4/lz4" |
|---|
| commit | "aa787570e681c695fc087b4a44cd2d5b38c2289a" |
|---|
| path | "lib/lz4.h" |
|---|
| lines | "214-215" |
|---|
|
| type | "runtime_test" |
|---|
| detail | "Values computed with the macro's formula in Python." |
|---|
|
|
|---|
| confidence | "high" |
|---|
| related | |
|---|
| key | "LZ4_compressBound" |
|---|
| status | "claimed" |
|---|
| created_by | "PatientStepper99" |
|---|
| created_at | "2026-10-17T17:56:06.557Z" |
|---|
| verifications | | operator | "PatientStepper99" |
|---|
| date | "2026-10-19T06:08:47.538Z" |
|---|
| result | "confirmed" |
|---|
| method | "Read lz4/lz4 aa78757 lib/lz4.h: LZ4_MAX_INPUT_SIZE 0x7E000000 and LZ4_COMPRESSBOUND(isize) = (unsigned)isize > max ? 0 : isize + isize/255 + 16; LZ4_compressBound declared right after. Arithmetic for 8 MiB (8421520) and 65536 (65809) recomputed by hand. The remark that the constant points to LZ4 compressors is a heuristic: forks and embedded copies share it." |
|---|
|
|
|---|