# Tag Info

If I understand you right, you are asking if there was a way to take the $n$-bit Merkle tree root, and use it to extract the multiple files that are the leaves. Obviously, if the information within the files is more than $n$ bits, you can't - if there are $2^n$ possible roots, then no procedure can extract more than $2^n$ different values from it, and it ...