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

current code can be downloaded at : http://frozenvoid.blogspot.com/2009/06/static-integer-power-search.html


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

If i had precompiled MFPR .libs on windows it'll make the search much more efficient(in terms of number of stored floats, not speed)



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

Function: int mpfr_pow (mpfr_t rop, mpfr_t op1, mpfr_t op2, mp_rnd_t rnd)
^this is the function i need


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

If only there were some mathematical function where one could capture the exponent in some base, instead of searching. Why, god, why is math so hard????????

>>164 search needs fast loops and fast operations.
The MPFR and GMP use optimized assembly: I cannot hope to achieve their performance with some hack to approximate floating point powers.



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

Just for example, imagine exponentiation of  1.0000000000113111098123382013727423894 by 2130706432.31209383236218736284234



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

>>166
OMG that's the excel file representing all my banking information!!

>>167  this number could be a file or it could be just a part of series of such numbers which converge(and my compression is dependent on methods for such convergence) into a file. 



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

(define continued-faction
    (λ(x)
      (let iter ((val 1) ; needs some work!
                 (lst empty)
                 (x x))
        (cond ((= x 1) (reverse (cons 1 lst))) ; reverse not necessary but
              ((= x 0) (reverse lst)) ; it looks nicer this way
              ((> (factorial val) x) (iter 1 (cons (- val 1) lst) (- x (factorial (- val 1))))) ; needs some memoization!
              (else
                (iter (+ 1 val) lst x))))))

(define collapse-cf!
 (λ(rep)
   (apply + (map factorial rep))))

> (continued-faction 12131231454)
(13 12 12 12 12 12 12 12 12 12 12 12 12 11 11 11 10 10 10 10 10 10 10 10 10 10 8 8 8 7 7 7 7 7 7 6 6 5 5 5 4 4 3)

Shoot!

Wait, I know, the problem is in the factorial function. I'll just use the gamma function, that way I can use floats, whose magickal compression powers are well-documented. Does anyone know of a free gamma function library call with arbitrary-precision inputs that I can use in Scheme? Thanks.

Where's mah compression?

>>170 Not in active development. I'm concentrated on the game.



_______________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
The press does not tell us what to think, it tells us what to think about.

>>171
the game

FFFFFFFFUUUUUUUUUUUUU-

>>172
back to /the game/ please

>>171
You'll need to have it worked out by then to deliver the content with peak efficiency.

>>174 Content is procedurally generated. No need for compression.



________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
When everyone thinks the same, nobody is thinking.

PUBLIC SERVICE ANNOUNCEMENT:

20721 IS NOT BEING CRAPFLOODED

PUBLIC SERVICE ANNOUNCEMENT:

20721 IS NOW BEING CRAPFLOODED
Fixed

>PUBLIC SERVICE ANNOUNCEMENT:

20721 IS NOW HAX'D ANUS
Fixed

Lain.

Lain.

Lain.

Lain.

Lain.

Lain.

Lain.

Lain.

Lain.

Lain.

Lain.

Lain.

Lain.

I personally use Notepad2 and avoid any "makefiles"(which i consider bloated and poor design)^[1]

I use one include file for everything.
#include "void.h" //handles all the common functions,#defines,#ifdefs and #includes

Anything which uses makefiles is defective Sepples-level shit.
All the C code posts on my blog are void.h merged with somefile.c
-
_References
1. >>1250330533/ posts 10,12