fixed

Pure Haskell large fixed-width integers and Montgomery arithmetic (docs.ppad.tech/fixed).
git clone git://git.ppad.tech/fixed.git
Log | Files | Refs | README | LICENSE

CHANGELOG (1371B)

      1 # Changelog
      2 
      3 - 0.2.0 (2026-08-01)
      4   * Addresses a couple of minor issues detected by an LLM scan:
      5 
      6     * Fixes a bug that could lead shl1_c# to produce a malformed Choice
      7       that would behave incorrectly for negation or selection.
      8 
      9     * Each Montgomery domain's 'signum' implementation was broken,
     10       producing R^-1 instead of the proper in-domain 'one'. Now these
     11       return the appropriate values.
     12 
     13     Also clarifies a few Haddocks, on the suggestions of the same scan.
     14 
     15 - 0.1.6 (2026-08-01)
     16   * The eq_{word,wide,wider}# functions now return a mask, instead of a
     17     bit, inside the resulting Choice value.
     18 
     19 - 0.1.5 (2026-06-07)
     20   * Improves constant-time modular inverse performance on the Montgomery
     21     'Curve' module by about 2x, and on the 'Scalar' module by about 1.5x.
     22 
     23 - 0.1.4 (2026-05-22)
     24   * Adds variable-time comparison functions to Data.Word.Wider.
     25 
     26 - 0.1.3 (2025-12-28)
     27   * Makes some backward-incompatible API tweaks to Data.Choice:
     28 
     29     * 'from_word_mask# is now 'from_full_mask#'
     30     * 'from_word#' is now 'from_bit#'
     31 
     32 - 0.1.2 (2025-12-27)
     33   * Fixes an API mistake made in the v0.1.1 release.
     34 
     35 - 0.1.1 (2025-12-27)
     36   * Contains miscellaneous hardening and API refinements to v0.1.1.
     37 
     38 - 0.1.0 (2025-12-21)
     39   * Initial release, supporting wide, wider, and secp256k1-related
     40     Montgomery-form words with supporting constant-time operations.
     41