six-degrees 0.4.11 → 0.5.0

package/lib/separation.js

@@ -86,11 +86,6 @@ export function comparePower(a, b) {
 }
 const NO_ROUTE = { id: null, bridge: null };
 
-/** "Ways in" order: most ways in first, then the power order. The rank shown stays the power rank. */
-export function compareWaysIn(a, b) {
-  return b.waysIn - a.waysIn || comparePower(a, b);
-}
-
 /**
  * @param {object[]} degree2      2nd-degree rows (one per bridge per person)
  * @param {object[]} connections  1st-degree rows, the bridges
@@ -236,6 +231,10 @@ export function dotRadius(waysIn) {
 
 export const MIN_BRIDGE_GAP = 18;
 const TOP_PAD = 16;
+/** Grey dots for mutual connections in circles not scanned yet, at most this many drawn. */
+export const GHOST_MAX = 60;
+const GHOST_LABEL = 40;   // room under the last connection for the line that counts them
+const PILL_W_LAYOUT = 236;   // SeparationView's PILL_W: the connection pills' width as cards
 
 /**
  * The summit map: You → the bridges → the top of the list, every route drawn.
@@ -249,10 +248,13 @@ const TOP_PAD = 16;
  *
  * @param {object[]} top    the first K people of whatever the list shows
  * @param {number}   width  map width in px
+ * @param {{ cards?: boolean }} opts  cards: people drawn as cards and
+ *   connections as pills (Blake, 2026-10-02), which need more room per row
  * @returns {{ width, height, you, people, bridges, links, spokes }}
  */
-export function summitLayout(top = [], width = 800, isMobile = false) {
-  const gap = isMobile ? 36 : 26;
+export function summitLayout(top = [], width = 800, isMobile = false, { cards = false } = {}) {
+  const gap = cards ? 50 : isMobile ? 36 : 26;
+  const bridgeGap = cards ? 36 : MIN_BRIDGE_GAP;
   const youX = 20;
   const bx = Math.round(width * 0.42);
   const px = Math.round(width * 0.58);
@@ -262,7 +264,7 @@ export function summitLayout(top = [], width = 800, isMobile = false) {
     p,
     x: px,
     y: TOP_PAD + i * gap,
-    r: dotRadius(p.waysIn),
+    r: cards ? 0 : dotRadius(p.waysIn),
     label: fit(`#${p.rank}${p.tied ? '=' : ''} ${p.person.name || ''}`, Math.floor((width - px - 60) / 6.2)),
   }));
 
