OpenEuphoria

Re: Hash Function

• Posted by cklester <cklester at yahoo.com> Nov 11, 2004
• 468 views

Alexander Toresson wrote:
> 
> cklester wrote:
> > 
> > Unfortunately, I think the contest is just going to be who can write the
> > fastest hash algorithm... something with which I have limited experience,
> > and fortunately wasn't a factor in the first official contest. :)
> 
> I'll share mine with you when the contest is over. It's fast and near-
> optimal.
> 
> However, I don't think that the contest is only about hashes - mine uses
> 14% of the total runtime.

If it's not about the hash, then sharing your hash won't affect the
outcome. In fact, it will level the playing field for those of us who
don't have any training/education regarding hash algorithms. Then the
contest is a matter of the word management algorithm.

As it is, I'm guessing Pete is on top because he has the fastest hash.
I could be wrong!!! I don't know for sure. That's why I'm asking. It
could well be that he has an awesome word management algorithm instead
that would blow everybody away no matter what hash was used.

Maybe Derek can shed some light on this.

-=ck
"Programming in a state of EUPHORIA."
http://www.cklester.com/euphoria/