Rainbow tables list pre-
The geometric type of this kind of function was originally developed for computer vision but is now used in, among other applications, fingerprint recognition. A function of this type is used by the Rabin-Karp algorithm to efficiently search for examples of plagiarism. Rainbow tables list pre- calculated outputs of these functions, which in most practical examples have pairs of values that map to the same output, called a collision. Algorithms to generate them include SHA-1 and MD5, which output an index based on the input, called a "key"; those indices, which are also known by this term, can be listed in a map or table named for them. Give this term associated with the tagging of objects using a pound sign.
The geometric type of this kind of function was originally developed for computer vision but is now used in, among other applications, fingerprint recognition.
hash(ing) function [accept hash table; accept hash tag]