Hash 127: 6 questions

1.  It appears that inputs must be divisible by sizeof(int32) in length.
Is that correct? 2.  Are there any implementations of the 64 bit hash
function available?

Suppose that I want to take a binary string of arbitrary length and
create a 64 bit hash from it. =20
3.  What is the correct sequence for me to do this?

Suppose that I have one billion messages of similar length, and I want
to create a distinct hash from each one of those messages as quickly as
possible. =20
4.  What is the correct sequence for me to do this?

The padding to an exact length congruent to zero mod 4 is very
inconvenient. =20
5.  Is it possible to modify the code so that it is not necessary?

I would like to be able to learn as much as possible about the system
without bothering the list members. 6.  Is there a repository somewhere
with old messages from the list?