@eclesia/indexer-engine 2.14.4 → 2.16.0

package/dist/mocks/rpc-client.mjs

@@ -1,10 +1,33 @@
-import { __toESM } from "../_virtual/rolldown_runtime.mjs";
-import { require_build } from "../node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/index.mjs";
+import { createHash } from "node:crypto";
 import { fromRfc3339WithNanoseconds } from "@cosmjs/tendermint-rpc";
+import { QueryDelegatorDelegationsResponse, QueryParamsResponse, QueryPoolResponse, QueryValidatorDelegationsResponse, QueryValidatorsRequest, QueryValidatorsResponse } from "cosmjs-types/cosmos/staking/v1beta1/query.js";
 import { Tx } from "cosmjs-types/cosmos/tx/v1beta1/tx.js";
+import { fromBase64, fromHex, toBech32 } from "@cosmjs/encoding";
+import { ModuleAccount } from "cosmjs-types/cosmos/auth/v1beta1/auth.js";
+import { QueryModuleAccountsResponse } from "cosmjs-types/cosmos/auth/v1beta1/query.js";
+import { QueryAllBalancesResponse } from "cosmjs-types/cosmos/bank/v1beta1/query.js";
+import { Validator } from "cosmjs-types/cosmos/staking/v1beta1/staking.js";
 
 //#region src/mocks/rpc-client.ts
-var import_build = /* @__PURE__ */ __toESM(require_build(), 1);
+/**
+* Mock RPC client for benchmarking and testing
+* Generates synthetic blockchain data without requiring an actual RPC node
+*/
+/** Deterministic bech32 address from a small integer, for synthetic accounts and validators */
+function syntheticAddress(prefix, seed) {
+	const bytes = new Uint8Array(20);
+	bytes[0] = seed & 255;
+	bytes[1] = seed >> 8 & 255;
+	bytes[19] = 1;
+	return toBech32(prefix, bytes);
+}
+/** Module accounts a chain always has, with deterministic addresses (computed on first use) */
+function mockModuleAccounts() {
+	return {
+		fee_collector: syntheticAddress("cosmos", 1001),
+		distribution: syntheticAddress("cosmos", 1002)
+	};
+}
 /**
 * Generates a synthetic transaction with realistic structure
 */
