fixed

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

commit e9498b179a8c88328af5f0c1518870bd1b5dd42e
parent b35970d2b8b04d934d1cab7e93e6aafe27d020fb
Author: Jared Tobin <jared@jtobin.io>
Date:   Fri, 26 Dec 2025 13:12:10 -0330

readme: blurb that got left behind

Diffstat:
MREADME.md | 17+++++++++--------
1 file changed, 9 insertions(+), 8 deletions(-)

diff --git a/README.md b/README.md @@ -155,17 +155,18 @@ exp curve: M(2) ^ 2 40 0 curve: M(2) ^ (2 ^ 255 - 19) 40 0 -sqrt +sqrt_vartime - Case Allocated GCs - curve: sqrt M(2) 56 0 - curve: sqrt M(2 ^ 255 - 19) 56 0 + Case Allocated GCs + curve: sqrt_vartime M(2) 56 0 + curve: sqrt_vartime M(2 ^ 255 - 19) 56 0 ``` -Note that 'sqrt' for example allocates 16 additional bytes as it returns -a value of type 'Maybe Montgomery', which involves allocating a Just -constructor and a pointer to its payload (the analogous function in the -unboxed API, 'sqrt#', avoids allocation by returning an unboxed sum). +Note that `sqrt_vartime` for example allocates 16 additional bytes +as it returns a value of type 'Maybe Montgomery', which involves +potentially allocating a Just constructor and a pointer to its payload +(the analogous function in the unboxed API, 'sqrt#', avoids allocation +by returning an unboxed sum). You can compile with GHC's LLVM backend and filter on specific benchmarks via e.g.: