Hashing InChIs

Rich Apodaca — Wed, 09 May 2007 14:01:00 -0400

The InChI team has announced a proposal for a standardized InChI hashing mechanism. This would create a free, fixed-length, alphanumeric molecular identifier.

This is an excellent proposal. One of the biggest problems in working with InChIs (and other line notations such as SMILES) is that even medium-sized molecules produce very long identifiers. Another problem is the use of characters that must be escaped in URLs. The hashing proposal addresses both of these issues, getting very close to creating the optimal molecular identifier.

For example, imagine the convenience of being able to refer to a molecule by a universally-recognized, machine-generated string like the one shown below:

AAAAAAAAAAA-BBBBBBB-XYZ

This is something that actually stands a chance of getting printed on reagent bottles, in catalogs, in patent applications, or anywhere else chemists are using chemical information. Aside from its length, it's not too different from that other molecular identifier system, but without the perpetual use tax.

There are at least three downsides to this approach:

For most purposes, hashing is a one-way process. It would become virtually impossible to computationally convert this hashed identifier back into its InChI or molecular representation . On the other hand, this could create a market for cryptography experts in cheminformatics. A hashed-InChI lookup service would start to look very useful.
Because of the one-way nature of hashing, the authenticity of a hashed InChI couldn't be directly verified. Checksums will help, but the fundamental problem remains. InChI itself can be decoded, and therefore authenticated.
It's possible, although extremely unlikely, that two different molecules will end up having the same hashed InChI. Reducing the collision probability means increasing the length of the identifier.

As in any design decision, the question is whether the benefits outweigh the disadvantages.

Anyone is free to develop their own InChI hash system. Several, including me, already have. But by introducing a standard mechanism, the InChI team has the potential to create both a free and easy-to-use molecular identifier.

"Hashing InChIs" by steve heller

Fri, 18 May 2007 09:29:53 -0400

Yes, the hash is one way, but by using a reasonably long bit string one will reduce the likelihood of a collision to 10 to the -11. Not perfect, and NEVER will be, but close. And we do have a checksum in the proposed hash.
A computer (or computers) set up as a InChI lookup system, with a "real" IncHI string and the Index hash, analogous to the DNS lookup machines for the Internet IP address/domain name will enable people to verify the hash for all practical purposes. Not perfect either, but darn close. This idea of a lookup computer was proposed when we gave an InChI seminar at Google. http://video.google.com/videoplay?docid=-6653695245776470969

Depth-First: Hashing InChIs

Hashing InChIs

"Hashing InChIs" by steve heller