@gmickel/gno 2.12.0 → 2.12.2

package/README.md

@@ -139,7 +139,7 @@ See the [guide](docs/COMPILED-CONTEXT.md).
 
 <!-- public-truth:current-version -->
 
-> Current source version: **v2.12.0**. See [CHANGELOG.md](./CHANGELOG.md).
+> Current source version: **v2.12.2**. See [CHANGELOG.md](./CHANGELOG.md).
 
 <!-- /public-truth -->
 

package/browser-extension/artifacts/gno-browser-clipper-v2.12.2.zip.sha256

@@ -0,0 +1 @@
+34953d40a06904ec1c0fc7c6df54aaa14cb24acb05b38c3f15d572a285f7b3fc  gno-browser-clipper-v2.12.2.zip

package/browser-extension/dist/manifest.json

@@ -21,5 +21,5 @@
   "content_security_policy": {
     "extension_pages": "script-src 'self'; object-src 'none'; connect-src http://127.0.0.1:*"
   },
-  "version": "2.12.0"
+  "version": "2.12.2"
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gmickel/gno",
-  "version": "2.12.0",
+  "version": "2.12.2",
   "description": "Local semantic search for your documents. Index Markdown, PDF, and Office files with hybrid BM25 + vector search.",
   "keywords": [
     "embeddings",

package/spec/mcp.md

@@ -3105,7 +3105,7 @@ Clients should check schema version for compatibility.
 - DB connection kept open for server lifetime
 - No persistent state between tool calls
 - Each tool call is independent
-- Server handles concurrent requests sequentially
+- Server handles concurrent tool calls sequentially; an accepted background job (`gno_sync`, `gno_embed`, `gno_index`) waits for the call in progress, then runs without holding that queue, so reads are not blocked while it runs
 
 ---
 

package/src/cli/program.ts

@@ -4691,8 +4691,12 @@ function wireGraphCommand(program: Command): void {
           );
         }
 
-        const maxDepth = cmdOpts.maxDepth
-          ? parsePositiveInt("max-depth", cmdOpts.maxDepth)
+        // `gno graph` declares --max-depth for paths, so Commander hands the
+        // flag to the parent command.
+        const rawMaxDepth: unknown =
+          cmdOpts.maxDepth ?? command.parent?.opts().maxDepth;
+        const maxDepth = rawMaxDepth
+          ? parsePositiveInt("max-depth", rawMaxDepth)
           : undefined;
         const maxNodes = cmdOpts.maxNodes
           ? parsePositiveInt("max-nodes", cmdOpts.maxNodes)

package/src/core/job-manager.ts

