@polycode-projects/the-mechanical-code-talker 5.0.3 → 5.0.5

package/corpus/worlds/manifest.json

@@ -50,17 +50,17 @@
     {
       "file": "src/town-square-chapel.jsonl",
       "bytes": 108408,
-      "sha256": "2c378e51c2f7d53d700e557970b72035aadcbea9496cc959adee09dd77181334"
+      "sha256": "02036d284ec27244494e1f575b750efa71d9a0fc232e57dbd8b5dab7e6a6b7b3"
     },
     {
       "file": "src/town-square-market.jsonl",
       "bytes": 52311,
-      "sha256": "91682ef54cdddd3d3fe0c5877d107f9577bff9d85621bfb4979947f89b029a45"
+      "sha256": "dd374f9cb1c6a13ccfab62badeb4150b8cfefdc349f834430c2c9e105c1d7a4f"
     },
     {
       "file": "src/town-square.jsonl",
       "bytes": 75251,
-      "sha256": "3238dcd53827e4139c0752bebc204257cac4a4663a8263183d387cc98e739779"
+      "sha256": "2fb87416759d8cee1464b55d4e811b91e772d52f65e0f06a88eac1d3a8fc5e7f"
     }
   ],
   "files": [
@@ -106,18 +106,18 @@
     },
     {
       "file": "shards/town-square-chapel.jsonl.gz",
-      "bytes": 5540,
-      "sha256": "f7515fc12de8bf40f5a5c0635032be2d4fe2f5a18d153a1b64fdc2adbcf5745c"
+      "bytes": 5538,
+      "sha256": "826e8732b419b506098f4fbce1adcc07d11bd7d91ea672aa46f13ed3ccebb0bb"
     },
     {
       "file": "shards/town-square-market.jsonl.gz",
-      "bytes": 3116,
-      "sha256": "5791be29b86ad2329978a8bca76dafb9a0ae2419beb0d8d00b83b958adb989d6"
+      "bytes": 3113,
+      "sha256": "c6834f0754498ff800e7be620e3e2268c375686bd753fa9da9b7dd89a63aa009"
     },
     {
       "file": "shards/town-square.jsonl.gz",
-      "bytes": 4277,
-      "sha256": "657e3a8825e579e38b24b64f4df95c17ee95caa10862afc0067acdf1f2db842f"
+      "bytes": 4275,
+      "sha256": "460864ccee3a6eed9dae93f158abaf9780f2b7fb4051f45c3ebc63c7400b01d2"
     }
   ]
 }

package/corpus/worlds/src/town-square-chapel.jsonl

@@ -920,7 +920,7 @@
 {"world":"town-square-chapel","kind":"fact","subject":"goblin","predicate":"mgx:lose","object":"0.06 mass per turn by default"}
 {"world":"town-square-chapel","kind":"fact","subject":"goblin","predicate":"mgx:arrive","object":"every 5 turns at the edge of the board by default"}
 {"world":"town-square-chapel","kind":"fact","subject":"crumb","predicate":"mgx:arrive","object":"every 3 turns on any open cell by default"}
-{"world":"town-square-chapel","kind":"fact","subject":"crumb","predicate":"mgx:start-with","object":"mass 1 by default"}
+{"world":"town-square-chapel","kind":"fact","subject":"crumb","predicate":"mgx:start-with","object":"mass 2 by default"}
 {"world":"town-square-chapel","kind":"fact","subject":"morsel","predicate":"mgx:start-with","object":"mass 2 by default"}
 {"world":"town-square-chapel","kind":"fact","subject":"morsel","predicate":"mgx:arrive","object":"where the player puts it"}
 {"world":"town-square-chapel","kind":"fact","subject":"vision radius","predicate":"mgx:hasProperty","object":"4 cells for the fox by default"}

package/corpus/worlds/src/town-square-market.jsonl

