@neauoire Every invertible Boolean function is - necessarily - a permutation of its input bits over all argument cases. It follows that any such function can be described as a permutation index - which implies that, for example, any invertible 8-to-8 bit program can be described in 1683.996 bits. (see OEIS A000722)