{"_id":"@accumulators/incremental-merkle-tree","_rev":"20-ec769360182e751b0ae8b9ed1cb8a406","name":"@accumulators/incremental-merkle-tree","dist-tags":{"latest":"4.3.0"},"versions":{"1.2.1":{"name":"@accumulators/incremental-merkle-tree","version":"1.2.1","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@1.2.1","maintainers":[{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"c4569fe27770ec22b785b15d8f86aa51ed696292","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-1.2.1.tgz","fileCount":10,"integrity":"sha512-H1Q7xLX5hET0wss7lv53d0pqG2iOfjmTiEIYNjzv6R3szx5ux7+T1OBlgkXR+BZcTT58V3hvHHu8Q6ZU8rLl/A==","signatures":[{"sig":"MEQCIAw3KUKeTibMzSnQmXemsFvtzecVUxFS2QD/VZpCKewQAiB5/g0xvL/x13r4SSlwfNclsuv60TqplapxqT0yJLfn5Q==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":18945},"main":"lib/index.js","_from":"file:accumulators-incremental-merkle-tree-1.2.1.tgz","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"_resolved":"/private/var/folders/bf/gkvz0pzd30155d51_82hdxpr0000gn/T/de642eebeff50aa67ef0ed9cf64b3c59/accumulators-incremental-merkle-tree-1.2.1.tgz","_integrity":"sha512-H1Q7xLX5hET0wss7lv53d0pqG2iOfjmTiEIYNjzv6R3szx5ux7+T1OBlgkXR+BZcTT58V3hvHHu8Q6ZU8rLl/A==","repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"9.6.6","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"20.2.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^1.2.1"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^1.2.1","@accumulators/hashers":"^1.2.1"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_1.2.1_1687341283132_0.5746716498248159","host":"s3://npm-registry-packages"}},"2.0.0":{"name":"@accumulators/incremental-merkle-tree","version":"2.0.0","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@2.0.0","maintainers":[{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"7c1d7c4e2474bde617a5bbe1adee482d3a84315d","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-2.0.0.tgz","fileCount":10,"integrity":"sha512-exyQO+vKSmbm78WOfp93nenV1LZ2Xg6Yb8NjUjQNc6J/Id3C0wC9g27ds0tIfS0eiD6GPk9IYudnrJGfzvbUtQ==","signatures":[{"sig":"MEQCIFoy4DVxb4XZ2GRZvwr3Sg4jV50JELdKmumj9raGyFC3AiAr6PbLO7MfLmLpyN6tC9DBkaMVHCbkq263C7+vrlToOg==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"e4c211538dce77ae00679d1e47d8d5d6a207b942","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v20.2.0+arm64 (darwin)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"20.2.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^2.0.0"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^2.0.0","@accumulators/hashers":"^2.0.0"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_2.0.0_1687344764623_0.3919384724044841","host":"s3://npm-registry-packages"}},"2.0.1":{"name":"@accumulators/incremental-merkle-tree","version":"2.0.1","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@2.0.1","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"1c2d6955068d6520feeb556f9ac78bc6ce60e5f9","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-2.0.1.tgz","fileCount":10,"integrity":"sha512-1Ox2EgTHpIvR1fXPE/nkwFPL7EC/geEdGlduqC6TYMtajBJn3EQlRBL9lftxifBEQk9sYvop0VxeI30zTRq9pQ==","signatures":[{"sig":"MEQCIFgGn6Zjl/ADi6MaUyPFkRsbC1k62Jl7QU0EeXHT8sKZAiB4JpMvDxflVtn0QbgeZqC6IVRldCga0VtmOra/crc4EQ==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"c07deccb21b7d878f7d36b5d6950afc79c7f1b54","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v20.2.0+arm64 (darwin)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"20.2.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^2.0.0"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^2.0.1","@accumulators/hashers":"^2.0.1"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_2.0.1_1690461672678_0.32985139197331703","host":"s3://npm-registry-packages"}},"2.0.2":{"name":"@accumulators/incremental-merkle-tree","version":"2.0.2","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@2.0.2","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"5c01e333b0f6ffbf4db5287a7cc56f86fd64cb55","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-2.0.2.tgz","fileCount":10,"integrity":"sha512-vLAgWsD9l3Gk/nk9ZL1EoyV+zEV3aLGkEuTbx+c6pa0dQHWEJhmPyjgTSWaDfoM11oeVSYbkk02Rr/7+f6remA==","signatures":[{"sig":"MEQCIFnQiEIuLC7KpKRQ0SGsLwloAg9+PlNmSocWUJMUPWp+AiBGnZPwZkWiqYsDGAUsv6uh86Ar+KhfeyOY6B0CjJzjog==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"3a5895c5062c651fbd1da2fab6d51935ab569cce","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v20.2.0+arm64 (darwin)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"20.2.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^2.0.0"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^2.0.2","@accumulators/hashers":"^2.0.2"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_2.0.2_1690463304715_0.8046386659248164","host":"s3://npm-registry-packages"}},"2.0.3":{"name":"@accumulators/incremental-merkle-tree","version":"2.0.3","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@2.0.3","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"11cd3b944eeb2406e7a0d7b407a9b1aa34cab339","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-2.0.3.tgz","fileCount":10,"integrity":"sha512-sFRYaKpnhY4uO5HbRgk4dpUALipp3po6byZ6dHw2UTSRrQSnlVVSMXiKXAiqxBVkAQLwLvKW2HU3jKjQukqmhQ==","signatures":[{"sig":"MEQCIAVVj04nBzrIAN0QCycgzf08mzeL6owLfCqwJkEsO/ZKAiBiL7i8cOzUqNIdF8RE6LxtxJiuwNec7XBBEvuIzLceJQ==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"d6ce4688ee2151d0b1d359b883e0aecdcdbd9e18","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v20.2.0+arm64 (darwin)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"20.2.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^2.0.3"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^2.0.3","@accumulators/hashers":"^2.0.3"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_2.0.3_1692693121013_0.6230522277355692","host":"s3://npm-registry-packages"}},"2.0.4":{"name":"@accumulators/incremental-merkle-tree","version":"2.0.4","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@2.0.4","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"18d88a69daffde09ec64900528c8d9f595a4e8b8","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-2.0.4.tgz","fileCount":10,"integrity":"sha512-6mUyLPSZ1T+QAec8RU8auh6sd1I7LGiGGN+B4sDQ9RBsCSPk5UHTAhfvPZ7/vXAIammlSQGwOqYBJkpMOjF+iA==","signatures":[{"sig":"MEYCIQDKz8wbwx3+u4FB4sdHHVTJNKNm922c7xlSibczrQZEYQIhAKND3LdM+dU+BGAqoD1VYOanCNO1zh7Xrk02DmgtDHAB","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"72c3f1d9380cf8aaed4d33eda81593271c402915","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^2.0.4"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^2.0.4","@accumulators/hashers":"^2.0.4"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_2.0.4_1692693816269_0.758879956824962","host":"s3://npm-registry-packages"}},"3.0.1":{"name":"@accumulators/incremental-merkle-tree","version":"3.0.1","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@3.0.1","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"d1866fc54225cde11b9f002636af0a99b4b11fa4","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-3.0.1.tgz","fileCount":10,"integrity":"sha512-Y+mBTSfxbyAZe7PGTPFPgtOamZfkaDJtZ49CPxgEbSfbrSVQ0uMz6uO620kWVTQ2wtczMglybd5FkyiPI6Kaaw==","signatures":[{"sig":"MEQCIEscGZJRc9LGfZ9z/rjIFwWZHOEllziTeeGSZXRDGPogAiBc54h8bQvgemTMfnVo8gjkjxZpL3NSZQ4/XuD4KpyofA==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"46d7d26d5d12dbbe9dfba9e15e7ba375efd0ff49","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^3.0.1"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^3.0.1","@accumulators/hashers":"^3.0.1"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_3.0.1_1692695838553_0.021241322112856453","host":"s3://npm-registry-packages"}},"3.0.2":{"name":"@accumulators/incremental-merkle-tree","version":"3.0.2","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@3.0.2","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"4a771241c3d8ca47dd3c601de07c9610a5c55769","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-3.0.2.tgz","fileCount":10,"integrity":"sha512-iqNfxlTZigLmLbJpytzNT2fI6zecSCno3JrYXf9GCfymYXgmIaELAX19+Lg1PFLsR80BczCII/d+sCLkmMUmIg==","signatures":[{"sig":"MEQCIHH82EqLyji26cxRQsFJxZVIDZ34FHBsgLDE8hxFrIXUAiAxqRFRz68KkFooYLyo1YnXxtrl5hLXHLU8GZj3ehKfqw==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"4a81be3475d20ee717216f64bf6430d450437f5a","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^3.0.2"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^3.0.2","@accumulators/hashers":"^3.0.2"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_3.0.2_1692860433271_0.9052777358669044","host":"s3://npm-registry-packages"}},"3.0.3":{"name":"@accumulators/incremental-merkle-tree","version":"3.0.3","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@3.0.3","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"da656e9ea103b26688934eba07a7229081f0d047","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-3.0.3.tgz","fileCount":10,"integrity":"sha512-RS4SJB+uNtsnyemnBo5fs9wSbI1e2ZaAasxU4TjRygpaCw4ifTym6ad5qmwzNUjYNKo8e9t7yvfvDX793U5isw==","signatures":[{"sig":"MEUCIE88lZMP1n6389WUbFpknbefa4clsbUVrYaZ7ecK9SDuAiEA6TYExDwypHIF1aarTyxPcDoqxrrzaZem0Y9qx/NT+Gg=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"32874d15a33696896c4b0189f4699642da399849","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^3.0.3"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^3.0.3","@accumulators/hashers":"^3.0.3"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_3.0.3_1692864522096_0.9962297871731058","host":"s3://npm-registry-packages"}},"3.0.8":{"name":"@accumulators/incremental-merkle-tree","version":"3.0.8","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@3.0.8","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"fbf1692612f14447f731aff3c394ec517175f7fa","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-3.0.8.tgz","fileCount":10,"integrity":"sha512-PNQMv9ewzgWYoHiJNsa3yVqtQZU4bFyHnKpHiH9ESXbJTnXeD4KYdi4JRJGSiyrVGKBCUuJE9TdCIMk8avC07Q==","signatures":[{"sig":"MEUCICN4fH6V42qzggw+se7Vj1hXd0BwbDHmhy4XJZ/27UghAiEAhef3TOkvemAXzyn8q7ppUTp35BfoyhE6i2Cy1cP2D7w=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19003},"main":"lib/index.js","gitHead":"1b5084968c5aa0a7034ff8d7c75cccf2eb882c4f","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^3.0.8"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^3.0.8","@accumulators/hashers":"^3.0.8"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_3.0.8_1693227019586_0.7284658982723273","host":"s3://npm-registry-packages"}},"3.0.9":{"name":"@accumulators/incremental-merkle-tree","version":"3.0.9","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@3.0.9","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"7546c7c459254ed24909405f55a82554d4eb2a69","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-3.0.9.tgz","fileCount":10,"integrity":"sha512-UDCMLi/t5JJiN9qn0O+tTlSY8qwd31k7AfxkQMBv8QOC8dGg+aEN5YzFou1zZYwPF3Ns9wyzp7h+kq+V7Gl1vA==","signatures":[{"sig":"MEUCIQC0GYxDiQBPSsM9Npqn0gMNn8XYTfPqTDWmWa8XWvwiHAIgF4aajMNvgtIBlffqQXfrbxLHaybAWi/qKQJPR2QgBm0=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19007},"main":"lib/index.js","gitHead":"0b4ea97f1f59a8c9797fcbae3e7e8685d6f17d58","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^3.0.8"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^3.0.8","@accumulators/hashers":"^3.0.8"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_3.0.9_1693230245803_0.9446250761405908","host":"s3://npm-registry-packages"}},"4.0.1":{"name":"@accumulators/incremental-merkle-tree","version":"4.0.1","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@4.0.1","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"3978b363cc1179cda0bc7c60ba5b299f08dc68e5","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-4.0.1.tgz","fileCount":10,"integrity":"sha512-saDC2yDLADx4LH5D2qxuuTnaQy14o6wdRQr8w0m9v3phULMG88Us7UXSX6UduoKVzQc6Q+JwI+jWudlstqfARg==","signatures":[{"sig":"MEQCIHamqsd/WTcOjUzBKI0ocJHgzdLlyh0YA3t3fZtUmv+GAiAZNXHHxu2f+NtEvEAb3tDwhtfKULcngtEYGAuQVIcq5Q==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19007},"main":"lib/index.js","gitHead":"eb2bd019faa03d6abb68e71b6f9ad03b0df9ab37","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^4.0.1"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^4.0.1","@accumulators/hashers":"^4.0.1"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_4.0.1_1694157155142_0.03264769312695326","host":"s3://npm-registry-packages"}},"4.1.0-alpha.0":{"name":"@accumulators/incremental-merkle-tree","version":"4.1.0-alpha.0","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@4.1.0-alpha.0","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"87745d0bae2b71fe5a7cdd0967fa96e765c952bb","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-4.1.0-alpha.0.tgz","fileCount":10,"integrity":"sha512-pXEuH3fLdFMFeQfAGspB5q4o291LdEmRZI8TNW4AAFF2zACL3OV3H8PKwXKzw9mtTHAp4rp47uiWBtxSASADug==","signatures":[{"sig":"MEQCIF6/YilrgEXYbdZ5mK7ou39YYB7dJ9WCfBPUn/IA3rEfAiA0jhCXIPTfptn7aZ8fYnZK1TAZoC1673AaUmYAGZ3w0A==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19023},"main":"lib/index.js","gitHead":"dda00bf0d093363078e7d9f675476a6cca079454","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v20.2.0+arm64 (darwin)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"20.2.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^4.0.0"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^4.0.0","@accumulators/hashers":"^4.1.0-alpha.0"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_4.1.0-alpha.0_1694420851951_0.14021538201917205","host":"s3://npm-registry-packages"}},"4.2.0-alpha.0":{"name":"@accumulators/incremental-merkle-tree","version":"4.2.0-alpha.0","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@4.2.0-alpha.0","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"eeb271a50d23f6ee65b204bf3c493916bd0a41a3","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-4.2.0-alpha.0.tgz","fileCount":10,"integrity":"sha512-bxGBKmfYwTrT7EPd5zFacNBtMPVoIoZlr8BZNG5bZnVxD5BfpUVS5GpnR6u6DwAKpKvQIdI9YvjhNCyFU8TXIQ==","signatures":[{"sig":"MEUCIQDMgqwi7zPJUz1Vr5+Xlkyb0Q0robMNIDLoKEcdYs48WQIgEJn0hANbAFU2GVnxc45E6u2d9n8eCvW3LWm7+oPX5OY=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19039},"main":"lib/index.js","gitHead":"5ead754b9e1bd4259a19cb8f98f67b5809e478ae","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v20.2.0+arm64 (darwin)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"20.2.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^4.2.0-alpha.0"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^4.2.0-alpha.0","@accumulators/hashers":"^4.2.0-alpha.0"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_4.2.0-alpha.0_1694422361499_0.17162594214561766","host":"s3://npm-registry-packages"}},"4.2.0-alpha.1":{"name":"@accumulators/incremental-merkle-tree","version":"4.2.0-alpha.1","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@4.2.0-alpha.1","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"3b76db46f383a1457836c3d4a6aad96a9060a233","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-4.2.0-alpha.1.tgz","fileCount":10,"integrity":"sha512-S3kZfz+986AXRoiA2Esk2To2yZx8lTbXlLiV0R4UKYRVgq1IkVxq4hDPVeML5n9aHFQ3SrkEmTVjJ7E4Cdzwzw==","signatures":[{"sig":"MEUCICt0RoAS5RnqAMcxBNUS9dGteF3RN72FCHz2rUGCgCQuAiEAr+M/bYOt2srh76kYEg4GyUSYYCJopf/xxcLhsr9aQdY=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19039},"main":"lib/index.js","gitHead":"fb6478c72a6f6a33a4658538186c99f4481759de","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v20.2.0+arm64 (darwin)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"20.2.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^4.2.0-alpha.1"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^4.2.0-alpha.1","@accumulators/hashers":"^4.2.0-alpha.1"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_4.2.0-alpha.1_1694426622621_0.8891615407140006","host":"s3://npm-registry-packages"}},"4.2.1":{"name":"@accumulators/incremental-merkle-tree","version":"4.2.1","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@4.2.1","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"dcfafa0ce45cdb9157d7dc81785d86a6ef098a8a","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-4.2.1.tgz","fileCount":10,"integrity":"sha512-VfVgUsifm9eYRWa5DPEueZlghg6O4sk/xD/a8Y7TOF9bWYzXSlt6pp48umt3h9+oET4WjC/dJEojvzfzWT7YWQ==","signatures":[{"sig":"MEUCIQC03pnJRAcrx+yJogocbie1RWBvK71ZnrAZNGBc1e6s3AIgBSGRcFoARutQWXhfenOUOXtojzKLtCVMNqGPL7g7sWA=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19007},"main":"lib/index.js","gitHead":"fc93df901b034d5cc65a0d283ef5388128fab257","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^4.2.1"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^4.2.1","@accumulators/hashers":"^4.2.1"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_4.2.1_1694434030468_0.8117429908101106","host":"s3://npm-registry-packages"}},"4.2.2":{"name":"@accumulators/incremental-merkle-tree","version":"4.2.2","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@4.2.2","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"b20933e231ab0b60037d2be5a73787e44fa61f11","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-4.2.2.tgz","fileCount":10,"integrity":"sha512-+lSiXyj6bosvlfX4n7iyJDQMYfmxAsRBwI+A/oPGEMb4oCYArcq6H6YEqNgTeRGOYEdCVuarMGBAjt1zUF9g9g==","signatures":[{"sig":"MEUCICpOwuXafTKzdko3VUTjsTUIy6JTcXgCI29kTgavPUHwAiEAvl6ytDU36UGMSsDyqunJpYNuxBfhPdLFmvvUNZLd2P0=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":19007},"main":"lib/index.js","gitHead":"97deb7b1913d568fc4816cd3f89078461528fd60","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.17.1+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.17.1","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^4.2.1"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^4.2.1","@accumulators/hashers":"^4.2.2"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_4.2.2_1695202827004_0.6095767134649595","host":"s3://npm-registry-packages"}},"4.2.3":{"name":"@accumulators/incremental-merkle-tree","version":"4.2.3","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","_id":"@accumulators/incremental-merkle-tree@4.2.3","maintainers":[{"name":"0xmarcello","email":"marcellobardus8@gmail.com"},{"name":"beeinger","email":"sulecki.maciek@gmail.com"}],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"dist":{"shasum":"896c6ebd101e350ed97d3118f48c0fd318b43483","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-4.2.3.tgz","fileCount":11,"integrity":"sha512-vWVJGazUzDPqyAnJPKtRRsbhVWWCwo2pd3vCQRgNSbnyKsqPewqIix+wEErrZkGAiZHzYTSALT4h7Vd/Xgy0dw==","signatures":[{"sig":"MEYCIQDOfRNkUTVKD/inu3NaV31ugzykYth58nTdY8SeTroK0AIhAPxCKQ8/Z2aLxoq6Ns+Lmx+igEQPv21u7KPKf0y2B4+B","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":22332},"main":"lib/index.js","gitHead":"beb68310fd4bf0e8204d77137abea949633af06b","scripts":{"build":"tsc"},"typings":"lib/index.d.ts","_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"repository":{"url":"git+https://github.com/HerodotusDev/accumulators.git","type":"git"},"_npmVersion":"lerna/7.0.2/node@v18.18.0+x64 (linux)","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","directories":{"lib":"lib","test":"__tests__"},"_nodeVersion":"18.18.0","dependencies":{"ulid":"^2.3.0","@accumulators/core":"^4.2.3"},"_hasShrinkwrap":false,"devDependencies":{"@accumulators/memory":"^4.2.3","@accumulators/hashers":"^4.2.3"},"_npmOperationalInternal":{"tmp":"tmp/incremental-merkle-tree_4.2.3_1696604807435_0.4118540724372213","host":"s3://npm-registry-packages"}},"4.3.0":{"name":"@accumulators/incremental-merkle-tree","version":"4.3.0","description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"homepage":"https://github.com/HerodotusDev/accumulators","bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"repository":{"type":"git","url":"git+https://github.com/HerodotusDev/accumulators.git"},"license":"GPL-3.0-or-later","author":{"name":"Herodotus Dev Ltd"},"main":"lib/index.js","typings":"lib/index.d.ts","directories":{"lib":"lib","test":"__tests__"},"scripts":{"build":"tsc"},"dependencies":{"@accumulators/core":"^4.2.3","ulid":"^2.3.0"},"devDependencies":{"@accumulators/hashers":"^4.3.0","@accumulators/memory":"^4.2.3"},"gitHead":"e342cd57222b62befd2489dda7b4f5d9a96ac1c7","_id":"@accumulators/incremental-merkle-tree@4.3.0","_nodeVersion":"20.20.2","_npmVersion":"lerna/7.0.2/node@v20.20.2+x64 (linux)","dist":{"integrity":"sha512-v+SUCoCqmHZlGAW1EFTEebkCEmMe2X8QGiHtkc4jKy/pI2UCnXuSiH+l44GUfWSf3JeqJ+DbrVAQRRWlfdasWA==","shasum":"13f4fb5953593c67834d298145571ae10c6a277f","tarball":"https://registry.npmjs.org/@accumulators/incremental-merkle-tree/-/incremental-merkle-tree-4.3.0.tgz","fileCount":11,"unpackedSize":22332,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEUCIQDSb88IRQYNYy6mYqMO2DAd+XdLWcK+3esn6VIIde5nEwIgBl7uc6CyeqXi42qnQ7fZ5HZJBXwRv4n5KH07s7h/emI="}]},"_npmUser":{"name":"beeinger","email":"sulecki.maciek@gmail.com"},"maintainers":[{"name":"beeinger","email":"sulecki.maciek@gmail.com"},{"name":"0xmarcello","email":"marcellobardus8@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/incremental-merkle-tree_4.3.0_1775158621660_0.3240021738576917"},"_hasShrinkwrap":false}},"time":{"created":"2023-06-21T09:54:43.065Z","modified":"2026-04-02T19:37:01.952Z","1.2.1":"2023-06-21T09:54:43.304Z","2.0.0":"2023-06-21T10:52:44.783Z","2.0.1":"2023-07-27T12:41:12.848Z","2.0.2":"2023-07-27T13:08:24.915Z","2.0.3":"2023-08-22T08:32:01.206Z","2.0.4":"2023-08-22T08:43:36.500Z","3.0.1":"2023-08-22T09:17:18.749Z","3.0.2":"2023-08-24T07:00:33.475Z","3.0.3":"2023-08-24T08:08:42.288Z","3.0.8":"2023-08-28T12:50:19.718Z","3.0.9":"2023-08-28T13:44:05.937Z","4.0.1":"2023-09-08T07:12:35.312Z","4.1.0-alpha.0":"2023-09-11T08:27:32.146Z","4.2.0-alpha.0":"2023-09-11T08:52:41.683Z","4.2.0-alpha.1":"2023-09-11T10:03:42.769Z","4.2.1":"2023-09-11T12:07:10.752Z","4.2.2":"2023-09-20T09:40:27.188Z","4.2.3":"2023-10-06T15:06:47.587Z","4.3.0":"2026-04-02T19:37:01.827Z"},"bugs":{"url":"https://github.com/HerodotusDev/accumulators/issues"},"author":{"name":"Herodotus Dev Ltd"},"license":"GPL-3.0-or-later","homepage":"https://github.com/HerodotusDev/accumulators","keywords":["incremental merkle tree","multiproofs","merkle proofs"],"repository":{"type":"git","url":"git+https://github.com/HerodotusDev/accumulators.git"},"description":"A TypeScript implementation of Incremental Merkle Trees with multiproofs","maintainers":[{"name":"beeinger","email":"sulecki.maciek@gmail.com"},{"name":"0xmarcello","email":"marcellobardus8@gmail.com"}],"readme":"# Incremental Merkle Tree\n\nIncremental Merkle Tree is a structure that contains a constant amount of hashes, allows updating a given hash and proving efficiently. Time complexity of both operations is O(log tree_size).\n\n## Example\n\n```typescript\nimport MemoryStore from \"@accumulators/memory\";\nimport { KeccakHasher } from \"@accumulators/hashers\";\nimport { IncrementalMerkleTree } from \"@accumulators/incremental-merkle-tree\";\n\nconst store = new MemoryStore();\nconst hasher = new KeccakHasher();\n\nconst tree = await IncrementalMerkleTree.initialize(4, \"0x0\", hasher, store);\n\nconst proof = await tree.getInclusionProof(2);\nconsole.log(await tree.verifyProof(2, \"0x0\", proof)); // true\n\nawait tree.update(2, \"0x0\", \"0x1\", proof);\n\nconsole.log(await tree.verifyProof(2, \"0x0\", proof)); // false\nconsole.log(await tree.verifyProof(2, \"0x1\", proof)); // true\n```\n\n## Functions\n\n- [initialize](#initializetreesize-number-nullvalue-string-hasher-hasher-store-store-treeid-string)\n- [getRoot](#getroot)\n- [getInclusionProof](#getinclusionproofindex-number)\n- [verifyProof](#verifyproofindex-number-value-string-proof-string)\n- [update](#updateindex-number-oldvalue-string-newvalue-string-proof-string)\n- [getInclusionMultiProof](#getinclusionmultiproofindexes-number)\n- [verifyMultiProof](#verifymultiproofindexes-number-values-string-proof-string)\n\n---\n\n### `initialize(treeSize: number, nullValue: string, hasher: Hasher, store: Store, treeId?: string)`\n\nCreates a new Incremental Merkle Tree of a given `treeSize` and fills all leaves with value `nullValue`. Returns the promise of `IncrementalMerkleTree`.\n\nAll the values in `store` have keys prefixes with `treeId`. If you want to recreate an existing Merkle Tree, you need to provide the same `treeId` as the original one. In case you want to create a new tree, you can omit `treeId` and it will be generated automatically. `treeId` can be later accessed using the property (e.g. `myTree.treeId`).\n\n---\n\n### `getRoot()`\n\nReturns the promise of a `string` of hexadecimal number which is the root hash of the tree.\n\n---\n\n### `getInclusionProof(index: number)`\n\nReturns the promise of `string[]` for a given `index` (0-based). The array contains hashes of all siblings of nodes on the path from the leaf to the root.\n\n---\n\n### `verifyProof(index: number, value: string, proof: string[])`\n\nReturns the promise of `boolean` which is `true` if the `value` is in the tree at `index` (0-based) and `false` otherwise.\n\n`proof` is an array of hashes returned by `getInclusionProof`.\n\n---\n\n### `update(index: number, oldValue: string, newValue: string, proof: string[])`\n\nChanges the value of the leaf at `index` (0-based) from `oldValue` to `newValue`. `proof` is an array of hashes returned by `getInclusionProof`.\n\nIf provided `oldValue` or `proof` is incorrect, the function will throw an error.\n\n---\n\n### `getInclusionMultiProof(indexes: number[])`\n\nReturns the promise of `string[]` for a given `indexes` (0-based). The array contains hashes of all siblings of nodes on the path from the leaves to the root.\n\n---\n\n### `verifyMultiProof(indexes: number[], values: string[], proof: string[])`\n\nReturns the promise of `boolean` which is `true` if and only if for every `i` value at position `indexes[i]` (0-based) is equal to `values[i]` and `proof` is a valid proof for all of them.\n","readmeFilename":"README.md"}