Arbitrary-precision arithmetic library for PHP
TFHE-rs: A Pure Rust implementation of the TFHE Scheme for Boolean and Integer Arithmetics Over Encrypted Data.
A Collection Of The State-of-the-art Metaheuristic Algorithms In Python (Metaheuristic/Optimizer/Nature-inspired/Biology)
Python library for arbitrary-precision floating-point arithmetic
Symbolica is a high-performance computer algebra library for Python and Rust. Manipulate large expressions, match patterns, and generate optimized numerical code β at unprecedented speed.
Wolfram Language / Mathematica reimplementation in Rust (Wolfram oxidized)
Libraries for finite field, elliptic curve, and polynomial arithmetic
FLINT (Fast Library for Number Theory)
General Multi-Precision arithmetic for Python (GMP, MPIR, MPFR, MPC)
gnark-crypto provides elliptic curve and pairing-based cryptography on BN, BLS12, BLS24 and BW6 curves. It also provides various algorithms (algebra, crypto) of particular interest to zero knowledge proof systems
An arbitrary-precision arithmetic library for Rust.
Large collection of number systems providing custom arithmetic for mixed-precision algorithm development and optimization for AI, Machine Learning, Computer Vision, Signal Processing, CAE, EDA, control, optimization, estimation, and approximation.
Constantine: modular, high-performance, zero-dependency cryptography stack for verifiable computation, proof systems and blockchain protocols.
Arbitrary verified fast precision floating point arithmetic in Lean, with proofs, optimized backends, and support for IEEE binary and decimal, posits, and custom formats.
Best Online Arithmetic Trainer 2026: Build Fast Math Skills Daily
Master Your Mental Math: The Ultimate Arithmetic Trainer for 2026, Built for Speed and Fluency
Math Trainer 2026: Master Mental Arithmetic with Daily Drills and Progress Analytics
Numtrain 2026: Best Arithmetic Trainer for Fast Mental Math Practice
LLVM 21 pass plugin for AΒ²MBA architectural and anti-generalization hardening of mixed Boolean-arithmetic expressions.
Integer multiplication below n log n: a conditional witness kappa = 6685733/10^10 (> 2^-11) for T(n) = O(n (log n)^(1-kappa)) in the multitape model, building on OpenAI's problem and Colkitt's integer-mult-bounds: certificates, independent replays, Lean 4 checks