@davesheffer/hunch 1.47.2 → 1.48.0

package/LICENSE

@@ -1,201 +1,105 @@
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2026 Dave Sheffer
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
+# Functional Source License, Version 1.1, ALv2 Future License
+
+## Abbreviation
+
+FSL-1.1-ALv2
+
+## Notice
+
+Copyright 2026 Dave Sheffer
+
+## Terms and Conditions
+
+### Licensor ("We")
+
+The party offering the Software under these Terms and Conditions.
+
+### The Software
+
+The "Software" is each version of the software that we make available under
+these Terms and Conditions, as indicated by our inclusion of these Terms and
+Conditions with the Software.
+
+### License Grant
+
+Subject to your compliance with this License Grant and the Patents,
+Redistribution and Trademark clauses below, we hereby grant you the right to
+use, copy, modify, create derivative works, publicly perform, publicly display
+and redistribute the Software for any Permitted Purpose identified below.
+
+### Permitted Purpose
+
+A Permitted Purpose is any purpose other than a Competing Use. A Competing Use
+means making the Software available to others in a commercial product or
+service that:
+
+1. substitutes for the Software;
+
+2. substitutes for any other product or service we offer using the Software
+   that exists as of the date we make the Software available; or
+
+3. offers the same or substantially similar functionality as the Software.
+
+Permitted Purposes specifically include using the Software:
+
+1. for your internal use and access;
+
+2. for non-commercial education;
+
+3. for non-commercial research; and
+
+4. in connection with professional services that you provide to a licensee
+   using the Software in accordance with these Terms and Conditions.
+
+### Patents
+
+To the extent your use for a Permitted Purpose would necessarily infringe our
+patents, the license grant above includes a license under our patents. If you
+make a claim against any party that the Software infringes or contributes to
+the infringement of any patent, then your patent license to the Software ends
+immediately.
+
+### Redistribution
+
+The Terms and Conditions apply to all copies, modifications and derivatives of
+the Software.
+
+If you redistribute any copies, modifications or derivatives of the Software,
+you must include a copy of or a link to these Terms and Conditions and not
+remove any copyright notices provided in or with the Software.
+
+### Disclaimer
+
+THE SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTIES OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING WITHOUT LIMITATION WARRANTIES OF FITNESS FOR A PARTICULAR
+PURPOSE, MERCHANTABILITY, TITLE OR NON-INFRINGEMENT.
+
+IN NO EVENT WILL WE HAVE ANY LIABILITY TO YOU ARISING OUT OF OR RELATED TO THE
+SOFTWARE, INCLUDING INDIRECT, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES,
+EVEN IF WE HAVE BEEN INFORMED OF THEIR POSSIBILITY IN ADVANCE.
+
+### Trademarks
+
+Except for displaying the License Details and identifying us as the origin of
+the Software, you have no right under these Terms and Conditions to use our
+trademarks, trade names, service marks or product names.
+
+## Grant of Future License
+
+We hereby irrevocably grant you an additional license to use the Software under
+the Apache License, Version 2.0 that is effective on the second anniversary of
+the date we make the Software available. On or after that date, you may use the
+Software under the Apache License, Version 2.0, in which case the following
+will apply:
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this file except in compliance with the License.
+
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software distributed
+under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+CONDITIONS OF ANY KIND, either express or implied. See the License for the
+specific language governing permissions and limitations under the License.

package/NOTICE

@@ -1,6 +1,13 @@
 Hunch — Engineering Memory and Change Gate
 Copyright 2026 Dave Sheffer
 
-This product is licensed under the Apache License, Version 2.0.
-See the LICENSE file for the full license text, or
-http://www.apache.org/licenses/LICENSE-2.0
+This product is licensed under the Functional Source License, Version 1.1,
+ALv2 Future License (FSL-1.1-ALv2). See the LICENSE file for the full text,
+or https://fsl.software. Each version becomes available under the Apache
+License, Version 2.0 on the second anniversary of its release.
+
+Versions released before the switch to FSL-1.1-ALv2 remain available under
+the license they shipped with (Apache-2.0 from v0.15.2, MIT before that).
+
+The Python client in clients/python is licensed separately under the Apache
+License, Version 2.0; see clients/python/LICENSE.

