Space improvement of node

[Chat-Wane]

LSEQ uses an exponential tree. Thus the root as k children, each of these children has k+1 children and so on. Nevertheless, it requires 1 additional bit to encode the path at each level.

Currently, each path is encoded with type integer. However, it does not require the 64 bit of the integer. Ideally, to get closer of the real value, it must be encoded using UINT8[].

[Chat-Wane]

Node should use ArrayBuffer. Then, the raw array of bits is interpreted as Uint8 array to perform comparisons etc. However, ArrayBuffer seems not worth it until the size of the integer is reached, which is very high and unlikely to happen (since arraybuffers contain metadata).