Re: [ANN] Lua 5.2.1 (work1) now available

[Frank Meier-Dörnberg <frank@...>]

Noise? what noise...?
Please give a pointer to your findings ( I found nothing on a first scim 
by googleing "holomorph hash").

Wouldn't

Hash( Str1 .. Str2) == Hash( Str1 ) * Hash( Str2 )

scrictly leads down to

Hash( Str) == Hash( Str[1] ) * Hash( Str[2] ) * ... * Hash(Str[#Str])

(read: Hash have to be defined char wise)

what ever '*' means?



Am 25.03.2012 20:31, schrieb Pierre-Yves Gérardy:
> Sorry for the noise, Some googling revealed several papers on the topic.
>
> -- Pierre-Yves
>
>
>
> On Sun, Mar 25, 2012 at 20:22, Pierre-Yves Gérardy<pygy79@gmail.com>  wrote:
> > > No, of course not. But it's pretty easy to write an implementation of ropes
> > > using tables and the appropriate concat and tostring metamethods.
> > While we’re talking about ropes and hashing, are there homomorphic
> > hashing algorithms such that
> >
> >      Hash( Str1 .. Str2) == Hash( Str1 ) * Hash( Str2 )
> >
> > where * is some algorithm faster than re-hashing a whole new string?
> >
> > -- Pierre-Yves