@@ -446,7 +446,7 @@
 {"world":"town-square-market","kind":"fact","subject":"goblin","predicate":"mgx:lose","object":"0.06 mass per turn by default"}
 {"world":"town-square-market","kind":"fact","subject":"goblin","predicate":"mgx:arrive","object":"every 5 turns at the edge of the board by default"}
 {"world":"town-square-market","kind":"fact","subject":"crumb","predicate":"mgx:arrive","object":"every 3 turns on any open cell by default"}
-{"world":"town-square-market","kind":"fact","subject":"crumb","predicate":"mgx:start-with","object":"mass 1 by default"}
+{"world":"town-square-market","kind":"fact","subject":"crumb","predicate":"mgx:start-with","object":"mass 2 by default"}
 {"world":"town-square-market","kind":"fact","subject":"morsel","predicate":"mgx:start-with","object":"mass 2 by default"}
 {"world":"town-square-market","kind":"fact","subject":"morsel","predicate":"mgx:arrive","object":"where the player puts it"}
 {"world":"town-square-market","kind":"fact","subject":"vision radius","predicate":"mgx:hasProperty","object":"4 cells for the fox by default"}

package/corpus/worlds/src/town-square.jsonl

@@ -678,7 +678,7 @@
 {"world":"town-square","kind":"fact","subject":"goblin","predicate":"mgx:lose","object":"0.06 mass per turn by default"}
 {"world":"town-square","kind":"fact","subject":"goblin","predicate":"mgx:arrive","object":"every 5 turns at the edge of the board by default"}
 {"world":"town-square","kind":"fact","subject":"crumb","predicate":"mgx:arrive","object":"every 3 turns on any open cell by default"}
-{"world":"town-square","kind":"fact","subject":"crumb","predicate":"mgx:start-with","object":"mass 1 by default"}
+{"world":"town-square","kind":"fact","subject":"crumb","predicate":"mgx:start-with","object":"mass 2 by default"}
 {"world":"town-square","kind":"fact","subject":"morsel","predicate":"mgx:start-with","object":"mass 2 by default"}
 {"world":"town-square","kind":"fact","subject":"morsel","predicate":"mgx:arrive","object":"where the player puts it"}
 {"world":"town-square","kind":"fact","subject":"vision radius","predicate":"mgx:hasProperty","object":"4 cells for the fox by default"}

package/data/mudiii-assets.json

@@ -21,7 +21,7 @@
       "destPath": "public/models/creatures/fox.glb",
       "licence": "CC0-1.0",
       "author": "Quaternius",
-      "source": "https://poly.pizza/u/Quaternius · https://quaternius.com",
+      "source": "https://poly.pizza/u/Quaternius \u00b7 https://quaternius.com",
       "bytes": 332748,
       "sha256": "2694028b47e84bad3b9d985aa7743dae02a3bcfddd6becd73b46c747a1e067b3",
       "targetHeight": 1.0,
@@ -30,7 +30,10 @@
         "walk": "Walk",
         "run": "Gallop",
         "attack": "Attack",
-        "hit": ["Idle_HitReact_Left", "Idle_HitReact_Right"],
+        "hit": [
+          "Idle_HitReact_Left",
+          "Idle_HitReact_Right"
+        ],
         "death": "Death",
         "eat": "Eating"
       }
@@ -41,7 +44,7 @@
       "destPath": "public/models/creatures/goblin.glb",
       "licence": "CC0-1.0",
       "author": "Quaternius",
-      "source": "https://poly.pizza/u/Quaternius · https://quaternius.com",
+      "source": "https://poly.pizza/u/Quaternius \u00b7 https://quaternius.com",
       "bytes": 47924,
       "sha256": "2f02ce927a8871554f3931655d75f1abb8237d36be8a19a35b09920d0812bc3c",
       "targetHeight": 2.1,
@@ -50,7 +53,9 @@
         "walk": "Walk",
         "run": "Run",
         "attack": "Attack",
-        "hit": ["HitRecieve"],
+        "hit": [
+          "HitRecieve"
+        ],
         "death": "Death"
       }
     },
