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

>>4
[1]"By which method? Do you have arbitrary time and memory as well?"
each byte is converted to decimal and multiplied by 256^position in file.
In current programs it takes 1 second per 100 bytes.(there are libraries which can convert the file in 0.0000001 seconds but they don't work with my compilers, e.g. MPI and GMP)
[2]"You have two steps labeled '2'".
 its insignificant, as they both specify the range.
[3]"You're going to search the representation of a number for known patterns then?"
I'm searching for any numbers which fit inside the range. floats, integers,etc
The formula is to find any of the (infinitely many with appropriate scale factor) numbers which can be computed via formula.
 
 



_____________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est