package/README.md

@@ -4,7 +4,13 @@
 
 [![npm version](https://img.shields.io/npm/v/@davesheffer/hunch?color=2742ff&label=npm)](https://www.npmjs.com/package/@davesheffer/hunch)
 [![GitHub stars](https://img.shields.io/github/stars/davesheffer/hunch?color=2742ff&label=%E2%98%85%20star)](https://github.com/davesheffer/hunch)
-[![license](https://img.shields.io/npm/l/@davesheffer/hunch?color=2742ff)](LICENSE)
+[![license](https://img.shields.io/badge/license-FSL--1.1--ALv2-2742ff)](LICENSE)
+
+[![Watch: Hunch Memory in 2 minutes](https://img.youtube.com/vi/m2PM6pV7D9Y/maxresdefault.jpg)](https://www.youtube.com/watch?v=m2PM6pV7D9Y)
+
+▶ **[Watch Hunch Memory in 2 minutes](https://www.youtube.com/watch?v=m2PM6pV7D9Y)**, then the [7-episode series](https://www.youtube.com/playlist?list=PLIXqtdE0LcNI) on setup, hooks, memory capture, delivery, rules, drift and teams.
+
+![Hunch refuses a staged change that imports lodash, citing the blocking rule it breaks](site/assets/hunch-blocks-it.gif)
 
 A new agent session should not mean explaining the project all over again. A second agent should be able to check a recorded decision, see the evidence behind completed work, and find an outstanding commitment.
 
@@ -12,10 +18,6 @@ Hunch keeps that record in Git and makes the relevant parts available to your ag
 
 The goal is simple: agents working from the same maintained record, with sources they can inspect. Hunch supplies memory and checks; the assistant still does the work.
 
-[![Watch: Hunch Memory in 2 minutes](https://img.youtube.com/vi/m2PM6pV7D9Y/maxresdefault.jpg)](https://www.youtube.com/watch?v=m2PM6pV7D9Y)
-
-▶ **[Watch Hunch Memory in 2 minutes](https://www.youtube.com/watch?v=m2PM6pV7D9Y)**, then the [7-episode series](https://www.youtube.com/playlist?list=PLIXqtdE0LcNI) on setup, hooks, memory capture, delivery, rules, drift and teams.
-
 ## Start with your coding assistant
 
 Requires **Node 22.13+** and a Git repository.
@@ -196,4 +198,4 @@ Profiles retain their revision, sources, confidence, and freshness.
 - [VS Code extension](vscode-extension/README.md)
 - [Contributing](CONTRIBUTING.md)
 
-Apache-2.0
+[FSL-1.1-ALv2](LICENSE) (Functional Source License). Use it, modify it, and run it for your own work, internal or commercial; you can't make it available to others in a commercial product or service that competes with Hunch or with services built on it (see Permitted Purpose in [LICENSE](LICENSE)). Each release converts to Apache-2.0 two years after it ships. Releases before this change keep the license they shipped with.

package/dist/cli/index.js

@@ -857,7 +857,7 @@ program
         if (ctxWarning !== null)
             console.log(ctxWarning);
     }
-    let written = 0, skipped = 0, llm = 0, heuristic = 0;
+    let written = 0, skipped = 0, llm = 0, heuristic = 0, fellBack = 0;
     const home = store.captureHome(false);
     // The per-commit cost is the Claude synthesis spawn; run several at once. Safe:
     // each commit drafts independently and writes its OWN decision file atomically,
@@ -869,11 +869,17 @@ program
         if (r.status === "written") {
             written++;
             // Any non-deterministic provider (claude/codex/cursor/ensemble) is an LLM draft.
-            if (r.provider && r.provider !== "deterministic")
+            // A provider failure that fell back is counted apart from the commits the
+            // significance gate sent to the heuristic on purpose (issue #561).
+            if (r.fallbackReason)
+                fellBack++;
+            else if (r.provider && r.provider !== "deterministic")
                 llm++;
             else
                 heuristic++;
-            process.stdout.write(`  ✓ ${sha.slice(0, 8)} ${r.decision?.title.slice(0, 64) ?? ""}\n`);
+            process.stdout.write(`  ${r.fallbackReason ? "⚠" : "✓"} ${sha.slice(0, 8)} ${r.decision?.title.slice(0, 64) ?? ""}\n`);
+            if (r.fallbackReason)
+                process.stdout.write(`      heuristic draft instead: ${r.fallbackReason}\n`);
         }
         else
             skipped++;
@@ -885,7 +891,8 @@ program
         pumpMemoryHome(store, root, home, `hunch: backfill ${written} decision(s)`);
     // Honest tally of where the tokens went: trivial commits are seeded by the
     // free deterministic heuristic, only substantive ones spend the LLM.
-    console.log(`Done: ${written} decision(s) seeded (${llm} via LLM, ${heuristic} heuristic), ${skipped} skipped (trivial/not substantive/already-captured).`);
+    const fellBackNote = fellBack ? `, ${fellBack} heuristic after the LLM failed` : "";
+    console.log(`Done: ${written} decision(s) seeded (${llm} via LLM, ${heuristic} heuristic${fellBackNote}), ${skipped} skipped (trivial/not substantive/already-captured).`);
     store.close();
 });
 // ---- sync (post-commit hook) ----------------------------------------------
@@ -948,6 +955,8 @@ program
         store.reindex();
         if (!opts.quiet)
             console.log(`✓ captured decision ${r.decision?.id} via ${r.provider}: "${r.decision?.title}"`);
+        if (!opts.quiet && r.fallbackReason)
+            console.log(`  ⚠ heuristic draft instead: ${r.fallbackReason}`);
     }
     else if (!opts.quiet) {
         console.log(`· skipped: ${r.reason}`);
@@ -2084,7 +2093,7 @@ program
     else {
         console.log(`Top matches for "${q}"${how}:\n`);
         for (const h of hits)
-            console.log(formatSearchHit(h, isStateKind(h.kind) ? store.resolve(h.ref)?.record : undefined));
+            console.log(formatSearchHit(h, isStateKind(h.kind) || h.kind === "decisions" ? store.resolve(h.ref)?.record : undefined));
     }
     store.close();
 });

package/dist/core/format.d.ts

@@ -7,7 +7,9 @@ export declare function formatContext(ctx: AssembledContext, options?: DeliveryO
 /** One search hit as `hunch query` / hunch_query print it (headline + indented detail line).
  *  Graph records keep their `[kind] id — title` shape; a nuryel.state/1 hit renders through
  *  renderStateLine (`[commitment/in_force] customer:Site:7 — "send report" due … (owner …)`)
- *  with the record id on the detail line, so both readers say the same thing. */
+ *  with the record id on the detail line, so both readers say the same thing. A decision that
+ *  is no longer accepted says so in its tag (`[decisions · superseded → dec_new]`), so a
+ *  reader never takes a history hit for the current rule. */
 export declare function formatSearchHit(hit: SearchHit, record: unknown): string;
 /** Render a StructureView as a compact orientation brief (hunch_structure). */
 export declare function formatStructure(v: StructureView): string;

package/dist/core/format.js

@@ -6,12 +6,24 @@ export function formatContext(ctx, options = {}) {
 /** One search hit as `hunch query` / hunch_query print it (headline + indented detail line).
  *  Graph records keep their `[kind] id — title` shape; a nuryel.state/1 hit renders through
  *  renderStateLine (`[commitment/in_force] customer:Site:7 — "send report" due … (owner …)`)
- *  with the record id on the detail line, so both readers say the same thing. */
+ *  with the record id on the detail line, so both readers say the same thing. A decision that
+ *  is no longer accepted says so in its tag (`[decisions · superseded → dec_new]`), so a
+ *  reader never takes a history hit for the current rule. */
 export function formatSearchHit(hit, record) {
     if (isStateKind(hit.kind) && record) {
         return `• ${renderStateLine(hit.kind, record)}\n    ${hit.ref}`;
     }
-    return `• [${hit.kind}] ${hit.ref} — ${hit.title}\n    ${hit.snippet}`;
+    return `• [${hit.kind}${decisionStatusTag(hit.kind, record)}] ${hit.ref} — ${hit.title}\n    ${hit.snippet}`;
+}
+function decisionStatusTag(kind, record) {
+    if (kind !== "decisions" || !record)
+        return "";
+    const { status, superseded_by, valid_to } = record;
+    if (superseded_by)
+        return ` · superseded → ${superseded_by}`;
+    if (status && status !== "accepted")
+        return ` · ${status}`;
+    return valid_to ? ` · closed ${valid_to.slice(0, 10)}` : "";
 }
 /** Render a StructureView as a compact orientation brief (hunch_structure). */
 export function formatStructure(v) {

package/dist/core/reviewMemory.d.ts

@@ -13,8 +13,8 @@ declare const commentSchema: z.ZodObject<{
     user: z.ZodObject<{
         login: z.ZodString;
         type: z.ZodEnum<{
-            User: "User";
             Bot: "Bot";
+            User: "User";
         }>;
     }, z.core.$strip>;
 }, z.core.$strip>;

package/dist/extractors/parse.js

@@ -242,6 +242,22 @@ function ascendToDef(node, defNodeTypes) {
     }
     return null;
 }
+/** Index in `symbols` of the narrowest symbol whose [startByte, endByte) range
+ *  holds `at`; on equal spans the earlier symbol wins. -1 when nothing encloses it. */
+function innermostSymbolAt(symbols, at) {
+    let found = -1;
+    let narrowest = Infinity;
+    symbols.forEach((sym, i) => {
+        if (at < sym.startByte || at >= sym.endByte)
+            return;
+        const span = sym.endByte - sym.startByte;
+        if (span < narrowest) {
+            narrowest = span;
+            found = i;
+        }
+    });
+    return found;
+}
 /** Map each call site to the innermost symbol whose byte-range contains it.
  *  The result is keyed by the symbol's INDEX in `parsed.symbols`, not its start
  *  byte: two distinct symbols can share a start byte (a synthetic whole-file root
@@ -252,17 +268,8 @@ function ascendToDef(node, defNodeTypes) {
 export function attributeCalls(parsed) {
     const out = new Map();
     for (const call of parsed.calls) {
-        let best = null;
-        let bestIndex = -1;
-        for (let i = 0; i < parsed.symbols.length; i++) {
-            const s = parsed.symbols[i];
-            if (call.atByte >= s.startByte && call.atByte < s.endByte) {
-                if (!best || s.endByte - s.startByte < best.endByte - best.startByte) {
-                    best = s;
-                    bestIndex = i;
-                }
-            }
-        }
+        const bestIndex = innermostSymbolAt(parsed.symbols, call.atByte);
+        const best = bestIndex >= 0 ? parsed.symbols[bestIndex] : undefined;
         if (best && best.name !== call.callee) {
             let m = out.get(bestIndex);
             if (!m) {
@@ -305,15 +312,7 @@ export function attributeQualifiedCalls(parsed) {
         }
         if (!target)
             continue;
-        let best = null;
-        let bestIndex = -1;
-        for (let i = 0; i < parsed.symbols.length; i++) {
-            const s = parsed.symbols[i];
-            if (call.atByte >= s.startByte && call.atByte < s.endByte && (!best || s.endByte - s.startByte < best.endByte - best.startByte)) {
-                best = s;
-                bestIndex = i;
-            }
-        }
+        const bestIndex = innermostSymbolAt(parsed.symbols, call.atByte);
         if (bestIndex < 0)
             continue;
         const list = out.get(bestIndex) ?? [];
@@ -329,16 +328,7 @@ export function attributeQualifiedCalls(parsed) {
 export function attributeRelations(parsed) {
     const out = new Map();
     for (const relation of parsed.relations) {
-        let best = null;
-        let bestIndex = -1;
-        for (let index = 0; index < parsed.symbols.length; index++) {
-            const symbol = parsed.symbols[index];
-            if (relation.atByte >= symbol.startByte && relation.atByte < symbol.endByte
-                && (!best || symbol.endByte - symbol.startByte < best.endByte - best.startByte)) {
-                best = symbol;
-                bestIndex = index;
-            }
-        }
+        const bestIndex = innermostSymbolAt(parsed.symbols, relation.atByte);
         if (bestIndex < 0)
             continue;
         const list = out.get(bestIndex) ?? [];

package/dist/integrations/hooks.js

@@ -609,14 +609,16 @@ function sharedInvocationFor(root, mark, invocation, own) {
     }
     return null;
 }
-/** Shared idempotent create/append/update-in-place logic for every hunch git
- *  hook: write a fresh hook file, replace our own managed block in place if the
- *  invocation changed, or append after any pre-existing (non-hunch) hook body
- *  without clobbering it. Used by all hook installers below — the copies had
- *  already drifted (installPreCommitHook was missing the chmodSync on its
- *  "updated" path) before this was unified. When a hook manager owns the file,
- *  or the block would sit after an exec/exit, nothing is written and the result
- *  carries the snippet to add by hand (issue #311). */
+/** The one idempotent install path every Hunch git hook goes through: create the
+ *  hook file when there is none; rewrite our own managed block in place when its
+ *  invocation moved; otherwise append the block after whatever non-Hunch body the
+ *  file already holds, never clobbering it. Each installer used to carry its own
+ *  copy of this, and the copies drifted (one forgot to chmod the file on its
+ *  update path), hence a single shared implementation.
+ *
+ *  When a hook manager owns the file, or the block would land after an `exec` /
+ *  `exit` that stops it from ever running, nothing is written: the result
+ *  carries the snippet for the user to add by hand instead (issue #311). */
 function installManagedBlock(root, hookName, mark, end, build, invocation) {
     // A linked worktree whose branch predates the opt-out marker shares the main
     // checkout's hooks dir: never re-hook a repository `hunch uninstall` opted out (#488).

package/dist/store/hunchStore.d.ts

@@ -281,10 +281,11 @@ export declare class HunchStore {
         total: number;
     }>;
     /** Post-fusion rerank by graph PRIORS (dec_25e277f479): relevance ordering, not
-     *  just reachability. Trust weight w = liveness × provenance × recency: liveness 0.6
-     *  for superseded/retired/rejected, provenance 1.0 / 0.85 / 0.75 for
-     *  human_confirmed / llm_draft / extracted-inferred, recency 0.7 + 0.3·½^(age/90d),
-     *  and proven anchored-file staleness 0.8. Every factor is ranking-only.
+     *  just reachability. Trust weight w = provenance × recency: provenance 1.0 / 0.9 /
+     *  0.85 / 0.75 for human_confirmed / agent_recorded / llm_draft / extracted-inferred,
+     *  recency 0.7 + 0.3·½^(age/90d), and proven anchored-file staleness 0.8. Liveness
+     *  (superseded/retired/rejected) is a separate DEAD_PRIOR_SHIFT, and a superseded
+     *  decision always lands just below its live successor. Every factor is ranking-only.
      *  Runbook trigger phrases matching the query boost ×1.5 (exact intent beats
      *  keyword luck). Structural refs (symbols/components/edges) stay neutral.
      *
@@ -302,10 +303,13 @@ export declare class HunchStore {
      *  they were the #1 fused hit, and 88% from fused rank 8. Both retrieval layers
      *  ranked the record first and the rerank alone threw it away.
      *
-     *  A shift of at most ±MAX_PRIOR_SHIFT positions restores the intended semantics:
+     *  A shift of at most ±MAX_PRIOR_SHIFT positions (+DEAD_PRIOR_SHIFT for history)
+     *  restores the intended semantics:
      *  a stale or low-provenance record visibly dims, an exact runbook-trigger match
      *  visibly promotes, and neither can leapfrog the whole pool. Same measurement
-     *  after: 0% evicted from fused ranks 0–8. Deterministic; ties keep fused order. */
+     *  after: 0% of live records evicted from fused ranks 0–8 (a dead record is meant to
+     *  sink; only from fused #0/#1 is it guaranteed to stay on an 8-hit page).
+     *  Deterministic; ties keep fused order. */
     private rerankByPriors;
     /**
      * Score only freshness that the existing graph clocks can prove: an anchored path changed after