bytehash: Universal hashing of bytes

[ bsd3, data, library ] [ Propose Tags ]

Taken together, universal hash functions and a good source of entropy provide a foundation for hash maps guarantee O(1) lookups even if an adversary chooses the keys. This library implements such a hash map. The implementation of lookup is tuned for performance. The functions for building hash maps are not since they are intended to be called infrequently.


Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS]
Change log
Dependencies base (>=4.12 && <5), byte-order (>=0.1.2 && <0.2), byteslice (>=0.2.1 && <0.3), bytestring (>=0.10.8 && <0.12), entropy (>= && <0.5), primitive (>=0.7 && <0.8), primitive-unlifted (>=0.1.2 && <0.2), transformers (>=0.5.6 && <0.7) [details]
License BSD-3-Clause
Copyright 2020 Andrew Martin
Author Andrew Martin
Revised Revision 1 made by andrewthad at 2022-07-15T17:43:41Z
Category Data
Home page
Bug tracker
Uploaded by andrewthad at 2020-04-30T17:09:17Z
Distributions LTSHaskell:, NixOS:, Stackage:
Reverse Dependencies 1 direct, 4 indirect [details]
Downloads 525 total (35 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2020-04-30 [all 1 reports]