Note: Community contributions shared here are not endorsed by the NGA team (unless explicitly stated) for posit compliance.
This is a fast posit C implementation of by S.H. Leong (Cerlane). Currently it supports 16-bit posit with one es bit. Functionalities include add, subtract, divide, multiply, fused-multiply-add, fused-dot-products with quire, square root, conversion of types from double to posit and vice versa, round to nearest integer, convert to 32 bit integer and comparison (less than, less than equal and equal). Square root and round to nearest integer are written in collaboration with J. Gustafson. This software is endorsed by NGA.
This is a parameterized Verilog HDL for Unum Posit number system arithmetic by Manish Kumar Jaiswal .
This is a python implementation of Posits and Quires (Drop-in replacement for IEEE Floats) by Ken Mercardo.
This is a sigmoid function based on posit Julia implementation by Isaac Yonemoto.
This is a fast sigmoid function based on posit C++ implementation by Isaac Yonemoto.
This is a Type II Unum implementiation using Python by Emanuele Ruffaldi.
This is a Type II Unum implementation using C++ by Emanuele Ruffaldi.
This is a Type II Julia implementation by Rex-Computing. Support for this work came in part from the following sources: DARPA Contract D15PC00135 awarded to REX Computing, Inc, DARPA Contract HR0011-17-9-0007 awarded to Etaphase, Inc.
This is a Python implementation of Unum (Pnums) by Jason Merrill. It is based on Type II Unum proposal but have several limitations and differences.
This is a Python port of the Mathematica unum prototype by Jeff Muizelaar.
This is a C implementation by Lawrence Livermore National Laboratory. It is based on Type I Unum and includes functions that support the creation of unums and conversion between unums and primitive 'C' types.
This is a Java implementation by Lawrence Livermore National Laboratory. It is based on Type I Unum.