@hinkal/common 0.2.12 → 0.2.14

package/data-structures/event-service/AbstractCommitmentsSnapshotService.mjs

@@ -1,13 +1,16 @@
-import { poseidonFunction as m } from "../../crypto/poseidon.mjs";
+import { poseidonFunction as s } from "../../crypto/poseidon.mjs";
 import "circomlibjs-hinkal-fork";
 import "libsodium-wrappers";
 import "process";
 import "buffer";
-import { MerkleTree as s } from "../merkle-tree/MerkleTree.mjs";
-import { toBigInt as n } from "../../functions/utils/amounts.utils.mjs";
-import { AbstractSnapshotService as i } from "./AbstractSnapshotService.mjs";
-class v extends i {
-  constructor(e, t, u, r) {
+import { MerkleTree as i } from "../merkle-tree/MerkleTree.mjs";
+import "ethers";
+import "../../error-handling/error-codes.constants.mjs";
+import { toBigInt as m } from "../../functions/utils/amounts.utils.mjs";
+import { AbstractSnapshotService as p } from "./AbstractSnapshotService.mjs";
+import { contructMerkleTreeFromSerialized as n } from "../../functions/utils/merkleTree.utils.mjs";
+class _ extends p {
+  constructor(e, t, r, u) {
     super(
       e,
       {
@@ -15,8 +18,8 @@ class v extends i {
         args: ["commitment", "index", "encryptedOutput"]
       },
       t,
-      u,
-      r
+      r,
+      u
     );
   }
   _merkleTree;
@@ -40,33 +43,17 @@ class v extends i {
   }
   deserializeSnapshot(e) {
     let t;
-    if (e.latestBlockNumber && e.merkleTree) {
-      const r = new Map(
-        Object.entries(e.merkleTree.tree).map(([c, p]) => [
-          BigInt(c),
-          BigInt(p)
-        ])
-      );
-      t = s.createWithData(
-        r,
-        n(e.merkleTree.index),
-        n(e.merkleTree.count),
-        m,
-        25n,
-        0n
-      );
-    } else
-      t = s.create(m, 25n, 0n);
-    const u = e.encryptedOutputs?.map((r) => ({
-      value: r.value,
-      isPositive: JSON.parse(r.isPositive)
+    e.latestBlockNumber && e.merkleTree ? t = n(e.merkleTree) : t = i.create(s, 25n, 0n);
+    const r = e.encryptedOutputs?.map((u) => ({
+      value: u.value,
+      isPositive: JSON.parse(u.isPositive)
     }));
     return {
       latestBlockNumber: e.latestBlockNumber ?? 0,
       reserveBlockNumber: e.reserveBlockNumber ?? 0,
       payload: {
         merkleTree: t,
-        encryptedOutputs: u || []
+        encryptedOutputs: r || []
       }
     };
   }
@@ -82,26 +69,26 @@ class v extends i {
     this._merkleTree = e, this._encryptedOutputs = t;
   }
   mapEvent(e) {
-    const { commitment: t, index: u, encryptedOutput: r } = e;
+    const { commitment: t, index: r, encryptedOutput: u } = e;
     return {
-      commitment: n(t),
-      index: n(u),
-      encryptedOutput: r
+      commitment: m(t),
+      index: m(r),
+      encryptedOutput: u
     };
   }
   acceptEvent(e, t) {
-    if (!this.encryptedOutputs.map((u) => u.value).includes(e.encryptedOutput)) {
+    if (!this.encryptedOutputs.map((r) => r.value).includes(e.encryptedOutput)) {
       if (!this._merkleTree.insert(e.commitment, e.index >= 0 ? e.index : -1n * e.index))
         return !1;
-      const r = {
+      const u = {
         value: e.encryptedOutput,
         isPositive: e.index >= 0n
       };
-      return this._encryptedOutputs.push(r), !0;
+      return this._encryptedOutputs.push(u), !0;
     }
     return !1;
   }
 }
 export {
-  v as AbstractCommitmentsSnapshotService
+  _ as AbstractCommitmentsSnapshotService
 };

package/data-structures/event-service/AbstractEventService.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("../../constants/reorg-depths.constants.cjs"),o=require("../../functions/utils/resolve-sync.utils.cjs");require("ethers");require("axios");require("../../constants/chains.constants.cjs");require("../../constants/vite.constants.cjs");require("../../types/circom-data.types.cjs");require("../../types/transactions.types.cjs");require("../../types/curve.types.cjs");require("circomlibjs-hinkal-fork");require("libsodium-wrappers");require("process");require("buffer");const v=require("../../error-handling/logError.cjs");class g{contract;eventConfig;_latestBlockNumber;maxPageSize;isReady=!1;_onNewEvent;isServer;intervalId;inProgress;constructor(e,r,t,s,n){this.contract=e,this.eventConfig=r,this._latestBlockNumber=t,this.maxPageSize=n,this.isServer=s,this.inProgress=!1}get latestBlockNumber(){return this._latestBlockNumber}set onNewEvent(e){this._onNewEvent=e}intervalClear(){this.isReady=!1,this._onNewEvent=void 0,clearInterval(this.intervalId)}async init(){if(this.isReady)throw new Error("Already initialized");this.isReady=!0,await this.retrieveEvents(this._latestBlockNumber+1),this.intervalId=setInterval(async()=>{await this.retrieveEvents(this.latestBlockNumber)},3500)}requireReady(){if(!this.isReady)throw new Error("Not ready")}emitNewEvent(e){this._onNewEvent?.(e)}getLastBlockNumberForEventRequest=async()=>{const e=await this.contract.provider.getBlockNumber();if(!this.isServer)return e;const{chainId:r}=await this.contract.provider.getNetwork();return Math.max(this.latestBlockNumber,e-u.blockReorgDepth[r]+1)};async retrieveEvents(e,r=!1){try{if(this.requireReady(),this.inProgress&&!r)return!1;this.inProgress=!0;const t=await this.getLastBlockNumberForEventRequest();if(t<e)return this.inProgress=!1,!1;const s=o.getSequence(e,t,this.maxPageSize);return await o.resolveSync(s.map(({from:n,to:i})=>async()=>{const c=await this.contract.queryFilter(this.contract.filters[this.eventConfig.name](),n,i);let a=[];c.length>0&&(a=await this.processEventsPage(c)),this._latestBlockNumber=i,await this.afterEventsAccepted(),a.length>0&&this.emitNewEvent()})),this.inProgress=!1,!0}catch(t){return v.logError("retrieveEvents error:",{err:t}),this.inProgress=!1,!1}}async processEventsPage(e){const r=[];return await o.resolveSync(e.map(t=>async()=>{const{args:s,blockNumber:n}=t;if(!s)throw new Error("Wrong event structure");const i=this.mapEvent(s);await this.acceptEvent(i,n)&&r.push(i)})),r}handleEvent=async(...e)=>{const{args:r}=this.eventConfig,{blockNumber:t}=e[e.length-1],s=e.slice(0,r.length),n=r.reduce((a,l,h)=>(a[l]=s[h],a),{});if(!t)throw new Error("Wrong event structure");const i=this.mapEvent(n);if(!await this.acceptEvent(i,t))throw new Error("Failed to retrieve events");this._latestBlockNumber=t,await this.afterEventsAccepted(),this.emitNewEvent(i)}}exports.AbstractEventService=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const v=require("../../constants/reorg-depths.constants.cjs"),o=require("../../functions/utils/resolve-sync.utils.cjs");class u{contract;eventConfig;_latestBlockNumber;maxPageSize;isReady=!1;_onNewEvent;isServer;intervalId;inProgress;constructor(e,t,s,r,i){this.contract=e,this.eventConfig=t,this._latestBlockNumber=s,this.maxPageSize=i,this.isServer=r,this.inProgress=!1}get latestBlockNumber(){return this._latestBlockNumber}set onNewEvent(e){this._onNewEvent=e}intervalClear(){this.isReady=!1,this._onNewEvent=void 0,clearInterval(this.intervalId)}async init(){if(this.isReady)throw new Error("Already initialized");this.isReady=!0,await this.retrieveEvents(this._latestBlockNumber+1),this.intervalId=setInterval(async()=>{await this.retrieveEvents(this.latestBlockNumber)},3500)}requireReady(){if(!this.isReady)throw new Error("Not ready")}emitNewEvent(e){this._onNewEvent?.(e)}getLastBlockNumberForEventRequest=async()=>{const e=await this.contract.provider.getBlockNumber();if(!this.isServer)return e;const{chainId:t}=await this.contract.provider.getNetwork();return Math.max(this.latestBlockNumber,e-v.blockReorgDepth[t]+1)};async retrieveEvents(e,t=!1){try{if(this.requireReady(),this.inProgress&&!t)return!1;this.inProgress=!0;const s=await this.getLastBlockNumberForEventRequest();if(s<e)return this.inProgress=!1,!1;const r=o.getSequence(e,s,this.maxPageSize);return await o.resolveSync(r.map(({from:i,to:n})=>async()=>{const a=await this.contract.queryFilter(this.contract.filters[this.eventConfig.name](),i,n);let c=[];a.length>0&&(c=await this.processEventsPage(a)),this._latestBlockNumber=n,await this.afterEventsAccepted(),c.length>0&&this.emitNewEvent()})),this.inProgress=!1,!0}catch{return this.inProgress=!1,!1}}async processEventsPage(e){const t=[];return await o.resolveSync(e.map(s=>async()=>{const{args:r,blockNumber:i,transactionHash:n}=s;if(!r)throw new Error("Wrong event structure");const a=this.mapEvent(r);await this.acceptEvent(a,i,n)&&t.push(a)})),t}handleEvent=async(...e)=>{const{args:t}=this.eventConfig,{blockNumber:s}=e[e.length-1],r=e.slice(0,t.length),i=t.reduce((c,l,h)=>(c[l]=r[h],c),{});if(!s)throw new Error("Wrong event structure");const n=this.mapEvent(i);if(!await this.acceptEvent(n,s))throw new Error("Failed to retrieve events");this._latestBlockNumber=s,await this.afterEventsAccepted(),this.emitNewEvent(n)}}exports.AbstractEventService=u;

package/data-structures/event-service/AbstractEventService.d.ts

@@ -25,7 +25,7 @@ export declare abstract class AbstractEventService<EventType, SerializedEventTyp
     protected retrieveEvents(fromBlockNumber: number, useForce?: boolean): Promise<boolean>;
     private processEventsPage;
     protected handleEvent: (...args: unknown[]) => Promise<void>;
-    protected abstract acceptEvent(event: EventType, blockNumber: number): boolean | Promise<boolean>;
+    protected abstract acceptEvent(event: EventType, blockNumber: number, txHash?: string): boolean | Promise<boolean>;
     protected abstract mapEvent(event: SerializedEventType): EventType;
     protected abstract afterEventsAccepted(): Promise<unknown>;
 }

package/data-structures/event-service/AbstractEventService.mjs

@@ -1,18 +1,6 @@
 import { blockReorgDepth as v } from "../../constants/reorg-depths.constants.mjs";
-import { getSequence as m, resolveSync as c } from "../../functions/utils/resolve-sync.utils.mjs";
-import "ethers";
-import "axios";
-import "../../constants/chains.constants.mjs";
-import "../../constants/vite.constants.mjs";
-import "../../types/circom-data.types.mjs";
-import "../../types/transactions.types.mjs";
-import "../../types/curve.types.mjs";
-import "circomlibjs-hinkal-fork";
-import "libsodium-wrappers";
-import "process";
-import "buffer";
-import { logError as u } from "../../error-handling/logError.mjs";
-class q {
+import { getSequence as u, resolveSync as o } from "../../functions/utils/resolve-sync.utils.mjs";
+class g {
   contract;
   eventConfig;
   _latestBlockNumber;
@@ -23,8 +11,8 @@ class q {
   intervalId;
   inProgress;
   // to remove race conditions
-  constructor(e, r, t, s, n) {
-    this.contract = e, this.eventConfig = r, this._latestBlockNumber = t, this.maxPageSize = n, this.isServer = s, this.inProgress = !1;
+  constructor(e, t, s, r, i) {
+    this.contract = e, this.eventConfig = t, this._latestBlockNumber = s, this.maxPageSize = i, this.isServer = r, this.inProgress = !1;
   }
   get latestBlockNumber() {
     return this._latestBlockNumber;
@@ -53,55 +41,55 @@ class q {
     const e = await this.contract.provider.getBlockNumber();
     if (!this.isServer)
       return e;
-    const { chainId: r } = await this.contract.provider.getNetwork();
-    return Math.max(this.latestBlockNumber, e - v[r] + 1);
+    const { chainId: t } = await this.contract.provider.getNetwork();
+    return Math.max(this.latestBlockNumber, e - v[t] + 1);
   };
-  async retrieveEvents(e, r = !1) {
+  async retrieveEvents(e, t = !1) {
     try {
-      if (this.requireReady(), this.inProgress && !r)
+      if (this.requireReady(), this.inProgress && !t)
         return !1;
       this.inProgress = !0;
-      const t = await this.getLastBlockNumberForEventRequest();
-      if (t < e)
+      const s = await this.getLastBlockNumberForEventRequest();
+      if (s < e)
         return this.inProgress = !1, !1;
-      const s = m(e, t, this.maxPageSize);
-      return await c(
-        s.map(({ from: n, to: i }) => async () => {
-          const o = await this.contract.queryFilter(
+      const r = u(e, s, this.maxPageSize);
+      return await o(
+        r.map(({ from: i, to: n }) => async () => {
+          const a = await this.contract.queryFilter(
             this.contract.filters[this.eventConfig.name](),
-            n,
-            i
+            i,
+            n
           );
-          let a = [];
-          o.length > 0 && (a = await this.processEventsPage(o)), this._latestBlockNumber = i, await this.afterEventsAccepted(), a.length > 0 && this.emitNewEvent();
+          let c = [];
+          a.length > 0 && (c = await this.processEventsPage(a)), this._latestBlockNumber = n, await this.afterEventsAccepted(), c.length > 0 && this.emitNewEvent();
         })
       ), this.inProgress = !1, !0;
-    } catch (t) {
-      return u("retrieveEvents error:", { err: t }), this.inProgress = !1, !1;
+    } catch {
+      return this.inProgress = !1, !1;
     }
   }
   async processEventsPage(e) {
-    const r = [];
-    return await c(
-      e.map((t) => async () => {
-        const { args: s, blockNumber: n } = t;
-        if (!s)
+    const t = [];
+    return await o(
+      e.map((s) => async () => {
+        const { args: r, blockNumber: i, transactionHash: n } = s;
+        if (!r)
           throw new Error("Wrong event structure");
-        const i = this.mapEvent(s);
-        await this.acceptEvent(i, n) && r.push(i);
+        const a = this.mapEvent(r);
+        await this.acceptEvent(a, i, n) && t.push(a);
       })
-    ), r;
+    ), t;
   }
   handleEvent = async (...e) => {
-    const { args: r } = this.eventConfig, { blockNumber: t } = e[e.length - 1], s = e.slice(0, r.length), n = r.reduce((a, h, l) => (a[h] = s[l], a), {});
-    if (!t)
+    const { args: t } = this.eventConfig, { blockNumber: s } = e[e.length - 1], r = e.slice(0, t.length), i = t.reduce((c, h, l) => (c[h] = r[l], c), {});
+    if (!s)
       throw new Error("Wrong event structure");
-    const i = this.mapEvent(n);
-    if (!await this.acceptEvent(i, t))
+    const n = this.mapEvent(i);
+    if (!await this.acceptEvent(n, s))
       throw new Error("Failed to retrieve events");
-    this._latestBlockNumber = t, await this.afterEventsAccepted(), this.emitNewEvent(i);
+    this._latestBlockNumber = s, await this.afterEventsAccepted(), this.emitNewEvent(n);
   };
 }
 export {
-  q as AbstractEventService
+  g as AbstractEventService
 };

package/data-structures/event-service/index.d.ts

@@ -1,5 +1,6 @@
 export * from './AbstractAccessTokenSnapshotService';
 export * from './AbstractCommitmentsSnapshotService';
+export * from './AbstractApprovalsSnapshotService';
 export * from './AbstractNullifierSnapshotService';
 export * from './AbstractSnapshotService';
 export * from './AbstractEventService';

package/data-structures/index.d.ts

@@ -11,3 +11,5 @@ export * from './transactions-manager';
 export * from './volatile-helper';
 export * from './MultiThreadedUtxoUtils/MultiThreadedUtxoUtils';
 export * from './cacheDevices';
+export * from './IndexedDB';
+export * from './TokenDBs';

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

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

package/data-structures/merkle-tree/MerkleTree.d.ts

@@ -1,5 +1,6 @@
 export type MerkleTreeJson = {
     tree: Record<string, string>;
+    reverseTree?: Record<string, string>;
     count: string;
     index: string;
 };
@@ -25,13 +26,15 @@ export declare class MerkleTree<T> {
      * meaning that there aren't any missing elements between getStartIndex() and index
      */
     private index;
-    static createWithData<T>(tree: Map<bigint, T>, index: bigint, count: bigint, hashFunction: (a: T, b: T) => T, levels: bigint, defaultNodeValue: T): MerkleTree<T>;
+    private reverseTree;
+    static createWithData<T>(tree: Map<bigint, T>, reverseTree: Map<T, bigint> | undefined, index: bigint, count: bigint, hashFunction: (a: T, b: T) => T, levels: bigint, defaultNodeValue: T): MerkleTree<T>;
     /**
      * @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>(hashFunction: (a: T, b: T) => T, levels: bigint, defaultNodeValue: T): MerkleTree<T>;
+    private createReverseTree;
     private constructor();
     /**
      * get starting nodeIndex from which inserts are allowed

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

@@ -1,8 +1,8 @@
 import { logError as l } from "../../error-handling/logError.mjs";
 import { MerkleTreeIncompleteError as a } from "./MerkleTreeIncompleteError.mjs";
-class h {
-  constructor(e, t, i, n, r, s) {
-    this.hashFunction = e, this.levels = t, this.defaultNodeValue = i, this.tree = n ?? /* @__PURE__ */ new Map(), this.count = s ?? 0n, this.index = r ?? 2n ** (t - 1n);
+class o {
+  constructor(t, e, r, i, s, n, h) {
+    this.hashFunction = t, this.levels = e, this.defaultNodeValue = r, this.tree = i ?? /* @__PURE__ */ new Map(), this.count = h ?? 0n, this.index = n ?? 2n ** (e - 1n), s ? this.reverseTree = s : this.reverseTree = this.createReverseTree();
   }
   /**
    * the map where the items are stored
@@ -18,16 +18,25 @@ class h {
    * meaning that there aren't any missing elements between getStartIndex() and index
    */
   index;
-  static createWithData(e, t, i, n, r, s) {
-    return new h(n, r, s, e, t, i);
+  reverseTree;
+  static createWithData(t, e, r, i, s, n, h) {
+    return new o(s, n, 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(e, t, i) {
-    return new h(e, t, i);
+  static create(t, e, r) {
+    return new o(t, e, r);
+  }
+  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
@@ -38,28 +47,28 @@ class h {
   /**
    * implementation of logarithm2 function from merkle contract
    */
-  logarithm2(e) {
-    let t = 0n;
-    for (; 2n ** t < e; )
-      t += 1n;
-    return t;
+  logarithm2(t) {
+    let e = 0n;
+    for (; 2n ** e < t; )
+      e += 1n;
+    return e;
   }
-  bigIntMax(e, t) {
-    return e > t ? e : t;
+  bigIntMax(t, e) {
+    return t > e ? t : e;
   }
-  forceInsert(e, t) {
-    if (t < this.getStartIndex())
+  forceInsert(t, e) {
+    if (e < this.getStartIndex())
       throw new RangeError();
-    this.tree.set(t, e);
-    const i = this.index - this.getStartIndex(), n = this.logarithm2(i);
-    let r = t;
-    for (let s = 1n; s <= n; s += 1n) {
-      r /= 2n;
-      const o = this.hashFunction(
-        this.tree.get(r * 2n) || this.defaultNodeValue,
-        this.tree.get(r * 2n + 1n) || this.defaultNodeValue
+    this.tree.set(e, t), this.reverseTree.set(t, e);
+    const r = this.index - this.getStartIndex(), i = this.logarithm2(r);
+    let s = e;
+    for (let n = 1n; n <= i; n += 1n) {
+      s /= 2n;
+      const h = this.hashFunction(
+        this.tree.get(s * 2n) || this.defaultNodeValue,
+        this.tree.get(s * 2n + 1n) || this.defaultNodeValue
       );
-      this.tree.set(r, o);
+      this.tree.set(s, h);
     }
   }
   /**
@@ -69,12 +78,12 @@ class h {
    * @return true - if added, false - if already exists
    * @throws will throw RangeError if nodeIndex is less than getStartIndex()
    */
-  insert(e, t) {
-    let i = !1;
-    return this.tree.has(t) && (i = !0, l(`Editing commitment index: ${t} `)), i || (this.count += 1n), this.index = this.bigIntMax(this.index, t + 1n), this.forceInsert(e, t), !0;
+  insert(t, e) {
+    let r = !1;
+    return this.tree.has(e) && (r = !0, l(`Editing commitment index: ${e} `)), r || (this.count += 1n), this.index = this.bigIntMax(this.index, e + 1n), this.forceInsert(t, e), !0;
   }
-  remove(e) {
-    this.forceInsert(this.defaultNodeValue, e);
+  remove(t) {
+    this.forceInsert(this.defaultNodeValue, t);
   }
   completenessCheck() {
     if (this.count !== this.index - this.getStartIndex())
@@ -87,69 +96,61 @@ class h {
    */
   getRootHash() {
     this.completenessCheck();
-    for (let e = 1n; e < 2n ** this.levels; e *= 2n)
-      if (this.tree.get(e))
-        return this.tree.get(e);
+    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);
   }
-  getSiblingIndex(e) {
-    return e === 1n ? 1n : e % 2n === 1n ? e - 1n : e + 1n;
+  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(e) {
+  getSiblingHashesForVerification(t) {
     this.completenessCheck();
-    let t;
-    for (let n = this.getStartIndex(); n < this.getStartIndex() + this.index; n += 1n)
-      if (this.tree.get(n) === e) {
-        t = n;
-        break;
-      }
-    if (t === void 0)
+    let e = this.reverseTree.get(t);
+    if (e === void 0)
       return new Array(Number(this.levels)).fill(0n);
-    const i = [];
-    for (; t !== 0n; )
-      i.push(this.tree.get(this.getSiblingIndex(t)) || this.defaultNodeValue), t /= 2n;
-    return i;
+    const r = [];
+    for (; e !== 0n; )
+      r.push(this.tree.get(this.getSiblingIndex(e)) || this.defaultNodeValue), e /= 2n;
+    return r;
   }
   /**
    * get item's sibling hashes side
    * @returns sibling's indexes
    * @throws will throw MerkleTreeIncompleteError if there are missing elements in the tree
    */
-  getSiblingSides(e) {
+  getSiblingSides(t) {
     this.completenessCheck();
-    let t;
-    for (let n = this.getStartIndex(); n < this.getStartIndex() + this.index; n += 1n)
-      if (this.tree.get(n) === e) {
-        t = n;
-        break;
-      }
-    if (t === void 0)
+    let e = this.reverseTree.get(t);
+    if (e === void 0)
       return new Array(Number(this.levels)).fill(0n);
-    const i = [];
-    for (; t !== 0n; ) {
-      const n = t % 2n === 0n ? 0n : 1n;
-      i.push(n), t /= 2n;
+    const r = [];
+    for (; e !== 0n; ) {
+      const i = e % 2n === 0n ? 0n : 1n;
+      r.push(i), e /= 2n;
     }
-    return i;
+    return r;
   }
   toJSON() {
-    const { tree: e, count: t, index: i } = this;
+    const { tree: t, reverseTree: e, count: r, index: i } = this;
     return {
-      tree: Object.fromEntries(e),
-      count: t.toString(),
+      tree: Object.fromEntries(t),
+      reverseTree: Object.fromEntries(e),
+      count: r.toString(),
       index: i.toString()
     };
   }
   clone() {
-    return h.createWithData(
+    return o.createWithData(
       new Map(this.tree),
+      new Map(this.reverseTree),
       this.index,
       this.count,
       this.hashFunction,
@@ -162,5 +163,5 @@ class h {
   }
 }
 export {
-  h as MerkleTree
+  o as MerkleTree
 };

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

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=(t,c,n)=>{if(n)return t;const e=t.clone(),s=e.getIndex(),r=BigInt(c.getAccessKey());return e.insert(r,s),e};exports.getPatchedAccessTokenMerkleTree=o;
+"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"),g=(r,n,o,t)=>{if(!t||o){const e=i.MerkleTree.create(c.poseidonFunction,25n,0n);return e.insert(BigInt(n.getAccessKey()),e.getStartIndex()),t||e.insert(s.randomBigInt(31),e.getStartIndex()+1n),e}return r};exports.getPatchedAccessTokenMerkleTree=g;

package/data-structures/merkle-tree/getPatchedAccessTokenMerkleTree.d.ts

@@ -1,3 +1,3 @@
 import { UserKeys } from '../crypto-keys/keys';
 import { MerkleTree } from './MerkleTree';
-export declare const getPatchedAccessTokenMerkleTree: (merkleTreeAccessToken: MerkleTree<bigint>, userKeys: UserKeys, hasAccessToken: boolean) => MerkleTree<bigint>;
+export declare const getPatchedAccessTokenMerkleTree: (merkleTreeAccessToken: MerkleTree<bigint>, userKeys: UserKeys, patchAccessTokenMerkleTree: boolean, kycRequired: boolean) => MerkleTree<bigint>;

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

@@ -1,9 +1,13 @@
-const o = (n, t, c) => {
-  if (c)
-    return n;
-  const e = n.clone(), s = e.getIndex(), r = BigInt(t.getAccessKey());
-  return e.insert(r, s), e;
+import { randomBigInt as i } from "../../functions/web3/etherFunctions.mjs";
+import { poseidonFunction as s } from "../../crypto/poseidon.mjs";
+import { MerkleTree as c } from "./MerkleTree.mjs";
+const f = (r, n, o, t) => {
+  if (!t || o) {
+    const e = c.create(s, 25n, 0n);
+    return e.insert(BigInt(n.getAccessKey()), e.getStartIndex()), t || e.insert(i(31), e.getStartIndex() + 1n), e;
+  }
+  return r;
 };
 export {
-  o as getPatchedAccessTokenMerkleTree
+  f as getPatchedAccessTokenMerkleTree
 };

package/data-structures/provider-adapter/IProviderAdapter.d.ts

@@ -8,6 +8,7 @@ export interface ChainEventListener {
 export interface IProviderAdapter<ConnectorType = unknown> {
     chainId: number | undefined;
     initConnector(connector: ConnectorType): void;
+    getSigner(): Signer;
     initSigner?(signer: Signer): void;
     init(chainId?: number): Promise<void>;
     initConfig?(config?: any): Promise<void> | void;
@@ -27,6 +28,7 @@ export interface IProviderAdapter<ConnectorType = unknown> {
     getContractWithFetcherForEthereum(contract: ContractType, contractAddress?: string): Contract;
     sendTransaction(tx: TransactionRequest): Promise<TransactionResponse>;
     switchNetwork(network: EthereumNetwork): Promise<unknown>;
+    switchAccount(signer: ethers.Signer): Promise<void>;
     onAccountChanged(): Promise<unknown>;
     onChainChanged(chainId?: number): Promise<unknown>;
     isPermitterAvailable(): boolean;

package/data-structures/snapshot/ClientAccessTokenSnapshotService.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../event-service/AbstractAccessTokenSnapshotService.cjs");require("ethers");require("circomlibjs-hinkal-fork");require("libsodium-wrappers");require("process");require("buffer");require("../../constants/vite.constants.cjs");require("../../constants/reorg-depths.constants.cjs");require("axios");require("../../constants/chains.constants.cjs");require("../../types/circom-data.types.cjs");require("../../types/transactions.types.cjs");require("../../types/curve.types.cjs");const t=require("../../API/fetchCommitmentsCache.cjs");class c extends s.AbstractAccessTokenSnapshotService{constructor(r,e){super(r,0,!1,e)}async fetchSnapshot(){const{chainId:r}=await this.contract.provider.getNetwork(),e=await t.fetchAccessTokenSnapshot(r);if(e.accessTokenContractAddress!==this.contract.address||e.chainId!==r)throw Error("Commitment Snapshot: incorrect contract or chain id");return{latestBlockNumber:e.latestBlockNumber,merkleTree:e.merkleTree,senderAddresses:e.senderAddresses,senderAddressIndexMap:e.senderAddressIndexMap}}persistSnapshot(r){return Promise.resolve()}}exports.ClientAccessTokenSnapshotService=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../event-service/AbstractAccessTokenSnapshotService.cjs");require("ethers");require("circomlibjs-hinkal-fork");require("libsodium-wrappers");require("process");require("buffer");require("../../constants/vite.constants.cjs");require("../../error-handling/error-codes.constants.cjs");require("../../constants/reorg-depths.constants.cjs");const t=require("../../API/fetchCommitmentsCache.cjs");class c extends s.AbstractAccessTokenSnapshotService{constructor(r,e){super(r,0,!1,e)}async fetchSnapshot(){const{chainId:r}=await this.contract.provider.getNetwork(),e=await t.fetchAccessTokenSnapshot(r);if(e.accessTokenContractAddress!==this.contract.address||e.chainId!==r)throw Error("Commitment Snapshot: incorrect contract or chain id");return{latestBlockNumber:e.latestBlockNumber,merkleTree:e.merkleTree,senderAddresses:e.senderAddresses,senderAddressIndexMap:e.senderAddressIndexMap}}persistSnapshot(r){return Promise.resolve()}}exports.ClientAccessTokenSnapshotService=c;

package/data-structures/snapshot/ClientAccessTokenSnapshotService.mjs

@@ -1,23 +1,19 @@
-import { AbstractAccessTokenSnapshotService as t } from "../event-service/AbstractAccessTokenSnapshotService.mjs";
+import { AbstractAccessTokenSnapshotService as s } from "../event-service/AbstractAccessTokenSnapshotService.mjs";
 import "ethers";
 import "circomlibjs-hinkal-fork";
 import "libsodium-wrappers";
 import "process";
 import "buffer";
 import "../../constants/vite.constants.mjs";
+import "../../error-handling/error-codes.constants.mjs";
 import "../../constants/reorg-depths.constants.mjs";
-import "axios";
-import "../../constants/chains.constants.mjs";
-import "../../types/circom-data.types.mjs";
-import "../../types/transactions.types.mjs";
-import "../../types/curve.types.mjs";
-import { fetchAccessTokenSnapshot as s } from "../../API/fetchCommitmentsCache.mjs";
-class u extends t {
+import { fetchAccessTokenSnapshot as t } from "../../API/fetchCommitmentsCache.mjs";
+class S extends s {
   constructor(r, e) {
     super(r, 0, !1, e);
   }
   async fetchSnapshot() {
-    const { chainId: r } = await this.contract.provider.getNetwork(), e = await s(r);
+    const { chainId: r } = await this.contract.provider.getNetwork(), e = await t(r);
     if (e.accessTokenContractAddress !== this.contract.address || e.chainId !== r)
       throw Error("Commitment Snapshot: incorrect contract or chain id");
     return {
@@ -32,5 +28,5 @@ class u extends t {
   }
 }
 export {
-  u as ClientAccessTokenSnapshotService
+  S as ClientAccessTokenSnapshotService
 };

package/data-structures/snapshot/ClientApprovalsSnapshotService.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("../event-service/AbstractApprovalsSnapshotService.cjs"),r=require("../../API/fetchCommitmentsCache.cjs");class s extends a.AbstractApprovalsSnapshotService{constructor(e,t){super(e,0,!1,t)}async fetchSnapshot(){const{chainId:e}=await this.contract.provider.getNetwork(),t=await r.fetchApprovalsSnapshot(e);if(t.hinkalAddress!==this.contract.address||t.chainId!==e)throw Error("approvalsSnapshotData Snapshot: incorrect contract or chain id");return{latestBlockNumber:t.latestBlockNumber,approvals:t.approvals,events:t.events}}persistSnapshot(e){return Promise.resolve()}}exports.ClientApprovalsSnapshotService=s;

package/data-structures/snapshot/ClientApprovalsSnapshotService.d.ts

@@ -0,0 +1,8 @@
+import { Contract } from 'ethers';
+import { AbstractApprovalsSnapshotService, ApprovalsSerializedSnapshot } from '../event-service/AbstractApprovalsSnapshotService';
+import { CommitmentsSerializedSnapshot } from '../event-service';
+export declare class ClientApprovalsSnapshotService extends AbstractApprovalsSnapshotService {
+    constructor(contract: Contract, maxPageSize?: number);
+    protected fetchSnapshot(): Promise<ApprovalsSerializedSnapshot>;
+    protected persistSnapshot(_serializedSnapshot: CommitmentsSerializedSnapshot): Promise<unknown>;
+}