Jump to content

Talk:Jenkins hash function

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Qwertyus (talk | contribs) at 15:06, 15 June 2015 (Notability). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputing Unassessed
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
???This article has not yet received a rating on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.

signed vs unsigned

It should be noted that for the += key[i] step it is a difference wether key is a char* or unsigned char*, and in my experience the unsigned version has a slightly better avalanche behaviour.

Who is Bob Jenkins?

I'm glad he decided to contribute so much, but honestly it seems like he is just plugging his website. Unless his work has been published in a peer-reviewed journal, I don't think it should be continuously cited throughout this article. A simple mention of his site in the external links section would suffice. --Kibblesnbits 17:16, 13 March 2007 (UTC)[reply]

Bob has produced some very good research articles in hash functions. We who do hash function research are often in the industry, and do not have easy access to academic publications. MegaHasher 06:31, 18 August 2007 (UTC)[reply]
I second that, I find code using the jenkins hash sometimes in other applications and libraries, and also jenkins seem to have made the research on avalanche behaviour quite popular. Also, if you surf aronud on his (horribly organized) website you will find some publications
I agree that the article is pretty weak, however I see it being used in HBase (HDFS/Hadoop) and people have ported versions to python, java, and ruby. I think it's important enough to keep, BUT the article needs clarification and expansion. Cgthayer (talk) 16:17, 12 May 2010 (UTC)[reply]
Perl has used Jenkins one-at-a-time hash function for years. IMO for that reason alone it deserves a reference. — Preceding unsigned comment added by 212.64.88.14 (talk) 23:03, 7 December 2012 (UTC)[reply]

License ?

This page reproduce the algorithm for the "One-at-a-Time" hash, is it allowed to ?

What is the license applicable to the Bob Jenkins hash algorithms ? Ydroneaud (talk) 08:42, 3 April 2013 (UTC)[reply]

The very first link in the references section[1] says "The code given here are all public domain.". Is this something we need to emphasize more in this article? --DavidCary (talk) 23:43, 29 May 2013 (UTC)[reply]

Notability

Intgr, regarding the notability and sourcing of this article:

I'll put some more of this into the article. Please reconsider the notability template. QVVERTYVS (hm?) 20:39, 11 June 2015 (UTC)[reply]

@Qwertyus: The SPIN paper is good because it actually discusses one of the variations in length, which can be used to expand the article with relevant content. But the other two are just name-dropping the function and don't qualify as "significant coverage" by WP:GNG. The notability requirement is there in order to make sure that sufficient reliable sources exist, to base the article on (WP:WHYN).
Building a list of software that uses this hash isn't an improvement to the article IMO; it's not much more useful than a "list of products built using M5 screws". I think you should concentrate on improving content about the Jenkins hash itself and find sources that help you do that. -- intgr [talk] 14:49, 15 June 2015 (UTC)[reply]
@Intgr: I actually picked exactly those sources that commented on their choice of hash function. I think notability is now well-enough established, and I'm removing the templates. QVVERTYVS (hm?) 15:06, 15 June 2015 (UTC)[reply]