Infinite Compression Explained

Because most of you don't read my blog,(i don't read random blogs as well) and have so much questions about what i'm doing with my programs, i'll write it here:
All of the programs(about 6 developed so far) despite wildly varying routines are targeted to generate large integers.
These integers are not files. Following transformations occurs:
encode
1.file is converted to large integer X(arbitrary length).
2.X multiplied by some scale factor e.g. 10e1000 to get a lower bound
2.(X+1)by some scale factor e.g. 10e1000 to get an uppper bound
3.a search is performed for finding numbers inside that range which are easy to represent via formula.
4.if number(s) found its saved to a file.
decode:
1.a formula is supplied with number(s) and filesize
2.the formula generates an integer/float, which is then divided by scale factor(e.g. 10e1000).
3.the first filesize bytes are then written to output.

the proces isn't perfected yet, because the formulas currently used in my programs either too slow to search or cuttoff at float precision(for non-integer parameters)
________________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>3 floats can be used in intermediate representation:
suppose i'm compressing a byte(it impossible of course to compress anything that small)
its value is 77 the process is a follows
multiply 77*1000=77000=lowerbound
multiply (77+1)*1000=78000=upperbound
all the numbers between 77000.0000000000...1 and 77999.99999999.... are in the range
finding parameters for formula is next:
 formula e.g. 2^16.25 generates 77935.87748881833, 16.25 and 2(ommited if single power is used) are saved to file
the formula then calculates  77935.87748881833/10000=77.93587748881832 who first byte is 77 which is printed.
________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est