@aistastudio/myc 0.3.9 → 0.3.10

package/README.md

@@ -37,8 +37,8 @@ Install Bun: https://bun.sh
 Installation is one command:
 
 ```bash
-bun install -g @aistastudio/myc   # 3.41 MB compressed, 12.57 MB unpacked, 13 files; no models pulled
-myc --version                     # myc 0.3.9 (schema 1)
+bun install -g @aistastudio/myc   # 3.42 MB compressed, 12.58 MB unpacked, 13 files; no models pulled
+myc --version                     # myc 0.3.10 (schema 1)
 ```
 
 It runs on macOS and Linux. On Windows, use WSL and install Bun and myc inside
@@ -255,6 +255,13 @@ under different keys; `code symbol` reads both.
 Anchors tie knowledge to a span and follow the code as it moves; that half is
 language-agnostic and was verified on Python as well as TypeScript.
 
+When the code is no longer where the anchor put it, the knowledge is not
+deleted — it ranks lower and says why. `recall` marks the row
+`[code moved ×0.64]`, `[code unverified ×0.5]` or `[code gone ×0.2]`: the
+multiplier is the one its score was taken down by (drifted × similarity,
+stale × 0.5, lost × 0.2). Knowledge whose every anchor is lost stays out of
+`prime`, and the footer counts it: `N with code gone hidden`.
+
 ## Migration from beads
 
 ```bash
@@ -424,7 +431,7 @@ last-writer-wins over whole records.
 
 **Guards are proved by mutation.** Every refusal and every invariant is
 accompanied by a mutation that removes it; a guard whose removal breaks no test
-is treated as absent. The full suite: 3625 pass / 0 fail / 16 skip
+is treated as absent. The full suite: 3672 pass / 0 fail / 16 skip
 (`bun test`, 2026-09-11).
 
 ## What myc does