@@ -207,7 +212,7 @@
       "source": "https://github.com/KayKit-Game-Assets/KayKit-Dungeon-Remastered-1.0",
       "bytes": 14004,
       "sha256": "8b340af18ea1325d5a9bd4a967d3ef37bb90838ca2d90927b123e23877f7ddad",
-      "targetHeight": 0.16,
+      "targetHeight": 0.6,
       "clips": null
     },
     {
@@ -219,7 +224,7 @@
       "source": "https://github.com/KayKit-Game-Assets/KayKit-Dungeon-Remastered-1.0",
       "bytes": 14004,
       "sha256": "8b340af18ea1325d5a9bd4a967d3ef37bb90838ca2d90927b123e23877f7ddad",
-      "targetHeight": 0.36,
+      "targetHeight": 0.6,
       "clips": null
     }
   ]

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@polycode-projects/the-mechanical-code-talker",
-  "version": "5.0.3",
+  "version": "5.0.5",
   "private": false,
   "type": "module",
   "description": "The Mechanical Code Talker (tmct) — a tolerant, offline, $0 chat surface that guides you toward precision queries about a software repository. ELIZA/PARRY-style but domain-obsessed with code. No model calls; indexes a repo on request (tmct index) or reads any producer's graph.",

package/src/adapters/memory/core.mjs

@@ -50,6 +50,7 @@ import {
   planRetraction, mergeRetractions, retractionFromWire, retractionWireFact,
   isRetractedRecord, RETRACTION_CLASS,
 } from "../../domain/memory/retraction.mjs";
+import { admittedNodes, stableRecordIds } from "../../domain/memory/causal-stability.mjs";
 import { assertIndividualValid } from "./shacl.mjs";
 
 // The rollup vocabulary and its tuning constants live with the compaction
@@ -70,6 +71,8 @@ export {
   retractedRecordIds, retractedAtOf, retractionWireFact, retractionFromWire,
 } from "../../domain/memory/retraction.mjs";
 
+export { admittedNodes, peersToConvince, stableRecordIds } from "../../domain/memory/causal-stability.mjs";
+
 export const MEMORY_DIR_REL = join(".tmct", "memory");
 export const MEMORY_GRAPH_REL = join(MEMORY_DIR_REL, "graph.json");
 
@@ -3189,6 +3192,56 @@ export async function appendRetractions(dir, wireFacts) {
   return { merged: incoming.length, removed };
 }
 
+/** What this store could retire, and the roster it has to convince first.
+ *
+ *  `roster` is the world's admission graph, folded to a set of node ids —
+ *  replicated, grow-only, and the same on every peer holding the same facts.
+ *  `retirable` is the tombstones every peer on that roster is known to hold.
+ *  `acknowledgedBy(nodeId)` is what supplies that evidence; nothing produces it
+ *  yet, so `retirable` reads empty and this is a report rather than a sweep.
+ *  Retiring nothing is the current behaviour, and it is the safe one: a
+ *  tombstone dropped one peer early lets that peer's copy resurrect a retracted
+ *  fact. See docs/references/papers/crdt.md. */
+export function retirableRetractions(memory, { self = "", acknowledgedBy = null } = {}) {
+  const roster = admittedNodes(readFactRows(memory));
+  const recordIds = [];
+  for (const ind of memory?.individuals || []) {
+    if (ind?.class === RETRACTION_CLASS && ind.id) recordIds.push(ind.id);
+  }
+  return { roster, retirable: stableRecordIds({ recordIds, roster, self, acknowledgedBy }) };
+}
+
+/** Drop named retraction records. Takes the ids rather than choosing them, so a
+ *  caller has to have run the stability rule and passed its answer; ids that are
+ *  not retraction records are skipped. Returns the ids that went. */
+export async function retireRetractions(dir, ids) {
+  const asked = new Set((ids || []).filter(Boolean));
+  const retired = [];
+  if (!asked.size) return { retired };
+  await mutateMemory(dir, (payload) => {
+    const drop = new Set();
+    payload.individuals = (payload.individuals || []).filter((ind) => {
+      if (ind?.class !== RETRACTION_CLASS || !asked.has(ind.id)) return true;
+      drop.add(ind.id);
+      return false;
+    });
+    if (!drop.size) return;
+    for (const id of drop) retired.push(id);
+    const idx = memoryIndexOf(payload);
+    if (idx) {
+      for (const id of drop) {
+        idx.individualsById.delete(id);
+        const groupId = factGroupId(id);
+        const held = (idx.retractionsByGroup.get(groupId) || []).filter((r) => !drop.has(r.id));
+        if (held.length) idx.retractionsByGroup.set(groupId, held);
+        else idx.retractionsByGroup.delete(groupId);
+      }
+    }
+    recountClasses(payload);
+  });
+  return { retired };
+}
+
 /** The trust floor a fact must clear before a differing object counts as a real
  *  contradiction (below it the fact is too weak to contradict anything). */
 const CONTRADICTION_TRUST_FLOOR = 0.5;

