/PLHash

Hash primitive and composite values (including hashes themselves) that self-describe their algorithm and may be shortened against other Hashes.

Primary LanguageHaskell

PLHash - experimental

This package defines Hashes which:

  • Uniquely identify some hashed value within it's type
  • Self-describe the algorithm used to perform the hash
  • May be shortened against other Hashes to produce the 'shortest unambiguous hash'.

This is currently used by the PL project for storing content-addressed programs that can be referenced with wieldy names.