#### Re: The compact notation of binary number designation

Generally, the specific optimal algorithm will depend on allocation of received values on a range.

Here for example a variant [length + value]:

We break value into ranges, with digit capacity to the multiple 4 bits, i.e.: 0. 15, 16. 270, 271. 4365...

At first we write down length units, and the size of length is multiple 2 to bits, i.e.: 00 = 1, 01 = 2, 10 = 3, 1100 = 4, 1101 = 5...

After length goes N*4 number bit.

Number 100500 will be written down as 1101 0001 1000 1000 1001 0100-> 24 bits.

Number ' 127213652436512428173512214698378623721714738352374 ' in binary system to translate laziness, but it occupies 196 bits.

There is some redundancy (for example, number 1 occupies 6 bits), but without it anywhere