Popularity
6.7
Growing
Activity
5.5
Growing
17
3
1

Monthly Downloads: 91
Programming language: Haskell
License: MIT License
Tags: Math     Number Theory    
Latest version: v0.1.1.0

mod alternatives and similar packages

Based on the "Math" category

Do you think we are missing an alternative of mod or a related project?

Add another 'Math' Package

README

mod Build Status Hackage Hackage CI Stackage LTS Stackage Nightly

Modular arithmetic, promoting moduli to the type level, with an emphasis on performance. Originally a part of arithmoi package.

> :set -XDataKinds
> 4 + 5 :: Mod 7
(2 `modulo` 7)
> 4 - 5 :: Mod 7
(6 `modulo` 7)
> 4 * 5 :: Mod 7
(6 `modulo` 7)
> 4 / 5 :: Mod 7
(5 `modulo` 7)
> 4 ^ 5 :: Mod 7
(2 `modulo` 7)

Competitors

There are other Haskell packages, employing the very same idea of moduli on the type level, namely modular and modular-arithmetic. One can also use finite-typelits, which covers some elementary modular arithmetic as well. Unfortunately, all of them fall behind in terms of performance. Here is a brief comparison:

Discipline mod modular modular-arithmetic finite-typelits
Addition Fast Slow Slow Slow
Small (*) Fast Slow Slow Slow
Inversion Fast N/A Slow N/A
Power Fast Slow Slow N/A
Overflows Safe Safe Unsafe Safe
  • Addition. All competing implementations of the modular addition involve divisions, while mod completely avoids this costly operation. It makes difference even for small numbers; e. g., sum [1..10^7] becomes 5x faster. For larger integers the speed up is even more significant, because the computational complexity of division is not linear.

  • Small (*). When a modulo fits a machine word (which is quite a common case on 64-bit architectures), mod implements the modular multiplication as a couple of CPU instructions and neither allocates intermediate arbitrary-precision values, nor calls libgmp at all. For computations like product [1..10^7] this gives a 3x boost to performance in comparison to other libraries.

  • Inversion. This package relies on libgmp for modular inversions. Even for small arguments it is about 5x faster than the native implementation of modular inversion in modular-arithmetic.

  • Power. This package relies on libgmp for modular exponentiation. Even for small arguments it is about 2x faster than competitors.

  • Overflows. At first glance modular-arithmetic is more flexible than mod, because it allows to specify the underlying representation of a modular residue, e. g., Mod Integer 100, Mod Int 100, Mod Word8 100. We argue that this is a dangerous freedom, vulnerable to overflows. For instance, 20 ^ 2 :: Mod Word8 100 returns 44 instead of expected 0. Even less expected is that 50 :: Mod Word8 300 appears to be 6 (remember that type-level numbers are always Natural).

Citius, altius, fortius!

If you are looking for an ultimate performance and your moduli fit into Word, try Data.Mod.Word, which is a drop-in replacement of Data.Mod, but offers almost 3x faster addition, 2x faster multiplication and much less allocations.

Benchmarks

Here are some relative benchmarks, which can be reproduced by running cabal bench.

Discipline Data.Mod.Word Data.Mod modular modular-arithmetic finite-typelits
Sum 0.4x 1x 4.2x 4.9x 2.9x
Product 0.5x 1x 3.2x 4.4x 2.8x
Inversion 0.8x 1x N/A 6.1x N/A
Power 0.9x 1x 5.4x 1.8x N/A

What's next?

This package was cut out of arithmoi to provide a modular arithmetic with a light dependency footprint. This goal certainly limits the scope of API to the bare minimum. If you need more advanced tools (the Chinese remainder theorem, cyclic groups, modular equations, etc.) please refer to Math.NumberTheory.Moduli.