Pre-Sort Issues
The problem with the success I have, is that modern data compression uses predictive analysis, we know that often after a specific character that there is odds of what comes next. Huffman Encoding, and other mathematical functions, need a slightly higher rate to produce good numbers, but this still ignores the back third to half which is essentially RAND at that point.
I would be willing to team up with someone just to make this a possible system, the numbers are so unique that there has to be some value here,
The Basics
A dual mechanism pre-sort that can hyper focus results as desired.
Optional Bullet List
- The first part sets up an extreme amount of 0's or 1's in front.
- The second part then splits them successfully, in a lossless manner.
- Repetitions of either will hyper focus the trend, further increasing the bias in the front portions while the back continues to grow in total bits that are essentially RAND.
- There is some ways to alter the results, but the amount of time it would take to examine all is extensive. I just do not have the time to pursue all routes.