@@ -287,20 +287,12 @@ export class JobManager {
     lock: { release: () => Promise<void> }
   ): Promise<void> {
     try {
-      const release = await this.#toolMutex.acquire();
-      try {
-        this.#assertAuthorizationEpoch(job);
-        assertInferenceActive();
-        const result = await fn(this.#jobControllers.get(job.id)!.signal);
-        assertInferenceActive();
-        job.status = "completed";
-        job.result = result;
-      } catch (e) {
-        job.status = "failed";
-        job.error = e instanceof Error ? e.message : String(e);
-      } finally {
-        release();
-      }
+      await this.#admit(job);
+      assertInferenceActive();
+      const result = await fn(this.#jobControllers.get(job.id)!.signal);
+      assertInferenceActive();
+      job.status = "completed";
+      job.result = result;
     } catch (e) {
       job.status = "failed";
       job.error = e instanceof Error ? e.message : String(e);
@@ -378,20 +370,12 @@ export class JobManager {
     lock: { release: () => Promise<void> }
   ): Promise<void> {
     try {
-      const release = await this.#toolMutex.acquire();
-      try {
-        this.#assertAuthorizationEpoch(job);
-        assertInferenceActive();
-        const result = await fn(this.#jobControllers.get(job.id)!.signal);
-        assertInferenceActive();
-        job.status = "completed";
-        job.typedResult = result;
-      } catch (e) {
-        job.status = "failed";
-        job.error = e instanceof Error ? e.message : String(e);
-      } finally {
-        release();
-      }
+      await this.#admit(job);
+      assertInferenceActive();
+      const result = await fn(this.#jobControllers.get(job.id)!.signal);
+      assertInferenceActive();
+      job.status = "completed";
+      job.typedResult = result;
     } catch (e) {
       job.status = "failed";
       job.error = e instanceof Error ? e.message : String(e);
@@ -435,6 +419,20 @@ export class JobManager {
     }
   }
 
+  /**
+   * Wait for the tool call in progress, then re-check authorization. The
+   * mutex is released before the job's work runs, so reads are not held
+   * behind a long sync or embed; writers stay serialized by the write lease.
+   */
+  async #admit(job: JobRecord): Promise<void> {
+    const release = await this.#toolMutex.acquire();
+    try {
+      this.#assertAuthorizationEpoch(job);
+    } finally {
+      release();
+    }
+  }
+
   #assertAuthorizationEpoch(job: JobRecord): void {
     if (this.#jobAuthorizationEpochs.get(job.id) === this.#authorizationEpoch) {
       return;

package/src/serve/public/index.html

@@ -5,6 +5,11 @@
     <meta name="viewport" content="width=device-width, initial-scale=1.0" />
     <meta name="referrer" content="no-referrer" />
     <title>GNO - Local Knowledge Index</title>
+    <link
+      rel="icon"
+      type="image/svg+xml"
+      href="data:image/svg+xml;base64,PHN2ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciIHdpZHRoPSI2NCIgaGVpZ2h0PSI2NCIgdmlld0JveD0iMCAwIDY0IDY0IiBmaWxsPSJub25lIiA+PGRlZnM+PGxpbmVhckdyYWRpZW50IGlkPSJnbm8tZmF2aWNvbi1ncmFkaWVudCIgeDE9IjEyIiB5MT0iOCIgeDI9IjU0IiB5Mj0iNTgiIGdyYWRpZW50VW5pdHM9InVzZXJTcGFjZU9uVXNlIj48c3RvcCBzdG9wLWNvbG9yPSIjZDA4YTNjIiAvPjxzdG9wIG9mZnNldD0iMSIgc3RvcC1jb2xvcj0iIzhhNGExYSIgLz48L2xpbmVhckdyYWRpZW50PjwvZGVmcz48cmVjdCB4PSI2IiB5PSI2IiB3aWR0aD0iNTIiIGhlaWdodD0iNTIiIHJ4PSIxNCIgZmlsbD0idXJsKCNnbm8tZmF2aWNvbi1ncmFkaWVudCkiIC8+PHBhdGggZmlsbD0iI2ZmZjhlZiIgZD0iTTM1LjYxOSAxOC42OTRjMy41NDYgMCA2LjAzIDEuNDMgNy42ODggMy41MzZsLTIuOTQ0IDIuMjk3Yy0xLjExLTEuMzk2LTIuNjMtMi40NTktNC45MzQtMi40NTktMy45MyAwLTYuNzA1IDMuMTU4LTYuNzA1IDcuMzYxIDAgNC4zMTYgMi43MTkgNy40MTggNi45MTkgNy40MTggMS43MSAwIDMuMzA1LS41MSA0LjI4NC0xLjM5NlYzMi4xaC01LjM3N3YtMy4yODloOS4xOTR2OC4wNTNjLTIuMTI2IDIuMzU0LTUuMTI2IDMuMzU0LTguNTEgMy4zNTQtNi4xOTggMC0xMC40MDctNC40MjItMTAuNDA3LTEwLjc4OSAwLTYuMzkgNC40ODMtMTAuNzM1IDEwLjc5Mi0xMC43MzVaIiAvPjwvc3ZnPg=="
+    />
     <link rel="stylesheet" href="./globals.built.css" />
   </head>
   <body>

package/src/store/sqlite/adapter.ts

@@ -5076,20 +5076,19 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
       const edgeTypeFilterFor = (alias: string): string =>
         edgeType ? `AND ${alias}.edge_type = ?` : "";
       const candidateEdgeLimit = Math.min(frontierLimit * 4, 4_000);
-      const frontierCtes: string[] = [];
-      const frontierParams: (number | string)[] = [];
-      const frontierNames = ["f0"];
-      const allFrontiers = (): string =>
-        frontierNames
-          .map((name) => `SELECT doc_id FROM ${name}`)
-          .join(" UNION ");
-      const frontierJoinClause = (frontierName: string): string =>
+      // Each level runs as its own statement over the previous frontier and
+      // the visited set, passed as JSON. One statement chaining every level
+      // as CTEs re-expands each earlier level at every reference, which
+      // grows exponentially with depth: SQLite 3.54 refuses it from depth 3
+      // ("nested too deep") and older versions fail at depth 6.
+      const visitedIds = "SELECT doc_id FROM visited";
+      const frontierJoinClause =
         direction === "out"
-          ? `e.src_doc_id = ${frontierName}.doc_id`
+          ? "e.src_doc_id = prev.doc_id"
           : direction === "in"
-            ? `e.dst_doc_id = ${frontierName}.doc_id`
-            : `(e.src_doc_id = ${frontierName}.doc_id OR e.dst_doc_id = ${frontierName}.doc_id)`;
-      const boundedEdgePredicate = (frontierName: string): string => {
+            ? "e.dst_doc_id = prev.doc_id"
+            : "(e.src_doc_id = prev.doc_id OR e.dst_doc_id = prev.doc_id)";
+      const boundedEdgePredicate = (): string => {
         if (direction === "out") {
           return `
             e.id IN (
@@ -5110,10 +5109,10 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
                     ) AS next_rank
                   FROM doc_edges e2
                   JOIN documents next_doc ON next_doc.id = e2.dst_doc_id AND next_doc.active = 1${nextDocScope}
-                  WHERE e2.src_doc_id = ${frontierName}.doc_id
+                  WHERE e2.src_doc_id = prev.doc_id
                     ${edgeTypeFilterFor("e2")}
-                    AND instr(${frontierName}.path, printf(',%d,', e2.dst_doc_id)) = 0
-                    AND e2.dst_doc_id NOT IN (${allFrontiers()})
+                    AND instr(prev.path, printf(',%d,', e2.dst_doc_id)) = 0
+                    AND e2.dst_doc_id NOT IN (${visitedIds})
                 )
                 WHERE next_rank = 1
                 ORDER BY edge_type ASC, next_doc_id ASC, edge_id ASC
@@ -5141,10 +5140,10 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
                     ) AS next_rank
                   FROM doc_edges e2
                   JOIN documents next_doc ON next_doc.id = e2.src_doc_id AND next_doc.active = 1${nextDocScope}
-                  WHERE e2.dst_doc_id = ${frontierName}.doc_id
+                  WHERE e2.dst_doc_id = prev.doc_id
                     ${edgeTypeFilterFor("e2")}
-                    AND instr(${frontierName}.path, printf(',%d,', e2.src_doc_id)) = 0
-                    AND e2.src_doc_id NOT IN (${allFrontiers()})
+                    AND instr(prev.path, printf(',%d,', e2.src_doc_id)) = 0
+                    AND e2.src_doc_id NOT IN (${visitedIds})
                 )
                 WHERE next_rank = 1
                 ORDER BY edge_type ASC, next_doc_id ASC, edge_id ASC
@@ -5172,10 +5171,10 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
                     ) AS next_rank
                   FROM doc_edges e2
                   JOIN documents next_doc ON next_doc.id = e2.dst_doc_id AND next_doc.active = 1${nextDocScope}
-                  WHERE e2.src_doc_id = ${frontierName}.doc_id
+                  WHERE e2.src_doc_id = prev.doc_id
                     ${edgeTypeFilterFor("e2")}
-                    AND instr(${frontierName}.path, printf(',%d,', e2.dst_doc_id)) = 0
-                    AND e2.dst_doc_id NOT IN (${allFrontiers()})
+                    AND instr(prev.path, printf(',%d,', e2.dst_doc_id)) = 0
+                    AND e2.dst_doc_id NOT IN (${visitedIds})
                 )
                 WHERE next_rank = 1
                 ORDER BY edge_type ASC, next_doc_id ASC, edge_id ASC
@@ -5200,10 +5199,10 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
                     ) AS next_rank
                   FROM doc_edges e3
                   JOIN documents next_doc ON next_doc.id = e3.src_doc_id AND next_doc.active = 1${nextDocScope}
-                  WHERE e3.dst_doc_id = ${frontierName}.doc_id
+                  WHERE e3.dst_doc_id = prev.doc_id
                     ${edgeTypeFilterFor("e3")}
-                    AND instr(${frontierName}.path, printf(',%d,', e3.src_doc_id)) = 0
-                    AND e3.src_doc_id NOT IN (${allFrontiers()})
+                    AND instr(prev.path, printf(',%d,', e3.src_doc_id)) = 0
+                    AND e3.src_doc_id NOT IN (${visitedIds})
                 )
                 WHERE next_rank = 1
                 ORDER BY edge_type ASC, next_doc_id ASC, edge_id ASC
@@ -5212,40 +5211,62 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
             )
           )`;
       };
-      const nextExprFor = (frontierName: string): string =>
-        `CASE WHEN e.src_doc_id = ${frontierName}.doc_id THEN e.dst_doc_id ELSE e.src_doc_id END`;
-
-      const boundaryCandidateDepth = maxDepth + 1;
-      for (let depth = 1; depth <= boundaryCandidateDepth; depth += 1) {
-        const previous = `f${depth - 1}`;
-        const raw = `c${depth}_raw`;
-        const deduped = `c${depth}_deduped`;
-        const nodeDeduped = `c${depth}_node_deduped`;
-        const ranked = `c${depth}_ranked`;
-        const candidates = `c${depth}`;
-        const frontier = `f${depth}`;
-        const nextExpr = nextExprFor(previous);
-        frontierCtes.push(`
-        ${raw} AS (
+      const nextExpr =
+        "CASE WHEN e.src_doc_id = prev.doc_id THEN e.dst_doc_id ELSE e.src_doc_id END";
+      const levelParams: (number | string)[] = [];
+      if (direction === "both") {
+        if (edgeType) {
+          levelParams.push(edgeType);
+        }
+        levelParams.push(candidateEdgeLimit);
+      }
+      if (edgeType) {
+        levelParams.push(edgeType);
+      }
+      levelParams.push(candidateEdgeLimit);
+      if (edgeType) {
+        levelParams.push(edgeType);
+      }
+      levelParams.push(
+        frontierLimit,
+        frontierLimit,
+        visitedLimit,
+        frontierLimit
+      );
+
+      const levelQuery = (depth: number) =>
+        db.query<
+          {
+            candidate_count: number;
+            has_candidates: number;
+            expansion_overflow: number;
+            doc_id: number | null;
+            depth: number | null;
+            path: string | null;
+            sort_key: string | null;
+          },
+          (number | string)[]
+        >(`
+        WITH
+        prev(doc_id, path) AS (
+          SELECT json_extract(value, '$[0]'), json_extract(value, '$[1]')
+          FROM json_each(?)
+        ),
+        visited(doc_id) AS (
+          SELECT value FROM json_each(?)
+        ),
+        raw AS (
           SELECT
-            ${previous}.doc_id AS from_doc_id,
+            prev.doc_id AS from_doc_id,
             ${nextExpr} AS doc_id,
             ${depth} AS depth,
-            ${previous}.path || ${nextExpr} || ',' AS path,
+            prev.path || ${nextExpr} || ',' AS path,
             printf('%06d|%s|%012d', ${depth}, e.edge_type, ${nextExpr}) AS sort_key,
             e.src_doc_id,
-            src.docid AS source_docid,
-            src.uri AS source_uri,
-            src.title AS source_title,
             e.dst_doc_id,
-            dst.docid AS target_docid,
-            dst.uri AS target_uri,
-            dst.title AS target_title,
             e.edge_type,
-            e.confidence,
-            e.source,
             row_number() OVER (
-              PARTITION BY ${previous}.doc_id, e.src_doc_id, e.dst_doc_id, e.edge_type
+              PARTITION BY prev.doc_id, e.src_doc_id, e.dst_doc_id, e.edge_type
               ORDER BY
                 CASE e.confidence
                   WHEN 'manual' THEN 1
@@ -5258,47 +5279,47 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
                 src.docid ASC,
                 dst.docid ASC
             ) AS dedup_rank
-          FROM ${previous}
-          JOIN doc_edges e ON ${frontierJoinClause(previous)}
-            AND ${boundedEdgePredicate(previous)}
+          FROM prev
+          JOIN doc_edges e ON ${frontierJoinClause}
+            AND ${boundedEdgePredicate()}
           JOIN documents src ON src.id = e.src_doc_id AND src.active = 1
           JOIN documents dst ON dst.id = e.dst_doc_id AND dst.active = 1
           WHERE 1 = 1
             ${edgeTypeFilter}
-            AND instr(${previous}.path, printf(',%d,', ${nextExpr})) = 0
-            AND ${nextExpr} NOT IN (${allFrontiers()})
+            AND instr(prev.path, printf(',%d,', ${nextExpr})) = 0
+            AND ${nextExpr} NOT IN (${visitedIds})
         ),
-        ${deduped} AS (
+        deduped AS (
           SELECT *
-          FROM ${raw}
+          FROM raw
           WHERE dedup_rank = 1
         ),
-        ${nodeDeduped} AS (
+        node_deduped AS (
           SELECT
             from_doc_id,
             doc_id,
             depth,
             min(path) AS path,
             min(sort_key) AS sort_key
-          FROM ${deduped}
+          FROM deduped
           GROUP BY from_doc_id, doc_id, depth
         ),
-        ${ranked} AS (
+        ranked AS (
           SELECT
             *,
             row_number() OVER (
               PARTITION BY from_doc_id
               ORDER BY sort_key ASC, doc_id ASC
             ) AS expansion_rank
-          FROM ${nodeDeduped}
+          FROM node_deduped
         ),
-        ${candidates} AS (
+        candidates AS (
           SELECT doc_id, depth, min(path) AS path, min(sort_key) AS sort_key
-          FROM ${ranked}
+          FROM ranked
           WHERE expansion_rank <= ?
           GROUP BY doc_id, depth
         ),
-        ${frontier} AS (
+        frontier AS (
           SELECT doc_id, depth, path, sort_key
           FROM (
             SELECT
@@ -5307,35 +5328,88 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
               path,
               sort_key,
               row_number() OVER (ORDER BY sort_key ASC, doc_id ASC) AS depth_rank
-            FROM ${candidates}
+            FROM candidates
           )
           WHERE depth_rank <= ?
-            AND depth_rank <= ? - (
-              SELECT count(*)
-              FROM (${allFrontiers()})
-            )
-        )`);
-        if (direction === "both") {
-          if (edgeType) {
-            frontierParams.push(edgeType);
-          }
-          frontierParams.push(candidateEdgeLimit);
-          if (edgeType) {
-            frontierParams.push(edgeType);
-          }
-          frontierParams.push(candidateEdgeLimit);
-        } else {
-          if (edgeType) {
-            frontierParams.push(edgeType);
-          }
-          frontierParams.push(candidateEdgeLimit);
+            AND depth_rank <= ? - (SELECT count(*) FROM visited)
+        )
+        SELECT
+          stats.candidate_count,
+          stats.has_candidates,
+          stats.expansion_overflow,
+          frontier.doc_id,
+          frontier.depth,
+          frontier.path,
+          frontier.sort_key
+        FROM (
+          SELECT
+            (SELECT count(*) FROM candidates) AS candidate_count,
+            EXISTS (SELECT 1 FROM ranked) AS has_candidates,
+            EXISTS (SELECT 1 FROM ranked WHERE expansion_rank > ?) AS expansion_overflow
+        ) stats
+        LEFT JOIN frontier ON 1
+        ORDER BY frontier.sort_key ASC, frontier.doc_id ASC`);
+
+      // Walk level by level; the extra level past maxDepth only reports
+      // whether the depth cap cut anything off.
+      type FrontierRow = {
+        doc_id: number;
+        depth: number;
+        path: string;
+        sort_key: string;
+      };
+      let previous: FrontierRow[] = [
+        {
+          doc_id: rootDocumentId,
+          depth: 0,
+          path: `,${rootDocumentId},`,
+          sort_key: "",
+        },
+      ];
+      const walked: FrontierRow[] = [...previous];
+      const visited = new Set([rootDocumentId]);
+      let visitedOverflow = false;
+      let frontierOverflow = false;
+      let depthOverflow = false;
+      for (let depth = 1; depth <= maxDepth + 1; depth += 1) {
+        const rows = levelQuery(depth).all(
+          JSON.stringify(previous.map((row) => [row.doc_id, row.path])),
+          JSON.stringify([...visited]),
+          ...levelParams
+        );
+        const stats = rows[0];
+        if (depth > maxDepth) {
+          depthOverflow = Boolean(stats?.has_candidates);
+          break;
         }
-        if (edgeType) {
-          frontierParams.push(edgeType);
+        const candidateCount = stats?.candidate_count ?? 0;
+        if (
+          candidateCount > 0 &&
+          candidateCount > visitedLimit - visited.size
+        ) {
+          visitedOverflow = true;
         }
-        frontierParams.push(frontierLimit, frontierLimit, visitedLimit);
-        if (depth <= maxDepth) {
-          frontierNames.push(frontier);
+        if (
+          (candidateCount > 0 && candidateCount > frontierLimit) ||
+          stats?.expansion_overflow
+        ) {
+          frontierOverflow = true;
+        }
+        previous = rows.flatMap((row) =>
+          row.doc_id === null
+            ? []
+            : [
+                {
+                  doc_id: row.doc_id,
+                  depth: row.depth ?? depth,
+                  path: row.path ?? "",
+                  sort_key: row.sort_key ?? "",
+                },
+              ]
+        );
+        for (const row of previous) {
+          visited.add(row.doc_id);
+          walked.push(row);
         }
       }
 
@@ -5345,62 +5419,18 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
           : direction === "in"
             ? "AND ns.depth > nt.depth"
             : "";
-      const frontierUnion = frontierNames
-        .map((name) => `SELECT doc_id, depth, sort_key FROM ${name}`)
-        .join(" UNION ALL ");
-      const visitedOverflowChecks = Array.from(
-        { length: maxDepth },
-        (_, index) => {
-          const previousFrontiers = Array.from(
-            { length: index + 1 },
-            (__, frontierIndex) => `SELECT doc_id FROM f${frontierIndex}`
-          ).join(" UNION ");
-          return `
-          SELECT 1 AS has_more
-          FROM c${index + 1}
-          GROUP BY 1
-          HAVING count(*) > ? - (
-            SELECT count(*)
-            FROM (${previousFrontiers})
-          )`;
-        }
-      ).join(" UNION ALL ");
-      const frontierOverflowChecks = Array.from(
-        { length: maxDepth },
-        (_, index) => `
-          SELECT 1 AS has_more
-          FROM c${index + 1}
-          GROUP BY 1
-          HAVING count(*) > ?
-          UNION ALL
-          SELECT 1 AS has_more
-          FROM c${index + 1}_ranked
-          WHERE expansion_rank > ?`
-      ).join(" UNION ALL ");
-      const walkCte = `
-        WITH RECURSIVE
-        f0(doc_id, depth, path, sort_key) AS (
-          SELECT ?, 0, printf(',%d,', ?), ''
-        ),
-        ${frontierCtes.join(",")},
+      const walkedJson = JSON.stringify(
+        walked.map((row) => [row.doc_id, row.depth, row.sort_key])
+      );
+      const nodeDepthCte = `
         node_depth AS (
-          SELECT doc_id, min(depth) AS depth, min(sort_key) AS sort_key
-          FROM (${frontierUnion})
-          GROUP BY doc_id
-        ),
-        ranked_nodes AS (
           SELECT
-            d.*,
-            nd.depth,
-            row_number() OVER (ORDER BY nd.depth ASC, nd.sort_key ASC, d.id ASC) AS global_rank,
-            count(*) OVER () AS total_count
-          FROM node_depth nd
-          JOIN documents d ON d.id = nd.doc_id AND d.active = 1
-        )
-      `;
-
-      const baseParams: (number | string)[] = [];
-      baseParams.push(rootDocumentId, rootDocumentId, ...frontierParams);
+            json_extract(value, '$[0]') AS doc_id,
+            min(json_extract(value, '$[1]')) AS depth,
+            min(json_extract(value, '$[2]')) AS sort_key
+          FROM json_each(?)
+          GROUP BY 1
+        )`;
 
       const nodeRows = db
         .query<
@@ -5411,14 +5441,23 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
           },
           (number | string)[]
         >(
-          `${walkCte}
+          `WITH ${nodeDepthCte},
+           ranked_nodes AS (
+             SELECT
+               d.*,
+               nd.depth,
+               row_number() OVER (ORDER BY nd.depth ASC, nd.sort_key ASC, d.id ASC) AS global_rank,
+               count(*) OVER () AS total_count
+             FROM node_depth nd
+             JOIN documents d ON d.id = nd.doc_id AND d.active = 1
+           )
            SELECT *
            FROM ranked_nodes
            WHERE global_rank <= ?
            ORDER BY depth ASC, uri ASC, docid ASC
            LIMIT ?`
         )
-        .all(...baseParams, nodeLimit + 1, nodeLimit + 1);
+        .all(walkedJson, nodeLimit + 1, nodeLimit + 1);
 
       const returnedNodeRows = nodeRows.slice(0, nodeLimit);
       const returnedIds = new Set(returnedNodeRows.map((row) => row.id));
@@ -5429,41 +5468,19 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
         truncated = true;
         warnings.push("maxNodes reached");
       }
-      if (totalNodes > visitedLimit) {
-        truncated = true;
-        warnings.push("visitedLimit reached");
-      }
-
-      const visitedRows = db
-        .query<{ has_more: number }, (number | string)[]>(
-          `${walkCte}
-           SELECT 1 AS has_more
-           FROM (${visitedOverflowChecks})
-           LIMIT 1`
-        )
-        .get(...baseParams, ...Array(maxDepth).fill(visitedLimit));
-      if (visitedRows) {
+      if (totalNodes > visitedLimit || visitedOverflow) {
         truncated = true;
         warnings.push("visitedLimit reached");
       }
-
-      const frontierRows = db
-        .query<{ has_more: number }, (number | string)[]>(
-          `${walkCte}
-           SELECT 1 AS has_more
-           FROM (${frontierOverflowChecks})
-           LIMIT 1`
-        )
-        .get(...baseParams, ...Array(maxDepth * 2).fill(frontierLimit));
-      if (frontierRows) {
+      if (frontierOverflow) {
         truncated = true;
         warnings.push("frontierLimit reached");
       }
 
       const edgeRows = db
         .query<DbDocEdgeRow & { traversal_depth: number }, (number | string)[]>(
-          `${walkCte}
-           , returned_edges AS (
+          `WITH ${nodeDepthCte},
+           returned_edges AS (
            SELECT
              e.src_doc_id,
              src.docid AS source_docid,
@@ -5510,22 +5527,13 @@ export class SqliteAdapter implements StorePort, SqliteDbProvider {
            ORDER BY traversal_depth ASC, edge_type ASC, source_docid ASC, target_docid ASC`
         )
         .all(
-          ...baseParams,
+          walkedJson,
           ...returnedIds,
           ...returnedIds,
           ...(edgeType ? [edgeType] : [])
         );
 
-      const boundaryRows = db
-        .query<{ has_more: number }, (number | string)[]>(
-          `${walkCte}
-           SELECT 1 AS has_more
-           FROM c${boundaryCandidateDepth}_ranked
-           LIMIT 1`
-        )
-        .get(...baseParams);
-
-      if (boundaryRows) {
+      if (depthOverflow) {
         truncated = true;
         warnings.push("maxDepth reached");
       }

package/browser-extension/artifacts/gno-browser-clipper-v2.12.0.zip.sha256

@@ -1 +0,0 @@
-af41e9b6f20acb402696b5d05f2901b50a7454669f3b9b89f44e1370004ff411  gno-browser-clipper-v2.12.0.zip