pollardsrho/package.json

integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test

{
  "name": "pollardsrho",
  "version": "1.0.9",
  "description": "integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test",
  "main": "PollardsRho.js",
  "scripts": {
    "compile1": "asc PollardsRho64.ts --outFile PollardsRho64.wasm --bindings raw -O3 --runtime stub --noExportMemory",
    "compile2": "asc isProbablyPrime64.ts --outFile isProbablyPrime64.wasm --bindings raw -O3 --runtime stub --noExportMemory",
    "compile3": "asc isPrime64.ts --outFile isPrime64.wasm --bindings raw -O3 --runtime stub --noExportMemory",
    "build1": "node ./build.js PollardsRho64",
    "build2": "node ./build.js isProbablyPrime64",
    "build3": "node ./build.js isPrime64",
    "test": "echo \"Error: no test specified\" && exit 1"
  },
  "repository": {
    "type": "git",
    "url": "git+https://github.com/Yaffle/PollardsRho.git"
  },
  "keywords": [
    "integer",
    "factorization",
    "Pollard's",
    "rho",
    "algorithm",
    "Miller",
    "Rabin",
    "prime",
    "testing"
  ],
  "author": "",
  "bugs": {
    "url": "https://github.com/Yaffle/PollardsRho/issues"
  },
  "homepage": "https://github.com/Yaffle/PollardsRho#readme",
  "devDependencies": {
    "assemblyscript": "^0.27.25"
  },
  "type": "module"
}