Using assembly theory, we investigate the assembly pathways of fixed-length binary strings formed by joining the individual bits present in the assembly pool and the strings that entered the pool as a result of previous joining operations. We show that the string assembly index is bounded from below and above, and we conjecture about the form of the upper bound. We show that a string having the smallest assembly index can be assembled by an elegant trivial program of length equal to this index, if the length of the string is expressible as a product of Fibonacci numbers. We conjecture that there is no binary program that has a length shorter than the length of the string having the largest assembly index that could assemble this string. We conjecture that a black hole surface is defined by a balanced distinct string that satisfies the upper bound of a distinct string assembly index. The results confirm that four Planck areas provide a minimum information capacity that provides a minimum thermodynamic (Bekenstein-Hawking) entropy. Knowing that the problem of determining the assembly index is at least NP-complete, we conjecture that the problem of determining the assembly index of a given binary string is NP-complete, while the problem of creating the string so that it would have a predetermined maximum assembly index is NP-hard. Therefore, once the new information is assembled by a dissipative structure or by a human, increasing the information entropy according to the second law of infodynamics, it is subject to the second law of thermodynamics, and nature seeks to optimize its assembly pathway.