reedsolomon: Reed-Solomon Erasure Coding in Haskell

[ data, library, mit ] [ Propose Tags ]

Please see

[Skip to Readme]
Versions [faq],,,,,,,, (info)
Dependencies base (>=4.7 && <4.10), bytestring (==0.10.*), exceptions (==0.8.*), gitrev (>=1.0 && <1.3), loop (>=0.2 && <0.4), mtl (>=2.1 && <2.3), primitive (==0.6.*), profunctors (>=4.4 && <5.3), vector (>=0.10 && <0.12) [details]
License MIT
Copyright (c) 2015, 2016, Nicolas Trangez (c) 2015, Klaus Post (c) 2015, Backblaze
Author Nicolas Trangez
Category Data
Home page
Bug tracker
Source repo head: git clone
Uploaded by NicolasTrangez at 2017-01-13T15:37:16Z
Distributions NixOS:
Executables reedsolomon-profiling, reedsolomon-simple-bench, reedsolomon-simple-decoder, reedsolomon-simple-encoder
Downloads 3979 total (23 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2017-01-13 [all 3 reports]


  • Data
    • Data.ReedSolomon
      • Data.ReedSolomon.BuildInfo
    • Vector
      • Storable
        • Data.Vector.Storable.ByteString



Enable SIMD Galois field calculation routines


Enable LLVM compilation


Build example binaries


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 reedsolomon-

[back to package description]


Travis CI Circle CI Appveyor

Reed-Solomon Erasure Coding in Haskell, with speeds exceeding multiple GB/s/cpu core implemented in pure Haskell (and some SIMD C/assembler).

This is a Haskell port of the GolangReedSolomon library released by Klaus Post, wich is a port of the JavaReedSolomon library released by Backblaze, with some additional optimizations.

For an introduction on erasure coding, see the post on the Backblaze blog.

Package home:


Performance depends mainly on the number of parity shards. In rough terms, doubling the number of parity shards will double the encoding time.

Here are the throughput numbers with some different selections of data and parity shards. For reference each shard is 1MB random data, and 1 CPU core is used for encoding.

<table> <thead> <tr> <th>Data</th> <th>Parity</th> <th>Parity</th> <th>SSSE3 MB/s</th> <th>AVX2 MB/s</th> </tr> </thead> <tbody> <tr><td>5</td><td>2</td><td>40%</td><td>3641,66</td><td>3987,24</td></tr> <tr><td>10</td><td>2</td><td>20%</td><td>3951,01</td><td>4444,44</td></tr> <tr><td>10</td><td>4</td><td>40%</td><td>1821,16</td><td>1927,90</td></tr> <tr><td>50</td><td>20</td><td>40%</td><td>398,09</td><td>431,78</td></tr> </tbody> </table>

Example of performance on Intel(R) Core(TM) i7-4600U CPU @ 3.30GHz - 2 physical cores, 4 logical cores (note: /proc/cpuinfo mentions 2.10GHz only). The example uses 10 blocks with 16MB data each and 4 parity blocks.

<table> <thead> <tr> <th>Threads</th> <th>SSSE3 MB/s</th> <th>AVX2 MB/s</th> <th>Speed</th> </tr> </thead> <tbody> <tr><td>1</td><td>1551,89</td><td>1588,88</td><td>100%</td></tr> </tbody> </table>



This code, as the original GolangReedSolomon and JavaReedSolomon is published under an MIT license. See LICENSE file for more information.