{
  "name": "bigint-gcd",
  "version": "1.0.46",
  "description": "greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm",
  "main": "gcd.js",
  "type": "module",
  "scripts": {
    "test": "echo \"Error: no test specified\" && exit 1"
  },
  "repository": {
    "type": "git",
    "url": "git+https://github.com/Yaffle/bigint-gcd.git"
  },
  "keywords": [
    "gcd",
    "Euclid",
    "Lehmer",
    "Subquadratic",
    "greatest common divisor",
    "BigInt"
  ],
  "files": [
    "gcd.js",
    "helper64.js"
  ],
  "author": "",
  "license": "SEE LICENSE IN LICENSE",
  "bugs": {
    "url": "https://github.com/Yaffle/bigint-gcd/issues"
  },
  "homepage": "https://github.com/Yaffle/bigint-gcd#readme"
}