{"_id":"bigint","_rev":"81-da7f92b4e993bffe40b626d9ca99e53b","name":"bigint","description":"Arbitrary-precision integer arithmetic using libgmp","dist-tags":{"latest":"0.4.2"},"versions":{"0.0.1":{"name":"bigint","version":"0.0.1","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index","repository":{"type":"git","url":"http://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0"},"scripts":{"test":"expresso","preinstall":"node-waf clean configure build"},"license":"MIT/X11","engine":["node >=0.2.0"],"_id":"bigint@0.0.1","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.2.16","_nodeVersion":"v0.3.8-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"2cb1e03203214566c9a513f5775da6dff94ac392","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.1.tgz","integrity":"sha512-DXUbQ7yx5yimdz9NWxoMNLcnK5xR14ddjqP9vH+wiEB2pYqgO3CXSMWHEHuDw1Aidxgid/xHqQU5GQkRyEJogQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFzF2KxNHnTnRI0DKnqwcTDkeRaTVWEFSfLH4Bv3cGsvAiB95gqeKFrAjSYMkeT9vHDv+l1kHJj7uaI3p4kw2dTHGQ=="}]}},"0.0.2":{"name":"bigint","version":"0.0.2","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index","repository":{"type":"git","url":"http://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0"},"scripts":{"test":"expresso","preinstall":"node-waf clean || true; node-waf configure build"},"license":"MIT/X11","engine":["node >=0.2.0"],"_id":"bigint@0.0.2","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.2.18","_nodeVersion":"v0.3.8-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"bd47ff80ab7e47cfa203af358e1d86293da83f8d","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.2.tgz","integrity":"sha512-5h4kljZeWxb5QGJ02czNy+xutu/GwvFa1vr8TFK3eiF6ZYYbLOfOjNUQeRGJuT/maoCbaM9Fp3whlm3I54FLDQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHilP3OBvnwSCOUnzagwzGpeu5Uf5b6sGZ+9CJZE9swHAiBuqKeud7a8ityhkRCyPjfds7tyHVN0G5M9t98oHw5IlA=="}]}},"0.0.5":{"name":"bigint","version":"0.0.5","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index","repository":{"type":"git","url":"http://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"test":"expresso","preinstall":"node-waf clean || true; node-waf configure build"},"license":"MIT/X11","engine":["node >=0.2.0"],"_id":"bigint@0.0.5","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.2.18","_nodeVersion":"v0.3.8-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"e0676881aa2eb25dc741124da3b6c28dbe1cbf1a","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.5.tgz","integrity":"sha512-6U/DCUIS7gHbK08uhD7ut5sL/I9lb6d5170lMk4ai75+z9+iLwIzUGUzhi+BIUfm7NQJu3G67BvQ9GNbjaVCNA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC4sxFowb/ooGWpH4tOCRFi+UxLx+Ac08vVTq+XgaGxagIgXnLCbbQBT1nvSnEq+AXnGf8AEKywnN9HK7ZJzIut+Zc="}]}},"0.0.6":{"name":"bigint","version":"0.0.6","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index","repository":{"type":"git","url":"http://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"test":"expresso","preinstall":"node-waf clean || true; node-waf configure build"},"license":"MIT/X11","engine":["node >=0.2.0"],"_id":"bigint@0.0.6","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.2.18","_nodeVersion":"v0.3.8-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"d0000be1b60d0ef3bdd7d725e1e4c9a53611c5fa","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.6.tgz","integrity":"sha512-pE9d+91ypQ2kNmKyCnROxsRSOe/c0gYZQjBLoJzNp5957lAbW+E8GkqU08VpDS5XX1ZBv+11grULTF1RjY1i2g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICeD/JVglKpGPIQyjZ+d9E/13oRBql2Ew8WKVv7KNz1gAiEAxnOL6d79VCghg582j8BL5G5B8aR2IePOm7myIHNWWlQ="}]}},"0.0.7":{"name":"bigint","version":"0.0.7","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"test":"expresso","preinstall":"node-waf clean || true; node-waf configure build"},"license":"MIT/X11","engine":["node >=0.2.0"],"_id":"bigint@0.0.7","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.3","_nodeVersion":"v0.5.0-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"f0785d997a856090d7b9be956885dc00596a81c9","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.7.tgz","integrity":"sha512-K+kMpHA8Ou+gsxb95O/3O9RiTiBav3opLuRGtdobIxUqMCzBmdJmI1Q+1TZdyXGm/9cn1hqnNSeW2EQ0VUDNkg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIADSsVClu+9i1+/7Xvm9PdZL7WNnwwPO3r7IkMK8XIbCAiEAh2cHMb+azq7YFh8b8KxYO7Rl+wBwtPbPgJRsBrNJ3bg="}]}},"0.0.8":{"name":"bigint","version":"0.0.8","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"test":"expresso","preinstall":"node-waf clean || true; node-waf configure build"},"license":"MIT/X11","engine":["node >=0.2.0"],"_id":"bigint@0.0.8","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.3","_nodeVersion":"v0.5.0-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"3847feea8375b6aaf619ee85cdf631b2c6882d69","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.8.tgz","integrity":"sha512-dNGcd+atAO5/luheD6aQF1Z3PuWBP7XiWHXhHDFzxzSr5f8v/eTdVaJiRaK/uBz9j5vsF8fPqb0h0dpvInQE2g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC+oy8mvXsDeTzU0Z/UuegrZxH1KCJPiAF1KOX8ErZ/TgIgBaN8pTwix4d0kTfLczJLr7A8ly7rcV2anHTaYChSb4g="}]}},"0.0.9":{"name":"bigint","version":"0.0.9","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"test":"expresso","preinstall":"node-waf clean || true; node-waf configure build"},"license":"MIT/X11","engine":["node >=0.2.0"],"_id":"bigint@0.0.9","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.7","_nodeVersion":"v0.5.0-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"a0028cc1ddec18288bbb628f150cd10c8aacd0f0","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.9.tgz","integrity":"sha512-XCUX1o1T5U6YqfnbE/qybCn4+hjZsy/bU8P2Z1Qm+NFCUXWwmufzzXxDfD6js5lYslP5YJCDxeHYQ/q64sX0Gg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCVoq4uywMqlZERn9R4BaaC47Ey232EryWXvV6xAk036wIgJW3jnfS2IB39bgJb7EoSTMAxRVplB6RqUJW4p3Aa6RY="}]}},"0.0.10":{"name":"bigint","version":"0.0.10","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.0.10","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.7","_nodeVersion":"v0.5.0-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"85b84f3d81187f6ee674b013e724c90f18a45c90","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.10.tgz","integrity":"sha512-SAjszWcXUx9piN4Vm82PmrUBMowg2ptI63VNtY4z/pfxnHSC1morn2Z69w0+flNmBNYADwotxeY7biUAeZ8Z2g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQD5zH8KnjUMQvTBGov7XyyD2yvUXPHtkB3jpQMInGt+6AIhAOSD2sHJ+wPjJG9qqoX2EHLlNaFLqER8dJi1NPoHZ2ze"}]}},"0.0.11":{"name":"bigint","version":"0.0.11","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.0.11","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.7","_nodeVersion":"v0.5.0-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"2d98a331503fa2178085bdfe54eaf6d750d1c570","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.11.tgz","integrity":"sha512-hOTtKGTyAT+C2FtkDEp1D1IDO+Emd2SVXshm20GhZ5uNq+q0uS3sQaw/ccy31bL2Y9mFeYHjaPesYfzQC3ofkQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC71vng7XoPjOkMih/8q5aYdh6bkH+BSW2UUQEDvXudNwIgHtPEstRWiAjVPXi33xgV/yao46vslWvjvn+QmwzZu5E="}]}},"0.0.12":{"name":"bigint","version":"0.0.12","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.0.12","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.7","_nodeVersion":"v0.5.0-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"6ccdf177007c5410acf1fd8ade51c2c67054a327","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.0.12.tgz","integrity":"sha512-cwaF+59Ikumn/SWA+zAoijBUpimjUF+t17yMoO0qGOsafzPrQOHrynHuv4KLHs+zD9FoESz/jcSK7ukmrZJXsA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEIqzOT/eaONT1PfocQR5dceyCRspoJlh8GJETAW7FFYAiEAhokqATwvQbL7n2pQM+EYEzpSJcw2csrfg/vNmyfCpY8="}]}},"0.1.0":{"name":"bigint","version":"0.1.0","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"dependencies":{"node-ffi":">=0.2.0"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.1.0","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.7","_nodeVersion":"v0.5.0-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"9065a359c39d66ae783ddf1d4f7ac36d211a2b27","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.1.0.tgz","integrity":"sha512-mNfsJ4FgyH6tXT7bfiEQCbr33YT0rRTsr8K/5o81y49r9tcDvAQYnnmkvaIzqyd0wkvSvUOgOsUKQI+7qGFKKA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC8C9IdAU1zqWv5cIkL3SWP1j+UFVO1o3g98ti2B4oPRQIgJzBjoBlVTAcOUBP1xYM8LUIJk46WEKuQCfcZMLlP8KA="}]}},"0.2.0":{"name":"bigint","version":"0.2.0","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.2.0","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.15","_nodeVersion":"v0.5.0-pre","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"366b7dad2d85aa01bd6316e71bc8604bedb68aaa","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.2.0.tgz","integrity":"sha512-O8uwUYh9KTss1QCdz9ug1IFPHCx2Hselpaq2qaRZmpPye4f1HDBiZ+fHns4lnWTpDLV4ZyI7ztTRyBIHWHlX+Q==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEF4kna3Ij8+yHobBEo4Qtm68XEN/jPcDe+5V22JkmoBAiAGeAKleBm00aYZM8qV2IPum+9e8jN14Q36s+jEsqQPCg=="}]}},"0.2.1":{"name":"bigint","version":"0.2.1","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.2.1","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.15","_nodeVersion":"v0.4.2","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"10b61aa42045ccad04e7681e32f89eaac9f59e47","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.2.1.tgz","integrity":"sha512-g52fMgv2wBLI6GNn4l8z/NTSA6AwIxRwjzp94iMO0rL8eWJIGOXuPoJ4nLXqm6kqbbFY+PsN4tgXhFX7z4wtWA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGBuJjVOfIq32vk+LpNq7LX7/DL3WFeFF2nDV3Vv3MGcAiAC+h5X5NCL+C3OSijlcTOZvIlpKLGhHKBwLzQINkmNkg=="}]}},"0.2.2":{"name":"bigint","version":"0.2.2","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.2.2","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.15","_nodeVersion":"v0.4.2","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"5bb0f1cd0b86f27f8b77b07eeaaec779e3d329e5","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.2.2.tgz","integrity":"sha512-rAhQz9JZS2JVt9Giw+I2f8JuM3Hog+XVjwXglWb6yz46w7kVOjlVVQuKasL946oPNI6P716Mz6NXrdLRp3GiBQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDQLfxwhBXWgqlTW9NVH6J0eBwpxB+MBjlQluIRwQbtaAiEAnfBpCmWGLengvFK4UbPevM8lO1/Cw33QDiMK1fbORag="}]}},"0.3.0":{"name":"bigint","version":"0.3.0","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.3.0","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.15","_nodeVersion":"v0.4.2","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"8295a980f1064f0221253df13cf62dcc5b9b7b00","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.0.tgz","integrity":"sha512-y4YIlk/L+H6YtJxhqqeC7jJefWAllVgSzUkq99IJCBBFldY+3uPgrXlpqSm3xjhzLMhZRSRdOuEr2pXmjwrZYA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDkIQvIdY9XL8i7kNbERpD9oCexLF/XhQX9cnTs30DPyQIhANKFai//rLhtdBxsVaMCUpq6O/ECgu/hcfhqHU97rWir"}]}},"0.3.1":{"name":"bigint","version":"0.3.1","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.3.1","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"0.3.18","_nodeVersion":"v0.4.2","directories":{},"files":[""],"_defaultsLoaded":true,"dist":{"shasum":"0e68b62ee7cce3d9192dbb2c19666f6712e1b152","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.1.tgz","integrity":"sha512-ynzZdc5y6uQ1Bksje2PNXivdX89KJUcXSCUNqhD+8kV8Ua+RZY+2bPTpgrg3k3JogSQbpHOLUV7vZp2uxpAR9Q==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDHyI+7Rs5PtWawl3WMZ24OEzqvMiSXYN7scS+EmGaDWgIgYqapbHDK4pr2jRbReA/fBBeBMey5J7sQKs8wAWkzQxU="}]}},"0.3.2":{"name":"bigint","version":"0.3.2","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"dependencies":{},"_id":"bigint@0.3.2","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.0.1rc7","_nodeVersion":"v0.5.0-pre","_defaultsLoaded":true,"dist":{"shasum":"9e323f2b3329422c38ad0eea0159b59e85ddf91e","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.2.tgz","integrity":"sha512-ie5Yoyux1JgRO8EyM1U8r5wVAGSKfS0ZgU6CIA84tvsQjvY+qb+NWq1UGaIh5gEQbWRcxHge5RNEuSG1JgjNcw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCDE/7Jv2LFJvHDa81a+X5K/wvo3+TJ8B1TRhb932BSMwIgVr473z2MuyIpWp8C9s8eANGQUJbZci2iUZbs07wg40c="}]},"directories":{}},"0.3.3":{"name":"bigint","version":"0.3.3","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"dependencies":{},"_id":"bigint@0.3.3","engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.0.1rc8","_nodeVersion":"v0.4.2","_defaultsLoaded":true,"dist":{"shasum":"d2a59570da4d0dd7213540f9886ffa8c6cb6efe1","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.3.tgz","bin":{"0.4-sunos-5.11":{"shasum":"408f8246ed8c5f42edeec1eb3941810ef397e16a","tarball":"http://registry.npmjs.org/bigint/-/bigint-0.3.3-0.4-sunos-5.11.tgz"}},"integrity":"sha512-0S/fPL/h8eOC+jHF6Mqjem6Y52k/UlP5qNPD0avT+dZv8JAkchTK5zNS422gc5i4imbMc8Wxjv1URxPeOCPUBg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICd89yBT0JPbYbs/q7JdLh74NvoDPJeVOgRj0EBmuWXoAiA01zOB8rxp9e1epjQ1rTf1Qatlil0G6I2GtdGYanictQ=="}]},"directories":{}},"0.3.4":{"name":"bigint","version":"0.3.4","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.3.4","dependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.0.10","_nodeVersion":"v0.5.0-pre","_defaultsLoaded":true,"dist":{"shasum":"58de903d678cba603ab8919c6d657f4475059ac6","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.4.tgz","integrity":"sha512-1nVcdWW1XMw0Qf5d2bahxuP3q8xGj3NequYpq1q0/dZsBxTumNRcQtIiPsbZBAZnKPbdwPe7lQ+cwRuhzh4ksg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDekrNMCWumBbfW0D2LXhz+zED03CBybJJw362RJfDmmQIhALkxUC61LbzFGgiw72+lVHk7HhcCl3GHh7j+kDDHnrXU"}]},"maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}},"0.3.5":{"name":"bigint","version":"0.3.5","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7"},"scripts":{"install":"node-waf configure build"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"_id":"bigint@0.3.5","dependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.0.10","_nodeVersion":"v0.5.0-pre","_defaultsLoaded":true,"dist":{"shasum":"297059f4b227b2a653f8ec75bb041b422c6b94e7","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.5.tgz","integrity":"sha512-SFLu7SMK6QZXYBPdnTqEKnlB+isskDMI0rmYXoa/AuwoMgjHXFgJH0E0y+PUr7XfR+ICrs5vOqS7aLb0eugbHA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEg5QXKQ8FNYq33FtADO5H+k9I8z6dEgK7q6tC+t8+4bAiEAme3lb5k0pfkS6l9T9BQdCUSa/i5lUiptdlF8TFpmPMU="}]},"maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}},"0.3.6":{"name":"bigint","version":"0.3.6","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7","put":">=0.0.5"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"scripts":{"install":"node-waf configure build","test":"expresso"},"_id":"bigint@0.3.6","dependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.0.10","_nodeVersion":"v0.5.0-pre","_defaultsLoaded":true,"dist":{"shasum":"34ca8ca6334c378f33960b59f24f91710daf7707","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.6.tgz","integrity":"sha512-BVm4z29tkPv+FkOqsVigS9tCEttWM9ht/ezoQnjRlLygcCrRlBrJd91jefpeShMI3wrOlUjg1ydAPj9MG/lK0g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICs2oGT2Q2CTpKSfUoDCyQ+44IYqW4xmTWiswud7Tgs3AiAe0nvbUtJbVKPE7PZ4INIM9ZeP2SxrAPzIPO3Cfrlaug=="}]},"maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}},"0.3.7":{"name":"bigint","version":"0.3.7","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7","put":">=0.0.5"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"scripts":{"install":"node-waf configure build","test":"expresso"},"_npmJsonOpts":{"file":"/home/substack/.npm/bigint/0.3.7/package/package.json","contributors":false,"serverjs":false,"wscript":true},"_id":"bigint@0.3.7","dependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.0.30","_nodeVersion":"v0.4.12","_defaultsLoaded":true,"dist":{"shasum":"392be9f97cde8ac4ede4f6cc1f0b607bb01479e1","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.7.tgz","integrity":"sha512-wQwy3o8St4MgpI5hzwisrG3NJiiSSij0VZSZ8ITtfjL0KG49eEEZqRg/sOMPj7uabR4OJeIdrk/iuA8ThlSGaA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDZoNeyI2xGq01itRDAjhg77tflnhCi2s7zCC1hnuZz+AIhAOEY8tVFo4zfxIxi919GZgRqobT4fEyVHp7fMgGxiGn3"}]},"maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}},"0.3.8":{"name":"bigint","version":"0.3.8","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"expresso":">=0.6.0","binary":">=0.1.7","put":">=0.0.5"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"scripts":{"install":"node-waf configure build","test":"expresso"},"_npmUser":{"name":"substack","email":"mail@substack.net"},"_id":"bigint@0.3.8","dependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.0.106","_nodeVersion":"v0.4.12","_defaultsLoaded":true,"dist":{"shasum":"c1c9d902c24db37eccdbfdf5a163a9b0347c662b","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.8.tgz","integrity":"sha512-PCDcCk6c4iPDvQyRHvYGZT0ipTNH2sdiVyMa3WdxQWJCZWj7bxCOviJ2839/dNkQXX6QXakJX3EaF6QlxdXadg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCCxHXUXREiLgQIzCglthUqIwjJUNFZ6S8SItVKiOZPKwIhAMyAmG07cDEaXNHtKv8xxMn0rWEL/NhZuTYqL049ZKTP"}]},"maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}},"0.3.9":{"name":"bigint","version":"0.3.9","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"git://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"tap":"~0.2.5","put":"~0.0.6"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"scripts":{"install":"node-waf configure build","test":"tap test/*.js"},"_npmUser":{"name":"substack","email":"mail@substack.net"},"_id":"bigint@0.3.9","dependencies":{},"optionalDependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.1.19","_nodeVersion":"v0.6.11","_defaultsLoaded":true,"dist":{"shasum":"0e32f5f685001a74b45d4fd9dd2e6fcbac335422","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.3.9.tgz","integrity":"sha512-L8IR15Ai2oQvn1S6k29C6acQ5A/RZKswpbGPp/ioEHIQW82O2fEXmy1A80zzNkjaIi6qT2crD3IK9VLK/0jJxA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQD5eTLSQMs7hUESY3fgEzPdb9r2+VZO/cp5cw52sWmeDAIhAKWYxRO6/3MZ8fI4uMsQ+gVP7FssjBqsVaCSsg1f9FiX"}]},"readme":"","maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}},"0.4.0":{"name":"bigint","version":"0.4.0","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"http://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"tap":"~0.2.5","put":"~0.0.6"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"scripts":{"install":"node-gyp configure build","test":"tap test/*.js"},"readme":"bigint\n======\n\nArbitrary precision integral arithmetic for node.js!\n\n[![build status](https://secure.travis-ci.org/substack/node-bigint.png)](http://travis-ci.org/substack/node-bigint)\n\nThis library wraps around [libgmp](http://gmplib.org/)'s\n[integer functions](http://gmplib.org/manual/Integer-Functions.html#Integer-Functions)\nto perform infinite-precision arithmetic.\n\nYou should also consider using\n[bignum](https://github.com/justmoon/node-bignum),\nwhich is based on the bigint api but uses openssl instead of libgmp,\nwhich you are more likely to already have on your system.\n\nexample\n=======\n\nsimple.js\n---------\n\n    var bigint = require('bigint');\n    \n    var b = bigint('782910138827292261791972728324982')\n        .sub('182373273283402171237474774728373')\n        .div(8)\n    ;\n    console.log(b);\n\n***\n    $ node simple.js\n    <BigInt 75067108192986261319312244199576>\n\nperfect.js\n----------\n\nGenerate the perfect numbers:\n\n    // If 2**n-1 is prime, then (2**n-1) * 2**(n-1) is perfect.\n    var bigint = require('bigint');\n\n    for (var n = 0; n < 100; n++) {\n        var p = bigint.pow(2, n).sub(1);\n        if (p.probPrime(50)) {\n            var perfect = p.mul(bigint.pow(2, n - 1));\n            console.log(perfect.toString());\n        }\n    }\n\n***\n\n    6\n    28\n    496\n    8128\n    33550336\n    8589869056\n    137438691328\n    2305843008139952128\n    2658455991569831744654692615953842176\n    191561942608236107294793378084303638130997321548169216\n\nmethods[0]\n==========\n\nbigint(n, base=10)\n------------------\n\nCreate a new `bigint` from `n` and a base. `n` can be a string, integer, or\nanother `bigint`.\n\nIf you pass in a string you can set the base that string is encoded in.\n\n.toString(base=10)\n------------------\n\nPrint out the `bigint` instance in the requested base as a string.\n\nbigint.fromBuffer(buf, opts)\n----------------------\n\nCreate a new `bigint` from a `Buffer`.\n\nThe default options are:\n    {\n        order : 'forward', // low-to-high indexed word ordering\n        endian : 'big',\n        size : 1, // number of bytes in each word\n    }\n\nNote that endian doesn't matter when size = 1.\n\nmethods[1]\n==========\n\nFor all of the instance methods below you can write either\n\n    bigint.method(x, y, z)\n\nor if x is a `bigint` instance``\n\n    x.method(y, z)\n\n.toNumber()\n-----------\n\nTurn a `bigint` into a `Number`. If the `bigint` is too big you'll lose\nprecision or you'll get ±`Infinity`.\n\n.toBuffer(opts)\n-------------\n\nReturn a new `Buffer` with the data from the `bigint`.\n\nThe default options are:\n    {\n        order : 'forward', // low-to-high indexed word ordering\n        endian : 'big',\n        size : 1, // number of bytes in each word\n    }\n\nNote that endian doesn't matter when size = 1.\n\n.add(n)\n-------\n\nReturn a new `bigint` containing the instance value plus `n`.\n\n.sub(n)\n-------\n\nReturn a new `bigint` containing the instance value minus `n`.\n\n.mul(n)\n-------\n\nReturn a new `bigint` containing the instance value multiplied by `n`.\n\n.div(n)\n-------\n\nReturn a new `bigint` containing the instance value integrally divided by `n`.\n\n.abs()\n------\n\nReturn a new `bigint` with the absolute value of the instance.\n\n.neg()\n------\n\nReturn a new `bigint` with the negative of the instance value.\n\n.cmp(n)\n-------\n\nCompare the instance value to `n`. Return a positive integer if `> n`, a\nnegative integer if `< n`, and 0 if `== n`.\n\n.gt(n)\n------\n\nReturn a boolean: whether the instance value is greater than n (`> n`).\n\n.ge(n)\n------\n\nReturn a boolean: whether the instance value is greater than or equal to n\n(`>= n`).\n\n.eq(n)\n------\n\nReturn a boolean: whether the instance value is equal to n (`== n`).\n\n.lt(n)\n------\n\nReturn a boolean: whether the instance value is less than n (`< n`).\n\n.le(n)\n------\n\nReturn a boolean: whether the instance value is less than or equal to n\n(`<= n`).\n\n.and(n)\n-------\n\nReturn a new `bigint` with the instance value bitwise AND (&)-ed with `n`.\n\n.or(n)\n------\n\nReturn a new `bigint` with the instance value bitwise inclusive-OR (|)-ed with\n`n`.\n\n.xor(n)\n-------\n\nReturn a new `bigint` with the instance value bitwise exclusive-OR (^)-ed with\n`n`.\n\n.mod(n)\n-------\n\nReturn a new `bigint` with the instance value modulo `n`.\n\n`m`.\n.pow(n)\n-------\n\nReturn a new `bigint` with the instance value raised to the `n`th power.\n\n.powm(n, m)\n-----------\n\nReturn a new `bigint` with the instance value raised to the `n`th power modulo\n`m`.\n\n.invertm(m)\n-----------\n\nCompute the multiplicative inverse modulo `m`.\n\n.rand()\n-------\n.rand(upperBound)\n-----------------\n\nIf `upperBound` is supplied, return a random `bigint` between the instance value\nand `upperBound - 1`, inclusive.\n\nOtherwise, return a random `bigint` between 0 and the instance value - 1,\ninclusive.\n\n.probPrime()\n------------\n\nReturn whether the bigint is:\n\n* certainly prime (true)\n* probably prime ('maybe')\n* certainly composite (false)\n\nusing [mpz_probab_prime](http://gmplib.org/manual/Number-Theoretic-Functions.html).\n\n.nextPrime()\n------------\n\nReturn the next prime greater than `this` using\n[mpz_nextprime](http://gmplib.org/manual/Number-Theoretic-Functions.html).\n\n.sqrt()\n-------\n\nReturn a new `bigint` that is the square root.  This truncates.\n\n.root(n)\n--------\n\nReturn a new `bigint` that is the `nth` root.  This truncates.\n\n.shiftLeft(n)\n-------------\n\nReturn a new `bigint` that is the `2^n` multiple. Equivalent of the `<<`\noperator.\n\n.shiftRight(n)\n--------------\n\nReturn a new `bigint` of the value integer divided by\n`2^n`. Equivalent of the `>>` operator.\n\n.gcd(n)\n-------\n\nReturn the greatest common divisor of the current bigint with `n` as a new\nbigint.\n\n.bitLength()\n------------\n\nReturn the number of bits used to represent the current bigint as a javascript\nNumber.\n\ninstall\n=======\n\nYou'll need the libgmp source to compile this package. Under Debian-based systems,\n\n    sudo aptitude install libgmp3-dev\n\nOn a Mac with [Homebrew](https://github.com/mxcl/homebrew/),\n\n    brew install gmp\n\nAnd then install with [npm](http://npmjs.org):\n\n    npm install bigint\n","readmeFilename":"README.markdown","_id":"bigint@0.4.0","dist":{"shasum":"d5e5974b866e00b9095ef5bf9a23eb3abc2fc6ed","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.4.0.tgz","integrity":"sha512-f80MpMVqByBrvSruUNp4ySmS9jO5zVNctHFjKvfDaHM/txiZZsV3OO4TQxjYaNuVwVzZVFz58GAxerWOuDfVGw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIGJko8fBHouvF4dSwfZHG/vAqyJOfqlN8PGLWUYSu/SLAiEAr/6P91baWv+IykW+tBhc/vUEty0XRK2ArXq2saz1lwY="}]},"_from":".","_npmVersion":"1.2.2","_npmUser":{"name":"substack","email":"mail@substack.net"},"maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}},"0.4.1":{"name":"bigint","version":"0.4.1","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"http://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"tap":"~0.2.5","put":"~0.0.6"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"scripts":{"install":"node-gyp configure build","test":"tap test/*.js"},"readme":"bigint\n======\n\nArbitrary precision integral arithmetic for node.js!\n\n[![build status](https://secure.travis-ci.org/substack/node-bigint.png)](http://travis-ci.org/substack/node-bigint)\n\nThis library wraps around [libgmp](http://gmplib.org/)'s\n[integer functions](http://gmplib.org/manual/Integer-Functions.html#Integer-Functions)\nto perform infinite-precision arithmetic.\n\nYou should also consider using\n[bignum](https://github.com/justmoon/node-bignum),\nwhich is based on the bigint api but uses openssl instead of libgmp,\nwhich you are more likely to already have on your system.\n\nexample\n=======\n\nsimple.js\n---------\n\n    var bigint = require('bigint');\n    \n    var b = bigint('782910138827292261791972728324982')\n        .sub('182373273283402171237474774728373')\n        .div(8)\n    ;\n    console.log(b);\n\n***\n    $ node simple.js\n    <BigInt 75067108192986261319312244199576>\n\nperfect.js\n----------\n\nGenerate the perfect numbers:\n\n    // If 2**n-1 is prime, then (2**n-1) * 2**(n-1) is perfect.\n    var bigint = require('bigint');\n\n    for (var n = 0; n < 100; n++) {\n        var p = bigint.pow(2, n).sub(1);\n        if (p.probPrime(50)) {\n            var perfect = p.mul(bigint.pow(2, n - 1));\n            console.log(perfect.toString());\n        }\n    }\n\n***\n\n    6\n    28\n    496\n    8128\n    33550336\n    8589869056\n    137438691328\n    2305843008139952128\n    2658455991569831744654692615953842176\n    191561942608236107294793378084303638130997321548169216\n\nmethods[0]\n==========\n\nbigint(n, base=10)\n------------------\n\nCreate a new `bigint` from `n` and a base. `n` can be a string, integer, or\nanother `bigint`.\n\nIf you pass in a string you can set the base that string is encoded in.\n\n.toString(base=10)\n------------------\n\nPrint out the `bigint` instance in the requested base as a string.\n\nbigint.fromBuffer(buf, opts)\n----------------------\n\nCreate a new `bigint` from a `Buffer`.\n\nThe default options are:\n    {\n        order : 'forward', // low-to-high indexed word ordering\n        endian : 'big',\n        size : 1, // number of bytes in each word\n    }\n\nNote that endian doesn't matter when size = 1.\n\nmethods[1]\n==========\n\nFor all of the instance methods below you can write either\n\n    bigint.method(x, y, z)\n\nor if x is a `bigint` instance``\n\n    x.method(y, z)\n\n.toNumber()\n-----------\n\nTurn a `bigint` into a `Number`. If the `bigint` is too big you'll lose\nprecision or you'll get ±`Infinity`.\n\n.toBuffer(opts)\n-------------\n\nReturn a new `Buffer` with the data from the `bigint`.\n\nThe default options are:\n    {\n        order : 'forward', // low-to-high indexed word ordering\n        endian : 'big',\n        size : 1, // number of bytes in each word\n    }\n\nNote that endian doesn't matter when size = 1.\n\n.add(n)\n-------\n\nReturn a new `bigint` containing the instance value plus `n`.\n\n.sub(n)\n-------\n\nReturn a new `bigint` containing the instance value minus `n`.\n\n.mul(n)\n-------\n\nReturn a new `bigint` containing the instance value multiplied by `n`.\n\n.div(n)\n-------\n\nReturn a new `bigint` containing the instance value integrally divided by `n`.\n\n.abs()\n------\n\nReturn a new `bigint` with the absolute value of the instance.\n\n.neg()\n------\n\nReturn a new `bigint` with the negative of the instance value.\n\n.cmp(n)\n-------\n\nCompare the instance value to `n`. Return a positive integer if `> n`, a\nnegative integer if `< n`, and 0 if `== n`.\n\n.gt(n)\n------\n\nReturn a boolean: whether the instance value is greater than n (`> n`).\n\n.ge(n)\n------\n\nReturn a boolean: whether the instance value is greater than or equal to n\n(`>= n`).\n\n.eq(n)\n------\n\nReturn a boolean: whether the instance value is equal to n (`== n`).\n\n.lt(n)\n------\n\nReturn a boolean: whether the instance value is less than n (`< n`).\n\n.le(n)\n------\n\nReturn a boolean: whether the instance value is less than or equal to n\n(`<= n`).\n\n.and(n)\n-------\n\nReturn a new `bigint` with the instance value bitwise AND (&)-ed with `n`.\n\n.or(n)\n------\n\nReturn a new `bigint` with the instance value bitwise inclusive-OR (|)-ed with\n`n`.\n\n.xor(n)\n-------\n\nReturn a new `bigint` with the instance value bitwise exclusive-OR (^)-ed with\n`n`.\n\n.mod(n)\n-------\n\nReturn a new `bigint` with the instance value modulo `n`.\n\n`m`.\n.pow(n)\n-------\n\nReturn a new `bigint` with the instance value raised to the `n`th power.\n\n.powm(n, m)\n-----------\n\nReturn a new `bigint` with the instance value raised to the `n`th power modulo\n`m`.\n\n.invertm(m)\n-----------\n\nCompute the multiplicative inverse modulo `m`.\n\n.rand()\n-------\n.rand(upperBound)\n-----------------\n\nIf `upperBound` is supplied, return a random `bigint` between the instance value\nand `upperBound - 1`, inclusive.\n\nOtherwise, return a random `bigint` between 0 and the instance value - 1,\ninclusive.\n\n.probPrime()\n------------\n\nReturn whether the bigint is:\n\n* certainly prime (true)\n* probably prime ('maybe')\n* certainly composite (false)\n\nusing [mpz_probab_prime](http://gmplib.org/manual/Number-Theoretic-Functions.html).\n\n.nextPrime()\n------------\n\nReturn the next prime greater than `this` using\n[mpz_nextprime](http://gmplib.org/manual/Number-Theoretic-Functions.html).\n\n.sqrt()\n-------\n\nReturn a new `bigint` that is the square root.  This truncates.\n\n.root(n)\n--------\n\nReturn a new `bigint` that is the `nth` root.  This truncates.\n\n.shiftLeft(n)\n-------------\n\nReturn a new `bigint` that is the `2^n` multiple. Equivalent of the `<<`\noperator.\n\n.shiftRight(n)\n--------------\n\nReturn a new `bigint` of the value integer divided by\n`2^n`. Equivalent of the `>>` operator.\n\n.gcd(n)\n-------\n\nReturn the greatest common divisor of the current bigint with `n` as a new\nbigint.\n\n.bitLength()\n------------\n\nReturn the number of bits used to represent the current bigint as a javascript\nNumber.\n\ninstall\n=======\n\nYou'll need the libgmp source to compile this package. Under Debian-based systems,\n\n    sudo aptitude install libgmp3-dev\n\nOn a Mac with [Homebrew](https://github.com/mxcl/homebrew/),\n\n    brew install gmp\n\nAnd then install with [npm](http://npmjs.org):\n\n    npm install bigint\n","readmeFilename":"README.markdown","_id":"bigint@0.4.1","dist":{"shasum":"53838fe2b4c88553099307eec2e67161be916e8e","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.4.1.tgz","integrity":"sha512-1bVL5pxjRQluO+2gFKSYyqHY1HNs/SaLN1mkIbZ4FTUW2mQ8ptt9tiT01zvpg7A0Tpftv3kdqqy1xYHKdMM7Tg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIH7mOfIMVu0VCEYuAExyYUMEU84Hrk1HoeT9X1mKMfCcAiEA1IpldFXS9yxBrvSZ687cTdPdJsji9i597r16qyK9f3Q="}]},"_from":".","_npmVersion":"1.2.2","_npmUser":{"name":"substack","email":"mail@substack.net"},"maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}},"0.4.2":{"name":"bigint","version":"0.4.2","description":"Arbitrary-precision integer arithmetic using libgmp","main":"./index.js","repository":{"type":"git","url":"http://github.com/substack/node-bigint.git"},"keywords":["gmp","libgmp","big","bignum","bigint","integer","arithmetic","precision"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"devDependencies":{"tap":"~0.2.5","put":"~0.0.6"},"license":"MIT/X11","engine":{"node":">=0.2.0"},"scripts":{"install":"node-gyp configure build","test":"tap test/*.js"},"readme":"bigint\n======\n\nArbitrary precision integral arithmetic for node.js!\n\n[![build status](https://secure.travis-ci.org/substack/node-bigint.png)](http://travis-ci.org/substack/node-bigint)\n\nThis library wraps around [libgmp](http://gmplib.org/)'s\n[integer functions](http://gmplib.org/manual/Integer-Functions.html#Integer-Functions)\nto perform infinite-precision arithmetic.\n\nYou should also consider using\n[bignum](https://github.com/justmoon/node-bignum),\nwhich is based on the bigint api but uses openssl instead of libgmp,\nwhich you are more likely to already have on your system.\n\nexample\n=======\n\nsimple.js\n---------\n\n    var bigint = require('bigint');\n    \n    var b = bigint('782910138827292261791972728324982')\n        .sub('182373273283402171237474774728373')\n        .div(8)\n    ;\n    console.log(b);\n\n***\n    $ node simple.js\n    <BigInt 75067108192986261319312244199576>\n\nperfect.js\n----------\n\nGenerate the perfect numbers:\n\n    // If 2**n-1 is prime, then (2**n-1) * 2**(n-1) is perfect.\n    var bigint = require('bigint');\n\n    for (var n = 0; n < 100; n++) {\n        var p = bigint.pow(2, n).sub(1);\n        if (p.probPrime(50)) {\n            var perfect = p.mul(bigint.pow(2, n - 1));\n            console.log(perfect.toString());\n        }\n    }\n\n***\n\n    6\n    28\n    496\n    8128\n    33550336\n    8589869056\n    137438691328\n    2305843008139952128\n    2658455991569831744654692615953842176\n    191561942608236107294793378084303638130997321548169216\n\nmethods[0]\n==========\n\nbigint(n, base=10)\n------------------\n\nCreate a new `bigint` from `n` and a base. `n` can be a string, integer, or\nanother `bigint`.\n\nIf you pass in a string you can set the base that string is encoded in.\n\n.toString(base=10)\n------------------\n\nPrint out the `bigint` instance in the requested base as a string.\n\nbigint.fromBuffer(buf, opts)\n----------------------\n\nCreate a new `bigint` from a `Buffer`.\n\nThe default options are:\n    {\n        order : 'forward', // low-to-high indexed word ordering\n        endian : 'big',\n        size : 1, // number of bytes in each word\n    }\n\nNote that endian doesn't matter when size = 1.\n\nmethods[1]\n==========\n\nFor all of the instance methods below you can write either\n\n    bigint.method(x, y, z)\n\nor if x is a `bigint` instance``\n\n    x.method(y, z)\n\n.toNumber()\n-----------\n\nTurn a `bigint` into a `Number`. If the `bigint` is too big you'll lose\nprecision or you'll get ±`Infinity`.\n\n.toBuffer(opts)\n-------------\n\nReturn a new `Buffer` with the data from the `bigint`.\n\nThe default options are:\n    {\n        order : 'forward', // low-to-high indexed word ordering\n        endian : 'big',\n        size : 1, // number of bytes in each word\n    }\n\nNote that endian doesn't matter when size = 1.\n\n.add(n)\n-------\n\nReturn a new `bigint` containing the instance value plus `n`.\n\n.sub(n)\n-------\n\nReturn a new `bigint` containing the instance value minus `n`.\n\n.mul(n)\n-------\n\nReturn a new `bigint` containing the instance value multiplied by `n`.\n\n.div(n)\n-------\n\nReturn a new `bigint` containing the instance value integrally divided by `n`.\n\n.abs()\n------\n\nReturn a new `bigint` with the absolute value of the instance.\n\n.neg()\n------\n\nReturn a new `bigint` with the negative of the instance value.\n\n.cmp(n)\n-------\n\nCompare the instance value to `n`. Return a positive integer if `> n`, a\nnegative integer if `< n`, and 0 if `== n`.\n\n.gt(n)\n------\n\nReturn a boolean: whether the instance value is greater than n (`> n`).\n\n.ge(n)\n------\n\nReturn a boolean: whether the instance value is greater than or equal to n\n(`>= n`).\n\n.eq(n)\n------\n\nReturn a boolean: whether the instance value is equal to n (`== n`).\n\n.lt(n)\n------\n\nReturn a boolean: whether the instance value is less than n (`< n`).\n\n.le(n)\n------\n\nReturn a boolean: whether the instance value is less than or equal to n\n(`<= n`).\n\n.and(n)\n-------\n\nReturn a new `bigint` with the instance value bitwise AND (&)-ed with `n`.\n\n.or(n)\n------\n\nReturn a new `bigint` with the instance value bitwise inclusive-OR (|)-ed with\n`n`.\n\n.xor(n)\n-------\n\nReturn a new `bigint` with the instance value bitwise exclusive-OR (^)-ed with\n`n`.\n\n.mod(n)\n-------\n\nReturn a new `bigint` with the instance value modulo `n`.\n\n`m`.\n.pow(n)\n-------\n\nReturn a new `bigint` with the instance value raised to the `n`th power.\n\n.powm(n, m)\n-----------\n\nReturn a new `bigint` with the instance value raised to the `n`th power modulo\n`m`.\n\n.invertm(m)\n-----------\n\nCompute the multiplicative inverse modulo `m`.\n\n.rand()\n-------\n.rand(upperBound)\n-----------------\n\nIf `upperBound` is supplied, return a random `bigint` between the instance value\nand `upperBound - 1`, inclusive.\n\nOtherwise, return a random `bigint` between 0 and the instance value - 1,\ninclusive.\n\n.probPrime()\n------------\n\nReturn whether the bigint is:\n\n* certainly prime (true)\n* probably prime ('maybe')\n* certainly composite (false)\n\nusing [mpz_probab_prime](http://gmplib.org/manual/Number-Theoretic-Functions.html).\n\n.nextPrime()\n------------\n\nReturn the next prime greater than `this` using\n[mpz_nextprime](http://gmplib.org/manual/Number-Theoretic-Functions.html).\n\n.sqrt()\n-------\n\nReturn a new `bigint` that is the square root.  This truncates.\n\n.root(n)\n--------\n\nReturn a new `bigint` that is the `nth` root.  This truncates.\n\n.shiftLeft(n)\n-------------\n\nReturn a new `bigint` that is the `2^n` multiple. Equivalent of the `<<`\noperator.\n\n.shiftRight(n)\n--------------\n\nReturn a new `bigint` of the value integer divided by\n`2^n`. Equivalent of the `>>` operator.\n\n.gcd(n)\n-------\n\nReturn the greatest common divisor of the current bigint with `n` as a new\nbigint.\n\n.bitLength()\n------------\n\nReturn the number of bits used to represent the current bigint as a javascript\nNumber.\n\ninstall\n=======\n\nYou'll need the libgmp source to compile this package. Under Debian-based systems,\n\n    sudo aptitude install libgmp3-dev\n\nOn a Mac with [Homebrew](https://github.com/mxcl/homebrew/),\n\n    brew install gmp\n\nAnd then install with [npm](http://npmjs.org):\n\n    npm install bigint\n","readmeFilename":"README.markdown","_id":"bigint@0.4.2","dist":{"shasum":"5bccafb5af3924cc71eb59942fb3a64a12906e49","tarball":"https://registry.npmjs.org/bigint/-/bigint-0.4.2.tgz","integrity":"sha512-eObvqHGA4oPyKCqDzvxHeqbJOTa+fcGw3URd/wpwFpahWBcXweTolIAhY18lW1mQESKx27cBS7y8zO+XnYTnsA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDSCPmuSYYC0ihHsBLq6RNkRQ+8q0w3eLcvYhv5ZjazIAiB+SXw5OZyrSWFxbKBtjsmceZ0/bFt/LKSx2iC0y+VH3w=="}]},"_from":".","_npmVersion":"1.2.2","_npmUser":{"name":"substack","email":"mail@substack.net"},"maintainers":[{"name":"substack","email":"mail@substack.net"},{"name":"draggor","email":"draggor@gmail.com"}],"directories":{}}},"maintainers":[{"email":"draggor@gmail.com","name":"draggor"}],"time":{"modified":"2022-11-11T06:33:19.474Z","created":"2011-02-14T06:12:21.707Z","0.0.1":"2011-02-14T06:12:22.258Z","0.0.2":"2011-02-15T01:19:38.287Z","0.0.5":"2011-02-20T05:00:01.922Z","0.0.6":"2011-02-20T10:17:24.078Z","0.0.7":"2011-02-21T07:53:07.899Z","0.0.8":"2011-02-22T13:25:25.105Z","0.0.9":"2011-02-27T11:35:53.440Z","0.0.10":"2011-03-01T11:17:30.925Z","0.0.11":"2011-03-04T03:46:08.034Z","0.0.12":"2011-03-06T11:25:42.412Z","0.1.0":"2011-03-08T01:47:35.910Z","0.2.0":"2011-03-13T23:17:24.579Z","0.2.1":"2011-03-15T23:47:24.928Z","0.2.2":"2011-03-21T10:19:03.831Z","0.3.0":"2011-03-23T23:05:55.266Z","0.3.1":"2011-04-01T09:50:48.767Z","0.3.2":"2011-04-13T10:19:55.492Z","0.3.3":"2011-04-14T00:31:54.231Z","0.3.4":"2011-08-08T00:05:33.550Z","0.3.5":"2011-08-20T23:54:03.707Z","0.3.6":"2011-09-02T01:52:10.562Z","0.3.7":"2011-10-09T21:53:59.704Z","0.3.8":"2011-12-30T20:14:10.948Z","0.3.9":"2012-05-18T21:45:57.239Z","0.4.0":"2013-04-18T01:32:41.453Z","0.4.1":"2013-04-18T01:39:51.721Z","0.4.2":"2013-04-18T02:22:16.531Z"},"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"repository":{"type":"git","url":"http://github.com/substack/node-bigint.git"},"users":{"asahiro":true,"akiva":true,"rsp":true,"ganeshkbhat":true}}