@hinkal/common 0.2.13 → 0.2.14

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

@@ -1,13 +1,16 @@
-import { zeroAddress as o } from "../../constants/protocol.constants.mjs";
-import { poseidonFunction as m } from "../../crypto/poseidon.mjs";
+import { zeroAddress as m } from "../../constants/protocol.constants.mjs";
+import { poseidonFunction as o } from "../../crypto/poseidon.mjs";
 import "circomlibjs-hinkal-fork";
 import "libsodium-wrappers";
 import "process";
 import "buffer";
-import { toBigInt as n } from "../../functions/utils/amounts.utils.mjs";
-import { MerkleTree as c } from "../merkle-tree/MerkleTree.mjs";
-import { AbstractSnapshotService as l } from "./AbstractSnapshotService.mjs";
-class I extends l {
+import { toBigInt as t } from "../../functions/utils/amounts.utils.mjs";
+import { MerkleTree as a } from "../merkle-tree/MerkleTree.mjs";
+import "ethers";
+import "../../error-handling/error-codes.constants.mjs";
+import { AbstractSnapshotService as c } from "./AbstractSnapshotService.mjs";
+import { contructMerkleTreeFromSerialized as l } from "../../functions/utils/merkleTree.utils.mjs";
+class f extends c {
   constructor(e, s, r, d) {
     super(
       e,
@@ -46,25 +49,8 @@ class I extends l {
   }
   deserializeSnapshot(e) {
     let s, r;
-    if (e.latestBlockNumber && e.merkleTree) {
-      const d = new Map(
-        Object.entries(e.merkleTree.tree).map(([t, a]) => [
-          BigInt(t),
-          BigInt(a)
-        ])
-      );
-      s = c.createWithData(
-        d,
-        n(e.merkleTree.index),
-        n(e.merkleTree.count),
-        m,
-        25n,
-        0n
-      );
-    } else
-      s = c.create(m, 25n, 0n);
-    return e.latestBlockNumber && e.senderAddressIndexMap ? r = new Map(
-      e.senderAddressIndexMap.map(({ address: d, index: t }) => [d, t])
+    return e.latestBlockNumber && e.merkleTree ? s = l(e.merkleTree) : s = a.create(o, 25n, 0n), e.latestBlockNumber && e.senderAddressIndexMap ? r = new Map(
+      e.senderAddressIndexMap.map(({ address: d, index: n }) => [d, n])
     ) : r = /* @__PURE__ */ new Map(), {
       latestBlockNumber: e.latestBlockNumber ?? 0,
       reserveBlockNumber: e.reserveBlockNumber ?? 0,
@@ -80,7 +66,7 @@ class I extends l {
       return this._merkleTree.insert(e.accessKey, e.index), this._senderAddressIndexMap.set(
         e.senderAddress,
         Math.max(Number(e.index), this._senderAddressIndexMap.get(e.senderAddress) ?? 0)
-      ), this._senderAddresses.includes(e.senderAddress) || this._senderAddresses.push(e.senderAddress), e.accessKey === 0n && e.senderAddress === o && this._merkleTree.remove(e.index), !0;
+      ), this._senderAddresses.includes(e.senderAddress) || this._senderAddresses.push(e.senderAddress), e.accessKey === 0n && e.senderAddress === m && this._merkleTree.remove(e.index), !0;
     } catch (r) {
       return console.error(r), !1;
     }
@@ -88,8 +74,8 @@ class I extends l {
   mapEvent(e) {
     const { accessKey: s, index: r, senderAddress: d } = e;
     return {
-      accessKey: n(s),
-      index: n(r),
+      accessKey: t(s),
+      index: t(r),
       senderAddress: d
     };
   }
@@ -107,5 +93,5 @@ class I extends l {
   }
 }
 export {
-  I as AbstractAccessTokenSnapshotService
+  f as AbstractAccessTokenSnapshotService
 };

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./AbstractSnapshotService.cjs"),d=require("../../functions/utils/amounts.utils.cjs"),u=require("../../functions/utils/caseInsensitive.utils.cjs");class A extends c.AbstractSnapshotService{constructor(e,t,r,s){super(e,{name:"NewApprovedUtxo",args:["approveTo","tokenAddress","amount","inHinkalAddress"]},t,r,s)}_approvals=new Map;events=new Set;get approvals(){return this._approvals}getEventKey(e,t){return typeof e!="bigint"||typeof t!="string"?null:`${t}-${e}`}serializeSnapshot(e){const t=Object.fromEntries(e.payload.approvals),r=Object.entries(t).map(([p,l])=>{const i=l.map(n=>({amount:n.amount.toString(),tokenAddress:n.tokenAddress,inHinkalAddress:n.inHinkalAddress.toString()}));return[p,i]}),s=Object.fromEntries(r);return{latestBlockNumber:e.latestBlockNumber,reserveBlockNumber:e.reserveBlockNumber,approvals:s,events:[...this.events]}}deserializeSnapshot(e){console.log({serializedSnapshot:e});const t=e.approvals,r=Object.entries(t).map(([p,l])=>{const i=l.map(n=>({amount:BigInt(n.amount),tokenAddress:n.tokenAddress,inHinkalAddress:BigInt(n.inHinkalAddress)}));return[p,i]}),s=new Map(r);return{latestBlockNumber:e.latestBlockNumber??0,reserveBlockNumber:e.reserveBlockNumber??0,payload:{approvals:s,events:new Set(e.events)}}}getSnapshotPayload(){return{approvals:this._approvals,events:this.events}}populateSnapshot({payload:{approvals:e,events:t}}){this._approvals=e,this.events=t}mapEvent(e){const{approveTo:t,tokenAddress:r,amount:s,inHinkalAddress:p}=e;return{approveTo:t,tokenAddress:r,amount:d.toBigInt(s),inHinkalAddress:d.toBigInt(p)}}acceptEvent(e,t,r){const s=this.getEventKey(e.inHinkalAddress,r);if(s&&!this.events.has(s)){const{amount:p,tokenAddress:l,inHinkalAddress:i}=e,n={amount:p,tokenAddress:l,inHinkalAddress:i};let a=this.approvals.get(e.approveTo)||[],v=!1;for(let o=0;o<a.length;o+=1)u.caseInsensitiveEqual(l,a[o].tokenAddress)&&i===a[o].inHinkalAddress&&(a[o].amount+=p,v=!0);if(a=a.filter(o=>o.amount!==0n),v&&a.length===0)this.approvals.delete(e.approveTo);else{const o=v?a:[...a,n];this.approvals.set(e.approveTo,o)}return r&&this.events.add(s),!0}return!1}}exports.AbstractApprovalsSnapshotService=A;

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

@@ -0,0 +1,30 @@
+import { ethers } from 'ethers';
+import { AbstractSnapshotService, Snapshot } from './AbstractSnapshotService';
+import { NewApprovedUtxoEvent } from '../../types/commitments.types';
+import { ApprovedUtxo } from '../../types/hinkal.types';
+export type ApprovalsSnapshotPayload = {
+    readonly approvals: Map<string, ApprovedUtxo[]>;
+    readonly events: Set<string>;
+};
+export type ApprovalsSerializedSnapshot = {
+    latestBlockNumber?: number;
+    reserveBlockNumber?: number;
+    approvals: Record<string, ApprovedUtxo<string>[]>;
+    events: string[];
+};
+export declare abstract class AbstractApprovalsSnapshotService extends AbstractSnapshotService<NewApprovedUtxoEvent, NewApprovedUtxoEvent<string>, ApprovalsSnapshotPayload, ApprovalsSerializedSnapshot> {
+    constructor(contract: ethers.Contract, initialBlockNumber: number, isServer: boolean, maxPageSize?: number);
+    private _approvals;
+    events: Set<string>;
+    get approvals(): Map<string, ApprovedUtxo[]>;
+    private getEventKey;
+    protected serializeSnapshot(snapshot: Snapshot<ApprovalsSnapshotPayload>): ApprovalsSerializedSnapshot;
+    protected deserializeSnapshot(serializedSnapshot: ApprovalsSerializedSnapshot): Snapshot<ApprovalsSnapshotPayload>;
+    protected getSnapshotPayload(): {
+        approvals: Map<string, ApprovedUtxo[]>;
+        events: Set<string>;
+    };
+    protected populateSnapshot({ payload: { approvals, events } }: Snapshot<ApprovalsSnapshotPayload>): void;
+    protected mapEvent(event: NewApprovedUtxoEvent<string>): NewApprovedUtxoEvent;
+    protected acceptEvent(event: NewApprovedUtxoEvent, _blockNumber: number, txHash: string): boolean;
+}

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

@@ -0,0 +1,104 @@
+import { AbstractSnapshotService as c } from "./AbstractSnapshotService.mjs";
+import { toBigInt as v } from "../../functions/utils/amounts.utils.mjs";
+import { caseInsensitiveEqual as u } from "../../functions/utils/caseInsensitive.utils.mjs";
+class f extends c {
+  constructor(e, t, r, s) {
+    super(
+      e,
+      {
+        name: "NewApprovedUtxo",
+        args: ["approveTo", "tokenAddress", "amount", "inHinkalAddress"]
+      },
+      t,
+      r,
+      s
+    );
+  }
+  _approvals = /* @__PURE__ */ new Map();
+  events = /* @__PURE__ */ new Set();
+  get approvals() {
+    return this._approvals;
+  }
+  getEventKey(e, t) {
+    return typeof e != "bigint" || typeof t != "string" ? null : `${t}-${e}`;
+  }
+  serializeSnapshot(e) {
+    const t = Object.fromEntries(e.payload.approvals), r = Object.entries(t).map(([p, l]) => {
+      const i = l.map((n) => ({
+        amount: n.amount.toString(),
+        tokenAddress: n.tokenAddress,
+        inHinkalAddress: n.inHinkalAddress.toString()
+      }));
+      return [p, i];
+    }), s = Object.fromEntries(r);
+    return {
+      latestBlockNumber: e.latestBlockNumber,
+      reserveBlockNumber: e.reserveBlockNumber,
+      approvals: s,
+      events: [...this.events]
+    };
+  }
+  deserializeSnapshot(e) {
+    console.log({ serializedSnapshot: e });
+    const t = e.approvals, r = Object.entries(t).map(
+      ([p, l]) => {
+        const i = l.map((n) => ({
+          amount: BigInt(n.amount),
+          tokenAddress: n.tokenAddress,
+          inHinkalAddress: BigInt(n.inHinkalAddress)
+        }));
+        return [p, i];
+      }
+    ), s = new Map(r);
+    return {
+      latestBlockNumber: e.latestBlockNumber ?? 0,
+      reserveBlockNumber: e.reserveBlockNumber ?? 0,
+      payload: {
+        approvals: s,
+        events: new Set(e.events)
+      }
+    };
+  }
+  getSnapshotPayload() {
+    return {
+      approvals: this._approvals,
+      events: this.events
+    };
+  }
+  populateSnapshot({ payload: { approvals: e, events: t } }) {
+    this._approvals = e, this.events = t;
+  }
+  mapEvent(e) {
+    const { approveTo: t, tokenAddress: r, amount: s, inHinkalAddress: p } = e;
+    return {
+      approveTo: t,
+      tokenAddress: r,
+      amount: v(s),
+      inHinkalAddress: v(p)
+    };
+  }
+  acceptEvent(e, t, r) {
+    const s = this.getEventKey(e.inHinkalAddress, r);
+    if (s && !this.events.has(s)) {
+      const { amount: p, tokenAddress: l, inHinkalAddress: i } = e, n = {
+        amount: p,
+        tokenAddress: l,
+        inHinkalAddress: i
+      };
+      let o = this.approvals.get(e.approveTo) || [], d = !1;
+      for (let a = 0; a < o.length; a += 1)
+        u(l, o[a].tokenAddress) && i === o[a].inHinkalAddress && (o[a].amount += p, d = !0);
+      if (o = o.filter((a) => a.amount !== 0n), d && o.length === 0)
+        this.approvals.delete(e.approveTo);
+      else {
+        const a = d ? o : [...o, n];
+        this.approvals.set(e.approveTo, a);
+      }
+      return r && this.events.add(s), !0;
+    }
+    return !1;
+  }
+}
+export {
+  f as AbstractApprovalsSnapshotService
+};

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

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../../crypto/poseidon.cjs");require("circomlibjs-hinkal-fork");require("libsodium-wrappers");require("process");require("buffer");const i=require("../merkle-tree/MerkleTree.cjs"),n=require("../../functions/utils/amounts.utils.cjs"),m=require("./AbstractSnapshotService.cjs");class p extends m.AbstractSnapshotService{constructor(e,t,u,r){super(e,{name:"NewCommitment",args:["commitment","index","encryptedOutput"]},t,u,r)}_merkleTree;_encryptedOutputs;get merkleTree(){return this._merkleTree}get encryptedOutputs(){return this._encryptedOutputs}serializeSnapshot(e){return{merkleTree:e.payload.merkleTree.toJSON(),latestBlockNumber:e.latestBlockNumber,reserveBlockNumber:e.reserveBlockNumber,encryptedOutputs:e.payload.encryptedOutputs.map(t=>({value:t.value,isPositive:String(t.isPositive)}))}}deserializeSnapshot(e){let t;if(e.latestBlockNumber&&e.merkleTree){const r=new Map(Object.entries(e.merkleTree.tree).map(([c,o])=>[BigInt(c),BigInt(o)]));t=i.MerkleTree.createWithData(r,n.toBigInt(e.merkleTree.index),n.toBigInt(e.merkleTree.count),s.poseidonFunction,25n,0n)}else t=i.MerkleTree.create(s.poseidonFunction,25n,0n);const u=e.encryptedOutputs?.map(r=>({value:r.value,isPositive:JSON.parse(r.isPositive)}));return{latestBlockNumber:e.latestBlockNumber??0,reserveBlockNumber:e.reserveBlockNumber??0,payload:{merkleTree:t,encryptedOutputs:u||[]}}}getSnapshotPayload(){return{merkleTree:this._merkleTree,encryptedOutputs:this._encryptedOutputs}}populateSnapshot({payload:{merkleTree:e,encryptedOutputs:t}}){this._merkleTree=e,this._encryptedOutputs=t}mapEvent(e){const{commitment:t,index:u,encryptedOutput:r}=e;return{commitment:n.toBigInt(t),index:n.toBigInt(u),encryptedOutput:r}}acceptEvent(e,t){if(!this.encryptedOutputs.map(u=>u.value).includes(e.encryptedOutput)){if(!this._merkleTree.insert(e.commitment,e.index>=0?e.index:-1n*e.index))return!1;const r={value:e.encryptedOutput,isPositive:e.index>=0n};return this._encryptedOutputs.push(r),!0}return!1}}exports.AbstractCommitmentsSnapshotService=p;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("../../crypto/poseidon.cjs");require("circomlibjs-hinkal-fork");require("libsodium-wrappers");require("process");require("buffer");const n=require("../merkle-tree/MerkleTree.cjs");require("ethers");require("../../error-handling/error-codes.constants.cjs");const s=require("../../functions/utils/amounts.utils.cjs"),c=require("./AbstractSnapshotService.cjs"),l=require("../../functions/utils/merkleTree.utils.cjs");class m extends c.AbstractSnapshotService{constructor(e,t,r,u){super(e,{name:"NewCommitment",args:["commitment","index","encryptedOutput"]},t,r,u)}_merkleTree;_encryptedOutputs;get merkleTree(){return this._merkleTree}get encryptedOutputs(){return this._encryptedOutputs}serializeSnapshot(e){return{merkleTree:e.payload.merkleTree.toJSON(),latestBlockNumber:e.latestBlockNumber,reserveBlockNumber:e.reserveBlockNumber,encryptedOutputs:e.payload.encryptedOutputs.map(t=>({value:t.value,isPositive:String(t.isPositive)}))}}deserializeSnapshot(e){let t;e.latestBlockNumber&&e.merkleTree?t=l.contructMerkleTreeFromSerialized(e.merkleTree):t=n.MerkleTree.create(i.poseidonFunction,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:r||[]}}}getSnapshotPayload(){return{merkleTree:this._merkleTree,encryptedOutputs:this._encryptedOutputs}}populateSnapshot({payload:{merkleTree:e,encryptedOutputs:t}}){this._merkleTree=e,this._encryptedOutputs=t}mapEvent(e){const{commitment:t,index:r,encryptedOutput:u}=e;return{commitment:s.toBigInt(t),index:s.toBigInt(r),encryptedOutput:u}}acceptEvent(e,t){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 u={value:e.encryptedOutput,isPositive:e.index>=0n};return this._encryptedOutputs.push(u),!0}return!1}}exports.AbstractCommitmentsSnapshotService=m;

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 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,n){this.contract=e,this.eventConfig=t,this._latestBlockNumber=s,this.maxPageSize=n,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: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{return this.inProgress=!1,!1}}async processEventsPage(e){const t=[];return await o.resolveSync(e.map(s=>async()=>{const{args:r,blockNumber:n}=s;if(!r)throw new Error("Wrong event structure");const i=this.mapEvent(r);await this.acceptEvent(i,n)&&t.push(i)})),t}handleEvent=async(...e)=>{const{args:t}=this.eventConfig,{blockNumber:s}=e[e.length-1],r=e.slice(0,t.length),n=t.reduce((a,l,h)=>(a[l]=r[h],a),{});if(!s)throw new Error("Wrong event structure");const i=this.mapEvent(n);if(!await this.acceptEvent(i,s))throw new Error("Failed to retrieve events");this._latestBlockNumber=s,await this.afterEventsAccepted(),this.emitNewEvent(i)}}exports.AbstractEventService=u;
+"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

@@ -11,8 +11,8 @@ class g {
   intervalId;
   inProgress;
   // to remove race conditions
-  constructor(e, t, s, r, n) {
-    this.contract = e, this.eventConfig = t, this._latestBlockNumber = s, this.maxPageSize = n, this.isServer = r, 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;
@@ -54,14 +54,14 @@ class g {
         return this.inProgress = !1, !1;
       const r = u(e, s, this.maxPageSize);
       return await o(
-        r.map(({ from: n, to: i }) => async () => {
-          const c = await this.contract.queryFilter(
+        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 = [];
-          c.length > 0 && (a = await this.processEventsPage(c)), 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 {
@@ -72,22 +72,22 @@ class g {
     const t = [];
     return await o(
       e.map((s) => async () => {
-        const { args: r, blockNumber: n } = s;
+        const { args: r, blockNumber: i, transactionHash: n } = s;
         if (!r)
           throw new Error("Wrong event structure");
-        const i = this.mapEvent(r);
-        await this.acceptEvent(i, n) && t.push(i);
+        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), n = t.reduce((a, h, l) => (a[h] = r[l], a), {});
+    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, s))
+    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(i);
+    this._latestBlockNumber = s, await this.afterEventsAccepted(), this.emitNewEvent(n);
   };
 }
 export {

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,r,n,i,s){this.hashFunction=t,this.levels=e,this.defaultNodeValue=r,this.tree=n??new Map,this.count=s??0n,this.index=i??2n**(e-1n)}tree;count;index;static createWithData(t,e,r,n,i,s){return new h(n,i,s,t,e,r)}static create(t,e,r){return new h(t,e,r)}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 r=this.index-this.getStartIndex(),n=this.logarithm2(r);let i=e;for(let s=1n;s<=n;s+=1n){i/=2n;const l=this.hashFunction(this.tree.get(i*2n)||this.defaultNodeValue,this.tree.get(i*2n+1n)||this.defaultNodeValue);this.tree.set(i,l)}}insert(t,e){let r=!1;return this.tree.has(e)&&(r=!0,o.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;for(let n=this.getStartIndex();n<this.getStartIndex()+this.index;n+=1n)if(this.tree.get(n)===t){e=n;break}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;for(let n=this.getStartIndex();n<this.getStartIndex()+this.index;n+=1n)if(this.tree.get(n)===t){e=n;break}if(e===void 0)return new Array(Number(this.levels)).fill(0n);const r=[];for(;e!==0n;){const n=e%2n===0n?0n:1n;r.push(n),e/=2n}return r}toJSON(){const{tree:t,count:e,index:r}=this;return{tree:Object.fromEntries(t),count:e.toString(),index:r.toString()}}}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
@@ -73,4 +76,6 @@ export declare class MerkleTree<T> {
      */
     getSiblingSides(item: T): bigint[];
     toJSON(): MerkleTreeJson;
+    clone(): MerkleTree<T>;
+    getIndex(): bigint;
 }