dankogai/swift-bigint-gmp
BigInt Implementation via the [GNU Multiple Precision Arithmetic Library]
Synopsis
import GMPBigInt
// Integer literals of any size, thanks to StaticBigInt
let n: GMPBigInt = 123456789012345678901234567890123456789012345678901234567890
// A full SignedInteger: use it like any Swift integer
let fact100 = (1...100).map { GMPBigInt($0) }.reduce(1, *)
GMPBigInt(2).power(128) // 340282366920938463463374607431768211456
(GMPBigInt(1) << 100) >> 100 // 1
GMPBigInt("deadbeef", radix: 16)! // 3735928559
fact100.toString(radix: 36) // "1cnfrwcnvxbzzicfd6…"
Int(GMPBigInt(42)) // 42 — stdlib conversions just work
Double(GMPBigInt(1) << 100) // 1.2676506002282294e+30Prerequisite: GMP
GMP is found through pkg-config:
sudo port install gmp # MacPorts
brew install gmp # Homebrew
sudo apt-get install libgmp-dev # Debian/UbuntuHomebrew and apt installations are found automatically. MacPorts keeps its gmp.pc off SwiftPM's search path, so point PKG_CONFIG_PATH at it:
PKG_CONFIG_PATH=/opt/local/lib/pkgconfig swift testUsage
Add to your Package.swift:
.package(url: "https://github.com/dankogai/swift-bigint-gmp.git", branch: "main")and import GMPBigInt.
Features
GMPBigIntconforms toSignedInteger(henceBinaryInteger,Numeric,
Comparable, Hashable, Strideable…), so it works with generic integer algorithms out of the box.
- Integer literals use
StaticBigInt— no precision loss, no strings needed. - Swift semantics throughout:
/truncates toward zero,%takes the
dividend's sign, >> is an arithmetic (smart) shift, division by zero traps.
- String conversion to and from any radix in
2...36. - Exact conversions to and from
BinaryIntegerandBinaryFloatingPoint
types, including two's-complement words for stdlib interop.
power(_:)viampz_pow_ui, and modular exponentiation
power(_:mod:) via mpz_powm with swift-bignum-compatible semantics (least non-negative residue; a negative exponent takes the modular inverse).
greatestCommonDivisor(with:)andsquareRoot()(integer square
root, floor), named and behaving like their swift-bignum and attaswift/BigInt counterparts.
- The whole primality kit, ported from swift-bignum with identical
verdicts: isPrime is tri-state — false and true are proofs (below 2⁶⁴ via exhaustively-verified [Baillie-PSW], below [A014233]'s last entry ≈3.3 × 10²⁴ via thirteen Miller-Rabin bases, or for any Mersenne number via Lucas-Lehmer), nil means "probably prime, unproven" with isProbablePrime (BPSW) holding that opinion and isSurelyPrime giving both halves at once. The building blocks are public too: millerRabinTest(base:), isLucasProbablePrime, isMersennePrime, and jacobiSymbol(_:). nextPrime/prevPrime walk to the neighboring primes (on the probable test, so they terminate at any size), and GMPBigInt.primes is the endless lazy sequence of them: Array(GMPBigInt.primes.prefix(5)) is [2, 3, 5, 7, 11].
[Baillie-PSW]: https://en.wikipedia.org/wiki/Baillie%E2%80%93PSW_primality_test
[A014233]: https://oeis.org/A014233
Codable(encoded as a decimal string).- Thread-safe: every value's
mpz_tis written once and never mutated,
and GMP is safe for concurrent reads.
- Works on macOS and Linux — anywhere GMP does.
Performance
GMP is the library other bignums measure themselves against, and it shows: GMPBigInt is the fastest of the four libraries benchmarked ([JSCBigInt], [attaswift/BigInt], [dankogai/swift-bignum]) on every case except many-tiny-ops — often by one to two orders of magnitude (isqrt of a 20k-digit number: 200–1000×). See Benchmark.md for numbers and the Benchmarks/ harness.
[JSCBigInt]: https://github.com/dankogai/swift-bigint-javascriptcore [attaswift/BigInt]: https://github.com/attaswift/BigInt
SwiftBigNumExample
SwiftBigNumExample shows GMPBigInt riding [dankogai/swift-bignum]'s generic machinery: Rational<GMPBigInt> and BigFloatOf<GMPBigInt> — BigRat and BigFloat with GMP digits — via two retroactive conformances.
Prerequisite
Swift 5.9 or better, macOS 14 or later, GMP.
License
MIT. See LICENSE.
Package Metadata
Repository: dankogai/swift-bigint-gmp
Default branch: main
README: README.md