@andespindola/brainlink 0.1.0-beta.122 → 0.1.0-beta.124

package/README.md

@@ -84,11 +84,11 @@ Legacy `.jsonl.gz` packs are upgraded to `.blpk` automatically on first search/c
 - Graph renderer optimized for large datasets with viewport-driven node culling and edge lookup by visible nodes.
 - Canvas graph rendering uses the same batched node and edge pipeline for every graph size, reducing per-frame draw calls while keeping selected and hovered items highlighted.
 - WebGL acceleration is used when available for dense node and edge drawing, with Canvas 2D preserved as the interaction and fallback layer.
-- Graph rendering keeps the flat node scene and adds stable hierarchical groups for vaults above 1000 notes, with recursive parent groups when a level itself exceeds 1000 groups.
+- Graph rendering keeps the flat node scene and adds stable hierarchical mesh groups for vaults above 1000 notes, with every visible graph level capped at 1000 nodes and recursive parent groups when a level itself exceeds 1000 groups.
 - Large graph layout API automatically uses compact payload encoding with link-coverage-aware edge selection to reduce initial client load without hiding major relationships.
 - Large-segment layout spacing now grows logarithmically to keep initial visual density consistent between medium and very large vaults (for example, ~1k vs ~50k notes).
 - Graph coordinates are visually compacted across graph sizes so reset starts from a stable fitted scene and zoom-in progressively reveals local detail.
-- Zoomed-out graph LOD renders hierarchy groups as normal graph nodes and expands a group only after it is framed in the viewport, progressively hiding sibling groups in micro view.
+- Zoomed-out graph LOD renders hierarchy groups as normal mesh graph nodes and expands a group only after it is framed in the viewport, progressively hiding sibling groups in micro view.
 - Graph reset fits the full graph scene instead of starting in a separate macro overview mode.
 - Graph filtering runs in a dedicated browser worker to keep the UI thread responsive during heavy datasets.
 - Edge rendering budgets adapt to zoom level to prevent frame spikes on large graph panoramas.
@@ -606,7 +606,7 @@ The graph UI shows:
 - graph rendering safeguards (batched canvas drawing across graph sizes, edge draw caps, lower redraw rate, zoom-aware interaction)
 - adaptive CPU safeguards for large graphs: idle frame pacing, throttled background physics updates and cached viewport dimensions to reduce redraw/layout overhead while preserving interaction responsiveness
 - WebGL node and edge acceleration when supported, falling back to Canvas 2D without changing graph behavior
-- large graph LOD keeps a recursive graph-of-graphs model: zoom-out shows one level of group nodes, zoom-in expands the framed node into its child graph, micro view renders only that focused subgraph, and zoom-out restores sibling groups
+- large graph LOD keeps a recursive graph-of-graphs mesh model: zoom-out shows one level capped at 1000 group nodes, zoom-in expands the framed node into its child graph capped at 1000 nodes, micro view renders only that focused subgraph in a local frame anchored to the group node, and zoom-out restores sibling groups
 
 The server indexes before starting by default. Use `--no-index` to skip that step:
 

package/dist/application/frontend/client-js.js

@@ -4,14 +4,13 @@ const ctx = canvas.getContext('2d')
 const largeGraphNodeThreshold = 4000
 const massiveGraphNodeThreshold = 20000
 const largeGraphEdgeRenderLimit = 120000
-const renderNodeBudget = 900
+const renderNodeBudget = 1000
 const zoomedMassiveRenderNodeBudget = 2200
 const massiveOverviewRenderNodeBudget = 1800
 const massiveOverviewScaleThreshold = 0.065
 const massiveSegmentedScaleThreshold = 0.45
 const massiveSegmentRepresentativeBudget = 760
 const massiveAutoFitMacroScale = 0.018
-const hierarchyGroupScaleThreshold = 0.62
 const hierarchyExpansionStartScale = 0.18
 const hierarchyMicroEnterCoverage = 0.72
 const hierarchyMicroExitCoverage = 0.52
