direvus / btern Goto Github PK

There is at least one typo in these comments, and they do not specify what happens with None input.

This will probably consist of mapping each set of 5 trits (243 symbols) to one byte (8 bits, 256 symbols).

There does not exist any suitably small X for which 3^X == 2^Y and X and Y are both positive integers -- there will always be some loss in the serialisation. The 5-8 mapping is 94.921875% efficient and takes advantage of the well-understood convention of using 8-bit blocks in binary.