-
Notifications
You must be signed in to change notification settings - Fork 86
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #68 from privacy-scaling-explorations/feat/new-imt
New `LeanIMT` incremental Merkle tree
- Loading branch information
Showing
84 changed files
with
6,716 additions
and
7,418 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,36 @@ | ||
| import b from "benny" | ||
| import { poseidon2 } from "poseidon-lite" | ||
| import { IMT, LeanIMT } from "../packages/imt/src" | ||
|
|
||
| const name = "incremental-merkle-trees" | ||
|
|
||
| export default async function run() { | ||
| const treeDepth = 7 | ||
| const numberOfLeaves = 2 ** treeDepth | ||
|
|
||
| b.suite( | ||
| name, | ||
|
|
||
| b.add(`IMT - Insert ${numberOfLeaves} leaves`, () => { | ||
| const tree1 = new IMT(poseidon2, treeDepth, 0, 2) | ||
|
|
||
| for (let i = 0; i < numberOfLeaves; i += 1) { | ||
| tree1.insert(i) | ||
| } | ||
| }), | ||
| b.add(`LeanIMT - Insert ${numberOfLeaves} leaves`, () => { | ||
| const tree2 = new LeanIMT((a, b) => poseidon2([a, b])) | ||
|
|
||
| for (let i = 0; i < numberOfLeaves; i += 1) { | ||
| tree2.insert(BigInt(i)) | ||
| } | ||
| }), | ||
|
|
||
| b.cycle(), | ||
| b.complete(), | ||
|
|
||
| b.save({ folder: "benchmarks/results", file: name, version: "1.0.0", details: true }), | ||
| b.save({ folder: "benchmarks/results", file: name, format: "chart.html", details: true }), | ||
| b.save({ folder: "benchmarks/results", file: name, format: "table.html", details: true }) | ||
| ) | ||
| } |
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,13 +1,13 @@ | ||
| import runIncrementalMerkleTree from "./incremental-merkle-tree" | ||
| import runIMT from "./imt" | ||
|
|
||
| const [benchmark] = process.argv.slice(2) | ||
|
|
||
| // If there is an argument with a specific benchmark to run, it will run only that | ||
| // benchmark, otherwise it will run all the benchmarks. | ||
| switch (benchmark) { | ||
| case "incremental-merkle-tree": | ||
| runIncrementalMerkleTree() | ||
| case "imt": | ||
| runIMT() | ||
| break | ||
| default: | ||
| runIncrementalMerkleTree() | ||
| runIMT() | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.