@@ -288,11 +290,16 @@ export function summitLayout(top = [], width = 800, isMobile = false) {
 
   const y0 = TOP_PAD;
   const y1 = people.length ? people[people.length - 1].y : TOP_PAD;
-  const step = bridges.length > 1 ? Math.max(MIN_BRIDGE_GAP, (y1 - y0) / (bridges.length - 1)) : 0;
+  // Each connection sits level with the people they lead to (the middle of
+  // them), moved no more than it takes to keep `bridgeGap` from the next one,
+  // so a connection with one person sits on that person's row and the line
+  // between them runs straight (Blake, 2026-10-02: "the lines should line up
+  // with every box").
+  const ys = stackColumn(bridges.map((b) => b.bary), bridgeGap, y0);
   const nameBudget = Math.max(4, Math.floor((bx - 10 - (youX + 22)) / 6));
   bridges.forEach((b, j) => {
     b.x = bx;
-    b.y = bridges.length === 1 ? (y0 + y1) / 2 : y0 + j * step;
+    b.y = ys[j];
     b.r = 5;
     if (b.unresolved) b.label = fit(`can't be named (${b.count})`, nameBudget);
     else {
@@ -302,6 +309,15 @@ export function summitLayout(top = [], width = 800, isMobile = false) {
     delete b.ys;
   });
   const nodeFor = new Map(bridges.map((b) => [b.unresolved ? UNRESOLVED : b.id, b]));
+  // What each connection is to the people on the map: the only door to some,
+  // the best way in to others, or only another way in.
+  for (const b of bridges) { b.onlyFor = 0; b.bestFor = 0; }
+  for (const pp of people) {
+    const first = pp.p.routes[0];
+    const bestNode = first ? nodeFor.get(first.bridge ? first.id : UNRESOLVED) : null;
+    if (bestNode) bestNode.bestFor++;
+    if (pp.p.waysIn === 1 && bestNode) bestNode.onlyFor++;
+  }
 
   // Routes, per person: routes[0] is the top-scored bridge. Two unnamed routes
   // for one person are one line to the one grey node.
@@ -326,3 +342,114 @@ export function summitLayout(top = [], width = 800, isMobile = false) {
   const spokes = bridges.map((b) => ({ id: b.id, x1: you.x, y1: you.y, x2: b.x, y2: b.y }));
   return { width, height, you, people, bridges, links, spokes };
 }
+
+/**
+ * Heights as near the ones asked for as they can be while staying `gap`
+ * apart, in the order given (already sorted), never above `top`: neighbours
+ * that would overlap move apart by the same amount each way.
+ */
+export function stackColumn(wanted = [], gap = MIN_BRIDGE_GAP, top = 0) {
+  const blocks = [];
+  wanted.forEach((y, k) => {
+    blocks.push({ sum: y - k * gap, count: 1 });
+    while (blocks.length > 1 && blocks[blocks.length - 2].sum / blocks[blocks.length - 2].count > blocks[blocks.length - 1].sum / blocks[blocks.length - 1].count) {
+      const last = blocks.pop();
+      blocks[blocks.length - 1].sum += last.sum;
+      blocks[blocks.length - 1].count += last.count;
+    }
+  });
+  const out = blocks.flatMap((b) => new Array(b.count).fill(b.sum / b.count)).map((q, k) => q + k * gap);
+  const lift = out.length && out[0] < top ? top - out[0] : 0;
+  return out.map((y) => y + lift);
+}
+
+/**
+ * Who the map aims at with the slider all the way to easy: whoever you share the
+ * most mutual connections with, scanned or not (Blake, 2026-10-02: "if we have
+ * mutuals but not scanned thats still a high probability … i dont want to hinder
+ * the algorithm since we havent scanned that person"). `mutualsOf` is LinkedIn's
+ * count where a scan saved one, never less than the ways in the app has drawn
+ * (lib/rarity.js). Then the most drawn, then the stronger person. Narrowing the
+ * tiers first (S only, say) keeps it to the people worth it.
+ */
+export function mostMutuals(people = [], mutualsOf = () => 0, limit = 7) {
+  return [...people].sort((a, b) => (Math.max(mutualsOf(b) || 0, b.waysIn) - Math.max(mutualsOf(a) || 0, a.waysIn))
+    || b.waysIn - a.waysIn
+    || comparePower(a, b)).slice(0, limit);
+}
+
+/**
+ * How many people the map draws with the slider at `at` (lib/rarity.js): all
+ * `k` from the rare end to the middle, then fewer and fewer, down to the one
+ * person you're aiming at with the slider all the way to easy. Blake,
+ * 2026-10-02: at the rare end "it will show that one door"; at the other "all
+ * the connections going into that one person".
+ */
+export function mapCount(at, k = 10) {
+  const v = Math.max(0, Math.min(100, Number(at) || 0));
+  if (v <= 50) return k;
+  return Math.max(1, Math.round((k * (100 - v)) / 50));
+}
+
+/**
+ * The map for one person: You → every connection of yours who leads to them →
+ * them, with rings round them. Routes the map can't name share one grey node,
+ * as in summitLayout, and it comes back in summitLayout's shape (`people` holds
+ * the one person, marked `big`), so one map draws both and can glide from one
+ * to the other. Pure, so it is tested without a browser.
+ *
+ * @returns {{ width, height, you, target, people, bridges, links, spokes }}
+ */
+export function convergeLayout(p, width = 800, isMobile = false, { cards = false, mutuals = 0 } = {}) {
+  const gap = cards ? 46 : isMobile ? 40 : 34;
+  const youX = 20;
+  const bx = Math.round(width * (isMobile ? 0.44 : 0.36));
+  const tx = Math.round(width * (isMobile ? 0.8 : cards ? 0.6 : 0.62));
+  const nodes = [];
+  let unnamed = null;
+  for (const r of p?.routes || []) {
+    if (r.bridge) nodes.push({ id: r.id, bridge: r.bridge, unresolved: false, count: 1 });
+    else if (unnamed) unnamed.count++;
+    else nodes.push((unnamed = { id: null, bridge: null, unresolved: true, count: 1 }));
+  }
+  // Mutual connections the app can't draw yet: they're in circles you haven't
+  // scanned. Grey dots under the connections who do lead there, each with a faint
+  // line in, so the count reads at a glance (GHOST_MAX at most, then "+N").
+  const unscanned = Math.max(0, Math.floor(Number(mutuals) || 0) - (p?.waysIn || 0));
+  const ghostCount = Math.min(GHOST_MAX, unscanned);
+  const ghostStep = cards ? 12 : 11;
+  const ghostW = cards ? PILL_W_LAYOUT - 16 : isMobile ? 96 : 120;
+  const perRow = Math.max(1, Math.floor(ghostW / ghostStep) + 1);
+  const ghostRows = Math.ceil(ghostCount / perRow);
+  const ghostH = ghostCount ? GHOST_LABEL + ghostRows * ghostStep : 0;
+  const block = Math.max(0, nodes.length - 1) * gap + ghostH;
+  const height = Math.max(isMobile ? 190 : cards ? 250 : 220, TOP_PAD * 2 + block + 48);
+  const mid = height / 2;
+  const top = mid - block / 2;
+  const nameBudget = Math.max(4, Math.floor((bx - 10 - (youX + 22)) / 6));
+  const bridges = nodes.map((n, j) => {
+    const full = n.unresolved ? `can't be named (${n.count})` : n.bridge.name || '';
+    return {
+      ...n, x: bx, y: top + j * gap, r: 6,
+      primary: j === 0 && !n.unresolved,
+      label: full.length <= nameBudget ? full : fit(n.unresolved ? full : shortName(full), nameBudget),
+    };
+  });
+  const target = { x: tx, y: mid, r: cards ? 0 : 17, rings: cards ? [] : [32, 50, 70].filter((r) => r <= mid - 4) };
+  const links = bridges.map((b) => ({
+    key: p?.key, bridgeId: b.id, primary: b.primary, unresolved: b.unresolved, tier: b.bridge?.tier ?? null,
+    x1: b.x, y1: b.y, x2: target.x, y2: target.y,
+  }));
+  const you = { x: youX, y: mid, r: 14 };
+  const spokes = bridges.map((b) => ({ id: b.id, x1: you.x, y1: you.y, x2: b.x, y2: b.y }));
+  const people = p ? [{ key: p.key, p, x: target.x, y: target.y, r: target.r, rings: target.rings, big: true, label: '' }] : [];
+  const gy = top + Math.max(0, nodes.length - 1) * gap + GHOST_LABEL;
+  const gx = cards ? bx - PILL_W_LAYOUT + 8 : bx - ghostW;
+  const ghosts = Array.from({ length: ghostCount }, (_, i) => ({ x: gx + (i % perRow) * ghostStep, y: gy + Math.floor(i / perRow) * ghostStep }));
+  // How bright the person is: the share of your mutual connections with them that the map can draw.
+  const drawn = p?.waysIn ? p.waysIn / (p.waysIn + unscanned) : 1;
+  return {
+    width, height, you, target, people, bridges, links, spokes,
+    ghosts, unscanned, ghostLabel: ghostCount ? { x: gx, y: gy - 13 } : null, drawn,
+  };
+}

package/lib/settings-effects.js

@@ -5,28 +5,37 @@
 
 import { rescoreAll } from './rpc.js';
 import { sameFocus, NO_FOCUS, tierMoves } from './sector-focus.js';
+import { rankingFingerprint } from './title-ranking.js';
 
 // Each entry: `changed(before, after)` says whether a change matters (by
 // default, any change to the stored value), and `run(db, after, before)` does
 // the work and returns what to tell the page.
+// Rescore everyone and count who changed tier, from the stored tiers before and after.
+function rescoreCountingMoves(db) {
+  const rows = () => db.prepare('SELECT id, degree, profile_url, tier FROM linkedin_connections').all();
+  try {
+    const before = new Map(rows().map((r) => [r.id, r.tier]));
+    const { scored } = rescoreAll();
+    const { people, up, down } = tierMoves(rows(), (r) => before.get(r.id), (r) => r.tier, { examples: 0 });
+    return { scored, people, moved: up + down, up, down };
+  } catch (err) {
+    throw new Error(`Saved, but rescoring your network failed (${err.message}). It will try again the next time the map loads.`);
+  }
+}
+
 const EFFECTS = {
+  // Title points are part of everyone's score, so a new ranking rescores everyone, as a new tier scale does.
+  titleRanking: {
+    changed: (before, after) => rankingFingerprint(before) !== rankingFingerprint(after),
+    run: (db) => rescoreCountingMoves(db),
+  },
   tierScale: {
     // Tiers are graded when everyone is scored, so a new scale rescores
     // everyone. The answer counts who changed tier, from the stored tiers
     // before and after, with the sector focus's own counter (tierMoves): a
     // person reachable through two bridges is two rows but one person, counted
     // once at their closest degree.
-    run(db) {
-      const rows = () => db.prepare('SELECT id, degree, profile_url, tier FROM linkedin_connections').all();
-      try {
-        const before = new Map(rows().map((r) => [r.id, r.tier]));
-        const { scored } = rescoreAll();
-        const { people, up, down } = tierMoves(rows(), (r) => before.get(r.id), (r) => r.tier, { examples: 0 });
-        return { scored, people, moved: up + down, up, down };
-      } catch (err) {
-        throw new Error(`Saved, but rescoring your network failed (${err.message}). It will try again the next time the map loads.`);
-      }
-    },
+    run: (db) => rescoreCountingMoves(db),
   },
   sectorFocus: {
     // Only a change to what scoring uses: a strength with no sectors picked

package/lib/settings.js

@@ -12,6 +12,7 @@
 
 import { SECTOR_FOCUS_SETTING, FIELD_ASKED_SETTING } from './sector-focus.js';
 import { TIER_SCALE_SETTING } from './scoring.js';
+import { TITLE_RANKING_SETTING } from './title-ranking.js';
 
 export const SETTINGS = {
   // Scores → Your sector: industries whose companies count for more (lib/sector-focus.js).
@@ -20,6 +21,8 @@ export const SETTINGS = {
   fieldAsked: FIELD_ASKED_SETTING,
   // Scores → Tiers: graded on your network's curve, or on the fixed scale (lib/scoring.js).
   tierScale: TIER_SCALE_SETTING,
+  // Scores → Titles: how much each kind of title counts, and roles you're looking for (lib/title-ranking.js).
+  titleRanking: TITLE_RANKING_SETTING,
 };
 
 const KEY = 'settings';

package/lib/tier-grid.js

@@ -0,0 +1,99 @@
+// The Filters panel's grid: five tiers down, six degrees across, the same in
+// Network Circle and in Degrees.
+//
+// Blake, 2026-10-02: "keeping the tiers as is but enlarging them and having 6
+// dots to let the user tap on to toggle or not if they want specific degrees
+// showing for whatever tier … it will be universal for both".
+//
+// A grid is { hidden: [tiers switched off], degrees: { S: [1, 2], … } }: a tier
+// row switches on and off as it always did, and remembers which degrees it
+// shows while it's off. Counts are { S: { 1: n, 2: n, … }, … }: how many people
+// there are at each tier and degree, so a dot with nobody behind it can't be
+// tapped, and the last people on screen can't be switched off.
+
+export const TIERS = ['S', 'A', 'B', 'C', 'D'];
+export const GRID_DEGREES = [1, 2, 3, 4, 5, 6];
+
+const tierOf = (tier) => (TIERS.includes(tier) ? tier : 'D');   // no tier: with D, as the views draw it
+
+export const makeGrid = (degrees = GRID_DEGREES) => ({
+  hidden: [],
+  degrees: Object.fromEntries(TIERS.map((t) => [t, degrees.slice()])),
+});
+
+/** Network Circle starts with your own connections; you pick the rest. */
+export const NETWORK_GRID = Object.freeze(makeGrid([1]));
+/** Degrees starts with everything it has. */
+export const DEGREES_GRID = Object.freeze(makeGrid());
+
+/** Is someone of this tier, at this degree, on screen? */
+export function shows(grid, tier, degree) {
+  const t = tierOf(tier);
+  return !grid.hidden.includes(t) && grid.degrees[t].includes(degree);
+}
+
+const countAt = (counts, tier, degree) => counts?.[tier]?.[degree] || 0;
+
+/** How many people one tier is showing. */
+export function showingIn(grid, counts, tier) {
+  if (grid.hidden.includes(tier)) return 0;
+  return grid.degrees[tier].reduce((n, d) => n + countAt(counts, tier, d), 0);
+}
+
+/** How many people the whole grid is showing. */
+export const showing = (grid, counts) => TIERS.reduce((n, t) => n + showingIn(grid, counts, t), 0);
+
+// A change that would leave nobody on screen isn't made.
+const keep = (grid, next, counts) => (counts && showing(next, counts) === 0 ? grid : next);
+
+/** One dot: that degree, for that tier. Tapping a dot in a tier that's off switches the tier on with it. */
+export function toggleCell(grid, tier, degree, counts) {
+  const has = grid.degrees[tier].includes(degree);
+  const off = grid.hidden.includes(tier);
+  const degrees = off || !has
+    ? [...new Set([...grid.degrees[tier], degree])].sort((a, b) => a - b)
+    : grid.degrees[tier].filter((d) => d !== degree);
+  return keep(grid, {
+    hidden: off ? grid.hidden.filter((t) => t !== tier) : grid.hidden,
+    degrees: { ...grid.degrees, [tier]: degrees },
+  }, counts);
+}
+
+/** A whole tier, off or back on with the degrees it had. */
+export function toggleTier(grid, tier, counts) {
+  if (!grid.hidden.includes(tier)) return keep(grid, { ...grid, hidden: [...grid.hidden, tier] }, counts);
+  // Back on with nothing to show would look broken: give it what the others show.
+  const own = grid.degrees[tier];
+  const others = [...new Set(TIERS.flatMap((t) => (t === tier ? [] : grid.degrees[t])))].sort((a, b) => a - b);
+  return {
+    hidden: grid.hidden.filter((t) => t !== tier),
+    degrees: own.length ? grid.degrees : { ...grid.degrees, [tier]: others.length ? others : [1] },
+  };
+}
+
+/** A whole degree: off if every tier with people there is showing it, otherwise on for all of them. */
+export function toggleDegree(grid, degree, counts) {
+  const tiers = TIERS.filter((t) => !grid.hidden.includes(t) && (!counts || countAt(counts, t, degree) > 0));
+  if (!tiers.length) return grid;
+  const allOn = tiers.every((t) => grid.degrees[t].includes(degree));
+  const degrees = { ...grid.degrees };
+  for (const t of tiers) {
+    degrees[t] = allOn ? degrees[t].filter((d) => d !== degree) : [...new Set([...degrees[t], degree])].sort((a, b) => a - b);
+  }
+  return keep(grid, { ...grid, degrees }, counts);
+}
+
+/** Every tier back on, each with the degrees it had. */
+export const showAllTiers = (grid) => (grid.hidden.length ? { ...grid, hidden: [] } : grid);
+
+/** People by tier and degree, for the dots: `byDegree` is { 1: rows, 2: rows, … }. */
+export function gridCounts(byDegree = {}) {
+  const counts = Object.fromEntries(TIERS.map((t) => [t, {}]));
+  for (const [degree, rows] of Object.entries(byDegree)) {
+    for (const row of rows || []) {
+      const t = tierOf(row?.tier);
+      counts[t][degree] = (counts[t][degree] || 0) + 1;
+    }
+  }
+  return counts;
+}

package/lib/title-ranking.js

@@ -0,0 +1,83 @@
+// Settings → Scores → Titles: how much each kind of title counts, your way
+// (Blake, 2026-10-02: "let the user change the rankings of titles as well …
+// incase they value certain people or is using this for outreaching new
+// founders", and people who "find more in that role" for outbound or hiring).
+//
+// Two parts, both in title points (the 0–10 a title is worth before the
+// company weighs it, lib/scoring.js LEVELS):
+//   points  a level's points, yours: Owner / Entrepreneur at 10, say, to put
+//           founders of small companies level with CEOs
+//   roles   words in a title, and what anyone whose title has them counts:
+//           "account executive" at 10 puts every AE you can reach in S
+// Nothing set scores exactly as before. The model applies it (scorePerson);
+// this file is the setting and its presets.
+
+import { LEVELS } from './scoring.js';
+
+/** The ladder shown in Settings, top to bottom (the main kinds of title). */
+export const RANKED_LEVELS = ['csuite', 'owner', 'vp', 'director', 'manager', 'senior', 'ic', 'unknown', 'intern', 'student'];
+export const NO_RANKING = Object.freeze({ points: Object.freeze({}), roles: Object.freeze([]) });
+export const MAX_ROLES = 20;
+const MAX_ROLE_TEXT = 60;
+
+const clampPoints = (v) => {
+  const n = Number(v);
+  if (!Number.isFinite(n) || n < 0 || n > 10) throw new Error('Title points go from 0 to 10.');
+  return Math.round(n * 2) / 2;
+};
+
+export const TITLE_RANKING_SETTING = {
+  default: NO_RANKING,
+  parse(value) {
+    if (!value || typeof value !== 'object' || Array.isArray(value)) throw new Error('A title ranking is { points, roles }.');
+    const points = {};
+    for (const [key, v] of Object.entries(value.points || {})) {
+      if (!Object.hasOwn(LEVELS, key)) throw new Error(`There is no kind of title called '${key}'.`);
+      const p = clampPoints(v);
+      if (p !== LEVELS[key].points) points[key] = p;   // the default needn't be stored
+    }
+    const roles = [];
+    const seen = new Set();
+    for (const r of Array.isArray(value.roles) ? value.roles : []) {
+      const text = String(r?.text ?? '').trim().toLowerCase().replace(/\s+/g, ' ');
+      if (text.length < 2) throw new Error('A role needs at least two letters.');
+      if (text.length > MAX_ROLE_TEXT) throw new Error(`Keep a role under ${MAX_ROLE_TEXT} letters.`);
+      if (seen.has(text)) continue;
+      seen.add(text);
+      roles.push({ text, points: clampPoints(r.points) });
+    }
+    if (roles.length > MAX_ROLES) throw new Error(`Up to ${MAX_ROLES} roles.`);
+    return { points, roles };
+  },
+};
+
+/** The same ranking always gives the same text, so the stored scores can say which they were made with. */
+export function rankingFingerprint(r = NO_RANKING) {
+  const points = Object.keys(r.points || {}).sort().map((k) => `${k}=${r.points[k]}`).join(',');
+  const roles = (r.roles || []).map((x) => `${x.text}=${x.points}`).sort().join(',');
+  return points || roles ? `${points}|${roles}` : 'none';
+}
+
+export const isDefaultRanking = (r) => rankingFingerprint(r) === 'none';
+
+/** Starting points for the common reasons to change it. Each replaces the whole ranking; you can adjust from there. */
+export const RANKING_PRESETS = [
+  { key: 'default', label: 'As the app ranks them', ranking: NO_RANKING, note: 'C-suite and founders first, then VPs, directors, managers.' },
+  {
+    key: 'founders', label: 'Founders first',
+    note: 'Owners and entrepreneurs count like CEOs, and anyone who says founder counts as much: for meeting founders, or selling to them.',
+    ranking: { points: { owner: 10 }, roles: [{ text: 'founder', points: 10 }, { text: 'co-founder', points: 10 }] },
+  },
+  {
+    key: 'investors', label: 'Investors',
+    note: 'Anyone who invests for a living rises to the top: for raising money.',
+    ranking: { points: {}, roles: ['investor', 'venture', 'angel', 'general partner', 'managing partner', 'principal at', 'vc'].map((text) => ({ text, points: 10 })) },
+  },
+  {
+    key: 'role', label: 'A role I’m looking for',
+    note: 'For outbound or hiring: add the role below, and everyone in it rises, whatever their level.',
+    ranking: null,   // keeps what you have and opens the role box
+  },
+];
+
+export { titleHas } from './scoring.js';

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "six-degrees",
-  "version": "0.4.11",
+  "version": "0.5.0",
   "description": "Map your professional network as a galaxy — leverage tiers, bridges into new circles, and the shortest path to anyone. Runs locally on your own data.",
   "license": "MIT",
   "author": "Blake Burford",

package/scripts/scrape.py

@@ -91,7 +91,7 @@ def _assert_local_target():
     if host in ("localhost", "127.0.0.1", "::1", "0.0.0.0"):
         return
     if os.getenv("ALLOW_REMOTE_PUSH") == "1":
-        print(f"WARNING: pushing scraped data to remote host {host}")
+        print(f"WARNING: pushing scanned data to remote host {host}")
         return
     raise SystemExit(
         f"Refusing to push scraped data to '{APP_URL}'.\n"
@@ -370,7 +370,7 @@ def _print_sign_in_banner(say):
     print("  inside automated browsers, which is why that window comes up")
     print("  greyed out and does nothing.")
     print()
-    print("  Nothing is scraped until you are signed in, and the scrape starts")
+    print("  Nothing is scanned until you are signed in, and the scan starts")
     print("  by itself the moment you are. Take as long as you need.")
     print("  Close the browser window to cancel.")
     print("  ==================================================================")
@@ -387,11 +387,11 @@ def _wait_for_sign_in(page, context, timeout_s, say):
         # not: signing in legitimately opens and closes tabs.
         try:
             if not [pg for pg in context.pages if not pg.is_closed()]:
-                print("\n  Browser closed — nothing was scraped.")
+                print("\n  Browser closed — nothing was scanned.")
                 say("Browser closed before sign-in.")
                 return False
         except Exception:
-            print("\n  Browser closed — nothing was scraped.")
+            print("\n  Browser closed — nothing was scanned.")
             return False
 
         # The cookie belongs to the whole browser, so it is found no matter which
@@ -493,7 +493,7 @@ def resolve_active_user():
             for u in users:
                 if (u.get("name") or "").strip().lower() == wanted:
                     _active_user_id = u["id"]
-                    print(f"  Scraping into profile: {u['name']}")
+                    print(f"  Scanning into profile: {u['name']}")
                     return _active_user_id
             raise SystemExit(f"No profile named '{os.getenv('SIX_DEGREES_USER')}' in the app.")
 
@@ -510,7 +510,7 @@ def resolve_active_user():
         raise SystemExit(f"The app at {APP_URL} did not say which profile to use.")
 
     _active_user_id = me["id"]
-    print(f"  Scraping into profile: {me.get('name')}")
+    print(f"  Scanning into profile: {me.get('name')}")
     return _active_user_id
 
 
@@ -732,7 +732,7 @@ def push_connections(connections, degree=1, bridge_id=None, user_id=None, on_sav
             if p["profile_url"] in d1_urls:
                 # Unlock via API route
                 requests.post(f"{APP_URL}/api/unlock", json={"connectionId": p["id"]}, headers=app_headers())
-                print(f"  *** PATH UNLOCKED: {p['name']}! Run --bridge \"{p['name']}\" to scrape their network ***")
+                print(f"  *** PATH UNLOCKED: {p['name']}! Run --bridge \"{p['name']}\" to scan their network ***")
 
     return inserted
 
@@ -893,8 +893,8 @@ def scrape_full(headless=False):
     if searches_left()[0] <= 0:
         raise BudgetReached(0, searches_left()[1])
 
-    print("\n=== Full Account Setup Scrape ===\n")
-    print("This scrapes ALL connections via the search page (not the connections page).")
+    print("\n=== Full account scan ===\n")
+    print("This scans ALL connections via the search page (not the connections page).")
     print("Takes 3-5 minutes for ~500 connections.\n")
 
     with sync_playwright() as p:
@@ -1286,6 +1286,18 @@ SAVE_EVERY_PAGES = 10             # save as a long read goes, so a stop loses li
 # randomised: the point is fewer searches an hour, not looking like a person.
 PAGE_PAUSE = 20                   # seconds before each next page of results
 CHUNK_COOLDOWN = 60               # extra seconds after every SAVE_EVERY_PAGES pages
+# The Scan page's speed (Blake, 2026-09-30 and 10-03: "slow, medium and fast").
+# Fast is exactly the pacing above and nothing is ever faster; Medium and Slow
+# only add waiting. Speed changes how many searches an hour, never how many a
+# day: the daily budget stays the volume cap. Read from scan-limits.json
+# ("pace") at the start of every run (apply_pace). lib/scan-pace.js holds the
+# same numbers for the page, and tests/scan-pace.test.mjs checks they agree.
+SCAN_PACES = {
+    "fast": {"page_pause": 20, "chunk_cooldown": 60, "profile_gap": 60},
+    "medium": {"page_pause": 45, "chunk_cooldown": 180, "profile_gap": 90},
+    "slow": {"page_pause": 90, "chunk_cooldown": 300, "profile_gap": 120},
+}
+DEFAULT_PACE = "fast"
 LEGACY_PAGES_READ = 10            # how far every read before 0.1.6 went, at most
 
 # Experimental all-day pacing for Auto-Bridge (--experimental; item 44, Graph
@@ -1561,6 +1573,27 @@ def _profile_wait(data, now):
     return 0
 
 
+def scan_pace():
+    """The speed saved on the Scan page: "fast", "medium" or "slow"."""
+    try:
+        name = json.loads((_home() / "scan-limits.json").read_text()).get("pace")
+    except Exception:
+        name = None
+    return name if name in SCAN_PACES else DEFAULT_PACE
+
+
+def apply_pace(name=None):
+    """Set this run's waits from the chosen speed. Never below Fast's."""
+    global PAGE_PAUSE, CHUNK_COOLDOWN, PROFILE_GAP
+    name = name if name in SCAN_PACES else scan_pace()
+    pace = SCAN_PACES[name]
+    fast = SCAN_PACES["fast"]
+    PAGE_PAUSE = max(fast["page_pause"], pace["page_pause"])
+    CHUNK_COOLDOWN = max(fast["chunk_cooldown"], pace["chunk_cooldown"])
+    PROFILE_GAP = max(fast["profile_gap"], pace["profile_gap"])
+    return name
+
+
 def search_limits():
     try:
         data = json.loads((_home() / "scan-limits.json").read_text())
@@ -3256,7 +3289,7 @@ def scrape_bridge(bridge_name, headless=False, max_pages=LINKEDIN_MAX_PAGES, dee
     if not urn and profiles_left() <= 0:
         raise BudgetReached(0, "profiles")
 
-    print(f"\n=== {'Carrying on with' if start_page > 1 else 'Scraping'} connections of {bridge_name} ===\n")
+    print(f"\n=== {'Carrying on with' if start_page > 1 else 'Scanning'} connections of {bridge_name} ===\n")
 
     read = []
 
@@ -3368,7 +3401,7 @@ def scrape_company(company_name, headless=False, log_fn=None):
         if log_fn:
             log_fn(msg)
 
-    log(f"Scraping employees at: {company_name}")
+    log(f"Scanning employees at: {company_name}")
 
     # A company scan is people searches too: the same cooldown and budget.
     cd = read_cooldown()
@@ -4045,7 +4078,7 @@ def auto_bridge_all(headless=False, log_fn=None, retry_private=False, max_bridge
 
 def rescrape_bridge(bridge_name, headless=False, max_pages=LINKEDIN_MAX_PAGES):
     """Delete all existing cluster data for a bridge and re-scrape from scratch."""
-    print(f"\n=== Re-scraping {bridge_name} (delete + fresh scrape) ===\n")
+    print(f"\n=== Rescanning {bridge_name} (delete + fresh scan) ===\n")
 
     # Check before deleting anything: a cooldown or an empty budget would leave
     # their circle deleted and not read again.
@@ -4349,11 +4382,16 @@ Examples:
         EXPERIMENT["on"] = True
         print("Experimental Auto-Bridge: all-day pacing, and LinkedIn's own data read beside the page text.")
     args.max_pages = max(1, min(LINKEDIN_MAX_PAGES, args.max_pages))
+    # The Scan page's speed. Signing in searches nothing, so it isn't said there.
+    _pace = apply_pace()
+    if not args.login:
+        print(f"Speed: {_pace.capitalize()}. {PAGE_PAUSE}s before each page of results, {CHUNK_COOLDOWN}s more after "
+              f"every {SAVE_EVERY_PAGES}, and profiles at least {PROFILE_GAP}s apart.")
 
     # A failed save ends the run with its reason, not a traceback (TRAPS §32).
     def _say_why(exc_type, exc, tb):
         if issubclass(exc_type, SaveFailed):
-            print(f"\n  The app could not save what was scraped: {exc}\n", file=sys.stderr)
+            print(f"\n  The app could not save what was scanned: {exc}\n", file=sys.stderr)
         elif issubclass(exc_type, TryLater):
             print(f"\n  The photos weren't saved: {exc}.\n", file=sys.stderr)
         elif issubclass(exc_type, NotSignedIn):

package/.next/standalone/.next/server/chunks/[root-of-the-server]__17hjtzl._.js

@@ -1,8 +0,0 @@
-module.exports=[70406,(e,t,r)=>{t.exports=e.x("next/dist/compiled/@opentelemetry/api",()=>require("next/dist/compiled/@opentelemetry/api"))},18622,(e,t,r)=>{t.exports=e.x("next/dist/compiled/next-server/app-page-turbo.runtime.prod.js",()=>require("next/dist/compiled/next-server/app-page-turbo.runtime.prod.js"))},56704,(e,t,r)=>{t.exports=e.x("next/dist/server/app-render/work-async-storage.external.js",()=>require("next/dist/server/app-render/work-async-storage.external.js"))},32319,(e,t,r)=>{t.exports=e.x("next/dist/server/app-render/work-unit-async-storage.external.js",()=>require("next/dist/server/app-render/work-unit-async-storage.external.js"))},59043,(e,t,r)=>{t.exports=e.x("next/dist/server/runtime-reacts.external.js",()=>require("next/dist/server/runtime-reacts.external.js"))},93695,(e,t,r)=>{t.exports=e.x("next/dist/shared/lib/no-fallback-error.external.js",()=>require("next/dist/shared/lib/no-fallback-error.external.js"))},74533,(e,t,r)=>{t.exports=e.x("node:child_process",()=>require("node:child_process"))},66680,(e,t,r)=>{t.exports=e.x("node:crypto",()=>require("node:crypto"))},2157,(e,t,r)=>{t.exports=e.x("node:fs",()=>require("node:fs"))},12714,(e,t,r)=>{t.exports=e.x("node:fs/promises",()=>require("node:fs/promises"))},60526,(e,t,r)=>{t.exports=e.x("node:os",()=>require("node:os"))},50227,(e,t,r)=>{t.exports=e.x("node:path",()=>require("node:path"))},81111,(e,t,r)=>{t.exports=e.x("node:stream",()=>require("node:stream"))},10960,e=>{"use strict";var t=e.i(2157),r=e.i(50227),n=e.i(60526);function s(){for(let e of[process.env.SIX_DEGREES_ROOT,process.cwd(),r.default.join(process.cwd(),".."),r.default.join(process.cwd(),"..","..")].filter(Boolean))if((0,t.existsSync)(r.default.join(e,"scripts","scrape.py")))return e;return null}e.s(["dataDir",0,function(){return process.env.SIX_DEGREES_HOME||r.default.join(n.default.homedir(),".six-degrees")},"isGitCheckout",0,function(){let e=s();return!!(e&&(0,t.existsSync)(r.default.join(e,".git")))},"projectRoot",0,s])},88602,e=>{"use strict";var t=e.i(88431);e.s(["networkCounts",0,function(e){let r=Object.fromEntries((0,t.getDb)().prepare("SELECT degree, COUNT(*) AS n FROM linkedin_connections WHERE user_id = ? GROUP BY degree").all(e).map(e=>[e.degree,e.n]));return{first:r[1]||0,second:r[2]||0,third:r[3]||0}},"resolveProfile",0,function({create:e=!0}={}){let[r]=(0,t.getDb)().prepare(`
-    SELECT u.*,
-           (SELECT COUNT(*) FROM linkedin_connections c WHERE c.user_id = u.id) AS connections
-    FROM users u
-    ORDER BY connections DESC, u.created_at ASC, u.rowid ASC
-  `).all().map(e=>(0,t.decodeRow)("users",e));if(r)return r;if(!e)return null;let n=(0,t.newId)();return(0,t.getDb)().prepare("INSERT INTO users (id, name) VALUES (?, ?)").run(n,"You"),{...(0,t.decodeRow)("users",(0,t.getDb)().prepare("SELECT * FROM users WHERE id = ?").get(n)),connections:0}}])},12506,1348,e=>{"use strict";e.s(["compareVersions",0,function(e,t){let r=e=>String(e||"").replace(/^v/i,"").split(/[-+]/)[0].split(".").map(e=>Number.parseInt(e,10)||0),n=r(e),s=r(t);for(let e=0;e<Math.max(n.length,s.length);e++){let t=(n[e]||0)-(s[e]||0);if(0!==t)return t>0?1:-1}return 0},"installKind",0,function(e=process.env,t=""){return["mac-app","source","npm"].includes(e.SIX_DEGREES_INSTALL)?e.SIX_DEGREES_INSTALL:/\.app\/Contents\/Resources/.test(t||"")?"mac-app":"npm"},"repoSlug",0,function(e){let t=("string"==typeof e?e:e?.url||"").match(/github\.com[/:]([^/]+)\/([^/.#?]+)/);return t?`${t[1]}/${t[2]}`:null},"updateCommand",0,function(e,t,{dataDir:r}={}){if("mac-app"===e)return`curl -fsSL https://raw.githubusercontent.com/${t}/main/install.sh | bash`;if("source"===e)return"git pull && npm ci && npm run build && npm run start:packaged";let n=r&&`'${String(r).replace(/'/g,"'\\''")}'`;return n?`npx six-degrees@latest --data-dir ${n}`:"npx six-degrees@latest"}],12506);let t=Symbol.for("six-degrees.scan-state");function r(){let e=globalThis[t];return e?.running!==!0?null:"string"==typeof e.action&&e.action?e.action:"scan"}function n(e){switch(e){case"install":return"The scanner's packages are being installed";case"setup":return"The scanner is being set up";case"login":return"The LinkedIn sign-in window is open";case"photos":return"Profile photos are being saved";default:return"A scan is running"}}e.s(["busyRefusal",0,function(e,t=r()){return t?`${n(t)}. ${e}`:null},"registerScanState",0,function(e){return globalThis[t]||(globalThis[t]=e),globalThis[t]},"runningNow",0,n,"scannerJob",0,r],1348)},1746,e=>{"use strict";e.s(["keyFor",0,function(e){return String(e?.profile_url||"").split(/[?#]/)[0].replace(/\/+$/,"")||`id:${e?.id}`}])},98199,e=>{"use strict";var t=e.i(50227),r=e.i(12506);let n="Six Degrees.app",s="SHA256SUMS",i=Object.freeze({apiBase:"https://api.github.com",downloadBase:"https://github.com"}),o=(e,t)=>({refusal:{code:e,message:t}}),a={arm64:"Apple Silicon",x64:"Intel"},l={0x1000007:"x64",0x100000c:"arm64"};e.s(["APP_BUNDLE_NAME",0,n,"BUNDLE_ID",0,"com.blakeburford.sixdegrees","CHIP_LABEL",0,a,"GITHUB",0,i,"UPDATE_HANDOFF_EXIT_CODE",0,76,"chipOf",0,function({sysctlArm64:e,processArch:t}={}){return"1"===String(e??"").trim()||"arm64"===t?"arm64":"x64"},"digestsMatch",0,function(e,t){let r=String(e||"").toLowerCase(),n=String(t||"").toLowerCase();return/^[0-9a-f]{64}$/.test(r)&&r===n},"foreignAppProcesses",0,function(e,{bundles:t=[],uid:r}){let n=t.filter(Boolean).map(e=>`${e}/Contents/`);if(!n.length||!Number.isInteger(r))return[];let s=[];for(let t of String(e||"").split("\n")){let e=t.match(/^\s*(\d+)\s+(\d+)\s+(.+)$/);e&&Number(e[1])!==r&&n.some(t=>e[3].startsWith(t))&&s.push(Number(e[2]))}return s},"helperArgs",0,function({target:e,staged:t,keepDir:r,statusFile:n,from:s,to:i,pids:o=[],waitSeconds:a=30,logFile:l,work:u,relaunch:d=[],confirmFile:p,confirmWaitSeconds:c=600}){let f=["--target",e,"--staged",t,"--keep",r,"--status",n,"--from",s,"--to",i,"--wait",String(a)];for(let e of o)Number.isInteger(e)&&e>1&&f.push("--pid",String(e));return p&&f.push("--confirm",p,"--confirm-wait",String(c)),l&&f.push("--log",l),u&&f.push("--work",u),[...f,"--",...d]},"installerTarget",0,function({applicationsWritable:e=!0,home:r=""}={}){return e?t.default.join("/Applications",n):t.default.join(r,"Applications",n)},"lastUpdateReport",0,function(e,{runningVersion:t,now:s=Date.now(),maxAgeDays:i=7}={}){if(!e||"object"!=typeof e||"string"!=typeof e.to)return null;let o=Date.parse(e.at);if(!Number.isFinite(o)||s-o>864e5*i)return null;let a=e.to,l="string"==typeof e.reason&&e.reason.trim()?e.reason.trim().replace(/\.$/,""):null,u={at:new Date(o).toISOString(),from:e.from||null,to:a,previous:"string"==typeof e.previous?e.previous:null},d=t?(0,r.compareVersions)(t,a):null,p=`The update to ${a} didn't finish${l?`: ${l}`:""}.`;switch(e.outcome){case"installed":case"started":if(0===d)return{...u,tone:"ok",text:`Updated to ${a}.`};if(d>0)return null;if("installed"===e.outcome)return{...u,tone:"bad",text:`Version ${a} was installed, but this copy is ${t}. If you have two copies of Six Degrees, open the one in Applications.`};return{...u,tone:"bad",text:`The update to ${a} didn't finish, and it didn't say why.${e.log?` Its log is ${e.log}.`:""}`};case"not-applied":if(null!==d&&d>=0)return null;return{...u,tone:"bad",text:`${p} Nothing was changed.`};case"rolled-back":if(null!==d&&d>=0)return null;return{...u,tone:"bad",text:`${p} Your previous version was put back.`};case"failed":if(null!==d&&d>=0)return null;return{...u,tone:"bad",text:`${p}${e.previous?` Your previous version is safe, in a hidden folder: ${e.previous}. To use it again, rename it to ${n} (in Finder, Shift-Command-. shows hidden files). Or install the newest version: Check for updates, below.`:""}`};default:return null}},"leftoversBeside",0,function(e,t){let r=`.${t}.`,n=[];for(let t of e){if("string"!=typeof t||!t.startsWith(r))continue;let e=t.slice(r.length);if("incoming"===e){n.push({name:t,kind:"incoming",pid:null});continue}let s=e.match(/^(previous|failed)-(\d+)(?:-\d+)?$/);s&&n.push({name:t,kind:s[1],pid:Number(s[2])})}return n},"machoArchs",0,function(e){let t=new Set;if(!e||e.length<8)return t;let r=e=>{l[e>>>0]&&t.add(l[e>>>0])},n=e.readUInt32LE(0);if(0xfeedfacf===n||0xfeedface===n)return r(e.readUInt32LE(4)),t;let s=e.readUInt32BE(0);if(0xcafebabe===s||0xcafebabf===s){let n=e.readUInt32BE(4),i=0xcafebabf===s?32:20;if(n<1||n>16)return t;for(let t=0;t<n;t++){let n=8+t*i;if(n+4>e.length)break;r(e.readUInt32BE(n))}}return t},"parseSha256Sums",0,function(e){let t=new Map;for(let r of String(e||"").split("\n")){let e=r.replace(/\r$/,"").match(/^([0-9a-fA-F]{64}) [ *](.+)$/);if(!e)continue;let[,n,s]=e,i=n.toLowerCase();t.has(s)&&t.get(s)!==i?t.set(s,null):t.set(s,i)}return t},"planFromRelease",0,function(e,{currentVersion:t,chip:n,slug:l,downloadBase:u=i.downloadBase}){if(!e||"object"!=typeof e||!e.tag_name)return o("no-release","GitHub did not describe a release.");let d=String(e.tag_name),p=d.replace(/^v/i,"");if(e.draft||e.prerelease||p.includes("-"))return o("prerelease",`Version ${p} is a test version, so it isn't installed from here.`);if(!/^\d+(\.\d+){1,3}$/.test(p))return o("bad-version",`GitHub's newest release has a version this app doesn't understand (${d}).`);if(0>=(0,r.compareVersions)(p,t))return o("not-newer",`You already have ${t}, and the newest version is ${p}.`);let c=Array.isArray(e.assets)?e.assets:[],f=e=>c.find(t=>t&&t.name===e)||null,m=f(`Six-Degrees-${p}-${n}.dmg`);if(!m)return o("no-download",`Version ${p} has no download for this Mac (${a[n]||n}).`);let g=f(s);if(!g)return o("no-checksums",`Version ${p} was published without its checksum file (${s}), so its download can't be checked.`);let h=`${u}/${l}/releases/download/${encodeURIComponent(d)}/`;for(let e of[m,g])if(e.browser_download_url!==h+encodeURIComponent(e.name))return o("unexpected-address",`GitHub listed ${e.name} at an unexpected address, so it wasn't downloaded.`);let x=Number(m.size)>0?Number(m.size):null;return x&&x>0x40000000?o("too-large",`The download for version ${p} is unexpectedly large, so it wasn't downloaded.`):{plan:{version:p,tag:d,notes:"string"==typeof e.html_url?e.html_url:null,dmg:{name:m.name,url:m.browser_download_url,size:x},sums:{name:g.name,url:g.browser_download_url}}}},"relaunchArgs",0,function({dataDir:e}={}){let r=["--after-update"];return e&&r.push("--data-dir",t.default.resolve(e)),r},"releaseSource",0,function(e={}){let t=e?.SIX_DEGREES_TEST_RELEASES;if(!t)return{...i,test:!1};let r=null;try{r=new URL(String(t))}catch{}return!r||"http:"!==r.protocol||"127.0.0.1"!==r.hostname||""===r.port||"/"!==r.pathname||r.search||r.hash||r.username||r.password?{...i,test:!1}:{apiBase:r.origin,downloadBase:r.origin,test:!0}},"stagingPath",0,function(e){return t.default.join(t.default.dirname(e),`.${t.default.basename(e)}.incoming`)},"terminalFallback",0,function({bundle:e,refusalCode:t=null,installsTo:r,dataDir:n=null}){if("data-inside-app"===t||"database-elsewhere"===t||"not-owner"===t&&e===r)return null;let s=n?{dataDir:n}:{};return e&&e===r?{mode:"replace",...s}:{mode:"elsewhere",installsTo:r,...s}},"versionAtLeast",0,function(e,t){return(0,r.compareVersions)(e,t)>=0}])}];
-
-//# sourceMappingURL=%5Broot-of-the-server%5D__17hjtzl._.js.map