package/src/domain/game-config.mjs

@@ -78,7 +78,9 @@ export const DEFAULT_GAME_CONFIG = Object.freeze({
     preyVisionRadius: 3,
     preySpawnIntervalTurns: 5,
     foodSpawnIntervalTurns: 3,
-    spawnedFoodMass: 1,
+    // Spawned and placed food are one thing: the same hay bale, worth the
+    // same. The two knobs stay separate so a world can still tell them apart.
+    spawnedFoodMass: 2,
     placedFoodMass: 2,
     maxPreyPopulation: 6,
     maxFoodItems: 8,
@@ -88,6 +90,11 @@ export const DEFAULT_GAME_CONFIG = Object.freeze({
     // this is the one switch that turns that off (visionRadius: Infinity for
     // the food-only belief call) without any new belief machinery.
     foodVisionGated: true,
+    // Whether the town-square lane accepts teaching. Its own knob rather than
+    // a share of the adventure one below: the board's sentence table is a
+    // different vocabulary, and a page checkbox on the town square should not
+    // have to set a key named after another surface.
+    teach: false,
   }),
   guessNumber: Object.freeze({
     defaultLo: 1,
@@ -159,6 +166,7 @@ const MUDIII_KEY_MAP = Object.freeze({
   max_prey_population: "maxPreyPopulation",
   max_food_items: "maxFoodItems",
   food_vision_gated: "foodVisionGated",
+  teach: "teach",
 });
 
 const ADVENTURE_KEY_MAP = Object.freeze({

package/src/domain/memory/causal-stability.mjs

@@ -0,0 +1,82 @@
+// memory/causal-stability.mjs — deciding when a replicated tombstone has been
+// held by enough peers to retire.
+//
+// A retraction record and a compaction summary both work by staying put: they
+// carry the ids they suppressed, and any peer that re-delivers one of those ids
+// gets refused. That is what makes a delete survive a sync over a grow-only
+// set. It also means the records accumulate, because nothing yet says when one
+// has done its job.
+//
+// The literature calls the missing rule CAUSAL STABILITY: a record is safe to
+// drop once every replica that could still send a conflicting copy has it. Two
+// inputs, and the mesh has one of them.
+//
+//   - The ROSTER. `node:<joiner> mgx:invitedBy node:<inviter>` is an ordinary
+//     replicated fact, so the set of node ids ever admitted to a world is a
+//     grow-only union every peer computes the same way. `admittedNodes` reads
+//     it. Grow-only is exactly right here: a roster that could shrink would let
+//     a forgotten node's stale copy back in.
+//   - The ACKNOWLEDGEMENT. Nothing yet records that a named node holds a named
+//     record. `stableRecordIds` takes it as an argument rather than inventing
+//     it, and answers "nothing is stable" when it is absent — which is the
+//     current answer, and the safe one.
+//
+// Every rule here errs the same way. Dropping a tombstone one peer short lets
+// that peer's copy resurrect a retracted fact, and that failure is silent,
+// late, and reads as the memory inventing something. Retiring nothing is
+// merely unbounded. So: an empty roster retires nothing, a member with no
+// acknowledgement retires nothing, and an unparseable input retires nothing.
+//
+// Pure: no clock, no counter, no arrival order. The answer is a function of the
+// fact set and the acknowledgement evidence handed in, which is the same
+// invariant every read-time resolver over the store has to meet.
+// docs/references/papers/crdt.md carries the full design and the options it
+// rejected.
+import { INVITED_BY_PREDICATE } from "../p2p/facts.mjs";
+
+/** The node ids a world has ever admitted, from its admission edges. Both ends
+ *  of each edge count: the joiner wrote the edge about itself, and it names the
+ *  node that let it in. Sorted, so two peers holding the same facts hand the
+ *  same roster to the rule below. */
+export function admittedNodes(rows) {
+  const nodes = new Set();
+  for (const row of rows || []) {
+    if (row?.predicate !== INVITED_BY_PREDICATE) continue;
+    if (row.subject) nodes.add(String(row.subject));
+    if (row.object) nodes.add(String(row.object));
+  }
+  return [...nodes].sort();
+}
+
+/** The roster this node has to convince before retiring anything: every
+ *  admitted node except itself. A node holding its own record proves nothing
+ *  about who else still has a copy. */
+export function peersToConvince(roster, self = "") {
+  const me = String(self || "");
+  return (roster || []).map(String).filter((id) => id && id !== me);
+}
+
+/**
+ * Which of `recordIds` every peer on the roster is known to hold.
+ *
+ * `acknowledgedBy(nodeId)` returns the record ids that node is known to hold.
+ * Nothing supplies it in the product yet, so it defaults to knowing nothing and
+ * the answer defaults to the empty set. That default is the gate: this rule
+ * cannot retire anything until something can show a peer holds a record.
+ *
+ * An empty roster answers with nothing too. A store with no admission edges has
+ * not shown it is alone; it has shown it does not know who else is out there,
+ * and a copy of it can be sitting in a closed browser tab.
+ */
+export function stableRecordIds({ recordIds = [], roster = [], self = "", acknowledgedBy = null } = {}) {
+  const peers = peersToConvince(roster, self);
+  if (!peers.length) return [];
+  if (typeof acknowledgedBy !== "function") return [];
+  const held = new Map();
+  for (const peer of peers) {
+    const ids = acknowledgedBy(peer);
+    held.set(peer, new Set([...(ids || [])].map(String)));
+  }
+  const candidates = [...new Set((recordIds || []).map(String).filter(Boolean))].sort();
+  return candidates.filter((id) => peers.every((peer) => held.get(peer).has(id)));
+}

package/src/domain/spider-fly-world.mjs

@@ -57,9 +57,9 @@ export const chebyshevDistance = (ax, ay, bx, by) => Math.max(Math.abs(ax - bx),
 export const inBounds = (x, y) => x >= 1 && x <= GRID_SIZE && y >= 1 && y <= GRID_SIZE;
 
 /** Every cell within Chebyshev `radius` of (cx, cy), clipped to the board, in
- *  raster order — the one visibility primitive PLAN_SPIDER_FLY.md §4 names
- *  ("visibleCells(cx, cy, radius=4)"), shared by both agents' belief and this
- *  module's own web-block derivation below. */
+ *  raster order — the one visibility primitive ("visibleCells(cx, cy, radius=4)")
+ *  shared by both agents' belief and this module's own web-block derivation
+ *  below. */
 export function visibleCells(cx, cy, radius) {
   const out = [];
   for (let y = Math.max(1, cy - radius); y <= Math.min(GRID_SIZE, cy + radius); y += 1) {
@@ -72,8 +72,7 @@ export function visibleCells(cx, cy, radius) {
 
 export const isInWebBlock = (x, y) => chebyshevDistance(x, y, WEB_HOME.x, WEB_HOME.y) <= WEB_RADIUS;
 
-/** Every board-edge (perimeter) cell, raster order — where a spawned fly
- *  arrives (PLAN_SPIDER_FLY.md §10). */
+/** Every board-edge (perimeter) cell, raster order. */
 export function perimeterCells() {
   const out = [];
   for (let y = 1; y <= GRID_SIZE; y += 1) {
@@ -110,11 +109,10 @@ export function oneStepDirectionBetween(fromCell, toCell) {
   return null;
 }
 
-/** The world's seed taxonomy (PLAN_SPIDER_FLY.md §7): enough for the
- *  ontology-to-sprite worked example (a poodle sprite, a sheepdog falling
- *  back to the generic dog sprite) to run on the default persona, no
- *  --persona-size large flag required. [subject, superclass] pairs, written
- *  as rdfs:subClassOf facts. */
+/** The world's seed taxonomy — enough for the ontology-to-sprite worked example
+ *  (a poodle sprite, a sheepdog falling back to the generic dog sprite) to run
+ *  on the default persona without the --persona-size large flag. [subject,
+ *  superclass] pairs, written as rdfs:subClassOf facts. */
 export const SEED_TAXONOMY = Object.freeze([
   Object.freeze(["poodle", "dog"]),
   Object.freeze(["sheepdog", "dog"]),
@@ -293,9 +291,9 @@ export function isLiveRenderableAgent(id, state) {
 /** A minimal, inert rule-row family, so scripts/build-worlds-pack.mjs's
  *  shared validator ("every world needs at least one rule row") passes.
  *  src/services/spider-fly-turn.mjs never reads these back: grid movement is
- *  hand-written pathfinding over findActionPath/findReachableSet
- *  (PLAN_SPIDER_FLY.md §5), not the taught action-Rule DSL, so this rides in
- *  the shard unused, same as an unrelated fact would. */
+ *  hand-written pathfinding over findActionPath/findReachableSet, not the
+ *  taught action-Rule DSL, so this rides in the shard unused, same as an
+ *  unrelated fact would. */
 export function* worldRuleRows() {
   yield {
     world: WORLD_NAME, kind: "rule", name: "go", ruleKind: "action-signature",

package/src/domain/town-square-world.mjs

@@ -82,6 +82,42 @@ export function oneStepDirectionBetween(fromCell, toCell) {
   return null;
 }
 
+/** The eight points a facing may take, clockwise from north. The four
+ *  cardinals are DIRECTION_DELTA's own keys, and they are the only ones a STEP
+ *  can use — the grid has no diagonal exits. The four intercardinals are
+ *  turn-only, which is what a forty-five degree turn on the spot writes. */
+export const COMPASS_POINTS = Object.freeze([
+  "north", "northeast", "east", "southeast", "south", "southwest", "west", "northwest",
+]);
+
+/** `facing` turned `degrees` clockwise (a negative angle turns the other way),
+ *  landing on one of COMPASS_POINTS. Null when `facing` isn't a compass point
+ *  or the angle isn't a whole multiple of 45, so a caller refuses rather than
+ *  rounding a nonsense turn into a real one. Pure. */
+export function turnedFacing(facing, degrees) {
+  const at = COMPASS_POINTS.indexOf(String(facing ?? ""));
+  if (at < 0) return null;
+  if (!Number.isInteger(degrees) || degrees % 45 !== 0) return null;
+  const steps = degrees / 45;
+  return COMPASS_POINTS[(((at + steps) % 8) + 8) % 8];
+}
+
+/** The compass point directly behind `facing`, or null. Pure. */
+export function reverseFacing(facing) {
+  return turnedFacing(facing, 180);
+}
+
+/** The cell one step `direction` from `cell`, or null when `direction` names
+ *  no cardinal step or `cell` doesn't parse. Bounds and props are NOT checked
+ *  here: whether that cell can actually be entered is the exit table's answer,
+ *  and there is only one of those. Pure. */
+export function stepCellFrom(cell, direction) {
+  const at = parseCellId(cell);
+  const delta = DIRECTION_DELTA[String(direction ?? "")];
+  if (!at || !delta) return null;
+  return cellId(at.x + delta.dx, at.y + delta.dy);
+}
+
 // ---- the prop vocabulary ------------------------------------------------------
 
 /** The closed set of noun stems a prop id may use ("house-1" -> "house"). A