I'm working on a De/Coder which can compress 365766! (in factorial) bytes into 9.5Mb of TXT or 1.7Mb of ZIP. The compression (that has been tested so far limits the INPUT length to 60961 bytes); though the OUTPUT is twisted... Laught as much as you want, but i took the Torah {encoding: Hebrew(windows-1255)} which length is 304805 letters what's strange that this huge number equals only to 60961*5 and doesn't devide by 15,25,35,etc. I entered the Torah into a hash which contains the following about each letter : ord(Letter), Original_id, Current_id, my_gimatria_value <=> (ord(letter) -224), colour according to the book( one of five), place in the "pipe of letters", is_occupied. Afterwards i read input into the "pipe" by the only 3 rules( yet) that the current_id changes(as if there's a hole in the "pipe") to counter(from 0) multiplied on 6 AND is_occupie = true AND place = 6 , when finished, it remembers the state in which the torah is twisted into a file names filename.tX. The decoder is the problemetic part although it should be the reverse of the encoder which means rewriting the Coder "backwars".

See I know what I mean. Why don't you?

...to which I want to add:

• the OP raises far more questions in the reader than are present in the writer (if the writer's question is even visible).

Questions your post rises:

• What do you ask for? a code revision?
• did you calculate the factorial of 365766?
  The biggest factorial my computer can calculate is 170! = 7,25741e+306, 171! is inf.
• compared to the former factorial, what is "huge" in the number 304805?
• to what purpose did you enter the Torah code into a hash?
• what is Current_id?
• what purpose does my_gimatria_value have?
• what colour are you talking about, and according to what book?
• what is the "pipe of letters" ?
• into what "pipe" are you reading what "input" afterwards?
• how do you determine is_occupied?
• what is "the state in which the torah is twisted"?
• ... ?

Then you provide some code which I just gazed at without capacity left to understand it, being busy puzzled by the questions I laid out above. Even trying hard, I had to give up. This puzzle is beyond my skills, although it sounds interesting (maybe related with numerology?).

I cannot relate all this with the title "hash confusion", given my own. Please reformulate your question and give us more insight into your proceedings.

_($_=" "x(1<<5)."?\n".q·/)Oo.  G°\        /
                              /\_¯/(q    /
----------------------------  \__(m.====·.(_("always off the crowd"))."·
");sub _{s./.($e="'Itrs `mnsgdq Gdbj O`qkdq")=~y/"-y/#-z/;$e.e && print}

I'm working on a De/Coder which can compress 365766! (in factorial) bytes into 9.5Mb of TXT or 1.7Mb of ZIP.

The compression (that has been tested so far limits the INPUT length to 60961 bytes);

Laught as much as you want, but i took the Torah {encoding: Hebrew(windows-1255)} which length is 304805 letters what's strange that this huge number equals only to 60961*5 and doesn't devide by 15,25,35,etc.

p.s.: the "pipe" is a 5 cornered star shaped tunel of letters where on the pics of the start the letters are shifted and in the center the are being written.

I'm able to tell that there are no syntax errors or compile-time warnings in your program, and I can see that it requires two input files, but I don't happen to have a file called "torah.cod" on my system, and there's no clue about what needs to be in a file called "temp.txt", so there's not much more I can do for you.

Maybe you could reduce the code to a shorter version that can demonstrate the problem, and post that along with just enough sample data so we can run it and see what the problem is.

You do seem to be doing some simple things in very complicated, bizarre ways, as in this part of the "enc()" sub that reads from "temp.txt" (I fixed the indenting a bit):

    open (DAT, "$file") || die "$!\n";
    while (<DAT>) {
        seek(DAT, $cc, 0);
        read(DAT, $tmpR, 1);
        $tmpR = sprintf("%02x", ord($tmpR));
        my @lets = split(//, $tmpR);
        $data = process($lets[0]);
        $data = process($lets[1]);
        print hex($lets[1].$lets[0])." KEY\n";
        $cc++;
    }
    close(DAT);
[download]

Okay, in some sense that actually does work. But what a lot of confusion and extra effort -- it ends up as one iteration of the while loop for every byte in the file, and the number of times each byte is read from the file is equal to the average line length times 2 -- when you really just need to read the data once, like this:

while (<DATA>) {
    for my $char ( split // ) {
        my @lets = split //, sprintf("%02x",ord($char));
        process( $_ ) for ( @lets );
        print ord( $char ), " KEY\n";
    }
}
[download]

There's probably a lot more confusion in the OP code, and it's not just a matter of hashes. Good luck -- if you can put together a coherent question, try posting that as a reply in this thread (or start a new thread), then maybe someone here can help.

which one ?

which one ?

All those that made us think you may want to ponder what Homer did:

Man, this is crazy. I hope I didn't brain my damage.