BucketCompressionTrick
Languages and libraries
data compression technique
SHOW HN2018
188points
140comments
#196of 2,155 in 2018
Top 10%of 2018 by points
How HN took it
CuriousMostly questions and neutral comments
4 positive, 31 neutral or asking, 0 mixed, 5 critical, out of 40 comments about the project. Thread score -0.05.
Idea: 4 for, 3 againstDocs: 0 for, 2 against
The thread, comment by comment
Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.
positive neutral or mixed critical about another commenter or something else the maker
What HN said
What people liked
Good lesson in information entropy
From 1 comment
This is a great little lesson in information entropy. I work on similar problems quite often in my work, and understanding this was a pleasant epiphany.
psyc on HN
Objections
Title is misleading; it stores a set, not an ordered sequence
From 2 comments
The title is deceptive. It should state that the goal is to store a set of four 5-bit values.
utopcell on HNAh, without preserving order. That's a set of four 5-bit values, not a sequence of four 5-bit values.
amptorn on HN
Relies on a lookup table, making it less interesting
From 1 comment
The fact that it's using lookup tables to store the mapping between the set of numbers and the encoded 16-bit number makes it less interesting; it basically just enumerates the…
barrkel on HN
Requests
Explain practical use cases
From 2 comments
It's pretty cool and all but what are the uses for this? What set of 4 un ordered 5-bit numbers would i need to store that I couldn't just store as 3 bytes? I waste only 4 bits…
grawprog on HNWhat's the practical use for this?
anonu on HN
Questions
How is the count of possible sets computed for 4 values of 4 bits
From 2 comments
how are you getting 3876 unique values for a set of 4 4 bit values (16, 16, 16, 16) ?
sabujp on HNWhy is this first line true: "This works because there are 3876 possible unique values for a set of 4 4 bit values" Each 4 bit number has 16 possible values. And you can order…
rasen58 on HN
Alternatives named
Combinatorial number system encoding
From 1 comment
It is possible to do this in O(1) memory, for arbitrary sized collections, efficiently. The first trick is to make a function that can calculate the nth set with k elements from…
nightcracker on HN