@andespindola/brainlink 0.1.0-beta.77 → 0.1.0-beta.79

package/README.md

@@ -83,7 +83,8 @@ Legacy `.jsonl.gz` packs are upgraded to `.blpk` automatically on first search/c
 - Realtime graph UI with agent selector and colored knowledge groups.
 - Graph renderer optimized for large datasets with viewport-driven node culling and edge lookup by visible nodes.
 - Large graph layout API automatically uses compact payload encoding with link-coverage-aware edge selection to reduce initial client load without hiding major relationships.
-- Zoomed-out graph LOD now clusters dense regions and progressively expands nodes as zoom increases.
+- 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).
+- Zoomed-out graph LOD clusters dense regions and progressively expands the focused viewport as zoom increases, including very large vaults.
 - Graph reset starts in macro "galaxy" overview mode and progressively reveals nearby nodes as zoom increases, including smaller vaults.
 - 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.
@@ -594,7 +595,7 @@ The graph UI shows:
 - double-click on canvas zooms in at cursor position
 - floating graph totals (notes, links, tags) below the Brainlink title
 - large-graph rendering safeguards (edge draw caps, lower redraw rate, zoom-aware interaction)
-- massive-graph LOD progression: very low zoom uses spatial overview sampling plus hub-neighborhood edge previews to preserve whole-vault shape and orientation, then progressively reveals nodes and edges as zoom increases
+- massive-graph LOD progression: very low zoom uses spatial overview sampling plus hub-neighborhood edge previews to preserve whole-vault shape and orientation, then progressively raises the focused node budget as zoom increases so dense local areas keep nearby notes and links visible
 
 The server indexes before starting by default. Use `--no-index` to skip that step:
 

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

@@ -4,6 +4,7 @@ const largeGraphNodeThreshold = 4000
 const massiveGraphNodeThreshold = 20000
 const largeGraphEdgeRenderLimit = 120000
 const renderNodeBudget = 900
+const zoomedMassiveRenderNodeBudget = 2200
 const renderEdgeBudget = 2400
 const clusterActivationNodeThreshold = 600
 const clusterZoomThreshold = 0.18
@@ -576,6 +577,13 @@ const nodeBudgetForScale = (scale) => {
   if (scale < 0.06) return 360
   if (scale < 0.09) return 520
   if (scale < 0.14) return 720
+  if (state.visibleNodes.length > massiveGraphNodeThreshold) {
+    if (scale < 0.28) return renderNodeBudget
+    if (scale < 0.45) return 1100
+    if (scale < 0.7) return 1400
+    if (scale < 1.05) return 1800
+    return zoomedMassiveRenderNodeBudget
+  }
   return renderNodeBudget
 }
 
@@ -739,16 +747,22 @@ const selectStableSampleNodes = (sourceNodes, limit) => {
       : null
   const anchor = recentZoomFocus ?? viewportCenterWorldPoint()
   const previousIds = new Set(state.renderNodes.map((node) => node.id))
+  const preferAnchorDistance = state.visibleNodes.length > massiveGraphNodeThreshold && state.transform.scale >= 0.28
 
   return [...sourceNodes]
     .sort((left, right) => {
       const leftWasVisible = previousIds.has(left.id) ? 1 : 0
       const rightWasVisible = previousIds.has(right.id) ? 1 : 0
-      if (leftWasVisible !== rightWasVisible) return rightWasVisible - leftWasVisible
-
       const leftDistance = Math.hypot(left.x - anchor.x, left.y - anchor.y)
       const rightDistance = Math.hypot(right.x - anchor.x, right.y - anchor.y)
-      if (leftDistance !== rightDistance) return leftDistance - rightDistance
+
+      if (preferAnchorDistance) {
+        if (leftDistance !== rightDistance) return leftDistance - rightDistance
+        if (leftWasVisible !== rightWasVisible) return rightWasVisible - leftWasVisible
+      } else {
+        if (leftWasVisible !== rightWasVisible) return rightWasVisible - leftWasVisible
+        if (leftDistance !== rightDistance) return leftDistance - rightDistance
+      }
 
       const leftDegree = state.nodeDegrees.get(left.id) ?? 0
       const rightDegree = state.nodeDegrees.get(right.id) ?? 0
@@ -1942,7 +1956,7 @@ const computeRenderVisibility = () => {
     const sampleLimit = nodeBudgetForScale(state.transform.scale)
     const carryMargin = Math.max(240, Math.min(1200, 340 / Math.max(state.transform.scale, 0.0001)))
     const carryViewport = expandViewportBounds(viewport, carryMargin)
-    const carryOverLimit = Math.max(180, Math.min(900, sampleLimit))
+    const carryOverLimit = Math.max(180, Math.min(sampleLimit, Math.floor(sampleLimit * 0.5)))
     const carryOverNodes = (state.renderNodes ?? [])
       .filter((node) => isNodeInViewport(node, carryViewport))
       .slice(0, carryOverLimit)
@@ -1951,18 +1965,19 @@ const computeRenderVisibility = () => {
       carryOverNodes,
       Math.max(sampleLimit * 7, carryOverLimit)
     )
+    const sourceWithCarryIds = new Set(sourceWithCarry.map((node) => node.id))
     const sampledRaw = selectStableSampleNodes(
       sourceWithCarry,
-      Math.min(sampleLimit, renderNodeBudget)
+      sampleLimit
     )
     const continuityBudget = Math.max(24, Math.min(sampleLimit - 8, Math.floor(sampleLimit * 0.42)))
     const previousVisibleNodes = (state.renderNodes ?? [])
-      .filter((node) => sourceWithCarry.some((candidate) => candidate.id === node.id))
+      .filter((node) => sourceWithCarryIds.has(node.id))
     const continuityNodes = selectStableSampleNodes(previousVisibleNodes, continuityBudget)
     const sampled = mergeUniqueNodes(
       continuityNodes,
       sampledRaw,
-      Math.min(sampleLimit, renderNodeBudget)
+      sampleLimit
     )
     let sampledNodes = ensureHubNodesInRenderedSet(sampled)
     if (state.transform.scale < 0.035) {

package/dist/domain/graph-layout.js

@@ -167,13 +167,17 @@ const groupNodesBySegment = (nodes, segments) => {
     return new Map(groups);
 };
 const segmentAngle = (segment, index, count) => segmentAngles[segment] ?? (Math.PI * 2 * index) / Math.max(count, 1) - Math.PI / 2;
+const petalSpreadForSegmentSize = (size) => {
+    const safeSize = Math.max(size, 1);
+    return 180 + Math.log2(safeSize + 1) * 6;
+};
 const createSegmentNodes = (segments, degrees, segmentCount) => ([segment, nodes], segmentIndex) => {
     const sortedNodes = [...nodes].sort(byDegreeThenTitle(degrees));
     const angle = segmentAngle(segment, segmentIndex, segmentCount);
     const baseRadius = segmentCount === 1 ? 0 : 340 + Math.min(sortedNodes.length, 22) * 10;
     const centerX = Math.cos(angle) * baseRadius;
     const centerY = Math.sin(angle) * (baseRadius * 0.78);
-    const petalSpread = 40 + Math.sqrt(sortedNodes.length) * 14;
+    const petalSpread = petalSpreadForSegmentSize(sortedNodes.length);
     return sortedNodes.map((node, index) => {
         const localAngle = index * 2.399963 + jitter(node.title, 0.42);
         const localRadius = Math.sqrt(index + 1) * petalSpread;

package/package.json

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