Higher to Lower Base Conversion using rotation method

It's a lossless compression program, in which I'm trying to accomplish 1/2 and probably more ... 1/4 ... compression using Higher to Lower Base Conversion using rotation method.

Traditional lossless Compression Algorithms LZMA2, Huffman Zstandard Gzip and many try on redundant data like simple text where Compression depends on H. Rotation method is trying to beat the idea of H.

What do i mean by 50% COMPRESSION
Imagine we have four numbers in our Data String of Base16
Bits required to store 4 numbers in Base16= 2power4=16 4(bits)x4(data)=16 total bits
Now same 4 numbers once compressed properly bits needed in Base4= 2power2=4 and 2(bits)x4(data)=8 total bits

I have attached the excel file (Base8 Conversion process) explaining mathematically the conversion process using rotation method for Base8 to Base 4 as an example. There's also a file attached explaining the conversion process for B9 to B6 and python file which is a conversion program for Base9 to Base6, and uses the same idea as B8 B4 but different approach.

*What i need is a programmer who has a very strong number theory background and python skills, which can help me further my cause and make few changes to P3-FINAL program.
Changes are very few, will reveal this in the meeting.

To get shortlisted please explain the process in P3_Final.py and B9-B6 Conversion Process.

I kept the information in files unlabeled except in B8 to B4. consider it more like a jigsaw puzzle (where you put the right pieces together to get a correct final picture) to test your knowledge and understanding of the idea.

HINT. If you understand the process in B8 then it's much easier to understand B9 to B6.