A playground of sparse linear algebra primitives using Morton ordering

Latest on Hackage:0.9.2

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow to host generated Haddocks.

BSD3 licensed by Edward A. Kmett
Maintained by Edward A. Kmett


Build Status

A sparse linear algebra playground based on Morton ordering.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on

-Edward Kmett



  • Rather dramatic memory usage reduction.
  • Dependency bumps


  • contravariant 1 support


  • lens 4 support

  • Consolidated the tutorial under on “slug” on the FP Complete site, this broke all of the URLs in the 0.7 documentation.


  • Switched to using an internal vector type that unboxes as much as it can. This lets type inference work much better when playing around at the ghci REPL.


  • Version bumped to exceed the # of Hans Hoglund’s sparse package. He started and released his library during the creation of this library, but graciously offered to let me take over the name. His library is now on hackage as sparser.


  • Repository initialized.
comments powered byDisqus