@bongos/core 1.19.900 → 1.19.901

package/.bongos-core.json

@@ -2,22 +2,22 @@
   "artifact": "bongos-core",
   "manifest_schema": 1,
   "generator": "scripts/gds/package-core.js",
-  "core_version": "1.19.900",
-  "core_contract": "1.19.900",
-  "source_commit": "b8386b789a905d1c25afd561989ef249965fd27f",
+  "core_version": "1.19.901",
+  "core_contract": "1.19.901",
+  "source_commit": "eaeb90f6f672cebb32a56069fe0f4cdab41c983a",
   "source_ref": "HEAD",
-  "built_at": "2026-09-20T05:47:20.635Z",
+  "built_at": "2026-09-20T06:23:47.726Z",
   "redaction": {
     "model": "docs-redacted+functional-verbatim",
     "docs_redacted": 502,
     "agent_docs_stubbed": 26,
-    "functional_verbatim": 2281,
+    "functional_verbatim": 2283,
     "rules": 3,
     "gate_literals": 3,
     "gate": "passed"
   },
-  "file_count": 2809,
-  "tree_sha256": "4b02605822334dafaf22a01bd8c5d34a16066b4f1afa4b9ee147b59d385f3c3b",
+  "file_count": 2811,
+  "tree_sha256": "c3fd3f2ffac72933f622b7cb06be2429710627f38d9a3d541cb1ce7f595cdf6a",
   "files": [
     {
       "path": ".claude/skills/ask-for-help/SKILL.md",
@@ -2097,12 +2097,12 @@
     {
       "path": "docs/copy-inventory.md",
       "mode": "0000644",
-      "sha256": "f1b9049057c56a02af6031f472a2634050753ca1539aa79549f663851db22e54"
+      "sha256": "bee7d1411eaf22aaaf7887b53e1151a0654055f8b4a7f6d78802b1eea766aa71"
     },
     {
       "path": "docs/copy-registry.json",
       "mode": "0000644",
-      "sha256": "969894adbb9bc33d4e6f1656aaaa3ba863aba18a5fa7cdce15922916e4d43a6d"
+      "sha256": "120d68ae5ad77ce670704ccd385b14b523ff7a530742b0038788e480084c6e34"
     },
     {
       "path": "docs/design/apex-pass-2-direction.md",
@@ -2632,7 +2632,7 @@
     {
       "path": "docs/module-api-changelog.md",
       "mode": "0000644",
-      "sha256": "180322d6ddd7b22d93aa7fada4e8124cc9949afc06b97995a8394c1d472a31be"
+      "sha256": "3ff6099cba4fdc3c31689aa4f007bdb23a8aa5fca100f118eb817e44cf8986c0"
     },
     {
       "path": "docs/modules-contract.md",
@@ -5037,7 +5037,7 @@
     {
       "path": "modules/hall-ui/public/profile.js",
       "mode": "0000644",
-      "sha256": "201199cc05841179b975cd46f22a9b82a312a748256733aa758f8fe55bb99aa6"
+      "sha256": "0ca0433fa846d12e2ea2d69084ad406d6e23fbe92e20c7364da4e92e54e26cf4"
     },
     {
       "path": "modules/hall-ui/public/profile.states.json",
@@ -5312,7 +5312,7 @@
     {
       "path": "modules/ideas/descent.js",
       "mode": "0000644",
-      "sha256": "b735a1a1c6bf892ca631b1ae8d1bac7643ea9adf39d243ef8a6c27d83451dbca"
+      "sha256": "778558f148d8b403b64f0714b27436b08c41ae0d21ed18b4ed73939928e05cd4"
     },
     {
       "path": "modules/ideas/homeless-home.js",
@@ -5377,7 +5377,7 @@
     {
       "path": "modules/ideas/routes/inbox.js",
       "mode": "0000644",
-      "sha256": "0f5997e58ca3f8ee33e84948136697519f095670387f0ae26cadb325f2389268"
+      "sha256": "5324f8d2eb8d55decadd371f2c48ee141e88b9aa3d62de0921d467aef401c2ae"
     },
     {
       "path": "modules/ideas/routing.js",
@@ -5394,6 +5394,11 @@
       "mode": "0000644",
       "sha256": "eade9a2d07da0a39af17c086d188a195be00c544889d61454ed3c6368d39ea04"
     },
+    {
+      "path": "modules/ideas/trail-descent.js",
+      "mode": "0000644",
+      "sha256": "2d0693b00dded081b6a0082c450762763d324d54f098a8f42a9aa25ec27370c4"
+    },
     {
       "path": "modules/lifecycle/CLAUDE.md",
       "mode": "0000644",
@@ -7757,12 +7762,12 @@
     {
       "path": "package-lock.json",
       "mode": "0000644",
-      "sha256": "a64d0eb048b0bbaebc11226da0ba59ecf3724630719a4c1e6f598d4e93f7fb64"
+      "sha256": "81176248d1045cd137a823208e30bdf4907b4f08ae1c0c0ff85750a38d2aeed3"
     },
     {
       "path": "package.json",
       "mode": "0000644",
-      "sha256": "0e217566767957cb7ec7607c94c10c1e99bf7b5aba1605e886058ce7929b1c2f"
+      "sha256": "bff9286aa9803a2eedaffb0f0798fcd15a27791208c786a6544424aa04db4a16"
     },
     {
       "path": "public-docs/index.html",
@@ -9772,7 +9777,7 @@
     {
       "path": "src/module-api.js",
       "mode": "0000644",
-      "sha256": "633c325acecc72b19dc2c6758f4bcd8e5712bd4251681bbd25b1aff4e9e907bd"
+      "sha256": "5ac46b294e25abc7c2a076f538a123991a638f3069dd4980ba2b75392942b710"
     },
     {
       "path": "src/module-loader/catalog.js",
@@ -11722,7 +11727,7 @@
     {
       "path": "tests/helpers.mjs",
       "mode": "0000644",
-      "sha256": "d90ec6d640f3a9a389169180d4a852c85e7c3a5336900f93b871673681b8718a"
+      "sha256": "40b3377e8f1e69f5f3465297018c9e148582a23aca85d5ea5802c119620562c6"
     },
     {
       "path": "tests/hierarchy-config.mjs",
@@ -11887,7 +11892,7 @@
     {
       "path": "tests/idea_task_descent.mjs",
       "mode": "0000644",
-      "sha256": "3adfccf9381985ad2fbf4e8911ef6cd0fcb66714a13c77de5a8318d185000d66"
+      "sha256": "36674ef87ccf2d10fca66f4999e62ec8c3518798618c1abfc77f3a6dcc9c330f"
     },
     {
       "path": "tests/idea_task_lineage.mjs",
@@ -11904,6 +11909,11 @@
       "mode": "0000644",
       "sha256": "943afa2366f92c4d6188ce9f8d68f499aac8d67930f91d6860a2cb83020642ab"
     },
+    {
+      "path": "tests/idea_trail_descent.mjs",
+      "mode": "0000644",
+      "sha256": "00701012dbdc9c4d9cb2484aeff4426cb1af0a4643bd979211b361b00af80c69"
+    },
     {
       "path": "tests/idea_triage.mjs",
       "mode": "0000644",
@@ -12577,7 +12587,7 @@
     {
       "path": "tests/profile_activity.mjs",
       "mode": "0000644",
-      "sha256": "840aad045289d95ef44c011934e782da23e5ba687d4b2163da99a54062bbc676"
+      "sha256": "483d249339dd696809a4d9ac53aa10d7b67a35ce064884ef5590cc7249418047"
     },
     {
       "path": "tests/profile_connections_ui.mjs",

package/docs/copy-inventory.md

@@ -4,13 +4,13 @@
 > Deterministic on a given tree — regenerate and commit rather than hand-editing.
 > Machine-readable twin: [`copy-registry.json`](copy-registry.json).
 
-**1826 strings** across 3 surfaces · 1584 distinct pieces of copy · 1826 certain, 0 heuristic · 166 shown in more than one place.
+**1827 strings** across 3 surfaces · 1585 distinct pieces of copy · 1827 certain, 0 heuristic · 166 shown in more than one place.
 
 ## Surfaces
 
 | surface | lives at | files | strings |
 |---|---|---|---|
-| `builders-hall` | `modules/hall-ui/public` | 84 | 1336 |
+| `builders-hall` | `modules/hall-ui/public` | 84 | 1337 |
 | `status-dashboard` | `modules/status-ui/public` | 4 | 100 |
 | `landing` | `modules/public-landing/public` | 5 | 390 |
 
@@ -78,7 +78,7 @@ Identical copy within one surface. Sometimes right (a repeated button), sometime
 | `996edffc1966` | 2x | Access requests | modules/hall-ui/public/watch.html:46, modules/hall-ui/public/watch.html:61 |
 | … | | _126 more in the JSON registry_ | |
 
-## `builders-hall` — 1336 strings
+## `builders-hall` — 1337 strings
 
 | id | conf | text | where |
 |---|---|---|---|
@@ -309,7 +309,7 @@ Identical copy within one surface. Sometimes right (a repeated button), sometime
 | `7775fec0fa85` | certain | Could not load sessions. | `modules/hall-ui/public/sessions.js:437` |
 | `a2f2e8babef5` | certain | Could not load that page. Try again. | `modules/hall-ui/public/blockers.js:274` |
 | `b2147cc90e36` | certain | Could not load the idea template. Reload, or file from the terminal with capture.js. | `modules/hall-ui/public/ideas.js:626` |
-| `7604af13c40e` | certain | Could not load the profile. | `modules/hall-ui/public/profile.js:790` |
+| `7604af13c40e` | certain | Could not load the profile. | `modules/hall-ui/public/profile.js:836` |
 | `8b69e445592a` | certain | Could not load the question labels; showing the answers as stored. | `modules/hall-ui/public/idea.js:244` |
 | `edd5bafbe075` | certain | Could not load the queue just now. | `modules/hall-ui/public/ideas.js:565` |
 | `02bb0570996a` | certain | Could not load the ranks. | `modules/hall-ui/public/ranks.js:197` |
@@ -601,7 +601,7 @@ Identical copy within one surface. Sometimes right (a repeated button), sometime
 | `6e73716aec6c` | certain | May be offered for sale later | `modules/hall-ui/public/settings.html:297` |
 | `df335a1224ae` | certain | Member since {…} | `modules/hall-ui/public/hall-render.js:563` |
 | `df335a1224ae` | certain | Member since {…} | `modules/hall-ui/public/profile.js:94` |
-| `c7a670e9552d` | certain | Merged into | `modules/hall-ui/public/profile.js:406` |
+| `c7a670e9552d` | certain | Merged into | `modules/hall-ui/public/profile.js:452` |
 | `dce0546c9e34` | certain | Merging work does not put it in front of anyone. This is the step that does: it moves this platform — or any p | `modules/hall-ui/public/deploy.html:39` |
 | `7637613c231b` | certain | Metic rank and above may vote | `modules/hall-ui/public/builders.js:781` |
 | `91328a97fe68` | certain | Mingle pairs you with someone from another role. Saying no costs nothing. | `modules/hall-ui/public/collab.html:87` |
@@ -919,7 +919,7 @@ Identical copy within one surface. Sometimes right (a repeated button), sometime
 | `9d4372b173cf` | certain | Standing sections | `modules/hall-ui/public/index.html:79` |
 | `ec1c2dae4a90` | certain | Standing there | `modules/hall-ui/public/profile.js:314` |
 | `eaad12cacb9d` | certain | Start over | `modules/hall-ui/public/studio.js:235` |
-| `efe530c0e3a7` | certain | Still open | `modules/hall-ui/public/profile.js:411` |
+| `efe530c0e3a7` | certain | Still open | `modules/hall-ui/public/profile.js:457` |
 | `9a4ced1afb6c` | certain | Stop waiting on task {…} | `modules/hall-ui/public/task.js:278` |
 | `b0861c874a2f` | certain | Stopped using it. | `modules/hall-ui/public/settings-specialities.js:200` |
 | `6c6544f5c011` | certain | Stored encrypted; never shown again after saving — only its last four digits. | `modules/hall-ui/public/settings.html:193` |
@@ -1180,6 +1180,7 @@ Identical copy within one surface. Sometimes right (a repeated button), sometime
 | `bc960f460250` | certain | and install dependencies ( | `modules/hall-ui/public/hall-render.js:864` |
 | `2177da93be9b` | certain | and leave this alone. | `modules/hall-ui/public/settings.html:339` |
 | `b867876e8b6c` | certain | and press Enter. | `modules/hall-ui/public/hall-render.js:825` |
+| `0257cb508ae7` | certain | and {…} more below this thought | `modules/hall-ui/public/profile.js:415` |
 | `d86265f99668` | certain | and {…} more waiting{…} | `modules/hall-ui/public/studio.js:277` |
 | `520853131591` | certain | artist mode | `modules/hall-ui/public/studio.html:36` |
 | `b4033000c537` | certain | as a table | `modules/hall-ui/public/profile-charts.js:205` |
@@ -1352,7 +1353,7 @@ Identical copy within one surface. Sometimes right (a repeated button), sometime
 | `cc5106af4b35` | certain | {…} of {…} criteria satisfied | `modules/hall-ui/public/goals-lib.js:32` |
 | `cc5106af4b35` | certain | {…} of {…} criteria satisfied | `modules/hall-ui/public/goals-render.js:682` |
 | `cc5106af4b35` | certain | {…} of {…} criteria satisfied | `modules/hall-ui/public/goals.js:45` |
-| `c3d9687e2375` | certain | {…} of {…} shipped | `modules/hall-ui/public/profile.js:512` |
+| `c3d9687e2375` | certain | {…} of {…} shipped | `modules/hall-ui/public/profile.js:558` |
 | `f32710d0ef37` | certain | {…} of {…} steps cleared. | `modules/hall-ui/public/hall-render.js:1037` |
 | `60743fe1e40d` | certain | {…} per page | `modules/hall-ui/public/hall-kit.js:74` |
 | `154bc518bab4` | certain | {…} proposed | `modules/hall-ui/public/government.js:695` |

package/docs/copy-registry.json

@@ -3,9 +3,9 @@
   "generator": "scripts/gds/copy-inventory.js",
   "goal": 1000074,
   "counts": {
-    "strings": 1826,
-    "unique_ids": 1584,
-    "certain": 1826,
+    "strings": 1827,
+    "unique_ids": 1585,
+    "certain": 1827,
     "heuristic": 0,
     "duplicate_ids": 166
   },
@@ -13,7 +13,7 @@
     "builders-hall": {
       "at": "modules/hall-ui/public",
       "files": 84,
-      "strings": 1336
+      "strings": 1337
     },
     "status-dashboard": {
       "at": "modules/status-ui/public",
@@ -3824,7 +3824,7 @@
       "surface": "builders-hall",
       "text": "Could not load the profile.",
       "file": "modules/hall-ui/public/profile.js",
-      "line": 790,
+      "line": 836,
       "origin": "js-notice",
       "confidence": "certain"
     },
@@ -6452,7 +6452,7 @@
       "surface": "builders-hall",
       "text": "Merged into",
       "file": "modules/hall-ui/public/profile.js",
-      "line": 406,
+      "line": 452,
       "origin": "js-markup",
       "confidence": "certain"
     },
@@ -9314,7 +9314,7 @@
       "surface": "builders-hall",
       "text": "Still open",
       "file": "modules/hall-ui/public/profile.js",
-      "line": 411,
+      "line": 457,
       "origin": "js-markup",
       "confidence": "certain"
     },
@@ -11658,6 +11658,15 @@
       "origin": "js-markup",
       "confidence": "certain"
     },
+    {
+      "id": "0257cb508ae7",
+      "surface": "builders-hall",
+      "text": "and {…} more below this thought",
+      "file": "modules/hall-ui/public/profile.js",
+      "line": 415,
+      "origin": "js-markup",
+      "confidence": "certain"
+    },
     {
       "id": "d86265f99668",
       "surface": "builders-hall",
@@ -13211,7 +13220,7 @@
       "surface": "builders-hall",
       "text": "{…} of {…} shipped",
       "file": "modules/hall-ui/public/profile.js",
-      "line": 512,
+      "line": 558,
       "origin": "js-markup",
       "confidence": "certain"
     },

package/docs/module-api-changelog.md

@@ -2274,5 +2274,7 @@ is load-bearing: the script throws rather than guess if it is missing, and
         landed since 1.19.898 with no explicit bump. run 35488237998. (task 1002620)
   1.19.900 — CI auto-patch (publish-on-merge, ADR 0161): carrier for merges
         landed since 1.19.899 with no explicit bump. run 35492534307. (task 1002620)
+  1.19.901 — CI auto-patch (publish-on-merge, ADR 0161): carrier for merges
+        landed since 1.19.900 with no explicit bump. run 35494090938. (task 1002620)
 ---------------------------------------------------------------------------
 ```

package/modules/hall-ui/public/profile.js

@@ -378,9 +378,55 @@
   const ideaHref = (id) => href(`${hallBase()}/idea/${encodeURIComponent(id)}`);
   const goalHref = (id) => href(`${hallBase()}/goals#/goal/${encodeURIComponent(id)}`);
 
+  // THE DESCENT — everything an idea's tasks went on to cause, at any depth and
+  // across version boundaries (task 1004089, BV2.R09; ADR 0312). Served as
+  // `descent_tasks`, already ordered nearest-first by the server, each entry at
+  // its shortest depth from one of the idea's own tasks.
+  //
+  // WHY IT RENDERS HERE, under the outcome and not beside it. The outcome line
+  // answers "what became of my idea" with the FIRST thing it became, which is
+  // all the trail could ever say while the read was one hop. The descent is the
+  // rest of that sentence, so it belongs in the same cell, subordinate to it.
+  //
+  // CAPPED, and the cap says so. The whole descent is the idea page's job
+  // (BV2.R10); a ledger row that paints forty tasks stops being a row. The
+  // overflow is a LINK to that page, never a silent truncation.
+  const DESCENT_SHOWN = 6;
+  function descentHtml(idea) {
+    const rows = Array.isArray(idea.descent_tasks) ? idea.descent_tasks : [];
+    if (!rows.length) return '';
+    const cells = rows.slice(0, DESCENT_SHOWN).map((t) => {
+      // The version is printed rather than compared away. A descendant living
+      // in a LATER version is the interesting case — it is the proof that an
+      // origin tag survives a version boundary — so it is labelled, not
+      // filtered and not silently flattened into the idea's own version.
+      const meta = [
+        `${escapeHtml(String(t.relation || 'descends'))}`,
+        `depth ${escapeHtml(String(t.depth))}`,
+        t.version_id ? escapeHtml(String(t.version_id)) : null,
+      ].filter(Boolean).join(' · ');
+      return `<span style="display:block;margin-top:2px">`
+        + `<a href="${taskHref(t.task_id)}">#${escapeHtml(String(t.task_id))} ${escapeHtml(t.title || '')}</a>`
+        + ` <span style="font-size:11px;color:var(--ink-faint)">${meta}</span>`
+        + `</span>`;
+    }).join('');
+    const rest = rows.length - DESCENT_SHOWN;
+    const more = rest > 0
+      ? `<span style="display:block;margin-top:2px;font-size:12px"><a href="${ideaHref(idea.id)}">and ${escapeHtml(String(rest))} more below this thought</a></span>`
+      : '';
+    return `<span style="display:block;margin-top:4px;font-size:12px;color:var(--ink-faint)">`
+      + `Then caused ${escapeHtml(String(rows.length))} ${rows.length === 1 ? 'task' : 'tasks'}</span>`
+      + cells + more;
+  }
+
   // What became of one idea, in a sentence a person can read. The four outcomes
   // the criterion names, each linked through to the thing it became.
   function ideaOutcomeHtml(idea) {
+    // The descent rides under EVERY outcome, not just a promotion: a merged
+    // idea inherits the descent of the idea it merged into (that is what
+    // "nothing is lost" means), and an idea whose first task was later split
+    // has a descent whatever its own status says.
+    const descent = descentHtml(idea);
     const note = idea.triage_note
       ? `<span style="display:block;margin-top:2px;font-size:12px;color:var(--ink-faint)">${escapeHtml(idea.triage_note)}</span>`
       : '';
@@ -396,19 +442,19 @@
           : []);
       // 'promoted' with nothing to point at is a real (old) state, not a bug to
       // paper over — say what is known rather than inventing a link.
-      if (!links.length) return `<span class="task__tag">Promoted</span>${note}`;
-      return `<span class="task__tag">Became ${links.length === 1 ? 'a task' : `${links.length} tasks`}</span> ${links.join(' · ')}${note}`;
+      if (!links.length) return `<span class="task__tag">Promoted</span>${note}${descent}`;
+      return `<span class="task__tag">Became ${links.length === 1 ? 'a task' : `${links.length} tasks`}</span> ${links.join(' · ')}${note}${descent}`;
     }
     if (idea.status === 'merged') {
       const target = idea.merged_into_idea_id
         ? ` <a href="${ideaHref(idea.merged_into_idea_id)}">#${escapeHtml(String(idea.merged_into_idea_id))} ${escapeHtml(idea.merged_into_idea_title || '')}</a>`
         : '';
-      return `<span class="task__tag">Merged into</span>${target}${note}`;
+      return `<span class="task__tag">Merged into</span>${target}${note}${descent}`;
     }
     if (idea.status === 'discarded') {
-      return `<span class="task__tag">Discarded</span>${note}`;
+      return `<span class="task__tag">Discarded</span>${note}${descent}`;
     }
-    return `<span class="task__tag">Still open</span>${note}`;
+    return `<span class="task__tag">Still open</span>${note}${descent}`;
   }
 
   // One ledger driven by one server-paged endpoint. `fetchPage(offset, perPage)`

package/modules/ideas/descent.js

@@ -22,8 +22,94 @@ const DESCENT_MAX_DEPTH = 64;
 
 const DESCENT_RELATIONS = Object.freeze(['rewrite', 'split', 'merge', 'fold', 'cascade']);
 
-// walk — breadth-first over the edge table, one query PER LEVEL.
+// ── the walk: one implementation, batched and single-root ─────────────────
+// walkMany — a breadth-first walk from MANY roots at once: ONE query per LEVEL
+// for the whole set, rather than one walk per root.
 //
+// WHY THE BATCH IS THE POINT OF THIS FUNCTION (task 1004089, BV2.R09). The
+// descent is read for a PAGE of ideas, not for one. Walking each root on its
+// own costs (roots x depth) round trips, which is the 4-6 serial round trips
+// per read that sank the previous attempt at this read. Batched, the cost is
+// depth round trips for the whole page — INDEPENDENT of how many ideas the page
+// carries, which is the property tests/idea_trail_descent.mjs pins.
+//
+// WHY NOT A RECURSIVE CTE, which collapses it to literally one query: the walk
+// comment above says it, and nothing about batching changes that argument. A
+// CTE re-expands every path, so a convergent DAG costs work exponential in
+// depth; here the whole page costs at most one query per level whatever the
+// shape. One query per level is the floor a walk that must not blow up can
+// reach, and this is that floor.
+//
+// PER-ROOT ATTRIBUTION is why the row carries `from_id`. The union of every
+// root's frontier goes to the database in one array, so a row coming back has
+// to say which frontier node produced it or the answer cannot be split back
+// apart. Depth is per-root and must stay that way: the payout decays by the
+// depth from THAT origin, so one shared answer would pay the wrong rate.
+//
+// Returns Map<rootKey, rows> — rootKey is String(rootId), rows exactly as the
+// single-root walk returns them.
+async function walkMany(startIds, direction, { maxDepth = DESCENT_MAX_DEPTH, client = null } = {}) {
+  const q = client || pool;
+  // Two literal statements rather than one with an interpolated column name:
+  // nothing here is caller-controlled, and a query built by concatenation is a
+  // shape a reader (and a scanner) has to stop and prove safe.
+  const SQL_UP = `SELECT parent_task_id AS id, task_id AS from_id, relation
+                    FROM ideas_task_descent
+                   WHERE task_id = ANY($1::bigint[])`;
+  const SQL_DOWN = `SELECT task_id AS id, parent_task_id AS from_id, relation
+                      FROM ideas_task_descent
+                     WHERE parent_task_id = ANY($1::bigint[])`;
+  const sql = direction === 'up' ? SQL_UP : SQL_DOWN;
+
+  // A root that is not a positive integer is dropped here rather than sent to
+  // the database as part of a bigint[]. linkTaskDescent already rejects a bad
+  // id by name before it ever walks; this is the second line, for the readers
+  // that take their roots from a row rather than from an argument.
+  const roots = [...new Set((startIds || []).map((r) => String(r)))].filter((r) => /^[1-9]\d*$/.test(r));
+
+  // One independent walk state per root, stepped in lockstep so that every
+  // root's frontier is expanded by the same query.
+  const state = new Map();
+  for (const r of roots) {
+    state.set(r, { found: new Map(), visited: new Set([r]), frontier: [Number(r)] });
+  }
+
+  for (let depth = 1; depth <= maxDepth; depth += 1) {
+    const union = new Set();
+    for (const s of state.values()) for (const n of s.frontier) union.add(n);
+    if (union.size === 0) break;
+    const { rows } = await q.query(sql, [[...union]]);
+    // from_id -> the edges it produced, so each root can expand only the nodes
+    // that were actually on ITS frontier.
+    const adjacency = new Map();
+    for (const row of rows) {
+      const from = String(row.from_id);
+      if (!adjacency.has(from)) adjacency.set(from, []);
+      adjacency.get(from).push(row);
+    }
+    for (const s of state.values()) {
+      const next = [];
+      for (const node of s.frontier) {
+        for (const edge of adjacency.get(String(node)) || []) {
+          const key = String(edge.id);
+          if (s.visited.has(key)) continue;   // already reached at a shallower depth
+          s.visited.add(key);
+          s.found.set(key, { id: edge.id, depth, relation: edge.relation });
+          next.push(Number(edge.id));
+        }
+      }
+      s.frontier = next;
+    }
+  }
+
+  const out = new Map();
+  for (const [root, s] of state) {
+    out.set(root, [...s.found.values()].sort((a, b) => a.depth - b.depth || Number(a.id) - Number(b.id)));
+  }
+  return out;
+}
+
+// Both of the above are breadth-first over the edge table, one query PER LEVEL.
 // WHY NOT A RECURSIVE CTE, which is the obvious shape and was the first cut.
 // A recursive CTE's working table re-expands every path independently, so a
 // densely-connected DAG — paths that converge and diverge again, which is
@@ -43,37 +129,13 @@ const DESCENT_RELATIONS = Object.freeze(['rewrite', 'split', 'merge', 'fold', 'c
 // The cost is one round trip per level instead of one per walk. Depth decay
 // halves each hop (spec decision 16), so a descent deep enough for that to
 // matter is already worth almost nothing.
-async function walk(startId, direction, { maxDepth = DESCENT_MAX_DEPTH, client = null } = {}) {
-  const q = client || pool;
-  // Two literal statements rather than one with an interpolated column name:
-  // nothing here is caller-controlled, and a query built by concatenation is a
-  // shape a reader (and a scanner) has to stop and prove safe.
-  const SQL_UP = `SELECT parent_task_id AS id, relation
-                    FROM ideas_task_descent
-                   WHERE task_id = ANY($1::bigint[])`;
-  const SQL_DOWN = `SELECT task_id AS id, relation
-                      FROM ideas_task_descent
-                     WHERE parent_task_id = ANY($1::bigint[])`;
-  const sql = direction === 'up' ? SQL_UP : SQL_DOWN;
-
-  const found = new Map();
-  const visited = new Set([String(startId)]);
-  let frontier = [Number(startId)];
-
-  for (let depth = 1; depth <= maxDepth && frontier.length > 0; depth += 1) {
-    const { rows } = await q.query(sql, [frontier]);
-    const next = [];
-    for (const r of rows) {
-      const key = String(r.id);
-      if (visited.has(key)) continue;   // already reached at a shallower depth
-      visited.add(key);
-      found.set(key, { id: r.id, depth, relation: r.relation });
-      next.push(Number(r.id));
-    }
-    frontier = next;
-  }
-
-  return [...found.values()].sort((a, b) => a.depth - b.depth || Number(a.id) - Number(b.id));
+// walk — the single-root walk, which is walkMany with one root. ONE
+// implementation on purpose: the payout (R11) walks up and the descent surface
+// (R10) walks down, and a second copy of the de-duplication would be free to
+// drift from this one — a drift that shows up as money, not as a render bug.
+async function walk(startId, direction, opts = {}) {
+  const byRoot = await walkMany([startId], direction, opts);
+  return byRoot.get(String(startId)) || [];
 }
 
 // ancestorsOfTask — every task this one descends from, nearest first, each at
@@ -87,6 +149,14 @@ function descendantsOfTask(taskId, opts = {}) {
   return walk(taskId, 'down', opts);
 }
 
+// descendantsOfTasks — the descent below SEVERAL roots, in one batch. What the
+// trail read (modules/ideas/trail-descent.js) consumes: a page of ideas has a
+// root task per promotion, and the whole page must cost one query per level,
+// not one walk per idea. Returns Map<String(rootId), rows>.
+function descendantsOfTasks(taskIds, opts = {}) {
+  return walkMany(taskIds, 'down', opts);
+}
+
 // linkTaskDescent — record that `taskId` came out of `parentTaskId`.
 //
 // Idempotent on the pair, because the derivation below runs on every ship and
@@ -209,6 +279,7 @@ module.exports = {
   linkTaskDescent,
   ancestorsOfTask,
   descendantsOfTask,
+  descendantsOfTasks,
   deriveEdgesForTask,
   syncDescentForTask,
 };

package/modules/ideas/routes/inbox.js

@@ -35,6 +35,10 @@
 const express = require('express');
 const api = require('../../../src/module-api');
 const inbox = require('../inbox');
+// The trail read to the FULL depth of the descent (task 1004089, BV2.R09). Its
+// own file because inbox.js is AT the size ratchet and because a task->task
+// walk is a different relation from the idea->task trail.
+const { attachDescentToTrail } = require('../trail-descent');
 // Full Idea capture (task 1002919 / BV1.R143): the template validator (R141)
 // and the deterministic scorer (R142) — both pure, both walk the declaration.
 const { validateFieldValues, templateFor, fieldOrder } = require('../templates');
@@ -552,6 +556,12 @@ module.exports = function buildInboxRouter() {
       inbox.listIdeaTrailForBuilder(builderId, { limit, offset, viewerRank }),
       inbox.countIdeaTrailForBuilder(builderId, { viewerRank }),
     ]);
+    // Everything those tasks went on to cause, to any depth and across version
+    // boundaries (BV2.R09, ADR 0312). Composed here rather than inside the trail
+    // read: the descent is a task->task walk, the trail is an idea->task read,
+    // and the walk is batched across the WHOLE page — so it stays one query per
+    // level however many ideas the window carries, never one walk per idea.
+    await attachDescentToTrail(ideas);
     return res.json({ builder_id: builderId, ideas, total, limit, offset });
   }, { errorCode: 'idea_trail_failed' }));