{"schema_version":1,"metadata":{"branch":"release","release":"7.9","architecture":"amd64","generated_at":"2026-09-09T04:04:02.361425+00:00","source_url":"https://cdn.openbsd.org/pub/OpenBSD/7.9/packages/amd64/sqlports-7.54.tgz","source_sha256":"2de00144847bf9da3a365be982f101dbb55d591ed7a915ea94984a16ab0e0404","package_count":12059,"source_kind":"sqlports"},"package":{"name":"libtommath-1.3.0","path":"math/libtommath","url":"/packages/release/math/libtommath/","comment":"number theoretic multiple-precision integer library","homepage":"http://libtom.net/","maintainer":"The OpenBSD ports mailing-list <ports@openbsd.org>","description":"LibTomMath is a free open source portable number theoretic multiple-precision\ninteger library written entirely in C. The library is designed to provide a\nsimple to work with API to fairly efficient routines from various branches of\nnumber theory:\n\n * Simple Algebraic\n  - Addition\n  - Subtraction\n  - Multiplication\n  - Squaring\n  - Division\n * Digit Manipulation\n  - Shift left/right whole digits (mult by 2b by moving digits)\n  - Fast multiplication/division by 2 and 2k for k>1\n  - Binary AND, OR and XOR gates\n * Modular Reductions\n  - Barrett Reduction (fast for any p)\n  - Montgomery Reduction (faster for any odd p)\n  - DR Reduction (faster for any restricted p see manual)\n  - 2k Reduction (fast reduction modulo 2p - k for k < MP_MASK and for\n    k > MP_MASK)\n  - The exptmod logic can use any of the five reduction algorithms when\n    appropriate with a single function call.\n * Number Theoretic\n  - Greatest Common Divisor\n  - Least Common Multiple\n  - Jacobi Symbol Computation (falls back to Legendre for prime moduli)\n  - Multiplicative Inverse\n  - Extended Euclidean Algorithm\n  - Modular Exponentiation\n  - Fermat and Miller-Rabin Primality Tests, utility function such as is_prime\n    and next_prime\n * Miscellaneous\n  - Root finding over Z\n  - Pseudo-random integers\n  - Signed and Unsigned comparisons\n * Optimizations\n  - Fast Comba based Multiplier, Squaring and Montgomery routines.\n  - Montgomery, Diminished Radix and Barrett based modular exponentiation.\n  - Karatsuba and Toom-Cook multiplication algorithms.\n  - Many pointer aliasing optimiztions throughout the entire library.\n","package_architecture":"amd64","stem":"libtommath","readme":null,"dependencies":[{"path":"devel/gmake","type":"build","package_spec":"","url":"/packages/release/devel/gmake/"}],"reverse_dependencies":{"count":4,"url":"/packages/data/ea/eac73e6f0955f6c5a479fe657a199b9b206d9de76de08e9df7324da90228d7f3.json"},"categories":["math"],"flavors":[],"only_for_architectures":[],"not_for_architectures":[]}}