New and revolutionary data comression scheme!

Infinite compression?

I've always was interested in how compressed files worked and why the compression factor is so low.
The entropy explanation isn't something i would accept without tinkering with the data. The idea of my compression algorithm(currently under development) is to
use algebraic properties of files to express the data in more concise way.
The thing might sound trivial, but its implementation is not.
Normal compression works by splitting FILE and finding redundant pieces to express them in minimum volume.
Imagine a FILE read and converted to arbitrary precision integer. Now consider all the myriad ways to generate said integer. Sounds difficult? Not so much.
1.lets take a Prime Number,e.g. 2 and raise it to power closest to our integer, e.g. 20000. Note the difference from the (FILE-result).
2.Get the smallest difference with the powers available,
and proceed to next step:
3.If the difference is negative: find 2 raised to the power
of X which would close the gap,by substracting it from #1
If the difference is positive just add 2 with closest power to the difference .
The end result could be something like
2^6+2^5-2^3+2^1-2^0=Integer=FILE
Its can be improved further by using other prime numbers powers with the idea of expression taking the least space.
The same thing can be accomplished with arbitrary length floating point numbers like 2^123712.1282 which would converge faster,but will require some fixing to convert to a stable binary result.
Posted by FrozenVoid at 15:37

Lain.

Lain.

Lain.

Lain.

zomg we need a trinary coprozessor. srsly a VHDL implementation might work

Consider we have a LUT of all primes for 2 times our word size.
Always use the corresponding word with the LUT.
One half nibble to indicate:
00....base
01....mul
10....exp
11....double word indicator

with a 18bit word size we would have 204 LUT operations and a 16 bit header (for leading leading zeros and appliance instructions) inside a 4kbit chunk. The problem is the LUT would be 288gb large. But you could store the single size LUT in ram and the double in a ssd.

Might not work, you'll probably need data which contains over 100 primes but could always crack rsa with this thing.

YES I BUMPED IT

Remember that infinite compression guy?  did he ever publish anything about his alleged algorithm?

idk I did stop looking once I saw ``floating point" and ``primes"

>>287
Aw, c'mon. Where's your sense of adventure?

Around >>80-100: Huffman coding apparently doesn't exist.