@@ -68,15 +91,106 @@ var MockRpcClient = class {
 	startHeight;
 	endHeight;
 	txPerBlock;
-	constructor({ chainId, startHeight, endHeight, txPerBlock }) {
+	cometVersion;
+	validatorCount;
+	constructor({ chainId, startHeight, endHeight, txPerBlock, cometVersion, validatorCount }) {
 		this.chainId = chainId;
 		this.startHeight = startHeight;
 		this.endHeight = endHeight;
 		this.txPerBlock = txPerBlock;
+		this.cometVersion = cometVersion ?? "0.37";
+		this.validatorCount = validatorCount ?? 3;
+	}
+	/** The synthetic validator set, identical at every height */
+	validators() {
+		const set = [];
+		for (let i = 0; i < this.validatorCount; i++) set.push(Validator.fromPartial({
+			operatorAddress: syntheticAddress("cosmosvaloper", i + 1),
+			jailed: false,
+			status: 3,
+			tokens: String(1e6 * (i + 1)),
+			delegatorShares: String(1e6 * (i + 1)) + "000000000000000000",
+			description: { moniker: "mock-validator-" + (i + 1) },
+			commission: { commissionRates: {
+				rate: "100000000000000000",
+				maxRate: "200000000000000000",
+				maxChangeRate: "10000000000000000"
+			} },
+			minSelfDelegation: "1"
+		}));
+		return set;
+	}
+	/**
+	* Answers the ABCI queries the engine and the core modules issue. Unknown paths get a
+	* non-zero code, as a real node would answer for a query it does not serve.
+	*/
+	async abciQuery(params) {
+		const reply = (value) => ({
+			key: new Uint8Array(),
+			value,
+			height: params.height,
+			index: 0,
+			code: 0,
+			codespace: "",
+			log: "",
+			info: ""
+		});
+		switch (params.path) {
+			case "/cosmos.staking.v1beta1.Query/Validators": {
+				const request = QueryValidatorsRequest.decode(params.data);
+				const all = this.validators();
+				const limit = Number(request.pagination?.limit ?? 100n) || 100;
+				const key = request.pagination?.key;
+				const offset = key && key.length > 0 ? key[0] : 0;
+				const page = all.slice(offset, offset + limit);
+				const next = offset + limit < all.length ? new Uint8Array([offset + limit]) : new Uint8Array();
+				return reply(QueryValidatorsResponse.encode(QueryValidatorsResponse.fromPartial({
+					validators: page,
+					pagination: {
+						nextKey: next,
+						total: BigInt(all.length)
+					}
+				})).finish());
+			}
+			case "/cosmos.auth.v1beta1.Query/ModuleAccounts": return reply(QueryModuleAccountsResponse.encode(QueryModuleAccountsResponse.fromPartial({ accounts: Object.entries(mockModuleAccounts()).map(([name, address]) => ({
+				typeUrl: "/cosmos.auth.v1beta1.ModuleAccount",
+				value: ModuleAccount.encode(ModuleAccount.fromPartial({
+					baseAccount: { address },
+					name
+				})).finish()
+			})) })).finish());
+			case "/cosmos.bank.v1beta1.Query/AllBalances": return reply(QueryAllBalancesResponse.encode(QueryAllBalancesResponse.fromPartial({ balances: [{
+				denom: "uatom",
+				amount: "1000000"
+			}] })).finish());
+			case "/cosmos.staking.v1beta1.Query/Pool": return reply(QueryPoolResponse.encode(QueryPoolResponse.fromPartial({ pool: {
+				bondedTokens: String(this.validators().reduce((sum, v) => sum + Number(v.tokens), 0)),
+				notBondedTokens: "0"
+			} })).finish());
+			case "/cosmos.staking.v1beta1.Query/Params": return reply(QueryParamsResponse.encode(QueryParamsResponse.fromPartial({ params: {
+				unbondingTime: {
+					seconds: 1814400n,
+					nanos: 0
+				},
+				maxValidators: 100,
+				maxEntries: 7,
+				historicalEntries: 1e4,
+				bondDenom: "uatom",
+				minCommissionRate: "0"
+			} })).finish());
+			case "/cosmos.staking.v1beta1.Query/DelegatorDelegations": return reply(QueryDelegatorDelegationsResponse.encode(QueryDelegatorDelegationsResponse.fromPartial({})).finish());
+			case "/cosmos.staking.v1beta1.Query/ValidatorDelegations": return reply(QueryValidatorDelegationsResponse.encode(QueryValidatorDelegationsResponse.fromPartial({})).finish());
+			default: return {
+				...reply(new Uint8Array()),
+				code: 6,
+				log: "unknown request: " + params.path
+			};
+		}
 	}
 	async block(height) {
 		const txs = [];
 		for (let i = 0; i < this.txPerBlock; i++) txs.push(generateMockTx(height, i));
+		const hashOf = (h) => new Uint8Array(createHash("sha256").update(this.chainId + ":" + h).digest());
 		return {
 			block: {
 				header: {
@@ -112,14 +226,14 @@ var MockRpcClient = class {
 					},
 					signatures: [{
 						blockIdFlag: 2,
-						validatorAddress: (0, import_build.fromHex)("D68EEC0D2E8248F1EC64CDB585EDB61ECA432BD8"),
+						validatorAddress: fromHex("D68EEC0D2E8248F1EC64CDB585EDB61ECA432BD8"),
 						timestamp: fromRfc3339WithNanoseconds((/* @__PURE__ */ new Date()).toISOString()),
-						signature: (0, import_build.fromBase64)("Z6d2P35dI6qBzfPdyIZvmZi7Imo2FmQ5kNSnpVb2UvCj0aSjRCtS59BauJFB6FDHPluOUYoz0rJ4jiOnNXh9AA==")
+						signature: fromBase64("Z6d2P35dI6qBzfPdyIZvmZi7Imo2FmQ5kNSnpVb2UvCj0aSjRCtS59BauJFB6FDHPluOUYoz0rJ4jiOnNXh9AA==")
 					}]
 				}
 			},
 			blockId: {
-				hash: new Uint8Array(),
+				hash: hashOf(height),
 				parts: {
 					total: 0,
 					hash: new Uint8Array()
@@ -135,30 +249,30 @@ var MockRpcClient = class {
 					block: 11,
 					app: 0
 				},
-				id: (0, import_build.fromHex)("d2982128df6a29e700980f325b0444e301c604d7"),
+				id: fromHex("d2982128df6a29e700980f325b0444e301c604d7"),
 				listenAddr: "tcp://0.0.0.0:26656",
-				network: "atomone-1",
-				version: "0.37.15",
+				network: this.chainId,
+				version: this.cometVersion === "0.38" ? "0.38.17" : "0.37.15",
 				channels: "40202122233038606100",
 				moniker: "node",
 				other: new Map([["txIndex", "on"], ["rpcAddress", "tcp://0.0.0.0:26657"]])
 			},
 			syncInfo: {
-				latestBlockHash: (0, import_build.fromHex)("3F3F7A6F11FA91856BE440F8C78262307CAEAB122720D61CB14B118EF89892B5"),
-				latestAppHash: (0, import_build.fromHex)("FF91D618633BDD5395763F34805E6DACF6BBFB642A2E787677BF28B39427F289"),
+				latestBlockHash: fromHex("3F3F7A6F11FA91856BE440F8C78262307CAEAB122720D61CB14B118EF89892B5"),
+				latestAppHash: fromHex("FF91D618633BDD5395763F34805E6DACF6BBFB642A2E787677BF28B39427F289"),
 				latestBlockHeight: this.endHeight,
 				latestBlockTime: fromRfc3339WithNanoseconds("2025-11-06T12:58:21.271608775Z"),
-				earliestBlockHash: (0, import_build.fromHex)("54473B6F28CAA85F5664F7CA3F2EEE49CD9857BDE41E0BF604B1A1DE93CBFEFF"),
-				earliestAppHash: (0, import_build.fromHex)("24DFB6C312A7FD4B753444F5CD5FAC4D239BAEC09B6A79BB3D04B21B0BC1FC53"),
+				earliestBlockHash: fromHex("54473B6F28CAA85F5664F7CA3F2EEE49CD9857BDE41E0BF604B1A1DE93CBFEFF"),
+				earliestAppHash: fromHex("24DFB6C312A7FD4B753444F5CD5FAC4D239BAEC09B6A79BB3D04B21B0BC1FC53"),
 				earliestBlockHeight: 1,
 				earliestBlockTime: fromRfc3339WithNanoseconds("2025-05-28T07:58:54.905470438Z"),
 				catchingUp: false
 			},
 			validatorInfo: {
-				address: (0, import_build.fromHex)("1C7CE0213D96CD5578249740DC31A9D8E4D7A226"),
+				address: fromHex("1C7CE0213D96CD5578249740DC31A9D8E4D7A226"),
 				pubkey: {
 					algorithm: "ed25519",
-					data: (0, import_build.fromBase64)("+KoTmCU6lo7NCtsfPCYpdNf0fs3aScZ8CtdgHTR/oGs=")
+					data: fromBase64("+KoTmCU6lo7NCtsfPCYpdNf0fs3aScZ8CtdgHTR/oGs=")
 				},
 				votingPower: 0n
 			}
@@ -172,24 +286,72 @@ var MockRpcClient = class {
 	}
 	async disconnect() {}
 	async blockResults(height) {
+		const attribute = (key, value) => ({
+			key,
+			value
+		});
+		const feeCollector = mockModuleAccounts().fee_collector;
+		const transferEvents = (msgIndex) => [
+			{
+				type: "message",
+				attributes: [attribute("action", "/cosmos.bank.v1beta1.MsgSend"), attribute("msg_index", String(msgIndex))]
+			},
+			{
+				type: "coin_spent",
+				attributes: [
+					attribute("spender", syntheticAddress("cosmos", 1)),
+					attribute("amount", "10uatom"),
+					attribute("msg_index", String(msgIndex))
+				]
+			},
+			{
+				type: "coin_received",
+				attributes: [
+					attribute("receiver", syntheticAddress("cosmos", 2)),
+					attribute("amount", "10uatom"),
+					attribute("msg_index", String(msgIndex))
+				]
+			}
+		];
 		const results = [];
 		for (let i = 0; i < this.txPerBlock; i++) results.push({
 			code: 0,
 			data: Buffer.from("success"),
-			log: JSON.stringify([{
+			log: this.cometVersion === "0.38" ? "" : JSON.stringify([{
 				msg_index: 0,
-				events: []
+				events: transferEvents(0)
 			}]),
 			gasWanted: BigInt(2e5),
 			gasUsed: BigInt(15e4),
-			events: [],
+			events: transferEvents(0),
 			codespace: ""
 		});
+		const beginBlockEvents = [{
+			type: "coin_received",
+			attributes: [attribute("receiver", feeCollector), attribute("amount", "50uatom")]
+		}];
+		const endBlockEvents = [{
+			type: "coin_spent",
+			attributes: [attribute("spender", feeCollector), attribute("amount", "5uatom")]
+		}];
+		if (this.cometVersion === "0.38") {
+			const tagged = (events, mode) => events.map((event) => ({
+				type: event.type,
+				attributes: [...event.attributes, attribute("mode", mode)]
+			}));
+			return {
+				height,
+				results,
+				finalizeBlockEvents: [...tagged(beginBlockEvents, "BeginBlock"), ...tagged(endBlockEvents, "EndBlock")],
+				validatorUpdates: [],
+				consensusUpdates: void 0
+			};
+		}
 		return {
 			height,
 			results,
-			beginBlockEvents: [],
-			endBlockEvents: [],
+			beginBlockEvents,
+			endBlockEvents,
 			validatorUpdates: [],
 			consensusUpdates: void 0
 		};
@@ -204,5 +366,5 @@ function createMockRpcClient(config) {
 }
 
 //#endregion
-export { MockRpcClient, createMockRpcClient };
+export { MockRpcClient, createMockRpcClient, mockModuleAccounts, syntheticAddress };
 //# sourceMappingURL=rpc-client.mjs.map

package/dist/mocks/rpc-client.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"rpc-client.mjs","names":["tx: Tx","txs: Uint8Array[]","results: TxData[]"],"sources":["../../src/mocks/rpc-client.ts"],"sourcesContent":["/**\n * Mock RPC client for benchmarking and testing\n * Generates synthetic blockchain data without requiring an actual RPC node\n */\nimport {\n  fromBase64, fromHex,\n} from \"@cosmjs/encoding\";\nimport {\n  BlockResponse,\n  BlockResultsResponse,\n  CometClient,\n  fromRfc3339WithNanoseconds,\n  StatusResponse,\n  TxData,\n} from \"@cosmjs/tendermint-rpc\";\nimport {\n  Tx,\n} from \"cosmjs-types/cosmos/tx/v1beta1/tx.js\";\n\n/** Configuration for mock data generation */\nexport interface MockRpcConfig {\n  /** Chain ID for generated blocks */\n  chainId: string\n  /** Number of transactions per block */\n  txPerBlock: number\n  /** Starting block height */\n  startHeight: number\n  /** Latest block height available */\n  endHeight: number\n}\n/**\n * Generates a synthetic transaction with realistic structure\n */\nfunction generateMockTx(height: number, txIndex: number): Uint8Array {\n  const tx: Tx = {\n    body: {\n      messages: [\n        {\n          typeUrl: \"/cosmos.bank.v1beta1.MsgSend\",\n          value: new Uint8Array([10, 45, 99, 111, 115, 109, 111, 115, 49, 18, 45, 99, 111, 115, 109, 111, 115, 50]),\n        },\n      ],\n      memo: `Mock tx ${height}-${txIndex}`,\n      timeoutHeight: BigInt(height + 100),\n      extensionOptions: [],\n      nonCriticalExtensionOptions: [],\n    },\n    authInfo: {\n      signerInfos: [\n        {\n          publicKey: {\n            typeUrl: \"/cosmos.crypto.secp256k1.PubKey\",\n            value: new Uint8Array(33),\n          },\n          modeInfo: {\n            single: {\n              mode: 1,\n            },\n          },\n          sequence: BigInt(txIndex),\n        },\n      ],\n      fee: {\n        amount: [\n          {\n            denom: \"uatom\",\n            amount: \"5000\",\n          },\n        ],\n        gasLimit: BigInt(200000),\n        payer: \"\",\n        granter: \"\",\n      },\n      tip: undefined,\n    },\n    signatures: [new Uint8Array(64)],\n  };\n\n  return Tx.encode(tx).finish();\n}\n\nexport class MockRpcClient {\n  private chainId: string;\n  private startHeight: number;\n  private endHeight: number;\n  private txPerBlock: number;\n\n  constructor({\n    chainId,\n    startHeight,\n    endHeight,\n    txPerBlock,\n  }: {\n    chainId: string\n    startHeight: number\n    endHeight: number\n    txPerBlock: number\n  }) {\n    this.chainId = chainId;\n    this.startHeight = startHeight;\n    this.endHeight = endHeight;\n    this.txPerBlock = txPerBlock;\n  }\n\n  async block(height: number): Promise<BlockResponse> {\n    const txs: Uint8Array[] = [];\n    for (let i = 0; i < this.txPerBlock; i++) {\n      txs.push(generateMockTx(height, i));\n    }\n    return {\n      block: {\n        header: {\n          height: height,\n          version: {\n            block: 11,\n            app: 0,\n          },\n          time: fromRfc3339WithNanoseconds(new Date().toISOString()),\n          chainId: this.chainId,\n          lastBlockId: null,\n          lastCommitHash: new Uint8Array(),\n          dataHash: new Uint8Array(),\n          validatorsHash: new Uint8Array(),\n          nextValidatorsHash: new Uint8Array(),\n          consensusHash: new Uint8Array(),\n          appHash: new Uint8Array(),\n          lastResultsHash: new Uint8Array(),\n          evidenceHash: new Uint8Array(),\n          proposerAddress: new Uint8Array(),\n        },\n        txs: txs,\n        evidence: [],\n        lastCommit: {\n          height: height - 1,\n          round: 0,\n          blockId: {\n            hash: new Uint8Array(),\n            parts: {\n              total: 0,\n              hash: new Uint8Array(),\n            },\n          },\n          signatures: [\n            {\n              blockIdFlag: 2,\n              validatorAddress: fromHex(\"D68EEC0D2E8248F1EC64CDB585EDB61ECA432BD8\"),\n              timestamp: fromRfc3339WithNanoseconds(new Date().toISOString()),\n              signature: fromBase64(\"Z6d2P35dI6qBzfPdyIZvmZi7Imo2FmQ5kNSnpVb2UvCj0aSjRCtS59BauJFB6FDHPluOUYoz0rJ4jiOnNXh9AA==\"),\n            },\n          ],\n        },\n      },\n      blockId: {\n        hash: new Uint8Array(),\n        parts: {\n          total: 0,\n          hash: new Uint8Array(),\n        },\n      },\n    };\n  }\n\n  async status(): Promise<StatusResponse> {\n    return {\n      nodeInfo: {\n        protocolVersion: {\n          p2p: 8,\n          block: 11,\n          app: 0,\n        },\n        id: fromHex(\"d2982128df6a29e700980f325b0444e301c604d7\"),\n        listenAddr: \"tcp://0.0.0.0:26656\",\n        network: \"atomone-1\",\n        version: \"0.37.15\",\n        channels: \"40202122233038606100\",\n        moniker: \"node\",\n        other: new Map([[\"txIndex\", \"on\"], [\"rpcAddress\", \"tcp://0.0.0.0:26657\"]]),\n      },\n      syncInfo: {\n        latestBlockHash: fromHex(\"3F3F7A6F11FA91856BE440F8C78262307CAEAB122720D61CB14B118EF89892B5\"),\n        latestAppHash: fromHex(\"FF91D618633BDD5395763F34805E6DACF6BBFB642A2E787677BF28B39427F289\"),\n        latestBlockHeight: this.endHeight,\n        latestBlockTime: fromRfc3339WithNanoseconds(\"2025-11-06T12:58:21.271608775Z\"),\n        earliestBlockHash: fromHex(\"54473B6F28CAA85F5664F7CA3F2EEE49CD9857BDE41E0BF604B1A1DE93CBFEFF\"),\n        earliestAppHash: fromHex(\"24DFB6C312A7FD4B753444F5CD5FAC4D239BAEC09B6A79BB3D04B21B0BC1FC53\"),\n        earliestBlockHeight: 1,\n        earliestBlockTime: fromRfc3339WithNanoseconds(\"2025-05-28T07:58:54.905470438Z\"),\n        catchingUp: false,\n      },\n      validatorInfo: {\n        address: fromHex(\"1C7CE0213D96CD5578249740DC31A9D8E4D7A226\"),\n        pubkey: {\n          algorithm: \"ed25519\",\n          data: fromBase64(\"+KoTmCU6lo7NCtsfPCYpdNf0fs3aScZ8CtdgHTR/oGs=\"),\n        },\n        votingPower: 0n,\n      },\n    };\n  }\n\n  subscribeNewBlock() {\n    return {\n      addListener: (..._args: unknown[]) => {},\n      removeListener: (..._args: unknown[]) => {},\n    } as ReturnType<CometClient[\"subscribeNewBlock\"]>;\n  }\n\n  async disconnect(): Promise<void> {\n    // No-op for mock\n  }\n\n  async blockResults(height: number): Promise<BlockResultsResponse> {\n    const results: TxData[] = [];\n    for (let i = 0; i < this.txPerBlock; i++) {\n      results.push({\n        code: 0,\n        data: Buffer.from(\"success\"),\n        log: JSON.stringify([\n          {\n            msg_index: 0,\n            events: [],\n          },\n        ]),\n        gasWanted: BigInt(200000),\n        gasUsed: BigInt(150000),\n        events: [],\n        codespace: \"\",\n      });\n    }\n    return {\n      height: height,\n      results: results,\n      beginBlockEvents: [],\n      endBlockEvents: [],\n      validatorUpdates: [],\n      consensusUpdates: undefined,\n    };\n  }\n\n  async connect(): Promise<void> {\n  }\n}\n\n/**\n * Factory function to create a mock RPC client\n */\nexport function createMockRpcClient(config: MockRpcConfig): CometClient {\n  return new MockRpcClient(config) as unknown as CometClient;\n}\n"],"mappings":";;;;;;;;;;AAiCA,SAAS,eAAe,QAAgB,SAA6B;CACnE,MAAMA,KAAS;EACb,MAAM;GACJ,UAAU,CACR;IACE,SAAS;IACT,OAAO,IAAI,WAAW;KAAC;KAAI;KAAI;KAAI;KAAK;KAAK;KAAK;KAAK;KAAK;KAAI;KAAI;KAAI;KAAI;KAAK;KAAK;KAAK;KAAK;KAAK;KAAG,CAAC;IAC1G,CACF;GACD,MAAM,WAAW,OAAO,GAAG;GAC3B,eAAe,OAAO,SAAS,IAAI;GACnC,kBAAkB,EAAE;GACpB,6BAA6B,EAAE;GAChC;EACD,UAAU;GACR,aAAa,CACX;IACE,WAAW;KACT,SAAS;KACT,OAAO,IAAI,WAAW,GAAG;KAC1B;IACD,UAAU,EACR,QAAQ,EACN,MAAM,GACP,EACF;IACD,UAAU,OAAO,QAAQ;IAC1B,CACF;GACD,KAAK;IACH,QAAQ,CACN;KACE,OAAO;KACP,QAAQ;KACT,CACF;IACD,UAAU,OAAO,IAAO;IACxB,OAAO;IACP,SAAS;IACV;GACD,KAAK;GACN;EACD,YAAY,CAAC,IAAI,WAAW,GAAG,CAAC;EACjC;AAED,QAAO,GAAG,OAAO,GAAG,CAAC,QAAQ;;AAG/B,IAAa,gBAAb,MAA2B;CACzB,AAAQ;CACR,AAAQ;CACR,AAAQ;CACR,AAAQ;CAER,YAAY,EACV,SACA,aACA,WACA,cAMC;AACD,OAAK,UAAU;AACf,OAAK,cAAc;AACnB,OAAK,YAAY;AACjB,OAAK,aAAa;;CAGpB,MAAM,MAAM,QAAwC;EAClD,MAAMC,MAAoB,EAAE;AAC5B,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,YAAY,IACnC,KAAI,KAAK,eAAe,QAAQ,EAAE,CAAC;AAErC,SAAO;GACL,OAAO;IACL,QAAQ;KACE;KACR,SAAS;MACP,OAAO;MACP,KAAK;MACN;KACD,MAAM,4CAA2B,IAAI,MAAM,EAAC,aAAa,CAAC;KAC1D,SAAS,KAAK;KACd,aAAa;KACb,gBAAgB,IAAI,YAAY;KAChC,UAAU,IAAI,YAAY;KAC1B,gBAAgB,IAAI,YAAY;KAChC,oBAAoB,IAAI,YAAY;KACpC,eAAe,IAAI,YAAY;KAC/B,SAAS,IAAI,YAAY;KACzB,iBAAiB,IAAI,YAAY;KACjC,cAAc,IAAI,YAAY;KAC9B,iBAAiB,IAAI,YAAY;KAClC;IACI;IACL,UAAU,EAAE;IACZ,YAAY;KACV,QAAQ,SAAS;KACjB,OAAO;KACP,SAAS;MACP,MAAM,IAAI,YAAY;MACtB,OAAO;OACL,OAAO;OACP,MAAM,IAAI,YAAY;OACvB;MACF;KACD,YAAY,CACV;MACE,aAAa;MACb,4CAA0B,2CAA2C;MACrE,WAAW,4CAA2B,IAAI,MAAM,EAAC,aAAa,CAAC;MAC/D,wCAAsB,2FAA2F;MAClH,CACF;KACF;IACF;GACD,SAAS;IACP,MAAM,IAAI,YAAY;IACtB,OAAO;KACL,OAAO;KACP,MAAM,IAAI,YAAY;KACvB;IACF;GACF;;CAGH,MAAM,SAAkC;AACtC,SAAO;GACL,UAAU;IACR,iBAAiB;KACf,KAAK;KACL,OAAO;KACP,KAAK;KACN;IACD,8BAAY,2CAA2C;IACvD,YAAY;IACZ,SAAS;IACT,SAAS;IACT,UAAU;IACV,SAAS;IACT,OAAO,IAAI,IAAI,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC,cAAc,sBAAsB,CAAC,CAAC;IAC3E;GACD,UAAU;IACR,2CAAyB,mEAAmE;IAC5F,yCAAuB,mEAAmE;IAC1F,mBAAmB,KAAK;IACxB,iBAAiB,2BAA2B,iCAAiC;IAC7E,6CAA2B,mEAAmE;IAC9F,2CAAyB,mEAAmE;IAC5F,qBAAqB;IACrB,mBAAmB,2BAA2B,iCAAiC;IAC/E,YAAY;IACb;GACD,eAAe;IACb,mCAAiB,2CAA2C;IAC5D,QAAQ;KACN,WAAW;KACX,mCAAiB,+CAA+C;KACjE;IACD,aAAa;IACd;GACF;;CAGH,oBAAoB;AAClB,SAAO;GACL,cAAc,GAAG,UAAqB;GACtC,iBAAiB,GAAG,UAAqB;GAC1C;;CAGH,MAAM,aAA4B;CAIlC,MAAM,aAAa,QAA+C;EAChE,MAAMC,UAAoB,EAAE;AAC5B,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,YAAY,IACnC,SAAQ,KAAK;GACX,MAAM;GACN,MAAM,OAAO,KAAK,UAAU;GAC5B,KAAK,KAAK,UAAU,CAClB;IACE,WAAW;IACX,QAAQ,EAAE;IACX,CACF,CAAC;GACF,WAAW,OAAO,IAAO;GACzB,SAAS,OAAO,KAAO;GACvB,QAAQ,EAAE;GACV,WAAW;GACZ,CAAC;AAEJ,SAAO;GACG;GACC;GACT,kBAAkB,EAAE;GACpB,gBAAgB,EAAE;GAClB,kBAAkB,EAAE;GACpB,kBAAkB;GACnB;;CAGH,MAAM,UAAyB;;;;;AAOjC,SAAgB,oBAAoB,QAAoC;AACtE,QAAO,IAAI,cAAc,OAAO"}
+{"version":3,"file":"rpc-client.mjs","names":["tx: Tx","set: Validator[]","QueryStakingParamsResponse","txs: Uint8Array[]","results: TxData[]","beginBlockEvents: Event38[]","endBlockEvents: Event38[]"],"sources":["../../src/mocks/rpc-client.ts"],"sourcesContent":["/**\n * Mock RPC client for benchmarking and testing\n * Generates synthetic blockchain data without requiring an actual RPC node\n */\nimport {\n  createHash,\n} from \"node:crypto\";\n\nimport {\n  fromBase64, fromHex, toBech32,\n} from \"@cosmjs/encoding\";\nimport {\n  AbciQueryParams,\n  AbciQueryResponse,\n  BlockResponse,\n  BlockResultsResponse,\n  CometClient,\n  fromRfc3339WithNanoseconds,\n  StatusResponse,\n  TxData,\n} from \"@cosmjs/tendermint-rpc\";\nimport {\n  BlockResultsResponse as BlockResultsResponse38, Event as Event38,\n} from \"@cosmjs/tendermint-rpc/build/comet38/responses.js\";\nimport {\n  ModuleAccount,\n} from \"cosmjs-types/cosmos/auth/v1beta1/auth.js\";\nimport {\n  QueryModuleAccountsResponse,\n} from \"cosmjs-types/cosmos/auth/v1beta1/query.js\";\nimport {\n  QueryAllBalancesResponse,\n} from \"cosmjs-types/cosmos/bank/v1beta1/query.js\";\nimport {\n  QueryDelegatorDelegationsResponse,\n  QueryParamsResponse as QueryStakingParamsResponse,\n  QueryPoolResponse,\n  QueryValidatorDelegationsResponse,\n  QueryValidatorsRequest,\n  QueryValidatorsResponse,\n} from \"cosmjs-types/cosmos/staking/v1beta1/query.js\";\nimport {\n  Validator,\n} from \"cosmjs-types/cosmos/staking/v1beta1/staking.js\";\nimport {\n  Tx,\n} from \"cosmjs-types/cosmos/tx/v1beta1/tx.js\";\n\n/** Configuration for mock data generation */\nexport interface MockRpcConfig {\n  /** Chain ID for generated blocks */\n  chainId: string\n  /** Number of transactions per block */\n  txPerBlock: number\n  /** Starting block height */\n  startHeight: number\n  /** Latest block height available */\n  endHeight: number\n  /** Which CometBFT response shape to produce (default: 0.37) */\n  cometVersion?: \"0.37\" | \"0.38\"\n  /** Size of the synthetic validator set answered by the Validators ABCI query (default: 3) */\n  validatorCount?: number\n}\n\n/** Deterministic bech32 address from a small integer, for synthetic accounts and validators */\nexport function syntheticAddress(prefix: string, seed: number): string {\n  const bytes = new Uint8Array(20);\n  bytes[0] = seed & 0xff;\n  bytes[1] = (seed >> 8) & 0xff;\n  bytes[19] = 0x01;\n  return toBech32(prefix, bytes);\n}\n\n/** Module accounts a chain always has, with deterministic addresses (computed on first use) */\nexport function mockModuleAccounts(): Record<string, string> {\n  return {\n    fee_collector: syntheticAddress(\"cosmos\", 1001),\n    distribution: syntheticAddress(\"cosmos\", 1002),\n  };\n}\n\n/**\n * Generates a synthetic transaction with realistic structure\n */\nfunction generateMockTx(height: number, txIndex: number): Uint8Array {\n  const tx: Tx = {\n    body: {\n      messages: [\n        {\n          typeUrl: \"/cosmos.bank.v1beta1.MsgSend\",\n          value: new Uint8Array([10, 45, 99, 111, 115, 109, 111, 115, 49, 18, 45, 99, 111, 115, 109, 111, 115, 50]),\n        },\n      ],\n      memo: `Mock tx ${height}-${txIndex}`,\n      timeoutHeight: BigInt(height + 100),\n      extensionOptions: [],\n      nonCriticalExtensionOptions: [],\n    },\n    authInfo: {\n      signerInfos: [\n        {\n          publicKey: {\n            typeUrl: \"/cosmos.crypto.secp256k1.PubKey\",\n            value: new Uint8Array(33),\n          },\n          modeInfo: {\n            single: {\n              mode: 1,\n            },\n          },\n          sequence: BigInt(txIndex),\n        },\n      ],\n      fee: {\n        amount: [\n          {\n            denom: \"uatom\",\n            amount: \"5000\",\n          },\n        ],\n        gasLimit: BigInt(200000),\n        payer: \"\",\n        granter: \"\",\n      },\n      tip: undefined,\n    },\n    signatures: [new Uint8Array(64)],\n  };\n\n  return Tx.encode(tx).finish();\n}\n\nexport class MockRpcClient {\n  private chainId: string;\n  private startHeight: number;\n  private endHeight: number;\n  private txPerBlock: number;\n  private cometVersion: \"0.37\" | \"0.38\";\n  private validatorCount: number;\n\n  constructor({\n    chainId,\n    startHeight,\n    endHeight,\n    txPerBlock,\n    cometVersion,\n    validatorCount,\n  }: MockRpcConfig) {\n    this.chainId = chainId;\n    this.startHeight = startHeight;\n    this.endHeight = endHeight;\n    this.txPerBlock = txPerBlock;\n    this.cometVersion = cometVersion ?? \"0.37\";\n    this.validatorCount = validatorCount ?? 3;\n  }\n\n  /** The synthetic validator set, identical at every height */\n  validators(): Validator[] {\n    const set: Validator[] = [];\n    for (let i = 0; i < this.validatorCount; i++) {\n      set.push(Validator.fromPartial({\n        operatorAddress: syntheticAddress(\"cosmosvaloper\", i + 1),\n        jailed: false,\n        status: 3,\n        tokens: String(1000000 * (i + 1)),\n        delegatorShares: String(1000000 * (i + 1)) + \"000000000000000000\",\n        description: {\n          moniker: \"mock-validator-\" + (i + 1),\n        },\n        commission: {\n          commissionRates: {\n            rate: \"100000000000000000\",\n            maxRate: \"200000000000000000\",\n            maxChangeRate: \"10000000000000000\",\n          },\n        },\n        minSelfDelegation: \"1\",\n      }));\n    }\n    return set;\n  }\n\n  /**\n   * Answers the ABCI queries the engine and the core modules issue. Unknown paths get a\n   * non-zero code, as a real node would answer for a query it does not serve.\n   */\n  async abciQuery(params: AbciQueryParams): Promise<AbciQueryResponse> {\n    const reply = (value: Uint8Array): AbciQueryResponse => ({\n      key: new Uint8Array(),\n      value,\n      height: params.height,\n      index: 0,\n      code: 0,\n      codespace: \"\",\n      log: \"\",\n      info: \"\",\n    });\n    switch (params.path) {\n      case \"/cosmos.staking.v1beta1.Query/Validators\": {\n        const request = QueryValidatorsRequest.decode(params.data);\n        const all = this.validators();\n        const limit = Number(request.pagination?.limit ?? 100n) || 100;\n        const key = request.pagination?.key;\n        const offset = key && key.length > 0 ? key[0] : 0;\n        const page = all.slice(offset, offset + limit);\n        const next = offset + limit < all.length ? new Uint8Array([offset + limit]) : new Uint8Array();\n        return reply(QueryValidatorsResponse.encode(QueryValidatorsResponse.fromPartial({\n          validators: page,\n          pagination: {\n            nextKey: next,\n            total: BigInt(all.length),\n          },\n        })).finish());\n      }\n      case \"/cosmos.auth.v1beta1.Query/ModuleAccounts\":\n        return reply(QueryModuleAccountsResponse.encode(QueryModuleAccountsResponse.fromPartial({\n          accounts: Object.entries(mockModuleAccounts()).map(([name, address]) => ({\n            typeUrl: \"/cosmos.auth.v1beta1.ModuleAccount\",\n            value: ModuleAccount.encode(ModuleAccount.fromPartial({\n              baseAccount: {\n                address,\n              },\n              name,\n            })).finish(),\n          })),\n        })).finish());\n      case \"/cosmos.bank.v1beta1.Query/AllBalances\":\n        return reply(QueryAllBalancesResponse.encode(QueryAllBalancesResponse.fromPartial({\n          balances: [\n            {\n              denom: \"uatom\",\n              amount: \"1000000\",\n            },\n          ],\n        })).finish());\n      case \"/cosmos.staking.v1beta1.Query/Pool\":\n        return reply(QueryPoolResponse.encode(QueryPoolResponse.fromPartial({\n          pool: {\n            bondedTokens: String(this.validators().reduce((sum, v) => sum + Number(v.tokens), 0)),\n            notBondedTokens: \"0\",\n          },\n        })).finish());\n      case \"/cosmos.staking.v1beta1.Query/Params\":\n        return reply(QueryStakingParamsResponse.encode(QueryStakingParamsResponse.fromPartial({\n          params: {\n            unbondingTime: {\n              seconds: 1814400n,\n              nanos: 0,\n            },\n            maxValidators: 100,\n            maxEntries: 7,\n            historicalEntries: 10000,\n            bondDenom: \"uatom\",\n            minCommissionRate: \"0\",\n          },\n        })).finish());\n      case \"/cosmos.staking.v1beta1.Query/DelegatorDelegations\":\n        return reply(QueryDelegatorDelegationsResponse.encode(QueryDelegatorDelegationsResponse.fromPartial({\n        })).finish());\n      case \"/cosmos.staking.v1beta1.Query/ValidatorDelegations\":\n        return reply(QueryValidatorDelegationsResponse.encode(QueryValidatorDelegationsResponse.fromPartial({\n        })).finish());\n      default:\n        return {\n          ...reply(new Uint8Array()),\n          code: 6,\n          log: \"unknown request: \" + params.path,\n        };\n    }\n  }\n\n  async block(height: number): Promise<BlockResponse> {\n    const txs: Uint8Array[] = [];\n    for (let i = 0; i < this.txPerBlock; i++) {\n      txs.push(generateMockTx(height, i));\n    }\n    // Deterministic, unique per height: the blocks table has a unique constraint on the hash\n    const hashOf = (h: number) => new Uint8Array(createHash(\"sha256\").update(this.chainId + \":\" + h).digest());\n    return {\n      block: {\n        header: {\n          height: height,\n          version: {\n            block: 11,\n            app: 0,\n          },\n          time: fromRfc3339WithNanoseconds(new Date().toISOString()),\n          chainId: this.chainId,\n          lastBlockId: null,\n          lastCommitHash: new Uint8Array(),\n          dataHash: new Uint8Array(),\n          validatorsHash: new Uint8Array(),\n          nextValidatorsHash: new Uint8Array(),\n          consensusHash: new Uint8Array(),\n          appHash: new Uint8Array(),\n          lastResultsHash: new Uint8Array(),\n          evidenceHash: new Uint8Array(),\n          proposerAddress: new Uint8Array(),\n        },\n        txs: txs,\n        evidence: [],\n        lastCommit: {\n          height: height - 1,\n          round: 0,\n          blockId: {\n            hash: new Uint8Array(),\n            parts: {\n              total: 0,\n              hash: new Uint8Array(),\n            },\n          },\n          signatures: [\n            {\n              blockIdFlag: 2,\n              validatorAddress: fromHex(\"D68EEC0D2E8248F1EC64CDB585EDB61ECA432BD8\"),\n              timestamp: fromRfc3339WithNanoseconds(new Date().toISOString()),\n              signature: fromBase64(\"Z6d2P35dI6qBzfPdyIZvmZi7Imo2FmQ5kNSnpVb2UvCj0aSjRCtS59BauJFB6FDHPluOUYoz0rJ4jiOnNXh9AA==\"),\n            },\n          ],\n        },\n      },\n      blockId: {\n        hash: hashOf(height),\n        parts: {\n          total: 0,\n          hash: new Uint8Array(),\n        },\n      },\n    };\n  }\n\n  async status(): Promise<StatusResponse> {\n    return {\n      nodeInfo: {\n        protocolVersion: {\n          p2p: 8,\n          block: 11,\n          app: 0,\n        },\n        id: fromHex(\"d2982128df6a29e700980f325b0444e301c604d7\"),\n        listenAddr: \"tcp://0.0.0.0:26656\",\n        network: this.chainId,\n        version: this.cometVersion === \"0.38\" ? \"0.38.17\" : \"0.37.15\",\n        channels: \"40202122233038606100\",\n        moniker: \"node\",\n        other: new Map([[\"txIndex\", \"on\"], [\"rpcAddress\", \"tcp://0.0.0.0:26657\"]]),\n      },\n      syncInfo: {\n        latestBlockHash: fromHex(\"3F3F7A6F11FA91856BE440F8C78262307CAEAB122720D61CB14B118EF89892B5\"),\n        latestAppHash: fromHex(\"FF91D618633BDD5395763F34805E6DACF6BBFB642A2E787677BF28B39427F289\"),\n        latestBlockHeight: this.endHeight,\n        latestBlockTime: fromRfc3339WithNanoseconds(\"2025-11-06T12:58:21.271608775Z\"),\n        earliestBlockHash: fromHex(\"54473B6F28CAA85F5664F7CA3F2EEE49CD9857BDE41E0BF604B1A1DE93CBFEFF\"),\n        earliestAppHash: fromHex(\"24DFB6C312A7FD4B753444F5CD5FAC4D239BAEC09B6A79BB3D04B21B0BC1FC53\"),\n        earliestBlockHeight: 1,\n        earliestBlockTime: fromRfc3339WithNanoseconds(\"2025-05-28T07:58:54.905470438Z\"),\n        catchingUp: false,\n      },\n      validatorInfo: {\n        address: fromHex(\"1C7CE0213D96CD5578249740DC31A9D8E4D7A226\"),\n        pubkey: {\n          algorithm: \"ed25519\",\n          data: fromBase64(\"+KoTmCU6lo7NCtsfPCYpdNf0fs3aScZ8CtdgHTR/oGs=\"),\n        },\n        votingPower: 0n,\n      },\n    };\n  }\n\n  subscribeNewBlock() {\n    return {\n      addListener: (..._args: unknown[]) => {},\n      removeListener: (..._args: unknown[]) => {},\n    } as ReturnType<CometClient[\"subscribeNewBlock\"]>;\n  }\n\n  async disconnect(): Promise<void> {\n    // No-op for mock\n  }\n\n  async blockResults(height: number): Promise<BlockResultsResponse | BlockResultsResponse38> {\n    const attribute = (key: string, value: string) => ({\n      key,\n      value,\n    });\n    const feeCollector = mockModuleAccounts().fee_collector;\n    // Events a real bank module emits for the transfer each mock tx performs\n    const transferEvents = (msgIndex: number): Event38[] => [\n      {\n        type: \"message\",\n        attributes: [attribute(\"action\", \"/cosmos.bank.v1beta1.MsgSend\"), attribute(\"msg_index\", String(msgIndex))],\n      },\n      {\n        type: \"coin_spent\",\n        attributes: [attribute(\"spender\", syntheticAddress(\"cosmos\", 1)), attribute(\"amount\", \"10uatom\"), attribute(\"msg_index\", String(msgIndex))],\n      },\n      {\n        type: \"coin_received\",\n        attributes: [attribute(\"receiver\", syntheticAddress(\"cosmos\", 2)), attribute(\"amount\", \"10uatom\"), attribute(\"msg_index\", String(msgIndex))],\n      },\n    ];\n    const results: TxData[] = [];\n    for (let i = 0; i < this.txPerBlock; i++) {\n      results.push({\n        code: 0,\n        data: Buffer.from(\"success\"),\n        // CometBFT 0.37 nodes return the structured log; 0.38 nodes return an empty log and\n        // events tagged with msg_index instead\n        log: this.cometVersion === \"0.38\"\n          ? \"\"\n          : JSON.stringify([\n            {\n              msg_index: 0,\n              events: transferEvents(0),\n            },\n          ]),\n        gasWanted: BigInt(200000),\n        gasUsed: BigInt(150000),\n        // The 0.37 and 0.38 event types are structurally identical\n        events: transferEvents(0) as unknown as TxData[\"events\"],\n        codespace: \"\",\n      });\n    }\n    // Block-level flows: the fee collector receives the mint at the start of the block\n    const beginBlockEvents: Event38[] = [\n      {\n        type: \"coin_received\",\n        attributes: [attribute(\"receiver\", feeCollector), attribute(\"amount\", \"50uatom\")],\n      },\n    ];\n    const endBlockEvents: Event38[] = [\n      {\n        type: \"coin_spent\",\n        attributes: [attribute(\"spender\", feeCollector), attribute(\"amount\", \"5uatom\")],\n      },\n    ];\n    if (this.cometVersion === \"0.38\") {\n      // Cosmos SDK 0.50+ delivers both phases in one list, tagged with mode=BeginBlock / EndBlock\n      const tagged = (events: Event38[], mode: string) => events.map(event => ({\n        type: event.type,\n        attributes: [...event.attributes, attribute(\"mode\", mode)],\n      }));\n      return {\n        height,\n        results,\n        finalizeBlockEvents: [...tagged(beginBlockEvents, \"BeginBlock\"), ...tagged(endBlockEvents, \"EndBlock\")],\n        validatorUpdates: [],\n        consensusUpdates: undefined,\n      } as unknown as BlockResultsResponse38;\n    }\n    return {\n      height,\n      results,\n      beginBlockEvents,\n      endBlockEvents,\n      validatorUpdates: [],\n      consensusUpdates: undefined,\n    } as unknown as BlockResultsResponse;\n  }\n\n  async connect(): Promise<void> {\n  }\n}\n\n/**\n * Factory function to create a mock RPC client\n */\nexport function createMockRpcClient(config: MockRpcConfig): CometClient {\n  return new MockRpcClient(config) as unknown as CometClient;\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAiEA,SAAgB,iBAAiB,QAAgB,MAAsB;CACrE,MAAM,QAAQ,IAAI,WAAW,GAAG;AAChC,OAAM,KAAK,OAAO;AAClB,OAAM,KAAM,QAAQ,IAAK;AACzB,OAAM,MAAM;AACZ,QAAO,SAAS,QAAQ,MAAM;;;AAIhC,SAAgB,qBAA6C;AAC3D,QAAO;EACL,eAAe,iBAAiB,UAAU,KAAK;EAC/C,cAAc,iBAAiB,UAAU,KAAK;EAC/C;;;;;AAMH,SAAS,eAAe,QAAgB,SAA6B;CACnE,MAAMA,KAAS;EACb,MAAM;GACJ,UAAU,CACR;IACE,SAAS;IACT,OAAO,IAAI,WAAW;KAAC;KAAI;KAAI;KAAI;KAAK;KAAK;KAAK;KAAK;KAAK;KAAI;KAAI;KAAI;KAAI;KAAK;KAAK;KAAK;KAAK;KAAK;KAAG,CAAC;IAC1G,CACF;GACD,MAAM,WAAW,OAAO,GAAG;GAC3B,eAAe,OAAO,SAAS,IAAI;GACnC,kBAAkB,EAAE;GACpB,6BAA6B,EAAE;GAChC;EACD,UAAU;GACR,aAAa,CACX;IACE,WAAW;KACT,SAAS;KACT,OAAO,IAAI,WAAW,GAAG;KAC1B;IACD,UAAU,EACR,QAAQ,EACN,MAAM,GACP,EACF;IACD,UAAU,OAAO,QAAQ;IAC1B,CACF;GACD,KAAK;IACH,QAAQ,CACN;KACE,OAAO;KACP,QAAQ;KACT,CACF;IACD,UAAU,OAAO,IAAO;IACxB,OAAO;IACP,SAAS;IACV;GACD,KAAK;GACN;EACD,YAAY,CAAC,IAAI,WAAW,GAAG,CAAC;EACjC;AAED,QAAO,GAAG,OAAO,GAAG,CAAC,QAAQ;;AAG/B,IAAa,gBAAb,MAA2B;CACzB,AAAQ;CACR,AAAQ;CACR,AAAQ;CACR,AAAQ;CACR,AAAQ;CACR,AAAQ;CAER,YAAY,EACV,SACA,aACA,WACA,YACA,cACA,kBACgB;AAChB,OAAK,UAAU;AACf,OAAK,cAAc;AACnB,OAAK,YAAY;AACjB,OAAK,aAAa;AAClB,OAAK,eAAe,gBAAgB;AACpC,OAAK,iBAAiB,kBAAkB;;;CAI1C,aAA0B;EACxB,MAAMC,MAAmB,EAAE;AAC3B,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,gBAAgB,IACvC,KAAI,KAAK,UAAU,YAAY;GAC7B,iBAAiB,iBAAiB,iBAAiB,IAAI,EAAE;GACzD,QAAQ;GACR,QAAQ;GACR,QAAQ,OAAO,OAAW,IAAI,GAAG;GACjC,iBAAiB,OAAO,OAAW,IAAI,GAAG,GAAG;GAC7C,aAAa,EACX,SAAS,qBAAqB,IAAI,IACnC;GACD,YAAY,EACV,iBAAiB;IACf,MAAM;IACN,SAAS;IACT,eAAe;IAChB,EACF;GACD,mBAAmB;GACpB,CAAC,CAAC;AAEL,SAAO;;;;;;CAOT,MAAM,UAAU,QAAqD;EACnE,MAAM,SAAS,WAA0C;GACvD,KAAK,IAAI,YAAY;GACrB;GACA,QAAQ,OAAO;GACf,OAAO;GACP,MAAM;GACN,WAAW;GACX,KAAK;GACL,MAAM;GACP;AACD,UAAQ,OAAO,MAAf;GACE,KAAK,4CAA4C;IAC/C,MAAM,UAAU,uBAAuB,OAAO,OAAO,KAAK;IAC1D,MAAM,MAAM,KAAK,YAAY;IAC7B,MAAM,QAAQ,OAAO,QAAQ,YAAY,SAAS,KAAK,IAAI;IAC3D,MAAM,MAAM,QAAQ,YAAY;IAChC,MAAM,SAAS,OAAO,IAAI,SAAS,IAAI,IAAI,KAAK;IAChD,MAAM,OAAO,IAAI,MAAM,QAAQ,SAAS,MAAM;IAC9C,MAAM,OAAO,SAAS,QAAQ,IAAI,SAAS,IAAI,WAAW,CAAC,SAAS,MAAM,CAAC,GAAG,IAAI,YAAY;AAC9F,WAAO,MAAM,wBAAwB,OAAO,wBAAwB,YAAY;KAC9E,YAAY;KACZ,YAAY;MACV,SAAS;MACT,OAAO,OAAO,IAAI,OAAO;MAC1B;KACF,CAAC,CAAC,CAAC,QAAQ,CAAC;;GAEf,KAAK,4CACH,QAAO,MAAM,4BAA4B,OAAO,4BAA4B,YAAY,EACtF,UAAU,OAAO,QAAQ,oBAAoB,CAAC,CAAC,KAAK,CAAC,MAAM,cAAc;IACvE,SAAS;IACT,OAAO,cAAc,OAAO,cAAc,YAAY;KACpD,aAAa,EACX,SACD;KACD;KACD,CAAC,CAAC,CAAC,QAAQ;IACb,EAAE,EACJ,CAAC,CAAC,CAAC,QAAQ,CAAC;GACf,KAAK,yCACH,QAAO,MAAM,yBAAyB,OAAO,yBAAyB,YAAY,EAChF,UAAU,CACR;IACE,OAAO;IACP,QAAQ;IACT,CACF,EACF,CAAC,CAAC,CAAC,QAAQ,CAAC;GACf,KAAK,qCACH,QAAO,MAAM,kBAAkB,OAAO,kBAAkB,YAAY,EAClE,MAAM;IACJ,cAAc,OAAO,KAAK,YAAY,CAAC,QAAQ,KAAK,MAAM,MAAM,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC;IACrF,iBAAiB;IAClB,EACF,CAAC,CAAC,CAAC,QAAQ,CAAC;GACf,KAAK,uCACH,QAAO,MAAMC,oBAA2B,OAAOA,oBAA2B,YAAY,EACpF,QAAQ;IACN,eAAe;KACb,SAAS;KACT,OAAO;KACR;IACD,eAAe;IACf,YAAY;IACZ,mBAAmB;IACnB,WAAW;IACX,mBAAmB;IACpB,EACF,CAAC,CAAC,CAAC,QAAQ,CAAC;GACf,KAAK,qDACH,QAAO,MAAM,kCAAkC,OAAO,kCAAkC,YAAY,EACnG,CAAC,CAAC,CAAC,QAAQ,CAAC;GACf,KAAK,qDACH,QAAO,MAAM,kCAAkC,OAAO,kCAAkC,YAAY,EACnG,CAAC,CAAC,CAAC,QAAQ,CAAC;GACf,QACE,QAAO;IACL,GAAG,MAAM,IAAI,YAAY,CAAC;IAC1B,MAAM;IACN,KAAK,sBAAsB,OAAO;IACnC;;;CAIP,MAAM,MAAM,QAAwC;EAClD,MAAMC,MAAoB,EAAE;AAC5B,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,YAAY,IACnC,KAAI,KAAK,eAAe,QAAQ,EAAE,CAAC;EAGrC,MAAM,UAAU,MAAc,IAAI,WAAW,WAAW,SAAS,CAAC,OAAO,KAAK,UAAU,MAAM,EAAE,CAAC,QAAQ,CAAC;AAC1G,SAAO;GACL,OAAO;IACL,QAAQ;KACE;KACR,SAAS;MACP,OAAO;MACP,KAAK;MACN;KACD,MAAM,4CAA2B,IAAI,MAAM,EAAC,aAAa,CAAC;KAC1D,SAAS,KAAK;KACd,aAAa;KACb,gBAAgB,IAAI,YAAY;KAChC,UAAU,IAAI,YAAY;KAC1B,gBAAgB,IAAI,YAAY;KAChC,oBAAoB,IAAI,YAAY;KACpC,eAAe,IAAI,YAAY;KAC/B,SAAS,IAAI,YAAY;KACzB,iBAAiB,IAAI,YAAY;KACjC,cAAc,IAAI,YAAY;KAC9B,iBAAiB,IAAI,YAAY;KAClC;IACI;IACL,UAAU,EAAE;IACZ,YAAY;KACV,QAAQ,SAAS;KACjB,OAAO;KACP,SAAS;MACP,MAAM,IAAI,YAAY;MACtB,OAAO;OACL,OAAO;OACP,MAAM,IAAI,YAAY;OACvB;MACF;KACD,YAAY,CACV;MACE,aAAa;MACb,kBAAkB,QAAQ,2CAA2C;MACrE,WAAW,4CAA2B,IAAI,MAAM,EAAC,aAAa,CAAC;MAC/D,WAAW,WAAW,2FAA2F;MAClH,CACF;KACF;IACF;GACD,SAAS;IACP,MAAM,OAAO,OAAO;IACpB,OAAO;KACL,OAAO;KACP,MAAM,IAAI,YAAY;KACvB;IACF;GACF;;CAGH,MAAM,SAAkC;AACtC,SAAO;GACL,UAAU;IACR,iBAAiB;KACf,KAAK;KACL,OAAO;KACP,KAAK;KACN;IACD,IAAI,QAAQ,2CAA2C;IACvD,YAAY;IACZ,SAAS,KAAK;IACd,SAAS,KAAK,iBAAiB,SAAS,YAAY;IACpD,UAAU;IACV,SAAS;IACT,OAAO,IAAI,IAAI,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC,cAAc,sBAAsB,CAAC,CAAC;IAC3E;GACD,UAAU;IACR,iBAAiB,QAAQ,mEAAmE;IAC5F,eAAe,QAAQ,mEAAmE;IAC1F,mBAAmB,KAAK;IACxB,iBAAiB,2BAA2B,iCAAiC;IAC7E,mBAAmB,QAAQ,mEAAmE;IAC9F,iBAAiB,QAAQ,mEAAmE;IAC5F,qBAAqB;IACrB,mBAAmB,2BAA2B,iCAAiC;IAC/E,YAAY;IACb;GACD,eAAe;IACb,SAAS,QAAQ,2CAA2C;IAC5D,QAAQ;KACN,WAAW;KACX,MAAM,WAAW,+CAA+C;KACjE;IACD,aAAa;IACd;GACF;;CAGH,oBAAoB;AAClB,SAAO;GACL,cAAc,GAAG,UAAqB;GACtC,iBAAiB,GAAG,UAAqB;GAC1C;;CAGH,MAAM,aAA4B;CAIlC,MAAM,aAAa,QAAwE;EACzF,MAAM,aAAa,KAAa,WAAmB;GACjD;GACA;GACD;EACD,MAAM,eAAe,oBAAoB,CAAC;EAE1C,MAAM,kBAAkB,aAAgC;GACtD;IACE,MAAM;IACN,YAAY,CAAC,UAAU,UAAU,+BAA+B,EAAE,UAAU,aAAa,OAAO,SAAS,CAAC,CAAC;IAC5G;GACD;IACE,MAAM;IACN,YAAY;KAAC,UAAU,WAAW,iBAAiB,UAAU,EAAE,CAAC;KAAE,UAAU,UAAU,UAAU;KAAE,UAAU,aAAa,OAAO,SAAS,CAAC;KAAC;IAC5I;GACD;IACE,MAAM;IACN,YAAY;KAAC,UAAU,YAAY,iBAAiB,UAAU,EAAE,CAAC;KAAE,UAAU,UAAU,UAAU;KAAE,UAAU,aAAa,OAAO,SAAS,CAAC;KAAC;IAC7I;GACF;EACD,MAAMC,UAAoB,EAAE;AAC5B,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,YAAY,IACnC,SAAQ,KAAK;GACX,MAAM;GACN,MAAM,OAAO,KAAK,UAAU;GAG5B,KAAK,KAAK,iBAAiB,SACvB,KACA,KAAK,UAAU,CACf;IACE,WAAW;IACX,QAAQ,eAAe,EAAE;IAC1B,CACF,CAAC;GACJ,WAAW,OAAO,IAAO;GACzB,SAAS,OAAO,KAAO;GAEvB,QAAQ,eAAe,EAAE;GACzB,WAAW;GACZ,CAAC;EAGJ,MAAMC,mBAA8B,CAClC;GACE,MAAM;GACN,YAAY,CAAC,UAAU,YAAY,aAAa,EAAE,UAAU,UAAU,UAAU,CAAC;GAClF,CACF;EACD,MAAMC,iBAA4B,CAChC;GACE,MAAM;GACN,YAAY,CAAC,UAAU,WAAW,aAAa,EAAE,UAAU,UAAU,SAAS,CAAC;GAChF,CACF;AACD,MAAI,KAAK,iBAAiB,QAAQ;GAEhC,MAAM,UAAU,QAAmB,SAAiB,OAAO,KAAI,WAAU;IACvE,MAAM,MAAM;IACZ,YAAY,CAAC,GAAG,MAAM,YAAY,UAAU,QAAQ,KAAK,CAAC;IAC3D,EAAE;AACH,UAAO;IACL;IACA;IACA,qBAAqB,CAAC,GAAG,OAAO,kBAAkB,aAAa,EAAE,GAAG,OAAO,gBAAgB,WAAW,CAAC;IACvG,kBAAkB,EAAE;IACpB,kBAAkB;IACnB;;AAEH,SAAO;GACL;GACA;GACA;GACA;GACA,kBAAkB,EAAE;GACpB,kBAAkB;GACnB;;CAGH,MAAM,UAAyB;;;;;AAOjC,SAAgB,oBAAoB,QAAoC;AACtE,QAAO,IAAI,cAAc,OAAO"}

package/dist/promise-queue/index.cjs

@@ -1,10 +1,7 @@
 
 //#region src/promise-queue/index.ts
 /**
-* Implements an "infinite" FIFO queue of fixed size using promises
-* - await `continue()` before enqueing items to ensure fixed size (resolves when space available)
-* - await `dequeue()` to pop an item (resolves when next item is available)
-* - size() is always at minimum 1 item which is the promise for the next enqueued item
+* @deprecated Not used by the engine; CircularBuffer is the block queue. Kept for compatibility, removed in 3.0.
 */
 var PromiseQueue = class {
 	/** Optional error handler for enqueue failures */
@@ -120,6 +117,14 @@ var CircularBuffer = class {
 		this.batcher(true);
 	}
 	enqueue(item) {
+		if (this.count >= this.batchSize) {
+			const error = /* @__PURE__ */ new Error("CircularBuffer is full (" + this.batchSize + " slots); await continue() before enqueueing");
+			if (this.errorHandler) {
+				this.errorHandler(error);
+				return;
+			}
+			throw error;
+		}
 		try {
 			this.enqueuer(item);
 			const nextVal = new Promise((resolve, _reject) => {
@@ -137,6 +142,7 @@ var CircularBuffer = class {
 		}
 	}
 	dequeue() {
+		if (this.count <= 0) throw new Error("CircularBuffer is empty; the previous dequeue() has not been fulfilled yet");
 		const item = this.items[this.next];
 		this.next++;
 		this.count--;

package/dist/promise-queue/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":["/**\n * Implements an \"infinite\" FIFO queue of fixed size using promises\n * - await `continue()` before enqueing items to ensure fixed size (resolves when space available)\n * - await `dequeue()` to pop an item (resolves when next item is available)\n * - size() is always at minimum 1 item which is the promise for the next enqueued item\n */\nexport class PromiseQueue<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n  /** Array of promises representing queued items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the queue is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items to keep in the queue */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items.push(nextVal);\n      if (this.size() > this.batchSize) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  clear() {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  dequeue() {\n    const item = this.items.shift();\n    if (this.size() <= this.batchSize) {\n      this.batcher(true);\n    }\n\n    return item as Promise<T>;\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.items.length == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.items.length;\n  }\n}\n\n/**\n * Circular buffer implementation using promises for efficient memory usage\n * Reuses array slots in a circular fashion to maintain constant memory footprint\n * Used by the indexer for managing block processing queues\n */\nexport class CircularBuffer<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n\n  /** Fixed-size array of promises representing buffered items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Current number of items in the buffer */\n  private count: number = 0;\n\n  /** Index of the next item to dequeue */\n  private next: number = 0;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the buffer is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items the buffer can hold */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  /** Index of the next available slot for enqueueing */\n  private nextAvail: number = 0;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    if (batchSize <= 1) {\n      throw new Error(\"Batch size must be greater than 1\");\n    }\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(batchSize);\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.items[this.nextAvail] = nextVal;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items[this.nextAvail] = nextVal;\n      this.count++;\n      this.nextAvail++;\n      if (this.nextAvail >= this.batchSize) {\n        this.nextAvail = 0;\n      }\n\n      if (this.nextAvail == this.next) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  dequeue() {\n    const item = this.items[this.next];\n    this.next++;\n    this.count--;\n    if (this.next >= this.batchSize) {\n      this.next = 0;\n    }\n    if (this.count <= this.batchSize) {\n      this.batcher(true);\n    }\n    return item;\n  }\n\n  clear() {\n    this.next = 0;\n    this.nextAvail = 0;\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(this.batchSize);\n    this.items[this.nextAvail] = nextVal;\n    this.synced = false;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.count == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.count;\n  }\n}\n"],"mappings":";;;;;;;;AAMA,IAAa,eAAb,MAA6B;;CAE3B,AAAQ;;CAER,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;CAER,YAAY,WAAmB,cAAyC;EACtE,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,QAAQ;AACxB,OAAI,KAAK,MAAM,GAAG,KAAK,UACrB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,QAAQ;EACN,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,MAAI,KAAK,MAAM,IAAI,KAAK,UACtB,MAAK,QAAQ,KAAK;AAGpB,SAAO;;CAGT,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,MAAM,UAAU,EACvB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK,MAAM;;;;;;;;AAStB,IAAa,iBAAb,MAA+B;;CAE7B,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,QAAgB;;CAGxB,AAAQ,OAAe;;CAGvB,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,YAAoB;CAE5B,YAAY,WAAmB,cAAyC;AACtE,MAAI,aAAa,EACf,OAAM,IAAI,MAAM,oCAAoC;EAEtD,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,UAAU;AAC7C,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,aAAa;AAC7B,QAAK;AACL,QAAK;AACL,OAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAI,KAAK,aAAa,KAAK,KACzB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,KAAK;AAC7B,OAAK;AACL,OAAK;AACL,MAAI,KAAK,QAAQ,KAAK,UACpB,MAAK,OAAO;AAEd,MAAI,KAAK,SAAS,KAAK,UACrB,MAAK,QAAQ,KAAK;AAEpB,SAAO;;CAGT,QAAQ;AACN,OAAK,OAAO;AACZ,OAAK,YAAY;EACjB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,KAAK,UAAU;AAClD,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,SAAS,EAChB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK"}
+{"version":3,"file":"index.cjs","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":["/**\n * @deprecated Not used by the engine; CircularBuffer is the block queue. Kept for compatibility, removed in 3.0.\n */\nexport class PromiseQueue<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n  /** Array of promises representing queued items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the queue is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items to keep in the queue */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items.push(nextVal);\n      if (this.size() > this.batchSize) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  clear() {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  dequeue() {\n    const item = this.items.shift();\n    if (this.size() <= this.batchSize) {\n      this.batcher(true);\n    }\n\n    return item as Promise<T>;\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.items.length == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.items.length;\n  }\n}\n\n/**\n * Circular buffer implementation using promises for efficient memory usage\n * Reuses array slots in a circular fashion to maintain constant memory footprint\n * Used by the indexer for managing block processing queues\n */\nexport class CircularBuffer<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n\n  /** Fixed-size array of promises representing buffered items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Current number of items in the buffer */\n  private count: number = 0;\n\n  /** Index of the next item to dequeue */\n  private next: number = 0;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the buffer is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items the buffer can hold */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  /** Index of the next available slot for enqueueing */\n  private nextAvail: number = 0;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    if (batchSize <= 1) {\n      throw new Error(\"Batch size must be greater than 1\");\n    }\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(batchSize);\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.items[this.nextAvail] = nextVal;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    if (this.count >= this.batchSize) {\n      // Overwriting would silently drop the oldest unprocessed block; callers must await continue()\n      const error = new Error(\"CircularBuffer is full (\" + this.batchSize + \" slots); await continue() before enqueueing\");\n      if (this.errorHandler) {\n        this.errorHandler(error);\n        return;\n      }\n      throw error;\n    }\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items[this.nextAvail] = nextVal;\n      this.count++;\n      this.nextAvail++;\n      if (this.nextAvail >= this.batchSize) {\n        this.nextAvail = 0;\n      }\n\n      if (this.nextAvail == this.next) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  dequeue() {\n    if (this.count <= 0) {\n      // The only pending slot (the sentinel) has already been handed out\n      throw new Error(\"CircularBuffer is empty; the previous dequeue() has not been fulfilled yet\");\n    }\n    const item = this.items[this.next];\n    this.next++;\n    this.count--;\n    if (this.next >= this.batchSize) {\n      this.next = 0;\n    }\n    if (this.count <= this.batchSize) {\n      this.batcher(true);\n    }\n    return item;\n  }\n\n  clear() {\n    this.next = 0;\n    this.nextAvail = 0;\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(this.batchSize);\n    this.items[this.nextAvail] = nextVal;\n    this.synced = false;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.count == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.count;\n  }\n}\n"],"mappings":";;;;;AAGA,IAAa,eAAb,MAA6B;;CAE3B,AAAQ;;CAER,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;CAER,YAAY,WAAmB,cAAyC;EACtE,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,QAAQ;AACxB,OAAI,KAAK,MAAM,GAAG,KAAK,UACrB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,QAAQ;EACN,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,MAAI,KAAK,MAAM,IAAI,KAAK,UACtB,MAAK,QAAQ,KAAK;AAGpB,SAAO;;CAGT,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,MAAM,UAAU,EACvB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK,MAAM;;;;;;;;AAStB,IAAa,iBAAb,MAA+B;;CAE7B,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,QAAgB;;CAGxB,AAAQ,OAAe;;CAGvB,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,YAAoB;CAE5B,YAAY,WAAmB,cAAyC;AACtE,MAAI,aAAa,EACf,OAAM,IAAI,MAAM,oCAAoC;EAEtD,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,UAAU;AAC7C,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,QAAQ,MAA0B;AAChC,MAAI,KAAK,SAAS,KAAK,WAAW;GAEhC,MAAM,wBAAQ,IAAI,MAAM,6BAA6B,KAAK,YAAY,8CAA8C;AACpH,OAAI,KAAK,cAAc;AACrB,SAAK,aAAa,MAAM;AACxB;;AAEF,SAAM;;AAER,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,aAAa;AAC7B,QAAK;AACL,QAAK;AACL,OAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAI,KAAK,aAAa,KAAK,KACzB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,UAAU;AACR,MAAI,KAAK,SAAS,EAEhB,OAAM,IAAI,MAAM,6EAA6E;EAE/F,MAAM,OAAO,KAAK,MAAM,KAAK;AAC7B,OAAK;AACL,OAAK;AACL,MAAI,KAAK,QAAQ,KAAK,UACpB,MAAK,OAAO;AAEd,MAAI,KAAK,SAAS,KAAK,UACrB,MAAK,QAAQ,KAAK;AAEpB,SAAO;;CAGT,QAAQ;AACN,OAAK,OAAO;AACZ,OAAK,YAAY;EACjB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,KAAK,UAAU;AAClD,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,SAAS,EAChB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK"}

package/dist/promise-queue/index.d.cts

@@ -1,9 +1,6 @@
 //#region src/promise-queue/index.d.ts
 /**
- * Implements an "infinite" FIFO queue of fixed size using promises
- * - await `continue()` before enqueing items to ensure fixed size (resolves when space available)
- * - await `dequeue()` to pop an item (resolves when next item is available)
- * - size() is always at minimum 1 item which is the promise for the next enqueued item
+ * @deprecated Not used by the engine; CircularBuffer is the block queue. Kept for compatibility, removed in 3.0.
  */
 declare class PromiseQueue<T> {
   /** Optional error handler for enqueue failures */

package/dist/promise-queue/index.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.cts","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":[],"mappings":";;AAMA;;;;;AAwEmB,cAxEN,YAwEM,CAAA,CAAA,CAAA,CAAA;EAGT;EAAA,QAAA,YAAA;EA2BG;EAsDG,QAAA,KAAA;EAAgB;EAAZ,QAAA,QAAA;EA2BX;EAAA,QAAA,OAAA;EAkCC;EAAA,MAAA,EAAA,OAAA;;;;;;gBAvLM,IAAI,YAAY;;aAsCb,QAAQ;cAGjB;;;;;;;;;;cA2BG;;;;;;;;;;;;;;;;;;;;;;gBAsDG,IAAI,YAAY;aA2BvB,QAAA;;cAkCC"}
+{"version":3,"file":"index.d.cts","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":[],"mappings":";;AAGA;;AAkCgC,cAlCnB,YAkCmB,CAAA,CAAA,CAAA,CAAA;EAAZ;EAsCO,QAAA,YAAA;EAAR;EAGT,QAAA,KAAA;EAAA;EA2BG,QAAA,QAAA;EAsDG;EAAgB,QAAA,OAAA;EAAZ;EAoCX,MAAA,EAAA,OAAA;EAAA;EAsCC,QAAA,SAAA;EAAA;;;gBApMM,IAAI,YAAY;;aAsCb,QAAQ;cAGjB;;;;;;;;;;cA2BG;;;;;;;;;;;;;;;;;;;;;;gBAsDG,IAAI,YAAY;aAoCvB,QAAA;;cAsCC"}

package/dist/promise-queue/index.d.mts

@@ -1,9 +1,6 @@
 //#region src/promise-queue/index.d.ts
 /**
- * Implements an "infinite" FIFO queue of fixed size using promises
- * - await `continue()` before enqueing items to ensure fixed size (resolves when space available)
- * - await `dequeue()` to pop an item (resolves when next item is available)
- * - size() is always at minimum 1 item which is the promise for the next enqueued item
+ * @deprecated Not used by the engine; CircularBuffer is the block queue. Kept for compatibility, removed in 3.0.
  */
 declare class PromiseQueue<T> {
   /** Optional error handler for enqueue failures */

package/dist/promise-queue/index.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.mts","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":[],"mappings":";;AAMA;;;;;AAwEmB,cAxEN,YAwEM,CAAA,CAAA,CAAA,CAAA;EAGT;EAAA,QAAA,YAAA;EA2BG;EAsDG,QAAA,KAAA;EAAgB;EAAZ,QAAA,QAAA;EA2BX;EAAA,QAAA,OAAA;EAkCC;EAAA,MAAA,EAAA,OAAA;;;;;;gBAvLM,IAAI,YAAY;;aAsCb,QAAQ;cAGjB;;;;;;;;;;cA2BG;;;;;;;;;;;;;;;;;;;;;;gBAsDG,IAAI,YAAY;aA2BvB,QAAA;;cAkCC"}
+{"version":3,"file":"index.d.mts","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":[],"mappings":";;AAGA;;AAkCgC,cAlCnB,YAkCmB,CAAA,CAAA,CAAA,CAAA;EAAZ;EAsCO,QAAA,YAAA;EAAR;EAGT,QAAA,KAAA;EAAA;EA2BG,QAAA,QAAA;EAsDG;EAAgB,QAAA,OAAA;EAAZ;EAoCX,MAAA,EAAA,OAAA;EAAA;EAsCC,QAAA,SAAA;EAAA;;;gBApMM,IAAI,YAAY;;aAsCb,QAAQ;cAGjB;;;;;;;;;;cA2BG;;;;;;;;;;;;;;;;;;;;;;gBAsDG,IAAI,YAAY;aAoCvB,QAAA;;cAsCC"}

package/dist/promise-queue/index.mjs

@@ -1,9 +1,6 @@
 //#region src/promise-queue/index.ts
 /**
-* Implements an "infinite" FIFO queue of fixed size using promises
-* - await `continue()` before enqueing items to ensure fixed size (resolves when space available)
-* - await `dequeue()` to pop an item (resolves when next item is available)
-* - size() is always at minimum 1 item which is the promise for the next enqueued item
+* @deprecated Not used by the engine; CircularBuffer is the block queue. Kept for compatibility, removed in 3.0.
 */
 var PromiseQueue = class {
 	/** Optional error handler for enqueue failures */
@@ -119,6 +116,14 @@ var CircularBuffer = class {
 		this.batcher(true);
 	}
 	enqueue(item) {
+		if (this.count >= this.batchSize) {
+			const error = /* @__PURE__ */ new Error("CircularBuffer is full (" + this.batchSize + " slots); await continue() before enqueueing");
+			if (this.errorHandler) {
+				this.errorHandler(error);
+				return;
+			}
+			throw error;
+		}
 		try {
 			this.enqueuer(item);
 			const nextVal = new Promise((resolve, _reject) => {
@@ -136,6 +141,7 @@ var CircularBuffer = class {
 		}
 	}
 	dequeue() {
+		if (this.count <= 0) throw new Error("CircularBuffer is empty; the previous dequeue() has not been fulfilled yet");
 		const item = this.items[this.next];
 		this.next++;
 		this.count--;

package/dist/promise-queue/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":["/**\n * Implements an \"infinite\" FIFO queue of fixed size using promises\n * - await `continue()` before enqueing items to ensure fixed size (resolves when space available)\n * - await `dequeue()` to pop an item (resolves when next item is available)\n * - size() is always at minimum 1 item which is the promise for the next enqueued item\n */\nexport class PromiseQueue<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n  /** Array of promises representing queued items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the queue is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items to keep in the queue */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items.push(nextVal);\n      if (this.size() > this.batchSize) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  clear() {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  dequeue() {\n    const item = this.items.shift();\n    if (this.size() <= this.batchSize) {\n      this.batcher(true);\n    }\n\n    return item as Promise<T>;\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.items.length == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.items.length;\n  }\n}\n\n/**\n * Circular buffer implementation using promises for efficient memory usage\n * Reuses array slots in a circular fashion to maintain constant memory footprint\n * Used by the indexer for managing block processing queues\n */\nexport class CircularBuffer<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n\n  /** Fixed-size array of promises representing buffered items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Current number of items in the buffer */\n  private count: number = 0;\n\n  /** Index of the next item to dequeue */\n  private next: number = 0;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the buffer is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items the buffer can hold */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  /** Index of the next available slot for enqueueing */\n  private nextAvail: number = 0;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    if (batchSize <= 1) {\n      throw new Error(\"Batch size must be greater than 1\");\n    }\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(batchSize);\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.items[this.nextAvail] = nextVal;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items[this.nextAvail] = nextVal;\n      this.count++;\n      this.nextAvail++;\n      if (this.nextAvail >= this.batchSize) {\n        this.nextAvail = 0;\n      }\n\n      if (this.nextAvail == this.next) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  dequeue() {\n    const item = this.items[this.next];\n    this.next++;\n    this.count--;\n    if (this.next >= this.batchSize) {\n      this.next = 0;\n    }\n    if (this.count <= this.batchSize) {\n      this.batcher(true);\n    }\n    return item;\n  }\n\n  clear() {\n    this.next = 0;\n    this.nextAvail = 0;\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(this.batchSize);\n    this.items[this.nextAvail] = nextVal;\n    this.synced = false;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.count == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.count;\n  }\n}\n"],"mappings":";;;;;;;AAMA,IAAa,eAAb,MAA6B;;CAE3B,AAAQ;;CAER,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;CAER,YAAY,WAAmB,cAAyC;EACtE,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,QAAQ;AACxB,OAAI,KAAK,MAAM,GAAG,KAAK,UACrB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,QAAQ;EACN,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,MAAI,KAAK,MAAM,IAAI,KAAK,UACtB,MAAK,QAAQ,KAAK;AAGpB,SAAO;;CAGT,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,MAAM,UAAU,EACvB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK,MAAM;;;;;;;;AAStB,IAAa,iBAAb,MAA+B;;CAE7B,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,QAAgB;;CAGxB,AAAQ,OAAe;;CAGvB,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,YAAoB;CAE5B,YAAY,WAAmB,cAAyC;AACtE,MAAI,aAAa,EACf,OAAM,IAAI,MAAM,oCAAoC;EAEtD,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,UAAU;AAC7C,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,aAAa;AAC7B,QAAK;AACL,QAAK;AACL,OAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAI,KAAK,aAAa,KAAK,KACzB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,KAAK;AAC7B,OAAK;AACL,OAAK;AACL,MAAI,KAAK,QAAQ,KAAK,UACpB,MAAK,OAAO;AAEd,MAAI,KAAK,SAAS,KAAK,UACrB,MAAK,QAAQ,KAAK;AAEpB,SAAO;;CAGT,QAAQ;AACN,OAAK,OAAO;AACZ,OAAK,YAAY;EACjB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,KAAK,UAAU;AAClD,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,SAAS,EAChB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK"}
+{"version":3,"file":"index.mjs","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":["/**\n * @deprecated Not used by the engine; CircularBuffer is the block queue. Kept for compatibility, removed in 3.0.\n */\nexport class PromiseQueue<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n  /** Array of promises representing queued items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the queue is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items to keep in the queue */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items.push(nextVal);\n      if (this.size() > this.batchSize) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  clear() {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  dequeue() {\n    const item = this.items.shift();\n    if (this.size() <= this.batchSize) {\n      this.batcher(true);\n    }\n\n    return item as Promise<T>;\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.items.length == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.items.length;\n  }\n}\n\n/**\n * Circular buffer implementation using promises for efficient memory usage\n * Reuses array slots in a circular fashion to maintain constant memory footprint\n * Used by the indexer for managing block processing queues\n */\nexport class CircularBuffer<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n\n  /** Fixed-size array of promises representing buffered items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Current number of items in the buffer */\n  private count: number = 0;\n\n  /** Index of the next item to dequeue */\n  private next: number = 0;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the buffer is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items the buffer can hold */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  /** Index of the next available slot for enqueueing */\n  private nextAvail: number = 0;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    if (batchSize <= 1) {\n      throw new Error(\"Batch size must be greater than 1\");\n    }\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(batchSize);\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.items[this.nextAvail] = nextVal;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    if (this.count >= this.batchSize) {\n      // Overwriting would silently drop the oldest unprocessed block; callers must await continue()\n      const error = new Error(\"CircularBuffer is full (\" + this.batchSize + \" slots); await continue() before enqueueing\");\n      if (this.errorHandler) {\n        this.errorHandler(error);\n        return;\n      }\n      throw error;\n    }\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items[this.nextAvail] = nextVal;\n      this.count++;\n      this.nextAvail++;\n      if (this.nextAvail >= this.batchSize) {\n        this.nextAvail = 0;\n      }\n\n      if (this.nextAvail == this.next) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  dequeue() {\n    if (this.count <= 0) {\n      // The only pending slot (the sentinel) has already been handed out\n      throw new Error(\"CircularBuffer is empty; the previous dequeue() has not been fulfilled yet\");\n    }\n    const item = this.items[this.next];\n    this.next++;\n    this.count--;\n    if (this.next >= this.batchSize) {\n      this.next = 0;\n    }\n    if (this.count <= this.batchSize) {\n      this.batcher(true);\n    }\n    return item;\n  }\n\n  clear() {\n    this.next = 0;\n    this.nextAvail = 0;\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(this.batchSize);\n    this.items[this.nextAvail] = nextVal;\n    this.synced = false;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.count == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.count;\n  }\n}\n"],"mappings":";;;;AAGA,IAAa,eAAb,MAA6B;;CAE3B,AAAQ;;CAER,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;CAER,YAAY,WAAmB,cAAyC;EACtE,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,QAAQ;AACxB,OAAI,KAAK,MAAM,GAAG,KAAK,UACrB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,QAAQ;EACN,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,MAAI,KAAK,MAAM,IAAI,KAAK,UACtB,MAAK,QAAQ,KAAK;AAGpB,SAAO;;CAGT,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,MAAM,UAAU,EACvB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK,MAAM;;;;;;;;AAStB,IAAa,iBAAb,MAA+B;;CAE7B,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,QAAgB;;CAGxB,AAAQ,OAAe;;CAGvB,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,YAAoB;CAE5B,YAAY,WAAmB,cAAyC;AACtE,MAAI,aAAa,EACf,OAAM,IAAI,MAAM,oCAAoC;EAEtD,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,UAAU;AAC7C,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,QAAQ,MAA0B;AAChC,MAAI,KAAK,SAAS,KAAK,WAAW;GAEhC,MAAM,wBAAQ,IAAI,MAAM,6BAA6B,KAAK,YAAY,8CAA8C;AACpH,OAAI,KAAK,cAAc;AACrB,SAAK,aAAa,MAAM;AACxB;;AAEF,SAAM;;AAER,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,aAAa;AAC7B,QAAK;AACL,QAAK;AACL,OAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAI,KAAK,aAAa,KAAK,KACzB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,UAAU;AACR,MAAI,KAAK,SAAS,EAEhB,OAAM,IAAI,MAAM,6EAA6E;EAE/F,MAAM,OAAO,KAAK,MAAM,KAAK;AAC7B,OAAK;AACL,OAAK;AACL,MAAI,KAAK,QAAQ,KAAK,UACpB,MAAK,OAAO;AAEd,MAAI,KAAK,SAAS,KAAK,UACrB,MAAK,QAAQ,KAAK;AAEpB,SAAO;;CAGT,QAAQ;AACN,OAAK,OAAO;AACZ,OAAK,YAAY;EACjB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,KAAK,UAAU;AAClD,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,SAAS,EAChB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK"}

package/dist/types/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":[],"sources":["../../src/types/index.ts"],"sourcesContent":["/* eslint-disable @stylistic/no-multi-spaces */\nimport {\n  BlockResponse, BlockResultsResponse,\n} from \"@cosmjs/tendermint-rpc\";\nimport {\n  BlockResultsResponse as BlockResultsResponse38, Event,\n} from \"@cosmjs/tendermint-rpc/build/comet38/responses\";\nimport {\n  Validator,\n} from \"cosmjs-types/cosmos/staking/v1beta1/staking\";\nimport {\n  TxBody,\n} from \"cosmjs-types/cosmos/tx/v1beta1/tx\";\n\nimport {\n  EcleciaIndexer,\n} from \"../indexer\";\nimport {\n  CircularBuffer,\n} from \"../promise-queue\";\n\n/** Configuration interface for the Eclesia indexer */\nexport type EcleciaIndexerConfig = {\n  startHeight?: number                                           // Block height to start indexing from\n  endHeight?: number                                             // Block height to stop indexing at (optional)\n  batchSize: number                                              // Number of blocks to process in parallel\n  modules: string[]                                              // List of module names to enable\n  getNextHeight: () => number | PromiseLike<number>             // Function to determine next block to process\n  logLevel: \"error\" | \"warn\" | \"info\" | \"http\" | \"verbose\" | \"debug\" | \"silly\" // Logging verbosity level\n  rpcUrl: string                                                 // Tendermint RPC endpoint URL\n  shouldProcessGenesis: () => Promise<boolean>                   // Whether to process genesis state\n  genesisPath?: string                                           // Path to genesis file\n  usePolling?: boolean                                           // Use polling instead of WebSocket subscription\n  pollingInterval?: number                                       // Interval between polls in milliseconds\n  minimal?: boolean                                              // Use minimal indexing mode (blocks only)\n  enableHealthcheck?: boolean                                    // Enable health check HTTP server\n  healthCheckPort?: number                                       // Port for health check HTTP server (default: 8888)\n  enablePrometheus?: boolean                                     // Enable Prometheus metrics server\n  prometheusPort?: number                                        // Port for Prometheus metrics server (default: 9090)\n  init?: () => Promise<void>                                     // Custom initialization function\n  beginTransaction: () => Promise<void>                          // Function to begin database transaction\n  endTransaction: (status: boolean) => Promise<void>             // Function to end database transaction\n};\n\n/** Queue for full indexing mode with validator data */\nexport type FullBlockQueue = CircularBuffer<[BlockResponse, BlockResultsResponse, Uint8Array]>;\n\n/** Queue for minimal indexing mode without validator data */\nexport type MinimalBlockQueue = CircularBuffer<[BlockResponse, BlockResultsResponse]>;\n\n/** Union type for block queues */\nexport type BlockQueue = FullBlockQueue | MinimalBlockQueue;\n\n/** Utility type to add height, timestamp, and UUID to event types */\nexport type WithHeightAndUUID<T> = {\n  [K in keyof T]: T[K] & {\n    uuid?: string      // Unique identifier for event tracking\n    height?: number    // Block height when event occurred\n    timestamp?: string // Block timestamp when event occurred\n  };\n};\n\n/** Function signature for emitting events asynchronously */\nexport type EmitFunc<K extends keyof WithHeightAndUUID<EventMap>> = (\n  t: K,\n  e: WithHeightAndUUID<EventMap>[K],\n) => Promise<void | void[]>;\n\nexport type LogEvent = {\n  type: \"log\" | \"info\" | \"warning\" | \"error\" | \"verbose\" | \"transient\"\n  message: string\n};\nexport type UUIDEvent = {\n  uuid: string\n  error?: string\n  status: boolean\n};\nexport type Events = {\n  log: LogEvent\n  uuid: UUIDEvent\n  \"fatal-error\": {\n    error: Error\n    message: string\n    retryCount?: number\n  }\n  begin_block: {\n    value: {\n      events: BlockResultsResponse[\"beginBlockEvents\"] | BlockResultsResponse38[\"finalizeBlockEvents\"]\n      validators: Validator[] | undefined\n    }\n  }\n\n  block: {\n    value: {\n      block: BlockResponse\n      block_results: BlockResultsResponse | BlockResultsResponse38\n    }\n  }\n  end_block: {\n    value: BlockResultsResponse[\"endBlockEvents\"] | BlockResultsResponse38[\"finalizeBlockEvents\"]\n  }\n  tx_events: {\n    value: BlockResultsResponse[\"results\"] | BlockResultsResponse38[\"results\"]\n  }\n  tx_memo: {\n    value: {\n      txHash: string\n      txBody: TxBody\n    }\n  }\n  _unhandled: {\n    type: string\n    event: unknown\n  }\n  \"periodic/small\": {\n    value: null\n  }\n  \"periodic/medium\": {\n    value: null\n  }\n  \"periodic/large\": {\n    value: null\n  }\n};\nexport type TxResult<T> = {\n  tx: T\n  events: Event[]\n};\n\n/** Interface that all indexing modules must implement */\nexport interface IndexingModule {\n  indexer: EcleciaIndexer                    // Reference to the main indexer instance\n  name: string                               // Unique module name\n  depends: string[]                          // Array of module names this module depends on\n  provides: string[]                         // Array of capabilities this module provides\n  setup: () => Promise<void>                 // Async setup function for database schema initialization\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  init: (...args: any[]) => void            // Initialization function called by the indexer\n}\n"],"mappings":""}
+{"version":3,"file":"index.cjs","names":[],"sources":["../../src/types/index.ts"],"sourcesContent":["/* eslint-disable @stylistic/no-multi-spaces */\nimport {\n  BlockResponse, BlockResultsResponse,\n} from \"@cosmjs/tendermint-rpc\";\nimport {\n  BlockResultsResponse as BlockResultsResponse38, Event,\n} from \"@cosmjs/tendermint-rpc/build/comet38/responses\";\nimport {\n  Validator,\n} from \"cosmjs-types/cosmos/staking/v1beta1/staking\";\nimport {\n  TxBody,\n} from \"cosmjs-types/cosmos/tx/v1beta1/tx\";\n\nimport {\n  EclesiaIndexer,\n} from \"../indexer\";\nimport {\n  CircularBuffer,\n} from \"../promise-queue\";\n\n/** Configuration interface for the Eclesia indexer */\nexport type EclesiaIndexerConfig = {\n  startHeight?: number                                           // Block height to start indexing from\n  endHeight?: number                                             // Block height to stop indexing at (optional)\n  batchSize: number                                              // Number of blocks to process in parallel\n  modules: string[]                                              // List of module names to enable\n  getNextHeight: () => number | PromiseLike<number>             // Function to determine next block to process\n  logLevel: \"error\" | \"warn\" | \"info\" | \"http\" | \"verbose\" | \"debug\" | \"silly\" // Logging verbosity level\n  rpcUrl: string                                                 // Tendermint RPC endpoint URL\n  chainId?: string                                               // Refuse to index if the RPC reports a different network\n  shouldProcessGenesis: () => Promise<boolean>                   // Whether to process genesis state\n  genesisPath?: string                                           // Path to genesis file\n  usePolling?: boolean                                           // Use polling instead of WebSocket subscription\n  pollingInterval?: number                                       // Interval between polls in milliseconds\n  minimal?: boolean                                              // Use minimal indexing mode (blocks only)\n  enableHealthcheck?: boolean                                    // Enable health check HTTP server\n  healthCheckPort?: number                                       // Port for health check HTTP server (default: 8888)\n  enablePrometheus?: boolean                                     // Enable Prometheus metrics server\n  prometheusPort?: number                                        // Port for Prometheus metrics server (default: 9090)\n  healthCheckHost?: string                                       // Address the health check server binds to (default: 0.0.0.0)\n  prometheusHost?: string                                        // Address the metrics server binds to (default: 0.0.0.0)\n  logFormat?: \"text\" | \"json\"                                    // Console log format (default: text)\n  maxRetries?: number                                            // Emit fatal-error after this many consecutive failed restarts; unlimited when unset\n  maxFailuresPerBlock?: number                                   // Consecutive processing failures on one block before fatal-error (default: 5)\n  onGenesisStart?: () => Promise<void>                           // Called before the genesis import begins, outside any transaction\n  onGenesisComplete?: () => Promise<void>                        // Called inside the final genesis transaction, right before it commits\n  init?: () => Promise<void>                                     // Custom initialization function\n  beginTransaction: () => Promise<void>                          // Function to begin database transaction\n  endTransaction: (status: boolean) => Promise<void>             // Function to end database transaction\n};\n\n/** @deprecated Misspelling kept for compatibility, use EclesiaIndexerConfig. Removed in 3.0. */\nexport type EcleciaIndexerConfig = EclesiaIndexerConfig;\n\n/** Queue for full indexing mode with validator data */\nexport type FullBlockQueue = CircularBuffer<[BlockResponse, BlockResultsResponse, Uint8Array]>;\n\n/** Queue for minimal indexing mode without validator data */\nexport type MinimalBlockQueue = CircularBuffer<[BlockResponse, BlockResultsResponse]>;\n\n/** Union type for block queues */\nexport type BlockQueue = FullBlockQueue | MinimalBlockQueue;\n\n/** Utility type to add height, timestamp, and UUID to event types */\nexport type WithHeightAndUUID<T> = {\n  [K in keyof T]: T[K] & {\n    uuid?: string      // Unique identifier for event tracking\n    height?: number    // Block height when event occurred\n    timestamp?: string // Block timestamp when event occurred\n  };\n};\n\n/** Function signature for emitting events asynchronously */\nexport type EmitFunc<K extends keyof WithHeightAndUUID<EventMap>> = (\n  t: K,\n  e: WithHeightAndUUID<EventMap>[K],\n) => Promise<void | void[]>;\n\nexport type LogEvent = {\n  type: \"log\" | \"info\" | \"warning\" | \"error\" | \"verbose\" | \"transient\"\n  message: string\n};\nexport type UUIDEvent = {\n  uuid: string\n  error?: string\n  status: boolean\n};\nexport type Events = {\n  log: LogEvent\n  uuid: UUIDEvent\n  \"fatal-error\": {\n    error: Error\n    message: string\n    retryCount?: number\n    height?: number   // Set when one block failed repeatedly\n  }\n  begin_block: {\n    value: {\n      events: BlockResultsResponse[\"beginBlockEvents\"] | BlockResultsResponse38[\"finalizeBlockEvents\"]\n      validators: Validator[] | undefined\n    }\n  }\n\n  block: {\n    value: {\n      block: BlockResponse\n      block_results: BlockResultsResponse | BlockResultsResponse38\n    }\n  }\n  end_block: {\n    value: BlockResultsResponse[\"endBlockEvents\"] | BlockResultsResponse38[\"finalizeBlockEvents\"]\n  }\n  tx_events: {\n    value: BlockResultsResponse[\"results\"] | BlockResultsResponse38[\"results\"]\n  }\n  tx_memo: {\n    value: {\n      txHash: string\n      txBody: TxBody\n    }\n  }\n  _unhandled: {\n    type: string\n    event: unknown\n  }\n  \"periodic/small\": {\n    value: null\n  }\n  \"periodic/medium\": {\n    value: null\n  }\n  \"periodic/large\": {\n    value: null\n  }\n};\nexport type TxResult<T> = {\n  tx: T\n  events: Event[]\n};\n\n/** Interface that all indexing modules must implement */\nexport interface IndexingModule {\n  indexer: EclesiaIndexer                    // Reference to the main indexer instance\n  name: string                               // Unique module name\n  depends: string[]                          // Array of module names this module depends on\n  provides: string[]                         // Array of capabilities this module provides\n  setup: () => Promise<void>                 // Async setup function for database schema initialization\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  init: (...args: any[]) => void            // Initialization function called by the indexer\n}\n\n/**\n * Global event map. Modules add their own events through declaration merging:\n *\n *   declare global { interface EventMap extends MyModule.Events {} }\n *\n * Declared in a regular module (not an ambient .d.ts) so it is emitted into the\n * published declarations and consumers get typed events without extra setup.\n */\ndeclare global {\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type\n  interface EventMap extends Events {\n  }\n}\n"],"mappings":""}