This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the project page for more information.Articles for creationWikipedia:WikiProject Articles for creationTemplate:WikiProject Articles for creationAfC articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles 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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
The following Wikipedia contributor has declared a personal or professional connection to the subject of this article. Relevant policies and guidelines may include conflict of interest, autobiography, and neutral point of view.
It's just a hash function to some desired number of bits. The tradeoff is that if you use more bits it takes that much more space to store them, but you are less likely to get a collision. I agree that the description in the article is not very clear. Fingerprint (computing) is similar but not quite the correct concept, though, because the concept at that article demands that fingerprints be long enough to have essentially no collisions (meaning probably hundreds of bits) while for cuckoo hashing to be useful, the fingerprints should be much shorter than the identifiers for the objects they fingerprint and collisions will still be possible (maybe 8-bit fingerprints would be normal). —David Eppstein (talk) 01:30, 28 December 2020 (UTC)Reply