Effective protein folding in simple random search

Here I show the following facts using a simple random search model without including any sophisticated energy term. As the size of elements exponentially affects the efficiency of folding, it can be remarkably enhanced by dividing the elements into small blocks. As the folding of the blocks is completely independent, the total folding time can be reduced to the folding time of the single hardest block. This result gives the simplest and most straightforward answer to the Levinthal paradox.