@secondlayer/subgraphs 3.11.0 → 3.13.0

package/dist/src/runtime/block-processor.d.ts

@@ -165,6 +165,13 @@ interface SubgraphContext {
 	update(table: string, where: Record<string, unknown>, set: Record<string, unknown>): void;
 	upsert(table: string, key: Record<string, unknown>, row: Record<string, unknown>): void;
 	delete(table: string, where: Record<string, unknown>): void;
+	/**
+	* Atomic counter update — the blessed accumulator primitive. Applies
+	* `col = COALESCE(col, 0) + delta` per column (insert-or-add); deltas may
+	* be negative. Requires a uniqueKeys constraint matching `key`. Prefer
+	* this over patchOrInsert with functional updaters for running totals.
+	*/
+	increment(table: string, key: Record<string, unknown>, deltas: Record<string, bigint | number>): void;
 	/** Partial update — sets only specified fields, preserves others */
 	patch(table: string, where: Record<string, unknown>, set: Record<string, unknown>): void;
 	/** Find-then-merge-or-insert. Values can be functions: (existing) => newValue */
@@ -196,6 +203,9 @@ interface SubgraphDefinition {
 	description?: string;
 	/** Block height to start indexing from (default: 1) */
 	startBlock?: number;
+	/** 'concurrent' = tip-first: live at tip now, history backfills behind.
+	*  Requires order-tolerant handlers. Default 'blocking'. */
+	backfillMode?: "blocking" | "concurrent";
 	/** Named source filters — keys become handler keys */
 	sources: Record<string, SubgraphFilter>;
 	/** Tables in this subgraph */
@@ -239,6 +249,29 @@ interface ProcessBlockOptions {
 	skipProgressUpdate?: boolean;
 	/** Pre-loaded block data — skips DB reads when provided (used by batch catch-up). */
 	preloaded?: PreloadedBlockData;
+	/**
+	* Crash-safe sequential processing (the reindex path). When set:
+	* - a block whose writes flush commits `last_processed_block = blockHeight`
+	*   (with this status) in the SAME transaction, so a crash can never leave
+	*   committed writes ahead of the checkpoint;
+	* - a block at or below the checkpoint is skipped entirely, so a replay
+	*   (crash-resume overshoot, duplicate dispatch) can never double-apply
+	*   deltas.
+	* Only valid for strictly ascending block walks over the subgraph's own
+	* cursor — backfill/reorg paths that legitimately revisit heights below
+	* the cursor must not set this.
+	*/
+	atomicProgress?: {
+		status: string
+	};
 }
+/** Default per-block retry schedule before a failure counts as persistent. */
+declare const BLOCK_RETRY_DELAYS_MS: unknown;
+/**
+* processBlock with bounded retries. Throws the last error once the schedule
+* is exhausted — callers decide whether that halts the walk (strict paths) or
+* records a gap (backfill). Never advances any cursor on failure.
+*/
+declare function processBlockWithRetry(subgraph: SubgraphDefinition, subgraphName: string, blockHeight: number, opts?: ProcessBlockOptions, retryDelaysMs?: number[]): Promise<ProcessBlockResult>;
 declare function processBlock(subgraph: SubgraphDefinition, subgraphName: string, blockHeight: number, opts?: ProcessBlockOptions): Promise<ProcessBlockResult>;
-export { processBlock, invalidateSubgraphRoute, ProcessBlockTiming, ProcessBlockResult, ProcessBlockOptions, PreloadedBlockData };
+export { processBlockWithRetry, processBlock, invalidateSubgraphRoute, ProcessBlockTiming, ProcessBlockResult, ProcessBlockOptions, PreloadedBlockData, BLOCK_RETRY_DELAYS_MS };