@hinkal/common 0.2.28 → 0.2.29

package/data-structures/http/BasicHttpClient.mjs

@@ -1,25 +1,25 @@
-import n from "axios";
-class c {
-  axiosInstance;
-  constructor() {
-    this.axiosInstance = n.create();
-  }
-  async get(s, t) {
-    return (await this.axiosInstance.get(s, t)).data;
-  }
-  async post(s, t, a) {
-    return (await this.axiosInstance.post(s, t, a)).data;
-  }
-  async put(s, t, a) {
-    return (await this.axiosInstance.put(s, t, a)).data;
-  }
-  async patch(s, t, a) {
-    return (await this.axiosInstance.patch(s, t, a)).data;
-  }
-  async delete(s, t) {
-    return (await this.axiosInstance.delete(s, t)).data;
-  }
-}
-export {
-  c as BasicHttpClient
+import e from "axios";
+//#region ../shared/common/src/data-structures/http/BasicHttpClient.ts
+var t = class {
+	axiosInstance;
+	constructor() {
+		this.axiosInstance = e.create();
+	}
+	async get(e, t) {
+		return (await this.axiosInstance.get(e, t)).data;
+	}
+	async post(e, t, n) {
+		return (await this.axiosInstance.post(e, t, n)).data;
+	}
+	async put(e, t, n) {
+		return (await this.axiosInstance.put(e, t, n)).data;
+	}
+	async patch(e, t, n) {
+		return (await this.axiosInstance.patch(e, t, n)).data;
+	}
+	async delete(e, t) {
+		return (await this.axiosInstance.delete(e, t)).data;
+	}
 };
+//#endregion
+export { t as BasicHttpClient };

package/data-structures/http/HttpClient.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./BasicHttpClient.cjs");let n=new i.BasicHttpClient;const l={setHttpClient:t=>{n=t},get:(t,e)=>n.get(t,e),post:(t,e,p)=>n.post(t,e,p),put:(t,e,p)=>n.put(t,e,p),patch:(t,e,p)=>n.patch(t,e,p),delete:(t,e)=>n.delete(t,e)};exports.httpClient=l;
+var e=new(require(`./BasicHttpClient.cjs`)).BasicHttpClient,t={setHttpClient:t=>{e=t},get:(t,n)=>e.get(t,n),post:(t,n,r)=>e.post(t,n,r),put:(t,n,r)=>e.put(t,n,r),patch:(t,n,r)=>e.patch(t,n,r),delete:(t,n)=>e.delete(t,n)};exports.httpClient=t;

package/data-structures/http/HttpClient.d.ts

@@ -2,9 +2,9 @@ import { HttpClient } from '../../types/http.types';
 declare const httpClient: {
     setHttpClient: (client: HttpClient) => void;
     get: <T = any>(url: string, config?: any) => Promise<T>;
-    post: <T_1 = any>(url: string, data?: any, config?: any) => Promise<T_1>;
-    put: <T_2 = any>(url: string, data?: any, config?: any) => Promise<T_2>;
-    patch: <T_3 = any>(url: string, data?: any, config?: any) => Promise<T_3>;
-    delete: <T_4 = any>(url: string, config?: any) => Promise<T_4>;
+    post: <T = any>(url: string, data?: any, config?: any) => Promise<T>;
+    put: <T = any>(url: string, data?: any, config?: any) => Promise<T>;
+    patch: <T = any>(url: string, data?: any, config?: any) => Promise<T>;
+    delete: <T = any>(url: string, config?: any) => Promise<T>;
 };
 export { httpClient };

package/data-structures/http/HttpClient.mjs

@@ -1,15 +1,14 @@
-import { BasicHttpClient as l } from "./BasicHttpClient.mjs";
-let p = new l();
-const o = {
-  setHttpClient: (t) => {
-    p = t;
-  },
-  get: (t, e) => p.get(t, e),
-  post: (t, e, n) => p.post(t, e, n),
-  put: (t, e, n) => p.put(t, e, n),
-  patch: (t, e, n) => p.patch(t, e, n),
-  delete: (t, e) => p.delete(t, e)
-};
-export {
-  o as httpClient
+import { BasicHttpClient as e } from "./BasicHttpClient.mjs";
+//#region ../shared/common/src/data-structures/http/HttpClient.ts
+var t = new e(), n = {
+	setHttpClient: (e) => {
+		t = e;
+	},
+	get: (e, n) => t.get(e, n),
+	post: (e, n, r) => t.post(e, n, r),
+	put: (e, n, r) => t.put(e, n, r),
+	patch: (e, n, r) => t.patch(e, n, r),
+	delete: (e, n) => t.delete(e, n)
 };
+//#endregion
+export { n as httpClient };

package/data-structures/http/index.cjs

@@ -0,0 +1 @@
+require(`./BasicHttpClient.cjs`),require(`./HttpClient.cjs`);

package/data-structures/http/index.mjs

@@ -0,0 +1,2 @@
+import "./BasicHttpClient.mjs";
+import "./HttpClient.mjs";

package/data-structures/index.cjs

@@ -0,0 +1 @@
+require(`./http/BasicHttpClient.cjs`),require(`./http/HttpClient.cjs`),require(`./http/index.cjs`),require(`./custom-token-registry/CustomTokenRegistry.cjs`),require(`./ValueCache/ValueCache.cjs`),require(`./crypto-keys/keyUtils.cjs`),require(`./crypto-keys/keys.cjs`),require(`./utxo/Utxo.cjs`),require(`./crypto-keys/decodeUTXO.cjs`),require(`./crypto-keys/encryptDecryptUtxo.cjs`),require(`./crypto-keys/index.cjs`),require(`./TokenDBs/token-visibility-db.cjs`),require(`./TokenDBs/PrivateTokensDB.cjs`),require(`./token-price-fetcher/TokenChecker.cjs`),require(`./AccountActions/AccountActions.cjs`),require(`./cacheDevices/FileCacheDevice.cjs`),require(`./cacheDevices/LocalStorageCacheDevice.cjs`),require(`./cacheDevices/index.cjs`),require(`./merkle-tree/MerkleTreeIncompleteError.cjs`),require(`./merkle-tree/MerkleTree.cjs`),require(`./merkle-tree/getPatchedAccessTokenMerkleTree.cjs`),require(`./merkle-tree/index.cjs`),require(`./Hinkal/hinkalDeposit.cjs`),require(`./Hinkal/hinkalDepositAndWithdraw.cjs`),require(`./Hinkal/hinkalSwap.cjs`),require(`./Hinkal/hinkalWithdraw.cjs`),require(`./event-service/evm/AbstractEventService.cjs`),require(`./event-service/evm/AbstractSnapshotService.cjs`),require(`./event-service/evm/AbstractAccessTokenSnapshotService.cjs`),require(`./event-service/evm/AbstractCommitmentsSnapshotService.cjs`),require(`./event-service/evm/AbstractApprovalsSnapshotService.cjs`),require(`./event-service/evm/AbstractNullifierSnapshotService.cjs`),require(`./BlockchainEvent/BlockchainEvent.cjs`),require(`./event-service/evm/BlockchainEventEmitter.cjs`),require(`./event-service/evm/PollingBlockchainEventEmitter.cjs`),require(`./event-service/evm/ClientBlockchainEventEmitter.cjs`),require(`./event-service/solana/SolanaBlockchainEventEmitter.cjs`),require(`./event-service/solana/ClientSolanaBlockchainEventEmitter.cjs`),require(`./event-service/solana/PollingSolanaBlockchainEventEmitter.cjs`),require(`./event-service/solana/AbstractSolanaEventService.cjs`),require(`./event-service/solana/AbstractSolanaSnapshotService.cjs`),require(`./event-service/solana/AbstractSolanaNullifierSnapshotService.cjs`),require(`./event-service/solana/AbstractSolanaCommitmentsSnapshotService.cjs`),require(`./event-service/solana/AbstractSolanaAccessTokenSnapshotService.cjs`),require(`./event-service/index.cjs`),require(`./snapshot/SnapshotFetcherService.cjs`),require(`./snapshot/solana-snapshots/ClientSolanaCommitmentsSnapshotService.cjs`),require(`./snapshot/solana-snapshots/ClientSolanaNullifierSnapshotService.cjs`),require(`./snapshot/solana-snapshots/ClientSolanaAccessTokenSnapshotService.cjs`),require(`./snapshot/evm-snapshots/ClientAccessTokenSnapshotService.cjs`),require(`./snapshot/evm-snapshots/ClientCommitmentsSnapshotService.cjs`),require(`./snapshot/evm-snapshots/ClientNullifierSnapshotService.cjs`),require(`./snapshot/evm-snapshots/ClientApprovalsSnapshotService.cjs`),require(`./snapshot/index.cjs`),require(`./Hinkal/resetMerkleTrees.cjs`),require(`./MultiThreadedUtxoUtils/MultiThreadedUtxoUtils.cjs`),require(`./IndexedDB/activity-db.cjs`),require(`./IndexedDB/balances-db.cjs`),require(`./IndexedDB/private-balances-db.cjs`),require(`./IndexedDB/prices-db.cjs`),require(`./IndexedDB/contact-db.cjs`),require(`./IndexedDB/signatures-db.cjs`),require(`./IndexedDB/pay-activity-db.cjs`),require(`./IndexedDB/index.cjs`),require(`./Hinkal/hinkalPrivateWallet.cjs`),require(`./AccountActions/index.cjs`),require(`./TokenDBs/ArcPublicTokensDB.cjs`),require(`./TokenDBs/PublicTokensDB.cjs`),require(`./TokenDBs/index.cjs`),require(`./Hinkal/hinkalProxySwap.cjs`),require(`./Hinkal/hinkalTransfer.cjs`),require(`./Hinkal/hinkalSolanaTransfer.cjs`),require(`./Hinkal/hinkalSolanaProxySend.cjs`),require(`./Hinkal/hinkalSolanaProxySwap.cjs`),require(`./Hinkal/hinkalSolanaProxyShield.cjs`),require(`./Hinkal/hinkalClaimUtxo.cjs`),require(`./Hinkal/hinkalSolanaProoflessDeposit.cjs`),require(`./Hinkal/hinkalSolanaClaimUtxo.cjs`),require(`./Hinkal/hinkalWithdrawStuckUtxos.cjs`),require(`./Hinkal/Hinkal.cjs`),require(`./Hinkal/index.cjs`),require(`./token-price-fetcher/index.cjs`),require(`./transactions-manager/history/history.types.cjs`),require(`./presale/PresaleContractWrapper.cjs`),require(`./presale/index.cjs`),require(`./ApprovalDBs/EventsPublicApprovalsDB.cjs`),require(`./ApprovalDBs/index.cjs`);

package/data-structures/index.mjs

@@ -0,0 +1,87 @@
+import "./http/BasicHttpClient.mjs";
+import "./http/HttpClient.mjs";
+import "./http/index.mjs";
+import "./custom-token-registry/CustomTokenRegistry.mjs";
+import "./ValueCache/ValueCache.mjs";
+import "./crypto-keys/keyUtils.mjs";
+import "./crypto-keys/keys.mjs";
+import "./utxo/Utxo.mjs";
+import "./crypto-keys/decodeUTXO.mjs";
+import "./crypto-keys/encryptDecryptUtxo.mjs";
+import "./crypto-keys/index.mjs";
+import "./TokenDBs/token-visibility-db.mjs";
+import "./TokenDBs/PrivateTokensDB.mjs";
+import "./token-price-fetcher/TokenChecker.mjs";
+import "./AccountActions/AccountActions.mjs";
+import "./cacheDevices/FileCacheDevice.mjs";
+import "./cacheDevices/LocalStorageCacheDevice.mjs";
+import "./cacheDevices/index.mjs";
+import "./merkle-tree/MerkleTreeIncompleteError.mjs";
+import "./merkle-tree/MerkleTree.mjs";
+import "./merkle-tree/getPatchedAccessTokenMerkleTree.mjs";
+import "./merkle-tree/index.mjs";
+import "./Hinkal/hinkalDeposit.mjs";
+import "./Hinkal/hinkalDepositAndWithdraw.mjs";
+import "./Hinkal/hinkalSwap.mjs";
+import "./Hinkal/hinkalWithdraw.mjs";
+import "./event-service/evm/AbstractEventService.mjs";
+import "./event-service/evm/AbstractSnapshotService.mjs";
+import "./event-service/evm/AbstractAccessTokenSnapshotService.mjs";
+import "./event-service/evm/AbstractCommitmentsSnapshotService.mjs";
+import "./event-service/evm/AbstractApprovalsSnapshotService.mjs";
+import "./event-service/evm/AbstractNullifierSnapshotService.mjs";
+import "./BlockchainEvent/BlockchainEvent.mjs";
+import "./event-service/evm/BlockchainEventEmitter.mjs";
+import "./event-service/evm/PollingBlockchainEventEmitter.mjs";
+import "./event-service/evm/ClientBlockchainEventEmitter.mjs";
+import "./event-service/solana/SolanaBlockchainEventEmitter.mjs";
+import "./event-service/solana/ClientSolanaBlockchainEventEmitter.mjs";
+import "./event-service/solana/PollingSolanaBlockchainEventEmitter.mjs";
+import "./event-service/solana/AbstractSolanaEventService.mjs";
+import "./event-service/solana/AbstractSolanaSnapshotService.mjs";
+import "./event-service/solana/AbstractSolanaNullifierSnapshotService.mjs";
+import "./event-service/solana/AbstractSolanaCommitmentsSnapshotService.mjs";
+import "./event-service/solana/AbstractSolanaAccessTokenSnapshotService.mjs";
+import "./event-service/index.mjs";
+import "./snapshot/SnapshotFetcherService.mjs";
+import "./snapshot/solana-snapshots/ClientSolanaCommitmentsSnapshotService.mjs";
+import "./snapshot/solana-snapshots/ClientSolanaNullifierSnapshotService.mjs";
+import "./snapshot/solana-snapshots/ClientSolanaAccessTokenSnapshotService.mjs";
+import "./snapshot/evm-snapshots/ClientAccessTokenSnapshotService.mjs";
+import "./snapshot/evm-snapshots/ClientCommitmentsSnapshotService.mjs";
+import "./snapshot/evm-snapshots/ClientNullifierSnapshotService.mjs";
+import "./snapshot/evm-snapshots/ClientApprovalsSnapshotService.mjs";
+import "./snapshot/index.mjs";
+import "./Hinkal/resetMerkleTrees.mjs";
+import "./MultiThreadedUtxoUtils/MultiThreadedUtxoUtils.mjs";
+import "./IndexedDB/activity-db.mjs";
+import "./IndexedDB/balances-db.mjs";
+import "./IndexedDB/private-balances-db.mjs";
+import "./IndexedDB/prices-db.mjs";
+import "./IndexedDB/contact-db.mjs";
+import "./IndexedDB/signatures-db.mjs";
+import "./IndexedDB/pay-activity-db.mjs";
+import "./IndexedDB/index.mjs";
+import "./Hinkal/hinkalPrivateWallet.mjs";
+import "./AccountActions/index.mjs";
+import "./TokenDBs/ArcPublicTokensDB.mjs";
+import "./TokenDBs/PublicTokensDB.mjs";
+import "./TokenDBs/index.mjs";
+import "./Hinkal/hinkalProxySwap.mjs";
+import "./Hinkal/hinkalTransfer.mjs";
+import "./Hinkal/hinkalSolanaTransfer.mjs";
+import "./Hinkal/hinkalSolanaProxySend.mjs";
+import "./Hinkal/hinkalSolanaProxySwap.mjs";
+import "./Hinkal/hinkalSolanaProxyShield.mjs";
+import "./Hinkal/hinkalClaimUtxo.mjs";
+import "./Hinkal/hinkalSolanaProoflessDeposit.mjs";
+import "./Hinkal/hinkalSolanaClaimUtxo.mjs";
+import "./Hinkal/hinkalWithdrawStuckUtxos.mjs";
+import "./Hinkal/Hinkal.mjs";
+import "./Hinkal/index.mjs";
+import "./token-price-fetcher/index.mjs";
+import "./transactions-manager/history/history.types.mjs";
+import "./presale/PresaleContractWrapper.mjs";
+import "./presale/index.mjs";
+import "./ApprovalDBs/EventsPublicApprovalsDB.mjs";
+import "./ApprovalDBs/index.mjs";

package/data-structures/merkle-tree/MerkleTree.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("../../constants/protocol.constants.cjs"),c=require("../../error-handling/logError.cjs"),u=require("./MerkleTreeIncompleteError.cjs");class l{constructor(t,e,r,n,i,s,h){this.hashFunction=t,this.levels=e,this.defaultNodeValue=r,this.tree=n??new Map,this.count=h??0n,this.index=s??2n**(e-1n),i?this.reverseTree=i:this.reverseTree=this.createReverseTree()}tree;count;index;reverseTree;static createWithData(t,e,r,n,i,s,h){return new l(i,s,h,t,e,r,n)}static create(t,e,r=o.MERKLE_LEVELS){return new l(t,r,e)}createReverseTree(){const t=new Map;for(let e=this.getStartIndex();e<this.getStartIndex()+this.count;e+=1n){const r=this.tree.get(e);r!==void 0&&t.set(r,e)}return t}getStartIndex(){return 2n**(this.levels-1n)}logarithm2(t){let e=0n;for(;2n**e<t;)e+=1n;return e}bigIntMax(t,e){return t>e?t:e}forceInsert(t,e){if(e<this.getStartIndex())throw new RangeError;this.tree.set(e,t),this.reverseTree.set(t,e);const r=this.index-this.getStartIndex(),n=this.logarithm2(r);let i=e;for(let s=1n;s<=n;s+=1n){i/=2n;const h=this.hashFunction(this.tree.get(i*2n)||this.defaultNodeValue,this.tree.get(i*2n+1n)||this.defaultNodeValue);this.tree.set(i,h)}}insert(t,e){let r=!1;this.tree.has(e)&&(r=!0,c.logError(`Editing commitment index: ${e} `)),r||(this.count+=1n),this.index=this.bigIntMax(this.index,e+1n),this.forceInsert(t,e)}remove(t){this.forceInsert(this.defaultNodeValue,t)}completenessCheck(){if(this.count!==this.index-this.getStartIndex())throw new u.MerkleTreeIncompleteError}getRootHash(){this.completenessCheck();for(let t=1n;t<2n**this.levels;t*=2n)if(this.tree.get(t))return this.tree.get(t);return this.defaultNodeValue}getMerkleData(){return this.completenessCheck(),new Map(this.tree)}getValue(t){return this.tree.get(t)}getSiblingIndex(t){return t===1n?1n:t%2n===1n?t-1n:t+1n}getSiblingHashesForVerification(t){this.completenessCheck();let e=this.reverseTree.get(t);if(e===void 0)return new Array(Number(o.CIRCOM_MERKLE_LENGTH)).fill(0n);const r=[];for(;e!==0n;)r.push(this.tree.get(this.getSiblingIndex(e))||this.defaultNodeValue),e/=2n;return r.slice(0,o.CIRCOM_MERKLE_LENGTH)}getSiblingSides(t){this.completenessCheck();let e=this.reverseTree.get(t);if(e===void 0)return new Array(Number(o.CIRCOM_MERKLE_LENGTH)).fill(0n);const r=[];for(;e!==0n;){const n=e%2n===0n?0n:1n;r.push(n),e/=2n}return r.slice(0,o.CIRCOM_MERKLE_LENGTH)}toJSON(){const{tree:t,reverseTree:e,count:r,index:n}=this;return{tree:Object.fromEntries(t),reverseTree:Object.fromEntries(e),count:r.toString(),index:n.toString()}}toJSONLite(){const{tree:t,count:e,index:r}=this;return{tree:Object.fromEntries(t),count:e.toString(),index:r.toString()}}clone(){return l.createWithData(new Map(this.tree),new Map(this.reverseTree),this.index,this.count,this.hashFunction,this.levels,this.defaultNodeValue)}getIndex(){return this.index}}exports.MerkleTree=l;
+const e=require(`../../constants/protocol.constants.cjs`),t=require(`../../error-handling/logError.cjs`),n=require(`./MerkleTreeIncompleteError.cjs`);var r=class r{tree;count;index;reverseTree;static createWithData(e,t,n,i,a,o,s){return new r(a,o,s,e,t,n,i)}static create(t,n,i=e.MERKLE_LEVELS){return new r(t,i,n)}createReverseTree(){let e=new Map;for(let t=this.getStartIndex();t<this.getStartIndex()+this.count;t+=1n){let n=this.tree.get(t);n!==void 0&&e.set(n,t)}return e}constructor(e,t,n,r,i,a,o){this.hashFunction=e,this.levels=t,this.defaultNodeValue=n,this.tree=r??new Map,this.count=o??0n,this.index=a??2n**(t-1n),i?this.reverseTree=i:this.reverseTree=this.createReverseTree()}getStartIndex(){return 2n**(this.levels-1n)}logarithm2(e){let t=0n;for(;2n**t<e;)t+=1n;return t}bigIntMax(e,t){return e>t?e:t}forceInsert(e,t){if(t<this.getStartIndex())throw RangeError();this.tree.set(t,e),this.reverseTree.set(e,t);let n=this.index-this.getStartIndex(),r=this.logarithm2(n),i=t;for(let e=1n;e<=r;e+=1n){i/=2n;let e=this.hashFunction(this.tree.get(i*2n)||this.defaultNodeValue,this.tree.get(i*2n+1n)||this.defaultNodeValue);this.tree.set(i,e)}}insert(e,n){let r=!1;this.tree.has(n)&&(r=!0,t.logError(`Editing commitment index: ${n} `)),r||(this.count+=1n),this.index=this.bigIntMax(this.index,n+1n),this.forceInsert(e,n)}remove(e){this.forceInsert(this.defaultNodeValue,e)}completenessCheck(){if(this.count!==this.index-this.getStartIndex())throw new n.MerkleTreeIncompleteError}getRootHash(){this.completenessCheck();for(let e=1n;e<2n**this.levels;e*=2n)if(this.tree.get(e))return this.tree.get(e);return this.defaultNodeValue}getMerkleData(){return this.completenessCheck(),new Map(this.tree)}getValue(e){return this.tree.get(e)}getSiblingIndex(e){return e===1n?1n:e%2n==1n?e-1n:e+1n}getSiblingHashesForVerification(e){this.completenessCheck();let t=this.reverseTree.get(e);if(t===void 0)return Array(25).fill(0n);let n=[];for(;t!==0n;)n.push(this.tree.get(this.getSiblingIndex(t))||this.defaultNodeValue),t/=2n;return n.slice(0,25)}getSiblingSides(e){this.completenessCheck();let t=this.reverseTree.get(e);if(t===void 0)return Array(25).fill(0n);let n=[];for(;t!==0n;){let e=t%2n==0n?0n:1n;n.push(e),t/=2n}return n.slice(0,25)}toJSON(){let{tree:e,reverseTree:t,count:n,index:r}=this;return{tree:Object.fromEntries(e),reverseTree:Object.fromEntries(t),count:n.toString(),index:r.toString()}}toJSONLite(){let{tree:e,count:t,index:n}=this;return{tree:Object.fromEntries(e),count:t.toString(),index:n.toString()}}clone(){return r.createWithData(new Map(this.tree),new Map(this.reverseTree),this.index,this.count,this.hashFunction,this.levels,this.defaultNodeValue)}getIndex(){return this.index}};exports.MerkleTree=r;

package/data-structures/merkle-tree/MerkleTree.mjs

@@ -1,178 +1,116 @@
-import { MERKLE_LEVELS as u, CIRCOM_MERKLE_LENGTH as o } from "../../constants/protocol.constants.mjs";
-import { logError as c } from "../../error-handling/logError.mjs";
-import { MerkleTreeIncompleteError as a } from "./MerkleTreeIncompleteError.mjs";
-class l {
-  constructor(t, e, r, i, n, s, h) {
-    this.hashFunction = t, this.levels = e, this.defaultNodeValue = r, this.tree = i ?? /* @__PURE__ */ new Map(), this.count = h ?? 0n, this.index = s ?? 2n ** (e - 1n), n ? this.reverseTree = n : this.reverseTree = this.createReverseTree();
-  }
-  /**
-   * the map where the items are stored
-   */
-  tree;
-  /**
-   * amount of elements inserted inside the bottom row of the tree
-   */
-  count;
-  /**
-   * the maximum index inserted into the tree
-   * used together with count to make sure that the merkle tree is complete.
-   * meaning that there aren't any missing elements between getStartIndex() and index
-   */
-  index;
-  reverseTree;
-  static createWithData(t, e, r, i, n, s, h) {
-    return new l(n, s, h, t, e, r, i);
-  }
-  /**
-   * @param hashFunction the hashFunction used to fill the upper layers of the merkle tree
-   * @param levels the amount of layers in the merkle tree
-   * @param defaultNodeValue the default value of an empty node in the merkle tree
-   */
-  static create(t, e, r = u) {
-    return new l(t, r, e);
-  }
-  createReverseTree() {
-    const t = /* @__PURE__ */ new Map();
-    for (let e = this.getStartIndex(); e < this.getStartIndex() + this.count; e += 1n) {
-      const r = this.tree.get(e);
-      r !== void 0 && t.set(r, e);
-    }
-    return t;
-  }
-  /**
-   * get starting nodeIndex from which inserts are allowed
-   */
-  getStartIndex() {
-    return 2n ** (this.levels - 1n);
-  }
-  /**
-   * implementation of logarithm2 function from merkle contract
-   */
-  logarithm2(t) {
-    let e = 0n;
-    for (; 2n ** e < t; )
-      e += 1n;
-    return e;
-  }
-  bigIntMax(t, e) {
-    return t > e ? t : e;
-  }
-  forceInsert(t, e) {
-    if (e < this.getStartIndex())
-      throw new RangeError();
-    this.tree.set(e, t), this.reverseTree.set(t, e);
-    const r = this.index - this.getStartIndex(), i = this.logarithm2(r);
-    let n = e;
-    for (let s = 1n; s <= i; s += 1n) {
-      n /= 2n;
-      const h = this.hashFunction(
-        this.tree.get(n * 2n) || this.defaultNodeValue,
-        this.tree.get(n * 2n + 1n) || this.defaultNodeValue
-      );
-      this.tree.set(n, h);
-    }
-  }
-  /**
-   * insert value into the merkle tree
-   * @param value the value to insert
-   * @param nodeIndex the index to insert the value, you can get starting index from getStartIndex()
-   * @throws will throw RangeError if nodeIndex is less than getStartIndex()
-   */
-  insert(t, e) {
-    let r = !1;
-    this.tree.has(e) && (r = !0, c(`Editing commitment index: ${e} `)), r || (this.count += 1n), this.index = this.bigIntMax(this.index, e + 1n), this.forceInsert(t, e);
-  }
-  remove(t) {
-    this.forceInsert(this.defaultNodeValue, t);
-  }
-  completenessCheck() {
-    if (this.count !== this.index - this.getStartIndex())
-      throw new a();
-  }
-  /**
-   * get root hash of the merkle tree
-   * @returns the hash, if the merkle tree is empty, will return
-   * @throws will throw MerkleTreeIncompleteError if there are missing elements in the tree
-   */
-  getRootHash() {
-    this.completenessCheck();
-    for (let t = 1n; t < 2n ** this.levels; t *= 2n)
-      if (this.tree.get(t))
-        return this.tree.get(t);
-    return this.defaultNodeValue;
-  }
-  getMerkleData() {
-    return this.completenessCheck(), new Map(this.tree);
-  }
-  getValue(t) {
-    return this.tree.get(t);
-  }
-  getSiblingIndex(t) {
-    return t === 1n ? 1n : t % 2n === 1n ? t - 1n : t + 1n;
-  }
-  /**
-   * get sibling hashes needed by main.circom
-   * @throws will throw MerkleTreeIncompleteError if there are missing elements in the tree
-   */
-  getSiblingHashesForVerification(t) {
-    this.completenessCheck();
-    let e = this.reverseTree.get(t);
-    if (e === void 0)
-      return new Array(Number(o)).fill(0n);
-    const r = [];
-    for (; e !== 0n; )
-      r.push(this.tree.get(this.getSiblingIndex(e)) || this.defaultNodeValue), e /= 2n;
-    return r.slice(0, o);
-  }
-  /**
-   * get item's sibling hashes side
-   * @returns sibling's indexes
-   * @throws will throw MerkleTreeIncompleteError if there are missing elements in the tree
-   */
-  getSiblingSides(t) {
-    this.completenessCheck();
-    let e = this.reverseTree.get(t);
-    if (e === void 0)
-      return new Array(Number(o)).fill(0n);
-    const r = [];
-    for (; e !== 0n; ) {
-      const i = e % 2n === 0n ? 0n : 1n;
-      r.push(i), e /= 2n;
-    }
-    return r.slice(0, o);
-  }
-  toJSON() {
-    const { tree: t, reverseTree: e, count: r, index: i } = this;
-    return {
-      tree: Object.fromEntries(t),
-      reverseTree: Object.fromEntries(e),
-      count: r.toString(),
-      index: i.toString()
-    };
-  }
-  toJSONLite() {
-    const { tree: t, count: e, index: r } = this;
-    return {
-      tree: Object.fromEntries(t),
-      count: e.toString(),
-      index: r.toString()
-    };
-  }
-  clone() {
-    return l.createWithData(
-      new Map(this.tree),
-      new Map(this.reverseTree),
-      this.index,
-      this.count,
-      this.hashFunction,
-      this.levels,
-      this.defaultNodeValue
-    );
-  }
-  getIndex() {
-    return this.index;
-  }
-}
-export {
-  l as MerkleTree
+import { MERKLE_LEVELS as e } from "../../constants/protocol.constants.mjs";
+import { logError as t } from "../../error-handling/logError.mjs";
+import { MerkleTreeIncompleteError as n } from "./MerkleTreeIncompleteError.mjs";
+//#region ../shared/common/src/data-structures/merkle-tree/MerkleTree.ts
+var r = class r {
+	tree;
+	count;
+	index;
+	reverseTree;
+	static createWithData(e, t, n, i, a, o, s) {
+		return new r(a, o, s, e, t, n, i);
+	}
+	static create(t, n, i = e) {
+		return new r(t, i, n);
+	}
+	createReverseTree() {
+		let e = /* @__PURE__ */ new Map();
+		for (let t = this.getStartIndex(); t < this.getStartIndex() + this.count; t += 1n) {
+			let n = this.tree.get(t);
+			n !== void 0 && e.set(n, t);
+		}
+		return e;
+	}
+	constructor(e, t, n, r, i, a, o) {
+		this.hashFunction = e, this.levels = t, this.defaultNodeValue = n, this.tree = r ?? /* @__PURE__ */ new Map(), this.count = o ?? 0n, this.index = a ?? 2n ** (t - 1n), i ? this.reverseTree = i : this.reverseTree = this.createReverseTree();
+	}
+	getStartIndex() {
+		return 2n ** (this.levels - 1n);
+	}
+	logarithm2(e) {
+		let t = 0n;
+		for (; 2n ** t < e;) t += 1n;
+		return t;
+	}
+	bigIntMax(e, t) {
+		return e > t ? e : t;
+	}
+	forceInsert(e, t) {
+		if (t < this.getStartIndex()) throw RangeError();
+		this.tree.set(t, e), this.reverseTree.set(e, t);
+		let n = this.index - this.getStartIndex(), r = this.logarithm2(n), i = t;
+		for (let e = 1n; e <= r; e += 1n) {
+			i /= 2n;
+			let e = this.hashFunction(this.tree.get(i * 2n) || this.defaultNodeValue, this.tree.get(i * 2n + 1n) || this.defaultNodeValue);
+			this.tree.set(i, e);
+		}
+	}
+	insert(e, n) {
+		let r = !1;
+		this.tree.has(n) && (r = !0, t(`Editing commitment index: ${n} `)), r || (this.count += 1n), this.index = this.bigIntMax(this.index, n + 1n), this.forceInsert(e, n);
+	}
+	remove(e) {
+		this.forceInsert(this.defaultNodeValue, e);
+	}
+	completenessCheck() {
+		if (this.count !== this.index - this.getStartIndex()) throw new n();
+	}
+	getRootHash() {
+		this.completenessCheck();
+		for (let e = 1n; e < 2n ** this.levels; e *= 2n) if (this.tree.get(e)) return this.tree.get(e);
+		return this.defaultNodeValue;
+	}
+	getMerkleData() {
+		return this.completenessCheck(), new Map(this.tree);
+	}
+	getValue(e) {
+		return this.tree.get(e);
+	}
+	getSiblingIndex(e) {
+		return e === 1n ? 1n : e % 2n == 1n ? e - 1n : e + 1n;
+	}
+	getSiblingHashesForVerification(e) {
+		this.completenessCheck();
+		let t = this.reverseTree.get(e);
+		if (t === void 0) return Array(25).fill(0n);
+		let n = [];
+		for (; t !== 0n;) n.push(this.tree.get(this.getSiblingIndex(t)) || this.defaultNodeValue), t /= 2n;
+		return n.slice(0, 25);
+	}
+	getSiblingSides(e) {
+		this.completenessCheck();
+		let t = this.reverseTree.get(e);
+		if (t === void 0) return Array(25).fill(0n);
+		let n = [];
+		for (; t !== 0n;) {
+			let e = t % 2n == 0n ? 0n : 1n;
+			n.push(e), t /= 2n;
+		}
+		return n.slice(0, 25);
+	}
+	toJSON() {
+		let { tree: e, reverseTree: t, count: n, index: r } = this;
+		return {
+			tree: Object.fromEntries(e),
+			reverseTree: Object.fromEntries(t),
+			count: n.toString(),
+			index: r.toString()
+		};
+	}
+	toJSONLite() {
+		let { tree: e, count: t, index: n } = this;
+		return {
+			tree: Object.fromEntries(e),
+			count: t.toString(),
+			index: n.toString()
+		};
+	}
+	clone() {
+		return r.createWithData(new Map(this.tree), new Map(this.reverseTree), this.index, this.count, this.hashFunction, this.levels, this.defaultNodeValue);
+	}
+	getIndex() {
+		return this.index;
+	}
 };
+//#endregion
+export { r as MerkleTree };

package/data-structures/merkle-tree/MerkleTreeIncompleteError.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class e extends Error{constructor(){super("Merkle tree is incomplete"),this.name="MerkleTreeIncompleteError"}}exports.MerkleTreeIncompleteError=e;
+var e=class extends Error{constructor(){super(`Merkle tree is incomplete`),this.name=`MerkleTreeIncompleteError`}};exports.MerkleTreeIncompleteError=e;

package/data-structures/merkle-tree/MerkleTreeIncompleteError.mjs

@@ -1,8 +1,8 @@
-class r extends Error {
-  constructor() {
-    super("Merkle tree is incomplete"), this.name = "MerkleTreeIncompleteError";
-  }
-}
-export {
-  r as MerkleTreeIncompleteError
+//#region ../shared/common/src/data-structures/merkle-tree/MerkleTreeIncompleteError.ts
+var e = class extends Error {
+	constructor() {
+		super("Merkle tree is incomplete"), this.name = "MerkleTreeIncompleteError";
+	}
 };
+//#endregion
+export { e as MerkleTreeIncompleteError };

package/data-structures/merkle-tree/getPatchedAccessTokenMerkleTree.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../../functions/web3/etherFunctions.cjs"),c=require("../../crypto/poseidon.cjs"),i=require("./MerkleTree.cjs"),u=(r,n,o,t)=>{if(!t||o){const e=i.MerkleTree.create(c.poseidonFunction,0n);return e.insert(BigInt(n),e.getStartIndex()),t||e.insert(s.randomBigInt(31),e.getStartIndex()+1n),e}return r};exports.getPatchedAccessTokenMerkleTree=u;
+const e=require(`../../functions/web3/etherFunctions.cjs`),t=require(`../../crypto/poseidon.cjs`),n=require(`./MerkleTree.cjs`);var r=(r,i,a,o)=>{if(!o||a){let r=n.MerkleTree.create(t.poseidonFunction,0n);return r.insert(BigInt(i),r.getStartIndex()),o||r.insert(e.randomBigInt(31),r.getStartIndex()+1n),r}return r};exports.getPatchedAccessTokenMerkleTree=r;

package/data-structures/merkle-tree/getPatchedAccessTokenMerkleTree.mjs

@@ -1,13 +1,13 @@
-import { randomBigInt as i } from "../../functions/web3/etherFunctions.mjs";
-import { poseidonFunction as m } from "../../crypto/poseidon.mjs";
-import { MerkleTree as s } from "./MerkleTree.mjs";
-const g = (r, n, o, t) => {
-  if (!t || o) {
-    const e = s.create(m, 0n);
-    return e.insert(BigInt(n), e.getStartIndex()), t || e.insert(i(31), e.getStartIndex() + 1n), e;
-  }
-  return r;
-};
-export {
-  g as getPatchedAccessTokenMerkleTree
+import { randomBigInt as e } from "../../functions/web3/etherFunctions.mjs";
+import { poseidonFunction as t } from "../../crypto/poseidon.mjs";
+import { MerkleTree as n } from "./MerkleTree.mjs";
+//#region ../shared/common/src/data-structures/merkle-tree/getPatchedAccessTokenMerkleTree.ts
+var r = (r, i, a, o) => {
+	if (!o || a) {
+		let r = n.create(t, 0n);
+		return r.insert(BigInt(i), r.getStartIndex()), o || r.insert(e(31), r.getStartIndex() + 1n), r;
+	}
+	return r;
 };
+//#endregion
+export { r as getPatchedAccessTokenMerkleTree };

package/data-structures/merkle-tree/index.cjs

@@ -0,0 +1 @@
+require(`./MerkleTreeIncompleteError.cjs`),require(`./MerkleTree.cjs`),require(`./getPatchedAccessTokenMerkleTree.cjs`);

package/data-structures/merkle-tree/index.mjs

@@ -0,0 +1,3 @@
+import "./MerkleTreeIncompleteError.mjs";
+import "./MerkleTree.mjs";
+import "./getPatchedAccessTokenMerkleTree.mjs";

package/data-structures/presale/PresaleContractWrapper.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../../constants/presale.constants.cjs"),n=require("ethers");class o{contract;eventsFrom;constructor(t,e){const{address:r,eventsFrom:a}=s.presaleContractInfoByChain[e];this.contract=new n.ethers.Contract(r,s.presaleABI,t),this.eventsFrom=a}deposit(t,e,r){return this.contract.deposit(t.erc20TokenAddress,e,r)}withdraw(t,e){return this.contract.withdraw(t,e)}moveToNextStage(t){return this.contract.moveToNextStage(t||{})}async estimateMoveToNextStageGas(){return this.contract.moveToNextStage.estimateGas()}async getTotalDeposit(){return await this.contract.totalDeposit()}async getDeposits(t,e){return await this.contract.deposits(t,e.erc20TokenAddress)}async getTotalHINK(t){return await this.contract.totalHINK(t)}async getCurrentPresaleStageIndex(){const t=await this.contract.currentPresaleStageIndex();return Number(t)}async getCurrentMaxDepositAmount(){return await this.contract.currentMaxDepositAmount()}async currentPresaleStage(){const[t,e]=await this.contract.currentPresaleStage(),[r,a]=[t,e].map(BigInt);return{amountToRaise:r,priceMultiplier:a}}async calculateHINK(t){return await this.contract.calculateHINK(t)}async queryDeposits(){return this.contract.queryFilter(this.contract.filters.Deposit(),this.eventsFrom)}onEvent(t,e){this.contract.on(t,e)}}exports.PresaleContractWrapper=o;
+require(`../../_virtual/_rolldown/runtime.cjs`);const e=require(`../../constants/presale.constants.cjs`);let t=require(`ethers`);var n=class{contract;eventsFrom;constructor(n,r){let{address:i,eventsFrom:a}=e.presaleContractInfoByChain[r];this.contract=new t.ethers.Contract(i,e.presaleABI,n),this.eventsFrom=a}deposit(e,t,n){return this.contract.deposit(e.erc20TokenAddress,t,n)}withdraw(e,t){return this.contract.withdraw(e,t)}moveToNextStage(e){return this.contract.moveToNextStage(e||{})}async estimateMoveToNextStageGas(){return this.contract.moveToNextStage.estimateGas()}async getTotalDeposit(){return await this.contract.totalDeposit()}async getDeposits(e,t){return await this.contract.deposits(e,t.erc20TokenAddress)}async getTotalHINK(e){return await this.contract.totalHINK(e)}async getCurrentPresaleStageIndex(){let e=await this.contract.currentPresaleStageIndex();return Number(e)}async getCurrentMaxDepositAmount(){return await this.contract.currentMaxDepositAmount()}async currentPresaleStage(){let[e,t]=await this.contract.currentPresaleStage(),[n,r]=[e,t].map(BigInt);return{amountToRaise:n,priceMultiplier:r}}async calculateHINK(e){return await this.contract.calculateHINK(e)}async queryDeposits(){return this.contract.queryFilter(this.contract.filters.Deposit(),this.eventsFrom)}onEvent(e,t){this.contract.on(e,t)}};exports.PresaleContractWrapper=n;