4 ms·
> In other words, you'd need about 16GB just to store the program to compute the permutation! Another way to reach this number is simply to consider that most
by wilun 9y ago
> In other words, you'd need about 16GB just to store the program to compute the permutation!
Another way to reach this number is simply to consider that most reversible operations are going to be implementable by non-compressible LUTs, and such a LUT for 32-bits number will be 2^32 * 4 Bytes == 16GB.
- Retric 9y agoYou can cut this in half because the inputs always map to different outputs and nothing repeats. So, after specifying the first mapping 0 > k, 1 can map to 2^32 -1 possible numbers, 2 can map to 2^32 - 2 numbers etc, and you can skip mapping the last number as only one possibility is left. LUT's would be vastly faster though.