@@ -1213,6 +1212,11 @@ const groupRenderRadius = group => {
   return 10 + Math.min(Math.log2(childCount + 1) * 4.2, 22)
 }
 
+const childGraphRenderRadius = group => {
+  const childCount = Math.max(group.nodeIds.length, group.childGroupIds.length, 1)
+  return Math.max(420, Math.min(1800, Math.sqrt(childCount) * 24))
+}
+
 const createGroupRenderNode = group => ({
   id: groupRenderNodeId(group),
   groupId: group.id,
@@ -1229,13 +1233,55 @@ const createGroupRenderNode = group => ({
   radius: groupRenderRadius(group)
 })
 
-const interpolateNodeFromGroup = (node, group, progress) => ({
-  ...node,
-  x: group.x + (node.x - group.x) * progress,
-  y: group.y + (node.y - group.y) * progress,
-  vx: 0,
-  vy: 0
-})
+const localGraphBounds = nodes => {
+  if (nodes.length === 0) {
+    return { centerX: 0, centerY: 0, radius: 1 }
+  }
+
+  const bounds = nodes.reduce(
+    (current, node) => ({
+      minX: Math.min(current.minX, node.x),
+      maxX: Math.max(current.maxX, node.x),
+      minY: Math.min(current.minY, node.y),
+      maxY: Math.max(current.maxY, node.y)
+    }),
+    {
+      minX: Number.POSITIVE_INFINITY,
+      maxX: Number.NEGATIVE_INFINITY,
+      minY: Number.POSITIVE_INFINITY,
+      maxY: Number.NEGATIVE_INFINITY
+    }
+  )
+  const centerX = (bounds.minX + bounds.maxX) / 2
+  const centerY = (bounds.minY + bounds.maxY) / 2
+  const radius = nodes.reduce(
+    (largest, node) => Math.max(largest, Math.hypot(node.x - centerX, node.y - centerY)),
+    1
+  )
+
+  return { centerX, centerY, radius }
+}
+
+const projectNodeIntoGroupGraph = (node, group, bounds) => {
+  const targetRadius = childGraphRenderRadius(group)
+  const scale = targetRadius / Math.max(bounds.radius, 1)
+
+  return {
+    x: group.x + (node.x - bounds.centerX) * scale,
+    y: group.y + (node.y - bounds.centerY) * scale
+  }
+}
+
+const interpolateNodeFromGroup = (node, group, bounds, progress) => {
+  const projected = projectNodeIntoGroupGraph(node, group, bounds)
+  return {
+    ...node,
+    x: group.x + (projected.x - group.x) * progress,
+    y: group.y + (projected.y - group.y) * progress,
+    vx: 0,
+    vy: 0
+  }
+}
 
 const parentHierarchyGroups = () =>
   state.groups.filter(group => group.parentId === null)
@@ -1257,7 +1303,7 @@ const groupViewportCoverage = (group, viewport) => {
   const centerX = (viewport.minX + viewport.maxX) / 2
   const centerY = (viewport.minY + viewport.maxY) / 2
   const centerDistance = Math.hypot(group.x - centerX, group.y - centerY)
-  const fitCoverage = Math.min(1, group.radius / Math.max(viewportRadius, 1))
+  const fitCoverage = Math.min(1, childGraphRenderRadius(group) / Math.max(viewportRadius, 1))
   const centerCoverage = 1 - Math.min(1, centerDistance / Math.max(viewportRadius, 1))
 
   return fitCoverage * 0.72 + centerCoverage * 0.28
@@ -1352,7 +1398,7 @@ const groupEdgesForRenderedGroups = (groupNodes) => {
 }
 
 const computeHierarchyRenderVisibility = (viewport) => {
-  if (state.groups.length === 0 || state.visibleNodes.length <= 1000 || state.transform.scale >= hierarchyGroupScaleThreshold) {
+  if (state.groups.length === 0 || state.visibleNodes.length <= 1000) {
     state.hierarchyFocusGroupId = null
     return false
   }
@@ -1376,11 +1422,13 @@ const computeHierarchyRenderVisibility = (viewport) => {
   }
 
   const focusIds = new Set(focus.nodeIds)
+  const rawChildNodes = state.visibleNodes.filter(node => focusIds.has(node.id))
+  const childBounds = localGraphBounds(rawChildNodes)
   const childLimit = Math.max(160, Math.min(zoomedMassiveRenderNodeBudget, Math.floor(renderNodeBudget * progress * 2.4)))
   const childNodes = selectStableSampleNodes(
-    state.visibleNodes.filter(node => focusIds.has(node.id)),
+    rawChildNodes,
     childLimit
-  ).map(node => interpolateNodeFromGroup(node, focus, progress))
+  ).map(node => interpolateNodeFromGroup(node, focus, childBounds, progress))
   const childIds = new Set(childNodes.map(node => node.id))
   const childById = new Map(childNodes.map(node => [node.id, node]))
   const isMicroView = progress >= 0.72
@@ -1509,7 +1557,8 @@ const buildMeshEdgesForNodes = (nodes, existingEdges) => {
 }
 
 const withMeshEdges = (nodes, edges) => {
-  if (nodes.length === 0 || state.visibleNodes.length <= largeGraphNodeThreshold || state.transform.scale < meshEdgeScaleThreshold) {
+  const isHierarchyGraphLevel = state.groups.length > 0 && (state.visibleNodes.length > 1000 || state.hierarchyFocusGroupId)
+  if (nodes.length === 0 || !isHierarchyGraphLevel || state.transform.scale < meshEdgeScaleThreshold) {
     return edges
   }
 

package/dist/application/get-graph-view.js

@@ -1,8 +1,9 @@
 import { getGraphLayout } from './get-graph-layout.js';
 const macroScale = 0.24;
 const microCoverage = 0.72;
-const nodeLimit = 1200;
+const nodeLimit = 1000;
 const edgeLimit = 5000;
+const meshEdgeLimit = 2500;
 const inViewport = (item, input) => {
     const radius = item.radius ?? 48;
     return (item.x + radius >= input.x &&
@@ -15,10 +16,14 @@ const groupCoverage = (group, input) => {
     const centerX = input.x + input.width / 2;
     const centerY = input.y + input.height / 2;
     const centerDistance = Math.hypot(group.x - centerX, group.y - centerY);
-    const fitCoverage = Math.min(1, group.radius / Math.max(viewportRadius, 1));
+    const fitCoverage = Math.min(1, childGraphRenderRadius(group) / Math.max(viewportRadius, 1));
     const centerCoverage = 1 - Math.min(1, centerDistance / Math.max(viewportRadius, 1));
     return fitCoverage * 0.72 + centerCoverage * 0.28;
 };
+const childGraphRenderRadius = (group) => {
+    const childCount = Math.max(group.nodeIds.length, group.childGroupIds.length, 1);
+    return Math.max(420, Math.min(1800, Math.sqrt(childCount) * 24));
+};
 const groupNode = (group) => [
     `group:${group.id}`,
     group.title,
@@ -37,6 +42,34 @@ const realNode = (node) => [
     node.segment,
     'node'
 ];
+const graphBounds = (nodes) => {
+    if (nodes.length === 0) {
+        return { centerX: 0, centerY: 0, radius: 1 };
+    }
+    const bounds = nodes.reduce((current, node) => ({
+        minX: Math.min(current.minX, node.x),
+        maxX: Math.max(current.maxX, node.x),
+        minY: Math.min(current.minY, node.y),
+        maxY: Math.max(current.maxY, node.y)
+    }), {
+        minX: Number.POSITIVE_INFINITY,
+        maxX: Number.NEGATIVE_INFINITY,
+        minY: Number.POSITIVE_INFINITY,
+        maxY: Number.NEGATIVE_INFINITY
+    });
+    const centerX = (bounds.minX + bounds.maxX) / 2;
+    const centerY = (bounds.minY + bounds.maxY) / 2;
+    const radius = nodes.reduce((largest, node) => Math.max(largest, Math.hypot(node.x - centerX, node.y - centerY)), 1);
+    return { centerX, centerY, radius };
+};
+const projectNodeIntoGroupGraph = (node, group, bounds) => {
+    const scale = childGraphRenderRadius(group) / Math.max(bounds.radius, 1);
+    return {
+        ...node,
+        x: group.x + (node.x - bounds.centerX) * scale,
+        y: group.y + (node.y - bounds.centerY) * scale
+    };
+};
 const descendants = (group, groupById) => group.nodeIds.length > 0
     ? group.nodeIds
     : group.childGroupIds.flatMap((childId) => {
@@ -68,6 +101,31 @@ const realEdges = (edges, nodeIds) => edges
     .filter((edge) => Boolean(edge.target && nodeIds.has(edge.source) && nodeIds.has(edge.target)))
     .slice(0, edgeLimit)
     .map((edge) => [edge.source, edge.target, edge.weight, edge.priority]);
+const edgePairKey = (left, right) => left < right ? `${left}|${right}` : `${right}|${left}`;
+const meshEdges = (nodes, existingEdges) => {
+    if (nodes.length < 2) {
+        return [];
+    }
+    const existing = new Set(existingEdges.map((edge) => edgePairKey(edge[0], edge[1])));
+    const selected = [];
+    const selectedKeys = new Set();
+    const maxNeighbors = nodes.length > 500 ? 2 : 3;
+    const byX = [...nodes].sort((left, right) => left[2] - right[2] || left[3] - right[3] || left[0].localeCompare(right[0]));
+    for (let index = 0; index < nodes.length && selected.length < meshEdgeLimit; index += 1) {
+        const node = byX[index];
+        const candidates = byX.slice(index + 1, index + 1 + maxNeighbors);
+        candidates.forEach((candidate) => {
+            const key = edgePairKey(node[0], candidate[0]);
+            if (existing.has(key) || selectedKeys.has(key) || selected.length >= meshEdgeLimit) {
+                return;
+            }
+            selectedKeys.add(key);
+            selected.push([node[0], candidate[0], 1, 'low']);
+        });
+    }
+    return selected;
+};
+const withMeshEdges = (nodes, edges) => [...edges, ...meshEdges(nodes, edges)].slice(0, edgeLimit);
 export const getGraphView = async (vaultPath, input) => {
     const { signature, layout } = await getGraphLayout(vaultPath, input.agentId);
     const groups = layout.groups ?? [];
@@ -75,11 +133,12 @@ export const getGraphView = async (vaultPath, input) => {
     if (groups.length === 0) {
         const nodes = layout.nodes.filter((node) => inViewport(node, input)).slice(0, nodeLimit);
         const nodeIds = new Set(nodes.map((node) => node.id));
+        const viewNodes = nodes.map(realNode);
         return {
             signature,
             mode: 'flat',
-            nodes: nodes.map(realNode),
-            edges: realEdges(layout.edges, nodeIds),
+            nodes: viewNodes,
+            edges: withMeshEdges(viewNodes, realEdges(layout.edges, nodeIds)),
             totals: {
                 nodes: layout.nodes.length,
                 edges: layout.edges.length
@@ -93,15 +152,25 @@ export const getGraphView = async (vaultPath, input) => {
         .sort((left, right) => right.coverage - left.coverage)[0];
     if (focused && input.scale >= macroScale && focused.coverage >= microCoverage) {
         const nodeIds = new Set(focused.group.nodeIds);
-        const nodes = layout.nodes
-            .filter((node) => nodeIds.has(node.id) && inViewport(node, input))
+        const projectedNodes = layout.nodes
+            .filter((node) => nodeIds.has(node.id));
+        const bounds = graphBounds(projectedNodes);
+        const nodesInViewport = projectedNodes
+            .map((node) => projectNodeIntoGroupGraph(node, focused.group, bounds))
+            .filter((node) => inViewport(node, input))
             .slice(0, nodeLimit);
+        const nodes = nodesInViewport.length > 0
+            ? nodesInViewport
+            : projectedNodes
+                .slice(0, nodeLimit)
+                .map((node) => projectNodeIntoGroupGraph(node, focused.group, bounds));
         const visibleNodeIds = new Set(nodes.map((node) => node.id));
+        const viewNodes = nodes.map(realNode);
         return {
             signature,
             mode: 'micro',
-            nodes: nodes.map(realNode),
-            edges: realEdges(layout.edges, visibleNodeIds),
+            nodes: viewNodes,
+            edges: withMeshEdges(viewNodes, realEdges(layout.edges, visibleNodeIds)),
             totals: {
                 nodes: layout.nodes.length,
                 edges: layout.edges.length
@@ -109,11 +178,12 @@ export const getGraphView = async (vaultPath, input) => {
         };
     }
     const groupsToRender = (visibleGroups.length > 0 ? visibleGroups : groups.filter((group) => group.parentId === null)).slice(0, nodeLimit);
+    const viewNodes = groupsToRender.map(groupNode);
     return {
         signature,
         mode: 'macro',
-        nodes: groupsToRender.map(groupNode),
-        edges: aggregateGroupEdges(groupsToRender, layout.edges, groupById),
+        nodes: viewNodes,
+        edges: withMeshEdges(viewNodes, aggregateGroupEdges(groupsToRender, layout.edges, groupById)),
         totals: {
             nodes: layout.nodes.length,
             edges: layout.edges.length

package/docs/AGENT_USAGE.md

@@ -607,7 +607,7 @@ Without `--vault`, the graph UI serves `$HOME/.brainlink/vault`.
 
 The frontend includes an agent selector that shows only the agent id. Selecting an agent calls the same read APIs with `agent=<agent-id>` and renders that namespace instead of merging every agent into one graph.
 
-Graph navigation controls include zoom in, zoom out, fit visible nodes and reset-to-fit-all nodes. Mouse wheel zoom (including `cmd+scroll` and `ctrl+scroll`) is anchored to the cursor. Keyboard shortcuts are `+` (zoom in), `-` (zoom out) and `0` (reset fit). Double-click on canvas zooms in at cursor position. Totals for notes, links and tags stay visible as floating metrics under the Brainlink title, and node details open on click in a modal (tags, outgoing links, backlinks and Markdown content). Vaults above 1000 notes also expose stable hierarchy groups of up to 1000 direct nodes, with recursive parent groups when a level exceeds 1000 groups; zoom-out renders those groups as normal graph nodes, zoom-in expands a group only after it is framed in the viewport, and micro view renders only the focused subgraph until zoom-out restores sibling groups.
+Graph navigation controls include zoom in, zoom out, fit visible nodes and reset-to-fit-all nodes. Mouse wheel zoom (including `cmd+scroll` and `ctrl+scroll`) is anchored to the cursor. Keyboard shortcuts are `+` (zoom in), `-` (zoom out) and `0` (reset fit). Double-click on canvas zooms in at cursor position. Totals for notes, links and tags stay visible as floating metrics under the Brainlink title, and node details open on click in a modal (tags, outgoing links, backlinks and Markdown content). Vaults above 1000 notes also expose stable hierarchy mesh groups of up to 1000 direct nodes, with recursive parent groups when a level exceeds 1000 groups; zoom-out renders those groups as normal mesh graph nodes, zoom-in expands a group only after it is framed in the viewport, and micro view renders only the focused subgraph in a local frame anchored to the group node until zoom-out restores sibling groups.
 During graph filtering, Brainlink keeps hub context nodes visible (`Memory Hub`/`MOC`/high-degree fallback) so filtered views still show relationship anchors.
 
 The command reindexes by default, then serves:

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@andespindola/brainlink",
-  "version": "0.1.0-beta.122",
+  "version": "0.1.0-beta.124",
   "description": "Local-first knowledge memory for agents with Markdown, backlinks, indexing and context retrieval.",
   "type": "module",
   "license": "MIT",