store: Fast binary serialization

[ data, library, mit, serialization ] [ Propose Tags ]

[Skip to Readme]
Versions [faq],,,,,, 0.3, 0.3.1, 0.4.0, 0.4.1, 0.4.2, 0.4.3,,, 0.5.0,,,,, 0.6.0,, 0.6.1, 0.7.0, 0.7.1, 0.7.2, 0.7.3, 0.7.4, 0.7.5, 0.7.6 (info)
Change log
Dependencies array (>=, async (>=2.0.2), base (>=4.7 && <5), base-orphans (>=0.4.3), base64-bytestring (>=0.1.1), bifunctors (>=4.0), bytestring (>=, containers (>=, contravariant (>=1.3), cryptohash (>=0.11.6), deepseq (>=, directory (>=1.2), fail (>=4.9), filepath (>=1.3), free (>=4.11), ghc-prim (>=, hashable (>=, hspec (>=2.1.2), hspec-smallcheck (>=0.3.0), integer-gmp (>=, integer-simple (>=, lifted-base (>=, monad-control (>=, mono-traversable (>=0.7.0), network (>=, primitive (>=0.6), resourcet (>=, safe (>=0.3.8), semigroups (>=0.8), smallcheck (>=1.1.1), store-core (==0.4.*), syb (>=0.4.4), template-haskell (>=, text (>=, th-lift (>=0.7.1), th-lift-instances (>=0.1.4), th-orphans (>=0.13.2), th-reify-many (>=0.1.6), th-utilities (>=0.2), time (>=1.4.2), transformers (>=, unordered-containers (>=, vector (>=, void (>=0.5.11) [details]
License MIT
Copyright 2016 FP Complete
Maintainer Michael Sloan <>
Category Serialization, Data
Home page
Bug tracker
Source repo head: git clone
Uploaded by MichaelSloan at 2020-07-31T21:52:45Z
Distributions Arch:0.7.5, Debian:, LTSHaskell:, NixOS:0.7.4, Stackage:, openSUSE:
Downloads 21867 total (745 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]


[Index] [Quick Jump]



Use the simple integer library instead of integer-gmp


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees

Readme for store-0.7.5

[back to package description]


The 'store' package provides efficient binary serialization. There are a couple features that particularly distinguish it from most prior Haskell serialization libraries:

  • Its primary goal is speed. By default, direct machine representations are used for things like numeric values (Int, Double, Word32, etc) and buffers (Text, ByteString, Vector, etc). This means that much of serialization uses the equivalent of memcpy.

    We have plans for supporting architecture independent serialization - see #36 and #31. This plan makes little endian the default, so that the most common endianness has no overhead.

    • Another way that the serialization behavior can vary is if integer-simple is used instead of GHC's default of using GMP. Integer serialized with the integer-simple flag enabled are not compatible with those serialized without the flag enabled.
  • Instead of implementing lazy serialization / deserialization involving multiple input / output buffers, peek and poke always work with a single buffer. This buffer is allocated by asking the value for its size before encoding. This simplifies the encoding logic, and allows for highly optimized tight loops.

  • store can optimize size computations by knowing when some types always use the same number of bytes. This allows us to compute the byte size of a Vector Int32 by just doing length v * 4.

It also features:

  • Optimized serialization instances for many types from base, vector, bytestring, text, containers, time, template-haskell, and more.

  • TH and GHC Generics based generation of Store instances for datatypes.

  • TH generation of testcases.

  • Utilities for streaming encoding / decoding of Store encoded messages, via the store-streaming package.


Store is best used for communication between trusted processes and local caches. It can certainly be used for other purposes, but the builtin set of instances have some gotchas to be aware of:

  • Store's builtin instances serialize in a format which depends on machine endianness.

  • Store's builtin instances trust the data when deserializing. For example, the deserialization of Vector will read the vector's length from the first 8 bytes. It will then allocate enough memory to store all the elements. Malicious or malformed input could cause allocation of large amounts of memory. See issue #122.

Blog posts