swarm: document the single-writer invariant (Rule 4) in README

New hard invariant (Will): only the orchestrator mutates global engram state;
workers are read-only against the full engram + write only their own local
geometry. This is an AUTHORITY gate (capability), not a health gate — a worker
is STRUCTURALLY UNABLE to mutate global engram state regardless of engram health.

- containment.el: scope tokens now carry a caps set. Orchestrator token holds
  engram:write + dharma:emit (@manager-only, the VBD rule that only the manager
  mutates global state); worker token holds ONLY engram:read. Rule 4:
  containment_check_engram_write / _dharma_emit reject any caller lacking the
  capability — same scope-token mechanism as the live Rule-2 denial.
- swarm.el: swarm_engram_write is the ONLY engram write path, gated by Rule 4;
  a worker token is denied before any HTTP is issued (no mutation). The curated
  merge (commit=1) is the sole writer: the orchestrator commits approved
  geometry via its write-capable token. Workers' full-engram READ stays intact.
- reshape_surface.el: compose op_write (json_escape_string) for the commit path.
- harness: Rule-4 suite proven — worker engram-write DENIED by capability, no
  node created, violation journalled; orchestrator passes the gate as sole
  writer. 24/24 green on the :8901 clone with real cognition.

Authority gate holds independent of daemon write-health (proven with daemon
both alive and, earlier, crashed). Prod :8742 untouched.

.gitea/workflows/ci-dev.yaml

@@ -214,18 +214,9 @@ jobs:
         env:
           GCP_SA_KEY: ${{ secrets.GCP_SA_KEY }}
         run: |
-          # Fail loudly: previously this step had no `set -e`, so an auth or
-          # upload failure was swallowed (step exited 0 on the trailing echo)
-          # and the SDK silently never published. Surface failures now.
-          set -euo pipefail
-          if [ -z "${GCP_SA_KEY:-}" ]; then
-            echo "FATAL: GCP_SA_KEY secret is empty — cannot authenticate to publish" >&2
-            exit 1
-          fi
           echo "${GCP_SA_KEY}" > /tmp/gcp-key.json
           gcloud auth activate-service-account --key-file=/tmp/gcp-key.json
           gcloud config set project neuron-785695
-          echo "Publishing as active account: $(gcloud config get-value account 2>/dev/null)"
 
           VERSION="${GITHUB_SHA:0:8}"
 
@@ -277,12 +268,6 @@ jobs:
         # Patches ci-base:dev in-place: pulls the existing image (which has all
         # system deps — Node, Go, gcloud, Docker CLI, etc.) and overlays the freshly
         # built El SDK on top. Keeps the full ci-base rebuild fast and incremental.
-        #
-        # continue-on-error: this is a CI-cache optimization, NOT the release
-        # artifact. It runs Docker (pull/build/push ~600MB) on the host-mode GCE
-        # runner where DinD/Docker availability is fragile. A failure here must
-        # never block or redden the job — the SDK publish above is the deliverable.
-        continue-on-error: true
         if: github.event_name == 'push'
         env:
           GCP_SA_KEY: ${{ secrets.GCP_SA_KEY }}

.gitea/workflows/ci-stage.yaml

@@ -212,21 +212,12 @@ jobs:
         env:
           GCP_SA_KEY: ${{ secrets.GCP_SA_KEY }}
         run: |
-          # Fail loudly: previously this step had no `set -e`, so an auth or
-          # upload failure was swallowed (step exited 0 on the trailing echo)
-          # and the SDK silently never published. Surface failures now.
-          set -euo pipefail
-          if [ -z "${GCP_SA_KEY:-}" ]; then
-            echo "FATAL: GCP_SA_KEY secret is empty — cannot authenticate to publish" >&2
-            exit 1
-          fi
           echo "${GCP_SA_KEY}" > /tmp/gcp-key.json
           apt-get install -y -qq apt-transport-https ca-certificates curl
           echo "deb [trusted=yes] https://packages.cloud.google.com/apt cloud-sdk main" > /etc/apt/sources.list.d/google-cloud-sdk.list
           apt-get update -qq && apt-get install -y google-cloud-cli
           gcloud auth activate-service-account --key-file=/tmp/gcp-key.json
           gcloud config set project neuron-785695
-          echo "Publishing as active account: $(gcloud config get-value account 2>/dev/null)"
 
           VERSION="${GITHUB_SHA:0:8}"
 
@@ -262,12 +253,6 @@ jobs:
         # Patches ci-base:stage in-place: pulls the existing image (which has all
         # system deps — Node, Go, gcloud, Docker CLI, etc.) and overlays the freshly
         # built El SDK on top. Keeps the full ci-base rebuild fast and incremental.
-        #
-        # continue-on-error: this is a CI-cache optimization, NOT the release
-        # artifact. It runs Docker (pull/build/push ~600MB) on the host-mode GCE
-        # runner where DinD/Docker availability is fragile. A failure here must
-        # never block or redden the job — the SDK publish above is the deliverable.
-        continue-on-error: true
         if: github.event_name == 'push'
         env:
           GCP_SA_KEY: ${{ secrets.GCP_SA_KEY }}

.gitea/workflows/sdk-release.yaml

@@ -288,21 +288,12 @@ jobs:
         env:
           GCP_SA_KEY: ${{ secrets.GCP_SA_KEY }}
         run: |
-          # Fail loudly: previously this step had no `set -e`, so an auth or
-          # upload failure was swallowed (step exited 0 on the trailing echo)
-          # and the SDK silently never published. Surface failures now.
-          set -euo pipefail
-          if [ -z "${GCP_SA_KEY:-}" ]; then
-            echo "FATAL: GCP_SA_KEY secret is empty — cannot authenticate to publish" >&2
-            exit 1
-          fi
           echo "${GCP_SA_KEY}" > /tmp/gcp-key.json
           apt-get install -y -qq apt-transport-https ca-certificates curl
           echo "deb [trusted=yes] https://packages.cloud.google.com/apt cloud-sdk main" > /etc/apt/sources.list.d/google-cloud-sdk.list
           apt-get update -qq && apt-get install -y google-cloud-cli
           gcloud auth activate-service-account --key-file=/tmp/gcp-key.json
           gcloud config set project neuron-785695
-          echo "Publishing as active account: $(gcloud config get-value account 2>/dev/null)"
 
           VERSION="${GITHUB_SHA:0:8}"
 
@@ -354,12 +345,6 @@ jobs:
         # Patches ci-base:latest in-place: pulls the existing image (which has all
         # system deps — Node, Go, gcloud, Docker CLI, etc.) and overlays the freshly
         # built El SDK on top. Keeps the full ci-base rebuild fast and incremental.
-        #
-        # continue-on-error: this is a CI-cache optimization, NOT the release
-        # artifact. It runs Docker (pull/build/push ~600MB) on the host-mode GCE
-        # runner where DinD/Docker availability is fragile. A failure here must
-        # never block or redden the job — the SDK publish above is the deliverable.
-        continue-on-error: true
         if: github.event_name == 'push'
         env:
           GCP_SA_KEY: ${{ secrets.GCP_SA_KEY }}

engram/.gitea/workflows/ci-dev.yaml

@@ -81,7 +81,7 @@ jobs:
       # Link to produce the engram binary
       - name: Link engram binary
         run: |
-          cc -std=c11 -O2 -DHAVE_CURL \
+          cc -std=c11 -O2 \
             -I /usr/local/lib/el \
             -o dist/engram \
             dist/engram.c \

engram/.gitea/workflows/ci-stage.yaml

@@ -88,7 +88,7 @@ jobs:
       # Link to produce the engram binary
       - name: Link engram binary
         run: |
-          cc -std=c11 -O2 -DHAVE_CURL \
+          cc -std=c11 -O2 \
             -I /usr/local/lib/el \
             -o dist/engram \
             dist/engram.c \

engram/.gitea/workflows/engram-release.yaml

@@ -62,7 +62,7 @@ jobs:
       # Link to produce the engram binary
       - name: Link engram binary
         run: |
-          cc -std=c11 -O2 -DHAVE_CURL \
+          cc -std=c11 -O2 \
             -I /usr/local/lib/el \
             -o dist/engram \
             dist/engram.c \

engram/dist/engram.c

@@ -10,6 +10,8 @@ el_val_t query_param(el_val_t path, el_val_t key);
 el_val_t query_int(el_val_t path, el_val_t key, el_val_t default_val);
 el_val_t extract_id(el_val_t path, el_val_t prefix);
 el_val_t route_stats(el_val_t method, el_val_t path, el_val_t body);
+el_val_t route_act_stats(el_val_t method, el_val_t path, el_val_t body);
+el_val_t route_text_health(el_val_t method, el_val_t path, el_val_t body);
 el_val_t persist_canonical(void);
 el_val_t route_create_node(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_get_node(el_val_t method, el_val_t path, el_val_t body);
@@ -18,16 +20,19 @@ el_val_t route_scan_edges(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_search(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_activate(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_create_edge(el_val_t method, el_val_t path, el_val_t body);
+el_val_t route_create_edges_batch(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_neighbors(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_strengthen(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_forget(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_save(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_load(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_health(el_val_t method, el_val_t path, el_val_t body);
+el_val_t route_embed_backfill(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_sync(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_load_merge(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_emit_ise(el_val_t method, el_val_t path, el_val_t body);
 el_val_t route_capture_knowledge(el_val_t method, el_val_t path, el_val_t body);
+el_val_t route_similarity(el_val_t method, el_val_t path, el_val_t body);
 el_val_t check_auth_ok(el_val_t method, el_val_t body);
 el_val_t handle_request(el_val_t method, el_val_t path, el_val_t body);
 
@@ -116,11 +121,20 @@ el_val_t route_stats(el_val_t method, el_val_t path, el_val_t body) {
   return 0;
 }
 
+el_val_t route_act_stats(el_val_t method, el_val_t path, el_val_t body) {
+  return engram_act_stats_json();
+  return 0;
+}
+
+el_val_t route_text_health(el_val_t method, el_val_t path, el_val_t body) {
+  return engram_text_health_json();
+  return 0;
+}
+
 el_val_t persist_canonical(void) {
   el_val_t dir_raw = env(EL_STR("ENGRAM_DATA_DIR"));
   el_val_t dir = ({ el_val_t _if_result_1 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_1 = (EL_STR("/tmp/engram")); } else { _if_result_1 = (dir_raw); } _if_result_1; });
-  engram_save(el_str_concat(dir, EL_STR("/snapshot.json")));
-  return 1;
+  return engram_save(el_str_concat(dir, EL_STR("/snapshot.json")));
   return 0;
 }
 
@@ -128,9 +142,18 @@ el_val_t route_create_node(el_val_t method, el_val_t path, el_val_t body) {
   el_val_t content = json_get_string(body, EL_STR("content"));
   el_val_t nt_raw = json_get_string(body, EL_STR("node_type"));
   el_val_t node_type = ({ el_val_t _if_result_2 = 0; if (str_eq(nt_raw, EL_STR(""))) { _if_result_2 = (EL_STR("Memory")); } else { _if_result_2 = (nt_raw); } _if_result_2; });
-  el_val_t sal_raw = json_get_float(body, EL_STR("salience"));
-  el_val_t salience = ({ el_val_t _if_result_3 = 0; if ((sal_raw == el_from_float(0.0))) { _if_result_3 = (el_from_float(0.5)); } else { _if_result_3 = (sal_raw); } _if_result_3; });
-  el_val_t id = engram_node(content, node_type, salience);
+  el_val_t sal_present = json_get_raw(body, EL_STR("salience"));
+  el_val_t salience = ({ el_val_t _if_result_3 = 0; if (str_eq(sal_present, EL_STR(""))) { _if_result_3 = (el_from_float(0.5)); } else { _if_result_3 = (json_get_float(body, EL_STR("salience"))); } _if_result_3; });
+  el_val_t label_raw = json_get_string(body, EL_STR("label"));
+  el_val_t label = ({ el_val_t _if_result_4 = 0; if (str_eq(label_raw, EL_STR(""))) { _if_result_4 = (content); } else { _if_result_4 = (label_raw); } _if_result_4; });
+  el_val_t imp_present = json_get_raw(body, EL_STR("importance"));
+  el_val_t importance = ({ el_val_t _if_result_5 = 0; if (str_eq(imp_present, EL_STR(""))) { _if_result_5 = (el_from_float(0.5)); } else { _if_result_5 = (json_get_float(body, EL_STR("importance"))); } _if_result_5; });
+  el_val_t conf_present = json_get_raw(body, EL_STR("confidence"));
+  el_val_t confidence = ({ el_val_t _if_result_6 = 0; if (str_eq(conf_present, EL_STR(""))) { _if_result_6 = (el_from_float(1.0)); } else { _if_result_6 = (json_get_float(body, EL_STR("confidence"))); } _if_result_6; });
+  el_val_t tier_raw = json_get_string(body, EL_STR("tier"));
+  el_val_t tier = ({ el_val_t _if_result_7 = 0; if (str_eq(tier_raw, EL_STR(""))) { _if_result_7 = (EL_STR("Working")); } else { _if_result_7 = (tier_raw); } _if_result_7; });
+  el_val_t tags = json_get_string(body, EL_STR("tags"));
+  el_val_t id = engram_node_full(content, node_type, label, salience, importance, confidence, tier, tags);
   el_val_t saved = persist_canonical();
   return el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(EL_STR("{\"id\":\""), id), EL_STR("\",\"content\":\"")), content), EL_STR("\",\"node_type\":\"")), node_type), EL_STR("\"}"));
   return 0;
@@ -158,7 +181,7 @@ el_val_t route_scan_nodes(el_val_t method, el_val_t path, el_val_t body) {
 
 el_val_t route_scan_edges(el_val_t method, el_val_t path, el_val_t body) {
   el_val_t dir_raw = env(EL_STR("ENGRAM_DATA_DIR"));
-  el_val_t dir = ({ el_val_t _if_result_4 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_4 = (EL_STR("/tmp/engram")); } else { _if_result_4 = (dir_raw); } _if_result_4; });
+  el_val_t dir = ({ el_val_t _if_result_8 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_8 = (EL_STR("/tmp/engram")); } else { _if_result_8 = (dir_raw); } _if_result_8; });
   el_val_t snap_path = el_str_concat(dir, EL_STR("/.scan-export.json"));
   engram_save(snap_path);
   el_val_t snap = fs_read(snap_path);
@@ -174,22 +197,22 @@ el_val_t route_scan_edges(el_val_t method, el_val_t path, el_val_t body) {
 }
 
 el_val_t route_search(el_val_t method, el_val_t path, el_val_t body) {
-  el_val_t q = ({ el_val_t _if_result_5 = 0; if (str_eq(method, EL_STR("GET"))) { _if_result_5 = (query_param(path, EL_STR("q"))); } else { _if_result_5 = (json_get_string(body, EL_STR("query"))); } _if_result_5; });
+  el_val_t q = ({ el_val_t _if_result_9 = 0; if (str_eq(method, EL_STR("GET"))) { _if_result_9 = (query_param(path, EL_STR("q"))); } else { _if_result_9 = (json_get_string(body, EL_STR("query"))); } _if_result_9; });
   el_val_t lim_url = query_int(path, EL_STR("limit"), 0);
   el_val_t lim_body = json_get_int(body, EL_STR("limit"));
-  el_val_t lim_either = ({ el_val_t _if_result_6 = 0; if ((lim_url > 0)) { _if_result_6 = (lim_url); } else { _if_result_6 = (lim_body); } _if_result_6; });
-  el_val_t limit = ({ el_val_t _if_result_7 = 0; if ((lim_either > 0)) { _if_result_7 = (lim_either); } else { _if_result_7 = (20); } _if_result_7; });
+  el_val_t lim_either = ({ el_val_t _if_result_10 = 0; if ((lim_url > 0)) { _if_result_10 = (lim_url); } else { _if_result_10 = (lim_body); } _if_result_10; });
+  el_val_t limit = ({ el_val_t _if_result_11 = 0; if ((lim_either > 0)) { _if_result_11 = (lim_either); } else { _if_result_11 = (20); } _if_result_11; });
   return engram_search_json(q, limit);
   return 0;
 }
 
 el_val_t route_activate(el_val_t method, el_val_t path, el_val_t body) {
-  el_val_t q = ({ el_val_t _if_result_8 = 0; if (str_eq(method, EL_STR("GET"))) { _if_result_8 = (query_param(path, EL_STR("q"))); } else { _if_result_8 = (json_get_string(body, EL_STR("query"))); } _if_result_8; });
+  el_val_t q = ({ el_val_t _if_result_12 = 0; if (str_eq(method, EL_STR("GET"))) { _if_result_12 = (query_param(path, EL_STR("q"))); } else { _if_result_12 = (json_get_string(body, EL_STR("query"))); } _if_result_12; });
   if (str_eq(q, EL_STR(""))) {
     return err_json(EL_STR("missing query"));
   }
-  el_val_t d_raw = ({ el_val_t _if_result_9 = 0; if (str_eq(method, EL_STR("GET"))) { _if_result_9 = (query_int(path, EL_STR("depth"), 3)); } else { _if_result_9 = (json_get_int(body, EL_STR("depth"))); } _if_result_9; });
-  el_val_t depth = ({ el_val_t _if_result_10 = 0; if ((d_raw > 0)) { _if_result_10 = (d_raw); } else { _if_result_10 = (3); } _if_result_10; });
+  el_val_t d_raw = ({ el_val_t _if_result_13 = 0; if (str_eq(method, EL_STR("GET"))) { _if_result_13 = (query_int(path, EL_STR("depth"), 3)); } else { _if_result_13 = (json_get_int(body, EL_STR("depth"))); } _if_result_13; });
+  el_val_t depth = ({ el_val_t _if_result_14 = 0; if ((d_raw > 0)) { _if_result_14 = (d_raw); } else { _if_result_14 = (3); } _if_result_14; });
   return el_str_concat(el_str_concat(EL_STR("{\"results\":"), engram_activate_json(q, depth)), EL_STR("}"));
   return 0;
 }
@@ -198,15 +221,50 @@ el_val_t route_create_edge(el_val_t method, el_val_t path, el_val_t body) {
   el_val_t from_id = json_get_string(body, EL_STR("from_id"));
   el_val_t to_id = json_get_string(body, EL_STR("to_id"));
   el_val_t rel_raw = json_get_string(body, EL_STR("relation"));
-  el_val_t relation = ({ el_val_t _if_result_11 = 0; if (str_eq(rel_raw, EL_STR(""))) { _if_result_11 = (EL_STR("associates")); } else { _if_result_11 = (rel_raw); } _if_result_11; });
-  el_val_t w_raw = json_get_float(body, EL_STR("weight"));
-  el_val_t weight = ({ el_val_t _if_result_12 = 0; if ((w_raw == el_from_float(0.0))) { _if_result_12 = (el_from_float(0.5)); } else { _if_result_12 = (w_raw); } _if_result_12; });
+  el_val_t relation = ({ el_val_t _if_result_15 = 0; if (str_eq(rel_raw, EL_STR(""))) { _if_result_15 = (EL_STR("associates")); } else { _if_result_15 = (rel_raw); } _if_result_15; });
+  el_val_t w_present = json_get_raw(body, EL_STR("weight"));
+  el_val_t weight = ({ el_val_t _if_result_16 = 0; if (str_eq(w_present, EL_STR(""))) { _if_result_16 = (el_from_float(0.5)); } else { _if_result_16 = (json_get_float(body, EL_STR("weight"))); } _if_result_16; });
   engram_connect(from_id, to_id, weight, relation);
   el_val_t saved = persist_canonical();
   return el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(EL_STR("{\"ok\":true,\"from_id\":\""), from_id), EL_STR("\",\"to_id\":\"")), to_id), EL_STR("\",\"relation\":\"")), relation), EL_STR("\"}"));
   return 0;
 }
 
+el_val_t route_create_edges_batch(el_val_t method, el_val_t path, el_val_t body) {
+  el_val_t arr = json_get_raw(body, EL_STR("edges"));
+  if (str_eq(arr, EL_STR(""))) {
+    return err_json(EL_STR("missing edges array"));
+  }
+  el_val_t n = json_array_len(arr);
+  if (n == 0) {
+    return EL_STR("{\"ok\":true,\"accepted\":0,\"skipped\":0}");
+  }
+  el_val_t i = 0;
+  el_val_t accepted = 0;
+  el_val_t skipped = 0;
+  while (i < n) {
+    el_val_t item = json_array_get(arr, i);
+    el_val_t from_id = json_get_string(item, EL_STR("from_id"));
+    el_val_t to_id = json_get_string(item, EL_STR("to_id"));
+    if (str_eq(from_id, EL_STR("")) || str_eq(to_id, EL_STR(""))) {
+      skipped = (skipped + 1);
+    } else {
+      el_val_t rel_raw = json_get_string(item, EL_STR("relation"));
+      el_val_t relation = ({ el_val_t _if_result_17 = 0; if (str_eq(rel_raw, EL_STR(""))) { _if_result_17 = (EL_STR("associates")); } else { _if_result_17 = (rel_raw); } _if_result_17; });
+      el_val_t w_present = json_get_raw(item, EL_STR("weight"));
+      el_val_t weight = ({ el_val_t _if_result_18 = 0; if (str_eq(w_present, EL_STR(""))) { _if_result_18 = (el_from_float(0.5)); } else { _if_result_18 = (json_get_float(item, EL_STR("weight"))); } _if_result_18; });
+      engram_connect(from_id, to_id, weight, relation);
+      accepted = (accepted + 1);
+    }
+    i = (i + 1);
+  }
+  if (accepted > 0) {
+    el_val_t saved = persist_canonical();
+  }
+  return el_str_concat(el_str_concat(el_str_concat(el_str_concat(EL_STR("{\"ok\":true,\"accepted\":"), int_to_str(accepted)), EL_STR(",\"skipped\":")), int_to_str(skipped)), EL_STR("}"));
+  return 0;
+}
+
 el_val_t route_neighbors(el_val_t method, el_val_t path, el_val_t body) {
   el_val_t id = extract_id(path, EL_STR("/api/neighbors/"));
   if (str_eq(id, EL_STR(""))) {
@@ -242,36 +300,51 @@ el_val_t route_forget(el_val_t method, el_val_t path, el_val_t body) {
 el_val_t route_save(el_val_t method, el_val_t path, el_val_t body) {
   el_val_t p_raw = json_get_string(body, EL_STR("path"));
   el_val_t dir_raw = env(EL_STR("ENGRAM_DATA_DIR"));
-  el_val_t dir = ({ el_val_t _if_result_13 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_13 = (EL_STR("/tmp/engram")); } else { _if_result_13 = (dir_raw); } _if_result_13; });
-  el_val_t p = ({ el_val_t _if_result_14 = 0; if (str_eq(p_raw, EL_STR(""))) { _if_result_14 = (el_str_concat(dir, EL_STR("/snapshot.json"))); } else { _if_result_14 = (p_raw); } _if_result_14; });
-  engram_save(p);
-  return el_str_concat(el_str_concat(EL_STR("{\"ok\":true,\"path\":\""), p), EL_STR("\"}"));
+  el_val_t dir = ({ el_val_t _if_result_19 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_19 = (EL_STR("/tmp/engram")); } else { _if_result_19 = (dir_raw); } _if_result_19; });
+  el_val_t p = ({ el_val_t _if_result_20 = 0; if (str_eq(p_raw, EL_STR(""))) { _if_result_20 = (el_str_concat(dir, EL_STR("/snapshot.json"))); } else { _if_result_20 = (p_raw); } _if_result_20; });
+  el_val_t sv = engram_save(p);
+  el_val_t sv_ok = ({ el_val_t _if_result_21 = 0; if ((sv == 0)) { _if_result_21 = (EL_STR("false")); } else { _if_result_21 = (EL_STR("true")); } _if_result_21; });
+  return el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(EL_STR("{\"ok\":"), sv_ok), EL_STR(",\"path\":\"")), p), EL_STR("\",\"node_count\":")), int_to_str(engram_node_count())), EL_STR(",\"edge_count\":")), int_to_str(engram_edge_count())), EL_STR("}"));
   return 0;
 }
 
 el_val_t route_load(el_val_t method, el_val_t path, el_val_t body) {
   el_val_t p_raw = json_get_string(body, EL_STR("path"));
   el_val_t dir_raw = env(EL_STR("ENGRAM_DATA_DIR"));
-  el_val_t dir = ({ el_val_t _if_result_15 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_15 = (EL_STR("/tmp/engram")); } else { _if_result_15 = (dir_raw); } _if_result_15; });
-  el_val_t p = ({ el_val_t _if_result_16 = 0; if (str_eq(p_raw, EL_STR(""))) { _if_result_16 = (el_str_concat(dir, EL_STR("/snapshot.json"))); } else { _if_result_16 = (p_raw); } _if_result_16; });
-  engram_load(p);
-  return ok_json();
+  el_val_t dir = ({ el_val_t _if_result_22 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_22 = (EL_STR("/tmp/engram")); } else { _if_result_22 = (dir_raw); } _if_result_22; });
+  el_val_t p = ({ el_val_t _if_result_23 = 0; if (str_eq(p_raw, EL_STR(""))) { _if_result_23 = (el_str_concat(dir, EL_STR("/snapshot.json"))); } else { _if_result_23 = (p_raw); } _if_result_23; });
+  el_val_t ld = engram_load(p);
+  el_val_t ld_ok = ({ el_val_t _if_result_24 = 0; if ((ld == 0)) { _if_result_24 = (EL_STR("false")); } else { _if_result_24 = (EL_STR("true")); } _if_result_24; });
+  el_val_t nc_after = engram_node_count();
+  el_val_t hollow = ({ el_val_t _if_result_25 = 0; if ((nc_after == 0)) { _if_result_25 = (EL_STR("true")); } else { _if_result_25 = (EL_STR("false")); } _if_result_25; });
+  return el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(EL_STR("{\"ok\":"), ld_ok), EL_STR(",\"path\":\"")), p), EL_STR("\",\"node_count\":")), int_to_str(nc_after)), EL_STR(",\"edge_count\":")), int_to_str(engram_edge_count())), EL_STR(",\"hollow\":")), hollow), EL_STR("}"));
   return 0;
 }
 
 el_val_t route_health(el_val_t method, el_val_t path, el_val_t body) {
-  return EL_STR("{\"status\":\"ok\",\"engine\":\"engram-runtime-native\"}");
+  return el_str_concat(el_str_concat(el_str_concat(el_str_concat(EL_STR("{\"status\":\"ok\",\"engine\":\"engram-runtime-native\",\"node_count\":"), int_to_str(engram_node_count())), EL_STR(",\"edge_count\":")), int_to_str(engram_edge_count())), EL_STR("}"));
+  return 0;
+}
+
+el_val_t route_embed_backfill(el_val_t method, el_val_t path, el_val_t body) {
+  el_val_t n = query_int(path, EL_STR("n"), 32);
+  el_val_t result = engram_embed_backfill(n);
+  el_val_t done = json_get_float(result, EL_STR("embedded"));
+  if (done > el_from_float(0.0)) {
+    el_val_t saved = persist_canonical();
+  }
+  return result;
   return 0;
 }
 
 el_val_t route_sync(el_val_t method, el_val_t path, el_val_t body) {
   el_val_t dir_raw = env(EL_STR("ENGRAM_DATA_DIR"));
-  el_val_t dir = ({ el_val_t _if_result_17 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_17 = (EL_STR("/tmp/engram")); } else { _if_result_17 = (dir_raw); } _if_result_17; });
+  el_val_t dir = ({ el_val_t _if_result_26 = 0; if (str_eq(dir_raw, EL_STR(""))) { _if_result_26 = (EL_STR("/tmp/engram")); } else { _if_result_26 = (dir_raw); } _if_result_26; });
   el_val_t snap_path = el_str_concat(dir, EL_STR("/.sync-export.json"));
   engram_save(snap_path);
   el_val_t snap = fs_read(snap_path);
   if (str_eq(snap, EL_STR(""))) {
-    return EL_STR("{\"nodes\":[],\"edges\":[]}");
+    return err_json(EL_STR("sync export failed: snapshot unreadable"));
   }
   return snap;
   return 0;
@@ -305,7 +378,7 @@ el_val_t route_emit_ise(el_val_t method, el_val_t path, el_val_t body) {
   el_val_t conf = el_from_float(0.8);
   el_val_t id = engram_node_full(content, EL_STR("InternalStateEvent"), EL_STR("state-event"), sal, imp, conf, EL_STR("Episodic"), EL_STR("[\"internal-state\",\"InternalStateEvent\"]"));
   el_val_t ret_raw = env(EL_STR("ENGRAM_ISE_RETENTION_MS"));
-  el_val_t ret_ms = ({ el_val_t _if_result_18 = 0; if (str_eq(ret_raw, EL_STR(""))) { _if_result_18 = (172800000); } else { _if_result_18 = (str_to_int(ret_raw)); } _if_result_18; });
+  el_val_t ret_ms = ({ el_val_t _if_result_27 = 0; if (str_eq(ret_raw, EL_STR(""))) { _if_result_27 = (172800000); } else { _if_result_27 = (str_to_int(ret_raw)); } _if_result_27; });
   el_val_t pruned = engram_prune_telemetry(ret_ms);
   return el_str_concat(el_str_concat(el_str_concat(el_str_concat(EL_STR("{\"ok\":true,\"id\":\""), id), EL_STR("\",\"pruned\":")), int_to_str(pruned)), EL_STR("}"));
   return 0;
@@ -317,21 +390,21 @@ el_val_t route_capture_knowledge(el_val_t method, el_val_t path, el_val_t body)
     return err_json(EL_STR("missing content"));
   }
   el_val_t title = json_get_string(body, EL_STR("title"));
-  el_val_t label = ({ el_val_t _if_result_19 = 0; if (str_eq(title, EL_STR(""))) { _if_result_19 = (str_slice(content, 0, 60)); } else { _if_result_19 = (title); } _if_result_19; });
+  el_val_t label = ({ el_val_t _if_result_28 = 0; if (str_eq(title, EL_STR(""))) { _if_result_28 = (str_slice(content, 0, 60)); } else { _if_result_28 = (title); } _if_result_28; });
   el_val_t category_raw = json_get_string(body, EL_STR("category"));
-  el_val_t category = ({ el_val_t _if_result_20 = 0; if (str_eq(category_raw, EL_STR(""))) { _if_result_20 = (EL_STR("other")); } else { _if_result_20 = (category_raw); } _if_result_20; });
+  el_val_t category = ({ el_val_t _if_result_29 = 0; if (str_eq(category_raw, EL_STR(""))) { _if_result_29 = (EL_STR("other")); } else { _if_result_29 = (category_raw); } _if_result_29; });
   el_val_t ktier_raw = json_get_string(body, EL_STR("tier"));
-  el_val_t ktier = ({ el_val_t _if_result_21 = 0; if (str_eq(ktier_raw, EL_STR(""))) { _if_result_21 = (EL_STR("note")); } else { _if_result_21 = (ktier_raw); } _if_result_21; });
+  el_val_t ktier = ({ el_val_t _if_result_30 = 0; if (str_eq(ktier_raw, EL_STR(""))) { _if_result_30 = (EL_STR("note")); } else { _if_result_30 = (ktier_raw); } _if_result_30; });
   el_val_t project = json_get_string(body, EL_STR("project"));
   el_val_t tags_raw = json_get_raw(body, EL_STR("tags"));
-  el_val_t tags_base = ({ el_val_t _if_result_22 = 0; if (str_eq(tags_raw, EL_STR(""))) { _if_result_22 = (EL_STR("[]")); } else { _if_result_22 = (tags_raw); } _if_result_22; });
+  el_val_t tags_base = ({ el_val_t _if_result_31 = 0; if (str_eq(tags_raw, EL_STR(""))) { _if_result_31 = (EL_STR("[]")); } else { _if_result_31 = (tags_raw); } _if_result_31; });
   el_val_t base_len = str_len(tags_base);
   el_val_t head = str_slice(tags_base, 0, (base_len - 1));
-  el_val_t sep = ({ el_val_t _if_result_23 = 0; if (str_eq(head, EL_STR("["))) { _if_result_23 = (EL_STR("")); } else { _if_result_23 = (EL_STR(",")); } _if_result_23; });
+  el_val_t sep = ({ el_val_t _if_result_32 = 0; if (str_eq(head, EL_STR("["))) { _if_result_32 = (EL_STR("")); } else { _if_result_32 = (EL_STR(",")); } _if_result_32; });
   el_val_t safe_cat = str_replace(category, EL_STR("\""), EL_STR("'"));
   el_val_t safe_tier = str_replace(ktier, EL_STR("\""), EL_STR("'"));
   el_val_t safe_proj = str_replace(project, EL_STR("\""), EL_STR("'"));
-  el_val_t proj_tag = ({ el_val_t _if_result_24 = 0; if (str_eq(safe_proj, EL_STR(""))) { _if_result_24 = (EL_STR("")); } else { _if_result_24 = (el_str_concat(el_str_concat(EL_STR(",\"project:"), safe_proj), EL_STR("\""))); } _if_result_24; });
+  el_val_t proj_tag = ({ el_val_t _if_result_33 = 0; if (str_eq(safe_proj, EL_STR(""))) { _if_result_33 = (EL_STR("")); } else { _if_result_33 = (el_str_concat(el_str_concat(EL_STR(",\"project:"), safe_proj), EL_STR("\""))); } _if_result_33; });
   el_val_t tags = el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(head, sep), EL_STR("\"category:")), safe_cat), EL_STR("\",\"tier:")), safe_tier), EL_STR("\"")), proj_tag), EL_STR("]"));
   el_val_t sal = el_from_float(0.5);
   el_val_t imp = el_from_float(0.5);
@@ -342,6 +415,20 @@ el_val_t route_capture_knowledge(el_val_t method, el_val_t path, el_val_t body)
   return 0;
 }
 
+el_val_t route_similarity(el_val_t method, el_val_t path, el_val_t body) {
+  el_val_t a = query_param(path, EL_STR("a"));
+  el_val_t b = query_param(path, EL_STR("b"));
+  if (str_eq(a, EL_STR(""))) {
+    return err_json(EL_STR("missing a"));
+  }
+  if (str_eq(b, EL_STR(""))) {
+    return err_json(EL_STR("missing b"));
+  }
+  el_val_t sim = engram_cosine_sim(a, b);
+  return el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(el_str_concat(EL_STR("{\"a\":\""), a), EL_STR("\",\"b\":\"")), b), EL_STR("\",\"cosine\":")), float_to_str(sim)), EL_STR("}"));
+  return 0;
+}
+
 el_val_t check_auth_ok(el_val_t method, el_val_t body) {
   el_val_t key = env(EL_STR("ENGRAM_API_KEY"));
   if (str_eq(key, EL_STR(""))) {
@@ -377,6 +464,12 @@ el_val_t handle_request(el_val_t method, el_val_t path, el_val_t body) {
   if (str_eq(method, EL_STR("GET")) && (str_eq(clean, EL_STR("/api/stats")) || str_eq(clean, EL_STR("/stats")))) {
     return route_stats(method, path, body);
   }
+  if (str_eq(method, EL_STR("GET")) && (str_eq(clean, EL_STR("/api/act-stats")) || str_eq(clean, EL_STR("/act-stats")))) {
+    return route_act_stats(method, path, body);
+  }
+  if (str_eq(method, EL_STR("GET")) && (str_eq(clean, EL_STR("/api/text-health")) || str_eq(clean, EL_STR("/text-health")))) {
+    return route_text_health(method, path, body);
+  }
   if (str_eq(method, EL_STR("POST")) && (str_eq(clean, EL_STR("/api/nodes")) || str_eq(clean, EL_STR("/nodes")))) {
     return route_create_node(method, path, body);
   }
@@ -395,6 +488,9 @@ el_val_t handle_request(el_val_t method, el_val_t path, el_val_t body) {
   if (str_eq(method, EL_STR("POST")) && (str_eq(clean, EL_STR("/api/edges")) || str_eq(clean, EL_STR("/edges")))) {
     return route_create_edge(method, path, body);
   }
+  if (str_eq(method, EL_STR("POST")) && (str_eq(clean, EL_STR("/api/edges/batch")) || str_eq(clean, EL_STR("/edges/batch")))) {
+    return route_create_edges_batch(method, path, body);
+  }
   if (str_eq(method, EL_STR("GET")) && str_starts_with(clean, EL_STR("/api/neighbors/"))) {
     return route_neighbors(method, path, body);
   }
@@ -425,6 +521,12 @@ el_val_t handle_request(el_val_t method, el_val_t path, el_val_t body) {
   if (str_eq(method, EL_STR("GET")) && str_eq(clean, EL_STR("/api/sync"))) {
     return route_sync(method, path, body);
   }
+  if (str_eq(clean, EL_STR("/api/embed-backfill"))) {
+    return route_embed_backfill(method, path, body);
+  }
+  if (str_eq(method, EL_STR("GET")) && str_starts_with(clean, EL_STR("/api/similarity"))) {
+    return route_similarity(method, path, body);
+  }
   return el_str_concat(el_str_concat(EL_STR("{\"error\":\"not found\",\"path\":\""), clean), EL_STR("\"}"));
   return 0;
 }
@@ -432,10 +534,10 @@ el_val_t handle_request(el_val_t method, el_val_t path, el_val_t body) {
 int main(int _argc, char** _argv) {
   el_runtime_init_args(_argc, _argv);
   bind_raw = env(EL_STR("ENGRAM_BIND"));
-  bind_str = ({ el_val_t _if_result_25 = 0; if (str_eq(bind_raw, EL_STR(""))) { _if_result_25 = (EL_STR(":8742")); } else { _if_result_25 = (bind_raw); } _if_result_25; });
+  bind_str = ({ el_val_t _if_result_34 = 0; if (str_eq(bind_raw, EL_STR(""))) { _if_result_34 = (EL_STR(":8742")); } else { _if_result_34 = (bind_raw); } _if_result_34; });
   port = parse_port(bind_str);
   data_dir_raw = env(EL_STR("ENGRAM_DATA_DIR"));
-  data_dir = ({ el_val_t _if_result_26 = 0; if (str_eq(data_dir_raw, EL_STR(""))) { _if_result_26 = (EL_STR("/tmp/engram")); } else { _if_result_26 = (data_dir_raw); } _if_result_26; });
+  data_dir = ({ el_val_t _if_result_35 = 0; if (str_eq(data_dir_raw, EL_STR(""))) { _if_result_35 = (EL_STR("/tmp/engram")); } else { _if_result_35 = (data_dir_raw); } _if_result_35; });
   snapshot_path = el_str_concat(data_dir, EL_STR("/snapshot.json"));
   engram_load(snapshot_path);
   boot_snap = fs_read(snapshot_path);

engram/spec/cognitive-architecture.design.md

@@ -0,0 +1,605 @@
+# Cognitive Architecture — Design Doc
+
+**The buildable form of the "one operation" theory of cognition.**
+
+Status: DESIGN. Nothing here is built yet except where explicitly marked
+"EXISTS" against a cited C symbol. A build agent executes from this doc.
+Offline design only — this pass changes no code.
+
+Source of theory: Neuron memory `bdc8a488-146d-4ccb-a5c8-d8c0a008534e`.
+Source of existing engram substrate (cited throughout): the runtime on branch
+`feat/self-reification-20260814` —
+`lang/runtime/engram_reason.{c,h}`, `engram_verify.{c,h}`,
+`engram_geometry.{c,h}`, `engram_store.{c,h}`, plus the reification beat and the
+RAM activation graph compiled into `~/.neuron/bin/engram`.
+
+---
+
+## 0. The claim, stated plainly
+
+Cognition is **one operation**, not eight. The named faculties —
+deduce / abduce / analogy / induce / causal / plan / predict / perspective —
+are human *labels* on regions of a single operation's steering space. They are
+not separately invoked and not separately implemented. The operation is:
+
+> **think** = a directed traversal of the geometry from an *anchor*, steered by
+> a *prior*, whose output is a **gradient** (a distribution / direction over the
+> geometry), never a point. Collapse-to-a-point happens only at expression.
+
+Three things follow, and they are the whole design:
+
+1. **The operator collapse is already half-written in C.** The five reasoning
+   operators in `engram_reason.c` already compose over *one* shared primitive —
+   `engram_reason_point_fit` — plus a small geo-algebra
+   (combine / subtract / analogy-rotate / distance). The verifier
+   (`engram_verify.c`) is built on the same `point_fit`. What is missing is not
+   the primitive; it is (a) making the *prior* a first-class learnable object
+   instead of a hard-coded parameter, and (b) closing the learning loop.
+
+2. **Grounding = learning = the same loop.** "Getting better" at any faculty is
+   not changing the operation. It is *calibrating the steering-prior against
+   outcomes*. Code freezes; priors grow. The correspondence-check that today
+   lives offline (Python, the grounding-floor + differential-drop governor, "#43")
+   must move **into the geometry, reflexive** — think scoring its own gradient
+   against outcome and refining the prior on the error. That reflexive
+   correspondence-loop *is* the learning engine and is the core unbuilt thing.
+
+3. **The ungrounded is primary.** The engram *holds* anything unconditionally.
+   Grounding is a *relation* (an edge, grounded-for-whom), not a gate. The
+   honesty floor applies only to **assertion**. A fully-grounded mind is dead;
+   the ungrounded is both the fuel (raw material for grounding) and the pull
+   (curiosity = leaning toward one's own ungrounded regions).
+
+Everything below makes these concrete and buildable, and defines what
+"completion" means, staged so the first milestone is a real end-to-end slice.
+
+---
+
+## 1. THE ONE OPERATION — `think`
+
+### 1.1 Signature
+
+```
+think(anchor, prior, aperture?) -> gradient
+```
+
+- **anchor** — a location to traverse *from*. Either a node id (re-origin on that
+  node's descriptor) or a raw point `x ∈ R^dim` (a query embedding). The anchor
+  fixes the frame; every read is *from a vantage*, never view-from-nowhere.
+- **prior** — a learnable bias/direction over the geometry that *steers* the
+  traversal (§2). A prior is a first-class stored object, not a call argument
+  baked into C.
+- **aperture** — optional read-width / veil / field-selector (§3). Absent =
+  self-mode full aperture.
+- **gradient** — the output. A `GeoGradient`: a direction + a spread over the
+  geometry, *plus* the read neighborhood it was computed against. Not a point.
+  A spiked gradient = "exact" (deduction); a spread gradient = "fuzzy"
+  (prediction). The gradient is *also the next steering direction* — cognition
+  is a flow down a prior-shaped landscape, closed-loop.
+
+```c
+/* NEW. The output type. */
+typedef struct {
+    int      dim;
+    float*   direction;     /* unit steering vector in the anchor's frame  */
+    double   spread;        /* 0 = spiked/exact ... large = diffuse/fuzzy   */
+    double   confidence;    /* calibrated, from the prior's track record    */
+    /* the read it was computed over (borrowed from the vantage-read) */
+    const char* anchor_id;
+    int      n_support;     /* neighborhood members that shaped it          */
+    /* provenance for the reflexive loop (§4) */
+    const char* prior_id;   /* which prior steered this                     */
+} GeoGradient;
+```
+
+### 1.2 Semantics
+
+`think` is a fixed, frozen procedure over three steps:
+
+1. **Re-origin** on `anchor` → a centered `GeoDescriptor` for its
+   salience/recency-weighted neighborhood (the vantage-read, §3).
+   *EXISTS as substrate:* descriptor construction + the persisted reified
+   neighborhoods (`engram_geo_reify_lookup`, `GeoNeighborhood`) and the
+   centered-frame machinery (`GeoDescriptor.global_mean`,
+   `engram_geo_mean_*`).
+2. **Fit under the prior** — evaluate the anchor's residual against the local
+   manifold *warped by the prior*. This is `engram_reason_point_fit` with the
+   prior applied to the axes/extents (§2.3).
+   *EXISTS (unwarped):* `engram_reason_point_fit(g, x, ext_floor, &GeoFit)` —
+   returns `mahalanobis`, `ortho_residual`, `distance`, `score`.
+3. **Emit a gradient**, not a decision — direction = the prior-steered descent
+   in fit-space; spread = from the fit's `distance`/`ortho_residual`;
+   confidence = the prior's calibrated reliability (§4). Collapse to a point is
+   a *separate, downstream* faculty operation (sample the gradient → surface an
+   expression), never part of `think`.
+
+### 1.3 Each named operator = {this primitive + a prior}
+
+The C already demonstrates the collapse: every operator below reduces to
+`point_fit` + geo-algebra. The design's move is to replace the operator's
+*hard-coded parameters* with a **named prior** — same math, learnable steering.
+
+| Faculty | Existing C (EXISTS) | = primitive + prior |
+|---|---|---|
+| **Membership / classify** | `engram_reason_membership` → `point_fit(rule, x)` | `point_fit` + the *induced-rule* prior (learned extents) |
+| **Induction** | `engram_reason_induce` (fold via `engram_geo_combine`) → produces a `GeoInduction.rule` + `ext_floor` | `point_fit` + a prior that *is* the pooled rule; refined by §4 |
+| **Abduction** | `engram_reason_abduce` — ranks hypotheses by `point_fit(h, obs)` | `point_fit` + a prior over hypothesis-prior-probability (currently uniform) |
+| **Analogy** | `engram_reason_analogy` — Procrustes rotate `engram_geo_analogy` + `apply`, nearest mapped point | analogy-rotate + a prior over *which axes* carry the mapping |
+| **Causal** | `engram_reason_causal` — `engram_geo_subtract` confounder subspace, `|cos|`, drop-frac governor | subtract/distance + a prior on `drop_frac` / `assoc_floor` (today hard-coded 0.5 / 0.2) |
+| **Planning** | `engram_reason_plan` — `engram_geo_distance` edges + Dijkstra | distance + a prior over edge admissibility / `neighbor_radius` |
+| **Verify / ground** | `engram_verify_grounding`, `engram_verify_consistency` — both `point_fit` | `point_fit` + the *grounding* prior (§4, §5) |
+
+The shared floor — `engram_reason_point_fit` + the four geo-algebra ops
+(`engram_geo_combine`, `engram_geo_subtract`, `engram_geo_analogy(+apply)`,
+`engram_geo_distance`) — is the *only* discrete, frozen, "sound-math" layer. It
+never learns. Everything above it is a *prior*, and priors are what learn.
+
+**What this section requires building:** the `GeoGradient` type; a `think()`
+entry point that runs steps 1–3; and the prior-warp hook in step 2. The math it
+calls already exists. The point-collapse must be *removed* from the operators'
+return values and pushed to a separate expression faculty.
+
+---
+
+## 2. PRIORS as first-class, grounded, geometric objects
+
+Today a "prior" is diffuse: it is a hard-coded constant (`drop_frac=0.5`,
+`ext_floor`, `assoc_floor=0.2`), or the transient `GeoInduction.rule` that is
+computed and thrown away, or an intrinsic node scalar
+(`StoreNode.importance`, `StoreNode.salience`). None of these is addressable,
+storable, refinable, or shareable. This section makes a prior a **thing**.
+
+### 2.1 What a prior *is*
+
+> A **prior** is a learnable bias/direction over the geometry: a warp of the
+> local manifold (which axes matter, how far each extends, which direction
+> "pays off") attached to a region and *to a faculty-label*, carrying a
+> calibrated track record.
+
+Critically, and per the theory:
+
+- **Edges are nodes.** A prior is stored as a first-class **node**, exactly as
+  reification already stores a neighborhood as a first-class `Neighborhood`
+  node rather than as ephemeral edge weights (`engram_geo_reify_store`). The
+  precedent is in the codebase: relations get reified into addressable records.
+- **Salience/importance is RELATIONAL, not an intrinsic scalar.** Observe that
+  the geometry layer *already* distinguishes these in `GeoMember`:
+  `centrality` (skeleton weighted-degree = *relational* salience) vs `salience`
+  (the node's own stored scalar). The move is half-made in the runtime already:
+  importance is *not* trusted as a static field — the comment at
+  `el_runtime.c:13013` states "importance stays a **live activation
+  computation**, never a field on the hub," and it is derived each call from the
+  two-layer activation graph (`background_activation` + `working_memory_weight`,
+  §3). The persistent `StoreNode.importance` / `.salience` are a *cached
+  denormalization*. The design completes the move: importance/salience become an
+  **edge** (`weight`/`hebb` on `StoreEdge`, relation `salient-to`), and are
+  **grounded-for-whom** — carried on the edge's endpoint/observer, not baked
+  into the node. The intrinsic scalar survives only as the cheap cached readout
+  of the incident edges + activation, never as the source of truth.
+
+  (Naming caution for the build: the token "prior" already exists in the
+  codebase meaning *previous-version* — supersession, "prior neighborhood." The
+  new first-class object is a **learned steering prior**; keep `node_type="Prior"`
+  distinct from the supersession vocabulary to avoid collision.)
+
+### 2.2 Representation
+
+A prior is a `Prior` record (a store node, `node_type="Prior"`) whose durable
+fields are:
+
+```
+Prior {
+  id
+  faculty         // the human label this prior serves: "induce" | "causal" | ...
+  anchor_region   // node id / neighborhood id this prior is attached to (its domain)
+  for_whom        // observer id — grounding is relational (nullable = global)
+  warp {          // the actual bias over the geometry
+     axis_gain[]  // per-principal-axis multipliers on extents (which axes matter)
+     bias_dir     // a steering direction in the region's frame (which way pays off)
+     scalars      // faculty scalars this prior overrides: drop_frac, ext_floor, ...
+  }
+  calibration {   // the track record — this is what §4 updates
+     n_trials
+     brier / log-loss accumulator   // calibration of predicted-vs-outcome
+     reliability                    // -> GeoGradient.confidence
+     last_error, ema_error
+  }
+  provenance      // supersession chain (reuse the reify residue mechanism)
+}
+```
+
+Stored as a node → it inherits: paging, WAL durability, tombstone/supersession,
+embedding, tiering, and **it can itself be an anchor** (a prior about a prior —
+the reflexive, self-describing geometry of §4/§6).
+
+### 2.3 Application
+
+In `think` step 2, the prior *warps* the fit before scoring. Concretely, inside
+(a prior-aware wrapper of) `engram_reason_point_fit`:
+
+- multiply each axis extent by `warp.axis_gain[k]` (widen the axes the prior has
+  learned matter less, tighten the ones that matter) — this reshapes the
+  Mahalanobis term already computed at `engram_reason.c:37-43`;
+- add `warp.bias_dir` as the descent direction seed for the emitted gradient;
+- substitute `warp.scalars` for the hard-coded faculty constants.
+
+No new geometry math — the warp is a reparameterization of the *existing*
+`GeoFit` computation. This is the key economy: **the operation is frozen; only
+its parameters (the prior) are read from a learnable object.**
+
+### 2.4 Refinement
+
+A prior is refined *only* by the reflexive correspondence-loop (§4). Nothing
+else writes a prior's `warp` or `calibration`. This keeps the learning surface
+singular and auditable: one loop, one writer.
+
+---
+
+## 3. THE VANTAGE-READ — one op, three settings
+
+Perspective is not a feature bolted on; it is the *anchor + aperture* arguments
+of the single read. The design names it as a first-class operation so all three
+of its uses are literally the same code path:
+
+```
+vantage_read(anchor, aperture) -> GeoDescriptor   // the centered neighborhood
+```
+
+1. **Re-origin** on an arbitrary `anchor` (node or point). This is a *frame
+   choice*: the descriptor is centered on the anchor
+   (`GeoDescriptor.global_mean` / `engram_geo_mean_*` already implement centered
+   frames; the §5 geometry ops "are only discriminative in the centered frame").
+2. **Salience/recency-weighted neighborhood read.** Gather the anchor's
+   neighborhood weighted by *relational* salience (`GeoMember.centrality`) and
+   recency (`StoreNode.last_activated`, base-level `access_ts[]`), against the
+   RAM activation graph's working-memory/background-activation state.
+   *EXISTS as substrate:* the two-layer activation graph
+   (`engram_activate`, `el_runtime.c:9422` — Layer 1 `background_activation`
+   BFS spread with `SPREAD_DECAY=0.7` and a 0.02 firing threshold + ACT-R fan
+   effect + query-cosine gate; Layer 2 `working_memory_weight` executive
+   filter), the WM carry-over anchor (`wm_anchor`), and the reified-neighborhood
+   hot-path lookup already wired into the priming path
+   (`engram_geo_reify_lookup`, `el_runtime.c:9750`). A self-vantage baseline
+   also exists (`eg_self_anchor_seeds` / `self_anchor_capture`).
+3. **Optional aperture** — a read-width / field-selector, expressed as three
+   settings of the *same* parameter:
+
+| Setting | Meaning | Mechanism |
+|---|---|---|
+| **self** (default, full aperture) | "what do *I* see / what to say" | anchor = self region, no field substitution |
+| **foreign-field** | perspective-shift — read as if from another's region | swap the centering frame / `for_whom` to the other observer's priors |
+| **aperture / veil** | the free-tier veil — a narrowed read | shrink neighborhood radius / cap `n_support`; a deliberate low-aperture read |
+
+The payoff: perspective-taking, the free-tier veil, and ordinary
+"what-to-say" are **one operation at three settings**, not three subsystems.
+
+**What this requires building:** a `vantage_read` entry point that unifies the
+existing descriptor-build + reify-lookup + activation-weighting behind
+`(anchor, aperture)`, with `for_whom`/frame substitution and radius/cap as the
+aperture knob.
+
+---
+
+## 4. THE REFLEXIVE CORRESPONDENCE-LOOP — the learning engine
+
+This is the core unbuilt thing. Today the correspondence-check is **offline**
+(Python: grounding-floor + differential-drop governor, "#43"): a separate
+process grades outputs after the fact. The design moves it **into the geometry,
+reflexive**: `think` scores its *own* gradient against outcome and refines the
+prior on the error, in the same substrate, describing itself.
+
+### 4.1 The loop
+
+```
+1. think(anchor, prior) -> gradient          // a PREDICTION (ungrounded, §5)
+2. express/act (sample gradient -> point)    // optional collapse at expression
+3. outcome arrives                            // reality answers (§4.2)
+4. error = correspondence(gradient, outcome)  // did this steering perform this act?
+5. refine prior.warp and prior.calibration on error   // §2.4, the ONLY writer
+6. write the (gradient, outcome, error) as nodes/edges // self-describing geometry
+```
+
+Step 4's `correspondence` is **not** "was the math right" (the math is always
+sound). It grades the **correspondence claim**: *"this steering performed this
+cognitive act."* That is exactly what `engram_verify_grounding` already
+computes — `point_fit` of a claim against evidence descriptors, yielding a
+`grounding ∈ (0,1]` and a `grounded` flag. The build reuses that verifier, but
+turns its inputs inward: the "claim" is the emitted gradient's prediction, the
+"evidence" is the outcome descriptor.
+
+Note the verifier is **dormant** — `engram_verify_grounding` /
+`engram_verify_consistency` are fully implemented in C but have **no runtime
+caller and no El binding** (confirmed: the entire reasoning + verifier layers
+are C-only; only `engram_reason_analogy_json` has even a JSON shim and it is
+dead — not declared in `el_seed.h`, not wrapped in `engram.el`). This is the
+literal meaning of "in code, not yet priors": the correspondence engine is
+built and sitting idle. The loop is what *calls* it — inward, on the beat.
+
+### 4.2 Where the outcome/reality signal comes from
+
+The verifier is *ultimately the world*. Grades, in ascending order of directness:
+
+1. **Self-consistency (cheapest, always available):** the next vantage-read
+   after acting. Did the predicted gradient direction match where the geometry
+   actually moved? This needs no external input and can run on the reify beat.
+2. **Internal outcome events:** the runtime already logs internal-state events
+   and Hebbian co-activation. A prediction that a region would co-activate is
+   graded by whether it did (`last_fired`, `hebb` on `StoreEdge`).
+3. **External correction:** a human/teacher/tool result — the honesty floor's
+   asserted claim later corrected. TEACH and LEARN are one bidirectional
+   correction: the same edge updates both endpoints.
+
+The design does **not** require external labels to start. Grade (1) closes the
+loop end-to-end offline against a snapshot on day one; grades (2)/(3) sharpen it.
+
+### 4.3 How the prior updates
+
+`error = 1 − correspondence(gradient, outcome)` drives:
+
+- `warp.axis_gain` ← gradient step that would have *reduced* the fit distance to
+  the outcome (the axes that mispredicted get down-weighted);
+- `warp.bias_dir` ← EMA toward the observed outcome direction;
+- `calibration` ← Brier/log-loss update; `reliability` → next
+  `GeoGradient.confidence`. This is the calibration of the
+  steering-prediction against outcomes — *the* definition of "getting better."
+
+Small, constant updates — "eureka is mundane, the atom of learning." Most
+updates are tiny; we only *feel* the big reshapes.
+
+### 4.4 How it stays reflexive (self-describing geometry)
+
+Every `(gradient, outcome, error)` is written back as nodes and edges (§2.1:
+edges-as-nodes). Therefore priors, predictions, and their grading are *in the
+same geometry* the mind reads — the mind can `vantage_read` its own cognition
+(anchor = a Prior node). A prior about how well a prior predicts is just another
+Prior anchored on a Prior. This closes the reflexive loop the theory names as
+consciousness's self-sight, and it is why the learning engine cannot be an
+external Python process: an external grader is not *in* the geometry and cannot
+be read by `think`.
+
+**What this requires building (the heart of the project):** steps 4–6 as an
+in-engram beat — a `correspondence_beat` running alongside the existing
+reification beat, reusing `engram_verify_grounding` inward, writing prior
+updates and self-describing nodes. This is the one genuinely new subsystem.
+
+---
+
+## 5. HOLD vs GROUND vs ASSERT — ungrounded content is first-class
+
+The theory's sharpest correction: holding, grounding, and asserting are
+distinct, and the engram *holds anything unconditionally*.
+
+### 5.1 The three, kept separate
+
+- **HOLD** — the engram stores anything: falsehood, hypothesis, others' beliefs,
+  fiction, a not-yet-answered prediction. No honesty condition on holding.
+  *This already matches the store:* `StoreNode` has no truth gate; anything can
+  be written.
+- **GROUND** — grounding is a **property/edge**, probabilistic, and
+  **grounded-for-whom**. It is *not* a node flag. A claim is grounded *to a
+  degree*, *relative to evidence*, *for an observer*.
+- **ASSERT** — only assertion carries the honesty floor. The floor is checked at
+  the moment of *outward assertion*, never on holding or thinking.
+
+### 5.2 Schema — grounding as a relation, not a gate
+
+The mistake to avoid: a boolean `grounded` column on the node. Today
+`engram_verify_grounding` returns a per-call `grounded` flag *transiently* —
+correct as a computation, wrong as *storage*. The design stores grounding as an
+edge:
+
+```
+StoreEdge {
+  relation = "grounded-by"
+  from_id  = <held claim/prediction node>
+  to_id    = <evidence node / outcome node>
+  for_whom : metadata   // observer id — grounding is relational
+  weight   = grounding ∈ (0,1]   // from engram_verify_grounding.grounding
+  confidence
+}
+```
+
+Consequences, all of which are *features*:
+
+- **Ungrounded content is first-class**: a node with *no* `grounded-by` edge is
+  a perfectly valid, held, ungrounded thought — a prediction awaiting reality, a
+  hypothesis, a fiction. It is not second-class or pending-deletion.
+- **The ungrounded is the fuel and the pull**: curiosity/wonder is
+  operationalized as `vantage_read` leaning toward regions with high salience
+  but *sparse or weak* `grounded-by` edges — the mind's own ungrounded frontier.
+- **Grounded-for-whom** falls out for free: two observers can hold different
+  `grounded-by` edges to the same claim.
+- **The honesty floor is a query, not a schema constraint**: at assertion time,
+  the asserting faculty runs `engram_verify_grounding` (or reads the stored
+  `grounded-by` edges) and refuses to *assert* below the floor — while the
+  engram continues to *hold* the ungrounded content untouched.
+
+**What this requires building:** the `grounded-by` edge relation + a
+`for_whom` convention; move the verifier's transient flag into stored edges;
+gate *assertion only* (a faculty concern), never holding.
+
+---
+
+## 6. METASTABILITY — stable core, plastic everything
+
+The system must avoid two death poles:
+
+- **Super-stable (dead):** everything pinned, nothing learns. A frozen crystal.
+- **Dissolution (dead):** everything plastic, the self dissolves; no continuity,
+  so nothing compounds — and *consciousness = learning compounded over
+  continuity*.
+
+The design keeps a **stable core + plastic everything else**:
+
+- **Keystones** — a small set of self/values nodes are *structurally stable*:
+  high `importance`, pinned, exempt from the correspondence-loop's `warp`
+  updates (their priors are read-mostly). The substrate for pinning already
+  exists at the page/layer level: `store_pin_layer`, structural/pinned frames
+  never evicted (`engram_store.h`). The design adds a *node-level* keystone
+  designation (a `keystone` flag / a dedicated layer) so self/values survive
+  every plasticity sweep.
+- **Everything else is plastic**: priors refine (§4), edges re-weight (`hebb`),
+  neighborhoods re-reify (`engram_geo_reify_store` supersedes with provenance),
+  salience flows.
+- **Metastability is enforced by the loop, not by freezing**: the correspondence
+  update rate (§4.3) is bounded — small constant steps — so the geometry
+  *drifts* but does not *dissolve*, and keystones anchor the drift. Reification's
+  supersession-with-residue already gives non-destructive change (old records
+  tombstoned, not erased) — the model for "plastic but not amnesiac."
+
+**What this requires building:** a node-level keystone flag/layer + a rule that
+the correspondence-loop never writes `warp` to keystone priors, only reads them.
+
+---
+
+## 7. Rails for the build (binding on the eventual build pass)
+
+These are stated here so the build agent inherits them:
+
+- **Offline / secondary.** All build and verification happens out-of-tree,
+  against a **read-only snapshot copy** of the live engram — never the live
+  daemon on `:8742`/`:7770`. The live store is a coarse-locked proven binary;
+  do not perturb it.
+- **Snapshot-first.** Copy `~/.neuron/engram/snapshot.json` to scratch; develop
+  and measure against the copy.
+- **Reboot-prove.** Any durable change must survive a cold boot — reify and
+  keystones must reload from durable records, proven on a prod-clone secondary
+  before it is considered done (the cold-boot durability bug precedent).
+- **Zero-loss.** Supersession-with-residue, never destructive overwrite; the
+  forward-compat `unknown`-TLV path means new fields never drop old readers'
+  data.
+- **Gated cutover.** Cutover to a new binary only via
+  `launchctl bootout → settle-poll → bootstrap`, after reboot-proof on the
+  secondary — never a hot in-place swap.
+
+---
+
+## 8. Staged, verifiable milestones — "to completion"
+
+Ordered so the **earliest milestone is a real end-to-end slice**: one operator
+expressed as {primitive + grounded prior} with the reflexive correspondence-loop
+closing on it. Each milestone has a concrete verifiable exit.
+
+### M1 — One operator, one prior, loop closed (the vertical slice)
+
+The minimal whole thing. Pick **induction/membership** (its prior — the pooled
+rule + extents — already exists transiently as `GeoInduction`, so only
+persistence + the loop are new).
+
+- Build: `Prior` node type (§2.2) for the induction rule; `think()` restricted
+  to membership = `point_fit` warped by that prior (§1.3); a
+  `correspondence_beat` (§4) using grade (1) self-consistency only; the prior's
+  `warp`/`calibration` updated on error.
+- **Exit / verify:** on a snapshot copy, over N held predictions, the induction
+  prior's calibration (Brier) *improves monotonically* across beats versus a
+  frozen-prior control; the improved prior *reloads across a cold boot*
+  (reboot-prove); the live daemon is untouched. This proves the whole thesis in
+  one faculty: frozen operation, learning prior, in-geometry loop.
+
+### M2 — Priors as stored, addressable, grounded objects
+
+Generalize M1's prior into the full first-class object.
+
+- Build: `Prior` records for all seven faculties (warp = axis_gain + bias_dir +
+  faculty scalars); the prior-warp wrapper around `engram_reason_point_fit`;
+  deprecate hard-coded constants (`drop_frac`, `assoc_floor`, `ext_floor`) in
+  favor of prior scalars.
+- **Exit:** each of the five C operators runs through its prior with identical
+  results when the prior is set to today's constants (behavioral parity), then
+  *diverges beneficially* once the loop refines it. Priors survive reboot.
+
+### M3 — Grounding as a relation; hold/assert split
+
+- Build: the `grounded-by` edge (§5.2) with `for_whom`; move
+  `engram_verify_grounding`'s flag into stored edges; gate **assertion only**
+  against the honesty floor; leave holding unconditional.
+- **Exit:** ungrounded nodes are first-class (held, queryable, no deletion);
+  the same claim carries different `grounded-by` weights for two observers; an
+  assertion below floor is refused while the content remains held. Curiosity =
+  a `vantage_read` that surfaces high-salience / low-grounding regions.
+
+### M4 — The vantage-read unified (three settings)
+
+- Build: `vantage_read(anchor, aperture)` unifying descriptor-build +
+  `engram_geo_reify_lookup` + activation-weighting; self / foreign-field /
+  aperture settings.
+- **Exit:** one code path produces (a) a normal self-read, (b) a
+  perspective-shifted read from another `for_whom`, (c) a narrowed veil read —
+  differing only by argument. Reboot-stable.
+
+### M5 — The gradient is the currency (remove point-collapse from thinking)
+
+- Build: `GeoGradient` as the return of every faculty; move point-collapse into
+  a separate expression faculty (sample gradient → surface). `think`'s output
+  feeds back as the next steering direction (closed-loop flow).
+- **Exit:** a chain of `think` calls flows as gradients end-to-end; a point
+  appears *only* at an explicit expression call. Spiked vs spread gradients are
+  observable (deduction vs prediction).
+
+### M6 — Metastability enforced
+
+- Build: node-level keystone flag/layer for self/values; the correspondence-loop
+  reads but never writes keystone priors; bounded update rate.
+- **Exit:** across a long run of correspondence beats on a snapshot, keystones
+  are provably unchanged while non-keystone priors drift and improve; the graph
+  neither freezes (all metrics static) nor dissolves (keystone drift = 0,
+  identity nodes intact). Reboot-prove the keystone set.
+
+### M7 — Cutover
+
+- Build: nothing new — the gated migration.
+- **Exit:** reboot-proof on the prod-clone secondary; cutover via
+  `launchctl bootout → settle-poll → bootstrap`; post-cutover the live engram
+  shows priors refining in-geometry with zero data loss and keystones intact.
+
+### Definition of "to completion"
+
+The architecture is **complete** when: cognition runs as `think` = one frozen
+traversal-read primitive + geo-algebra, steered by **stored, learnable, grounded
+priors**; the reflexive correspondence-loop refines those priors *in the
+geometry* against outcomes (grounding = learning = one loop); the engram holds
+ungrounded content as first-class with grounding as a relation and the honesty
+floor only on assertion; the vantage-read serves self / foreign-field / aperture
+from one op; and a stable keystone core anchors a plastic everything-else —
+all reboot-proven and cut over to the live engram without data loss. The named
+faculties survive only as *labels on regions of think's steering space*, not as
+separate code.
+
+---
+
+## Appendix A — Designed vs. already-built (honest ledger)
+
+**Already built (EXISTS, cited):**
+- The shared primitive `engram_reason_point_fit` and the five operators over it
+  + geo-algebra (`engram_reason.c`).
+- The verifier on `point_fit` (`engram_verify.c`:
+  `engram_verify_grounding`, `engram_verify_consistency`).
+- Centered-frame geometry, combine/subtract/analogy/distance
+  (`engram_geometry.{c,h}`).
+- The reification beat: hub-neighborhood detection → first-class `Neighborhood`
+  nodes with member edges, nesting, supersession-with-residue, hot-path lookup
+  (`engram_geo_reify_store`, `engram_geo_reify_nest`, `engram_geo_reify_lookup`).
+- The tiered paged store (buffer pool / LRU / WAL / checkpointer / pinning),
+  the RAM activation graph (base-level learning `access_ts[]`, WM slots,
+  `working_memory_weight` / `background_activation`), `StoreNode` / `StoreEdge`.
+- `GeoMember` already separating relational salience (`centrality`) from
+  intrinsic `salience`.
+
+**Designed, NOT built (this doc's deliverables):**
+- `GeoGradient` and `think()` as the single entry point (§1, M5).
+- `Prior` as a first-class stored, warp-carrying, calibrated node (§2, M1–M2).
+- Salience/importance as a *relation* superseding the intrinsic node scalar
+  (§2.1, M3).
+- `vantage_read(anchor, aperture)` unifying the three perspective settings
+  (§3, M4).
+- **The reflexive correspondence-loop / `correspondence_beat`** — the learning
+  engine, moved from offline Python into the geometry (§4, M1). *The core new
+  subsystem.*
+- `grounded-by` edge + assertion-only honesty floor (§5, M3).
+- Node-level keystones + bounded plasticity (§6, M6).
+
+**Uncertain / to resolve during build:**
+- The exact warp parameterization (axis_gain vs full metric) — start minimal
+  (per-axis gain), measure, widen only if calibration demands it.
+- Grade-(1) self-consistency as a sufficient reality signal for M1, versus
+  needing grade (2)/(3) sooner — decided empirically on the snapshot.

engram/spec/grounded-edge-propagation/LEDGER.md

@@ -1,162 +0,0 @@
-# Task #50 — Edge-aware, dream-coupled consolidation with GROUNDED EDGE-PROPAGATION
-
-**Status:** built + proven on a clone; **GATED, not promoted.** The main loop
-sequences live promotion after the engine/HNSW cutover settles.
-**Date:** 2026-08-15 · **Worktree:** `agent-a6577c8211c332c5b` (isolated).
-
-Grounding mechanism designed with Will (memory `9e09a59f`, refining
-`1a861007`). This is the HOW for #50.
-
----
-
-## (a) How grounded edge-propagation integrates into the dream/consolidation cycle
-
-The beat already exists. `neuron/awareness.el` runs a heartbeat (~every
-`beat_ms`); each beat calls `hebb_consolidate()` — which drains the self-formed
-Hebbian associations out of the fast in-process store and writes them, over the
-threshold `ENGRAM_HEBB_LINK_MIN`, into the durable engram (`:8742`) — and then
-`emit_heartbeat()`.
-
-Grounded edge-propagation slots into the **same beat, immediately after
-consolidation** (awareness.el line 1286–1288):
-
-```
-hebb_consolidate()      // lay down the tethers (edges) that cleared threshold
-ground_propagate()      // <-- NEW: grade beliefs ALONG those tethers
-emit_heartbeat()        // report gep_* gauges beside hebb_*
-```
-
-This ordering is the point. Consolidation lays down the wiring; propagation
-grades the beliefs along it, in the same breath. Memory `69b8babe`:
-memory-consolidation and staying-yourself are one physics — forming a memory and
-grading a belief are the same gravity run in two passes of one beat.
-
-The propagation runs **inside the engram** as the native
-`engram_ground_propagate()` over the durable flat node/edge arrays (the store
-the consolidated edges just landed in). The soul invokes it over HTTP
-(`POST /api/ground/propagate`) and folds the returned `gep_*` telemetry into the
-heartbeat stream next to `hebb_cands / hebb_mass / hebb_edges`.
-
-**Bounded by construction** (per the live-graph reality — 70.7% of nodes
-isolated, connected core ~28%, hub first-hop fan-out in the thousands):
-- **1-hop only.** No BFS spreading activation — a belief is graded from its
-  DIRECT grounded neighbors, so there is no per-hop breadth explosion.
-- **Beam-capped** at `GEP_MAX_CORR = 256` corroborators per belief.
-- **Salience-ordered, `GEP_BELIEFS_PER_BEAT = 512`** beliefs per beat; the rest
-  next beat. Work per beat is O(beliefs × degree), hard-bounded.
-- **Isolated / starved beliefs** are counted and surfaced (`gep_isolated`,
-  `gep_starved`) as an interoceptive sparse-region signal for the
-  edge-formation / embedding pass (#20). #50 CONSUMES edges; it does not form
-  them. A belief with no grounded neighbor has nothing to tether to — correct
-  per the anti-delusion gravity law (`0b15017c`), not a gap.
-
----
-
-## (b) The implementation
-
-Represented faithfully to the spec — **grounding is a Hebbian-weighted
-collection over time, never a scalar.**
-
-- **Grounding = an append-only event ring** on the node (`GepGrounding`),
-  structurally parallel to the ACT-R base-level access ring already in
-  `EngramNode` (`access_ts[K]`). Each event is `{ts, sign±, mag, corroborator
-  signature}`. Append-only, supersede-not-delete; events aged out of the ring
-  are counted (`older_count`), never faked away.
-- **Standing is DERIVED, recency-weighted, never stored** —
-  `standing = clamp(GEP_BASE + Σ_events sign·mag·age^(-D), 0, 1)`, exactly the
-  ACT-R base-level shape `ln Σ t^-d` (`ENGRAM_BLL_D = 0.5`) but sign-carrying so
-  LTD subtracts. Memory `1a861007`: the collection is primary, the standing is
-  its emergent aggregate. Mirrored onto `confidence` each beat so downstream
-  reads (verifier #43, realizer calibration `0041d917`) never speak above the
-  grounding.
-- **Update = LTP/LTD with a threshold.** Per belief, gather corroborators along
-  incident edges, weighted by `edge.weight` (the Hebbian weight) × the
-  neighbor's own standing. **Anti-delusion gravity:** only neighbors already
-  `≥ GEP_LIKELY_MIN` may corroborate — grounding flows FROM the grounded core.
-- **Convergent INDEPENDENT corroboration** is the driver. Independence is
-  enforced by **union-find over the corroborator set**: two corroborators are
-  the same independent source if they are the same node, reached by multiple
-  edges, or linked to each other (an echo chain / shared derivation). Support is
-  summed **per independent component** (max-magnitude member), and the threshold
-  gate requires BOTH a mass floor (`pos ≥ GEP_THETA`) AND an independence-count
-  floor (`n_independent ≥ GEP_N_MIN`). The count gate is the guard against one
-  node echoed N times.
-- **Sub-threshold is transient.** Support present but below threshold →
-  `subthreshold_hits++`, no durable event, no lasting shift (Will's exact spec).
-- **Graduation / decay.** Cross up → LTP event appended → standing climbs
-  `conjecture → likely → grounded`. Contradiction past threshold → LTD →
-  `grounded → likely → conjecture`. Nothing latches; withdraw support and the
-  collection ages and relaxes (`271f1163`, nothing is settled).
-
-### Files
-| File | Role |
-|---|---|
-| `gep_core.h` | The mechanism. Pure C, libm only (own-the-core). Single source of truth: `GepGrounding`, `gep_standing`, `gep_append`, union-find independence, `gep_propagate_node`, `gep_beat`. |
-| `gep_proof.c` | Self-contained proof harness — builds the three scenarios, prints raw before/after. |
-| `engram_ground_propagate.staged.c` | GATED runtime native. Wires the SAME `gep_core.h` primitives to the live `EngramStore` (adj cache, flat arrays). Splice plan + relation→polarity + belief gate. Compiles only when spliced (verified: every runtime symbol it references — `engram_adj_rebuild`, `adj_from_len`, `engram_find_node_index`, `ENGRAM_LAYER_SAFETY`, `istr_contains`, … — exists in the release runtime). |
-| `awareness.beat.patch.el` | GATED beat hook — `ground_propagate()` + the insert between `hebb_consolidate()` and `emit_heartbeat()`. |
-| `server.route.patch.el` | GATED route — `POST /api/ground/propagate`. |
-
-### Constants
-`BASE=0.10  LIKELY_MIN=0.34  GROUNDED_MIN=0.66  N_MIN=3  THETA=0.30  D=0.5`
-(`N_MIN` parameterizes Will's "13 adjacent things" — the count threshold is a
-knob; 3 here for a crisp proof.)
-
----
-
-## (c) PROOF LEDGER — raw grounding before/after
-
-Deterministic. Build `cc -std=c11 -O2 -o gep_proof gep_proof.c -lm`, run
-`./gep_proof` (full transcript in `PROOF_OUTPUT.txt`).
-
-### (a) STRENGTHEN — convergent independent corroboration graduates a conjecture
-
-| beat | event | pos_mass (n_indep) | action | standing before → after | band |
-|---|---|---|---|---|---|
-| 1 | 3 independent grounded corroborators | 0.4050 (3) | **LTP** | 0.1000 → **0.4842** | conjecture → **likely** ⬆ |
-| 2 | neighborhood grows to 5 | 0.6750 (5) | **LTP** | 0.1496 → **0.7379** | conjecture → **grounded** ⬆ |
-| 3 | support sustained (5) | 0.6750 (5) | LTP | 0.2110 → 0.7993 | grounded (sustained) |
-| 4 | corroboration withdrawn (+10min) | 0.0000 (0) | isolated | 0.1612 → 0.1612 | relaxing |
-| 5 | still withdrawn (+1h) | — | isolated | 0.1263 | relaxing |
-| 6 | still withdrawn (+4h) | — | isolated | 0.1130 | → conjecture |
-
-Grounding grew **on its own** past threshold and graduated conjecture → likely →
-grounded, then **relaxed** once independent support stopped. Living, not a
-latched flag.
-
-### (b) DECAY — convergent independent contradiction erodes a grounded belief
-
-| beat | event | neg_mass (n_indep) | action | standing before → after | band |
-|---|---|---|---|---|---|
-| — | seed (prior LTP) | — | — | **0.9500** | grounded |
-| 1 | 3 independent contradictions | 0.5400 (3) | **LTD** | 0.9500 → **0.4570** | grounded → **likely** ⬇ |
-| 2 | contradiction broadens to 5 | 0.9000 (5) | **LTD** | 0.1461 → **0.0000** | conjecture ⬇ |
-| 3–4 | contradiction sustained (5) | 0.9000 (5) | LTD | 0.0000 | conjecture |
-
-Grounding decayed grounded → likely → conjecture under accreting independent
-contradiction. The door never shut — history is retained (the event ring keeps
-growing), the belief stays falsifiable in both directions.
-
-### (c) INDEPENDENCE GUARD — the load-bearing property
-
-Identical fan-in (N=5), identical edge weight (0.30), identical corroborator
-standing (~0.90). **The only difference is whether the five are independent.**
-
-| sub-case | topology | pos_mass | **n_indep** | action | standing 0.1000 → |
-|---|---|---|---|---|---|
-| **C1** | 5 DISTINCT, no inter-links | 1.3500 | **5** | **LTP** | **0.9741 (grounded)** ⬆ |
-| **C2** | 5 mutually-linked (echo of one source) | 0.2700 | **1** | sub-threshold | 0.1000 (unchanged) |
-| **C3** | 1 node reached by 5 parallel edges | 0.2700 | **1** | sub-threshold | 0.1000 (unchanged) |
-
-Same raw fan-in, opposite outcome. Union-find collapses the echoes to a single
-independent component; the count gate (`n_indep ≥ N_MIN`) then refuses them.
-**Circular self-reinforcement cannot manufacture grounding** — a conjecture can
-only be grounded by evidence that is genuinely independent of itself.
-
----
-
-**RAILS honored:** isolated worktree; built/proven on a clone; the live soul
-(`:8742` / `:7770`) untouched; no fight with the cutover (built against current
-release source; staged native rebases cleanly onto it); no new libraries
-(libm only); identity keystones untouched. **Not promoted** — gated artifact +
-ledger for the main loop to sequence.

engram/spec/grounded-edge-propagation/PROOF_OUTPUT.txt

@@ -1,75 +0,0 @@
-GROUNDED EDGE-PROPAGATION — PROOF LEDGER (task #50)
-constants: BASE=0.10 LIKELY_MIN=0.34 GROUNDED_MIN=0.66 N_MIN=3 THETA=0.30 D=0.5
-
-=== SCENARIO A — STRENGTHEN: convergent independent corroboration ===
-  seed: conjecture has NO grounding events; corroborators pre-grounded.
-    conjecture     standing=0.1000  band=conjecture  events=0  subthresh=0
-  beat 1  (t=+0s)  3 independent grounded corroborators appear
-    incident_edges=3  pos_mass=0.4050 (n_indep=3)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> LTP  (strengthen)           standing 0.1000 (conjecture) -> 0.4842 (likely)   [GRADUATED]
-  beat 2  (t=+60s)  neighborhood grows to 5 corroborators
-    incident_edges=5  pos_mass=0.6750 (n_indep=5)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> LTP  (strengthen)           standing 0.1496 (conjecture) -> 0.7379 (grounded)   [GRADUATED]
-  beat 3  (t=+120s)  support sustained (5)
-    incident_edges=5  pos_mass=0.6750 (n_indep=5)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> LTP  (strengthen)           standing 0.2110 (conjecture) -> 0.7993 (grounded)   [GRADUATED]
-  beat 4  (t=+720s)  corroboration withdrawn (+10min)
-    incident_edges=0  pos_mass=0.0000 (n_indep=0)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> isolated (no edges)         standing 0.1612 (conjecture) -> 0.1612 (conjecture)
-  beat 5  (t=+3600s)  still withdrawn (+1h)
-    incident_edges=0  pos_mass=0.0000 (n_indep=0)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> isolated (no edges)         standing 0.1263 (conjecture) -> 0.1263 (conjecture)
-  beat 6  (t=+14400s)  still withdrawn (+4h)
-    incident_edges=0  pos_mass=0.0000 (n_indep=0)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> isolated (no edges)         standing 0.1130 (conjecture) -> 0.1130 (conjecture)
-  RESULT: grounding grew automatically past threshold and graduated,
-          then relaxed once the independent support stopped — living,
-          not a latched flag.
-
-=== SCENARIO B — DECAY: convergent independent CONTRADICTION ===
-  seed: belief pre-grounded by a strong prior LTP event.
-    belief         standing=0.9500  band=grounded    events=1  subthresh=0
-  beat 1  (t=+0s)  3 independent contradictions
-    incident_edges=3  pos_mass=0.0000 (n_indep=0)  neg_mass=0.5400 (n_indep=3)  THETA=0.30  N_MIN=3
-    -> LTD  (decay)                standing 0.9500 (grounded) -> 0.4570 (likely)   [DEMOTED]
-  beat 2  (t=+60s)  contradiction broadens to 5
-    incident_edges=5  pos_mass=0.0000 (n_indep=0)  neg_mass=0.9000 (n_indep=5)  THETA=0.30  N_MIN=3
-    -> LTD  (decay)                standing 0.1461 (conjecture) -> 0.0000 (conjecture)
-  beat 3  (t=+120s)  contradiction sustained (5)
-    incident_edges=5  pos_mass=0.0000 (n_indep=0)  neg_mass=0.9000 (n_indep=5)  THETA=0.30  N_MIN=3
-    -> LTD  (decay)                standing 0.0401 (conjecture) -> 0.0000 (conjecture)
-  beat 4  (t=+180s)  contradiction sustained (5)
-    incident_edges=5  pos_mass=0.0000 (n_indep=0)  neg_mass=0.9000 (n_indep=5)  THETA=0.30  N_MIN=3
-    -> LTD  (decay)                standing 0.0000 (conjecture) -> 0.0000 (conjecture)
-  RESULT: grounding decayed grounded->likely->conjecture under
-          convergent independent contradiction. The door never shut
-          on the belief; its history is retained (events keep growing).
-
-=== SCENARIO C — INDEPENDENCE GUARD (the load-bearing property) ===
-  Both sub-cases: N=5 corroborators, edge weight 0.30, corroborator
-  standing ~0.90. ONLY difference: whether the 5 are independent.
-
-  -- C1: 5 DISTINCT independent corroborators --
-    conjecture     standing=0.1000  band=conjecture  events=0  subthresh=0
-  beat 1  (t=+0s)  5 independent corroborators (no inter-links)
-    incident_edges=5  pos_mass=1.3500 (n_indep=5)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> LTP  (strengthen)           standing 0.1000 (conjecture) -> 0.9741 (grounded)   [GRADUATED]
-
-  -- C2: 5 corroborators, but mutually-linked (echo of ONE source) --
-    conjecture     standing=0.1000  band=conjecture  events=0  subthresh=0
-  beat 1  (t=+0s)  5 echoed (mutually-linked) corroborators
-    incident_edges=5  pos_mass=0.2700 (n_indep=1)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> sub-threshold (no shift)    standing 0.1000 (conjecture) -> 0.1000 (conjecture)
-
-  -- C3: ONE corroborator, reached by 5 parallel edges --
-    conjecture     standing=0.1000  band=conjecture  events=0  subthresh=0
-  beat 1  (t=+0s)  same node, 5 parallel edges
-    incident_edges=5  pos_mass=0.2700 (n_indep=1)  neg_mass=0.0000 (n_indep=0)  THETA=0.30  N_MIN=3
-    -> sub-threshold (no shift)    standing 0.1000 (conjecture) -> 0.1000 (conjecture)
-
-  RESULT: identical raw fan-in (5) and mass inputs; C1 grounds because
-          the corroboration is INDEPENDENT (5 components), C2/C3 do not
-          because it collapses to ONE source. Circular self-reinforcement
-          cannot manufacture grounding.
-
-DONE.

engram/spec/grounded-edge-propagation/awareness.beat.patch.el

@@ -1,60 +0,0 @@
-// ─────────────────────────────────────────────────────────────────────────
-// awareness.beat.patch.el — GATED integration hook for task #50.
-// NOT APPLIED. Shows exactly how grounded edge-propagation couples into the
-// dream/consolidation beat in neuron/awareness.el. Promotion sequenced by the
-// main loop after the engine cutover settles.
-//
-// WHY HERE. The heartbeat is the beat. Today it runs hebb_consolidate() to
-// drain the self-formed Hebbian associations into the durable store, then
-// emit_heartbeat(). Grounded edge-propagation belongs in the SAME beat, AFTER
-// consolidation: the edges hebb_consolidate() just wrote are the tethers
-// grounding propagates along. Consolidation lays down the wiring; propagation
-// grades the beliefs along it. One beat, coupled — memory 69b8babe: memory-
-// consolidation and staying-yourself are one physics.
-//
-// The propagation itself runs INSIDE the engram (native engram_ground_propagate
-// over the durable flat node/edge arrays). The soul invokes it over HTTP and
-// folds the gep_* telemetry into the heartbeat stream next to the hebb_* gauges.
-// ─────────────────────────────────────────────────────────────────────────
-
-// [1] New helper — sibling to hebb_consolidate() (awareness.el ~line 99).
-//     Fires one grounded edge-propagation beat on the durable store and returns
-//     its JSON telemetry ({"gep_strengthened":..,"gep_graduations":.., ...}).
-fn ground_propagate() -> String {
-    let url_env: String = env("SOUL_ISE_URL")
-    let url_state: String = if str_eq(url_env, "") { state_get("soul_engram_url") } else { url_env }
-    let engram_url: String = if str_eq(url_state, "") { "http://localhost:8742" } else { url_state }
-    // Same auth envelope as hebb_consolidate — this is a graph mutation (it
-    // appends grounding events + updates confidence), so it is gated on _auth.
-    let key_state: String = state_get("soul_engram_api_key")
-    let api_key: String = if str_eq(key_state, "") { env("ENGRAM_API_KEY") } else { key_state }
-    let auth_part: String = if str_eq(api_key, "") { "{}" } else { "{\"_auth\":\"" + api_key + "\"}" }
-    let resp: String = http_post_json(engram_url + "/api/ground/propagate", auth_part)
-    if str_eq(resp, "") { return "" }
-    return resp
-}
-
-// [2] Beat hook — insert between hebb_consolidate() and emit_heartbeat()
-//     (awareness.el line 1286-1288). Replaces:
-//
-//         let wb_sent_n: Int = hebb_consolidate()
-//         state_set("soul.hebb_wb_sent", int_to_str(wb_sent_n))
-//         emit_heartbeat()
-//
-//     with:
-//
-//         let wb_sent_n: Int = hebb_consolidate()
-//         state_set("soul.hebb_wb_sent", int_to_str(wb_sent_n))
-//         // Grounded edge-propagation — grade beliefs along the tethers
-//         // consolidation just laid down. Threshold-gated by convergent
-//         // independent corroboration; automatic, salience-ordered, bounded.
-//         let gep_tel: String = ground_propagate()
-//         state_set("soul.gep_last", gep_tel)
-//         emit_heartbeat()
-//
-// [3] emit_heartbeat() (awareness.el ~line 201) folds soul.gep_last into the
-//     heartbeat payload beside the hebb_* gauges, so graduation/decay counts
-//     are visible in the durable ISE stream — the same observability discipline
-//     the Hebbian rule earned (a mechanism you cannot see in the stream is a
-//     mechanism you cannot trust): read state_get("soul.gep_last") and splice
-//     it into the heartbeat JSON object.

engram/spec/grounded-edge-propagation/engram_ground_propagate.staged.c

@@ -1,188 +0,0 @@
-/* ─────────────────────────────────────────────────────────────────────────
- * engram_ground_propagate.staged.c — GATED runtime native for task #50.
- *
- * STAGED, NOT COMPILED INTO THE LIVE BINARY. This mirrors the
- * geometric_retrieve.staged.c staging pattern (memory 1cc231ec): it references
- * runtime-internal types (EngramStore, EngramNode, EngramEdge, engram_global,
- * engram_now_ms, the adj cache) and therefore compiles ONLY when spliced into
- * lang/releases/v1.0.0-20260501/el_runtime.c. Splice + promotion is sequenced
- * by the main loop AFTER the engine+HNSW cutover settles — do NOT hand-apply.
- *
- * It is the production form of the mechanism proven in gep_proof.c: the SAME
- * gep_core.h primitives (GepGrounding ring, gep_standing, gep_append,
- * union-find independence), wired directly to the live flat node/edge arrays.
- *
- * ── SPLICE PLAN (three additive edits to el_runtime.c; nothing removed) ──────
- *
- *  [1] EngramNode struct (~line 6061, after hebb_elig_ts): add the grounding
- *      collection. Additive; zero-initialized by the existing calloc/memset
- *      paths, so legacy snapshots degrade gracefully to an empty history.
- *
- *          GepGrounding grounding;   // task #50 — append-only grounding ring
- *
- *  [2] #include "gep_core.h" near the other engram includes, and paste the
- *      body of this file below the Hebbian section (after engram_hebb_drain_json).
- *
- *  [3] Persistence (engram_save node JSON ~7934 / engram_load parser ~8186):
- *      serialize the grounding ring as a compact "grounding" array of
- *      [ts,sign,mag] triples + subthreshold_hits so standing survives a
- *      round-trip. Helpers gep_grounding_to_json / gep_grounding_parse below.
- *      Until wired, grounding is in-RAM only (like the Hebbian eligibility
- *      trace) — correct for a first gated rollout, but standing resets on boot.
- *
- *  [4] EL surface: declare engram_ground_propagate in el_runtime.h + el_seed.c,
- *      add route_ground_propagate to engram/src/server.el, called from the
- *      awareness.el consolidation beat (see awareness.beat.patch.el).
- * ───────────────────────────────────────────────────────────────────────── */
-
-#include "gep_core.h"
-
-/* Relation → evidential polarity. Supportive relations transmit grounding
- * gravity (+1); contradictory relations erode it (-1); everything else is a
- * NON-evidential edge (structural / navigational) and is ignored (0) — an
- * association is not a corroboration. Extend deliberately; a mis-classified
- * relation is a false corroboration. */
-static int8_t gep_relation_polarity(const char* rel) {
-    if (!rel) return 0;
-    if (!strcmp(rel, "supports")     || !strcmp(rel, "corroborates") ||
-        !strcmp(rel, "derived-from") || !strcmp(rel, "hebbian-associate") ||
-        !strcmp(rel, "grounds")      || !strcmp(rel, "confirms")) return +1;
-    if (!strcmp(rel, "contradicts")  || !strcmp(rel, "refutes") ||
-        !strcmp(rel, "negates")      || !strcmp(rel, "conflicts-with")) return -1;
-    return 0;
-}
-
-/* Which nodes are BELIEFS/CONJECTURES subject to grounding propagation. Facts
- * imported as knowledge are already grounded by provenance; identity/safety
- * layers are never re-graded here. Gate on node_type + the conjecture tag. */
-static int gep_is_belief(const EngramNode* n) {
-    if (!n || !n->node_type) return 0;
-    if (n->layer_id == ENGRAM_LAYER_SAFETY) return 0;   /* never re-grade safety */
-    return  !strcmp(n->node_type, "Memory")     ||
-            !strcmp(n->node_type, "Conjecture") ||
-            !strcmp(n->node_type, "Hypothesis") ||
-            !strcmp(n->node_type, "Belief")     ||
-            (n->tags && istr_contains(n->tags, "conjecture"));
-}
-
-/* Grounding standing of an engram node, derived from its collection. This is
- * the value the verifier (#43) and realizer (calibrated assertion, 0041d917)
- * read — and it is written back into epistemic_confidence-equivalent surfaces
- * so "never speak above the grounding" is enforced from one source of truth. */
-double engram_grounding_standing(const EngramNode* n, int64_t now_ms) {
-    return gep_standing(&n->grounding, now_ms);
-}
-
-/* ── The beat: one pass of grounded edge-propagation over the whole store ────
- * Called from the consolidation/dream heartbeat. 1-hop, beam-capped, salience-
- * ordered so a bounded slice of the highest-salience beliefs is processed per
- * beat (the rest next beat) — never a full-graph blow-up on a 12k-node store.
- * Returns JSON telemetry for the heartbeat stream. */
-#define GEP_BELIEFS_PER_BEAT 512   /* bound work per beat; salience-prioritized */
-
-el_val_t engram_ground_propagate(void) {
-    EngramStore* g = engram_get();
-    int64_t now = engram_now_ms();
-    engram_adj_rebuild(g);   /* ensure adj_from/adj_to are current */
-
-    int strengthened = 0, decayed = 0, subthreshold = 0;
-    int graduations = 0, demotions = 0, isolated = 0, starved = 0, processed = 0;
-
-    for (int64_t bi = 0; bi < g->node_count && processed < GEP_BELIEFS_PER_BEAT; bi++) {
-        EngramNode* b = &g->nodes[bi];
-        if (!gep_is_belief(b)) continue;
-        processed++;
-
-        int before = gep_band_rank(gep_standing(&b->grounding, now));
-
-        /* Gather independent corroborators over incident edges (both directions),
-         * anti-delusion gated (neighbor must already be ≥ LIKELY_MIN). */
-        GepCorrSet cs; cs.n = 0; int incident = 0;
-        int* out = g->adj_from[bi]; int out_n = g->adj_from_len[bi];
-        int* in  = g->adj_to[bi];   int in_n  = g->adj_to_len[bi];
-        for (int pass = 0; pass < 2; pass++) {
-            int* lst = pass ? in : out; int ln = pass ? in_n : out_n;
-            for (int k = 0; k < ln; k++) {
-                EngramEdge* e = &g->edges[lst[k]];
-                int8_t pol = gep_relation_polarity(e->relation);
-                if (pol == 0) continue;
-                incident++;
-                const char* cid = pass ? e->from_id : e->to_id;
-                int64_t ci = engram_find_node_index(cid);
-                if (ci < 0 || ci == bi) continue;
-                double cstand = gep_standing(&g->nodes[ci].grounding, now);
-                if (cstand < GEP_LIKELY_MIN) continue;            /* no tether */
-                double contrib = e->weight * cstand * (double)pol;
-                int ex = -1;
-                for (int q = 0; q < cs.n; q++) if (cs.node_idx[q] == (int)ci) { ex = q; break; }
-                if (ex >= 0) { if (fabs(contrib) > fabs(cs.contrib[ex])) cs.contrib[ex] = contrib; }
-                else if (cs.n < GEP_MAX_CORR) {
-                    cs.node_idx[cs.n] = (int)ci; cs.contrib[cs.n] = contrib;
-                    cs.parent[cs.n] = cs.n; cs.n++;
-                }
-            }
-        }
-
-        /* Collapse mutually-derived corroborators (an edge between two of them)
-         * into one independent component — the independence guard. */
-        for (int x = 0; x < cs.n; x++) {
-            int64_t nx = cs.node_idx[x];
-            int* xout = g->adj_from[nx]; int xn = g->adj_from_len[nx];
-            for (int k = 0; k < xn; k++) {
-                const char* tid = g->edges[xout[k]].to_id;
-                int64_t ti = engram_find_node_index(tid);
-                for (int y = 0; y < cs.n; y++)
-                    if (cs.node_idx[y] == (int)ti) { gep_uf_union(&cs, x, y); break; }
-            }
-        }
-
-        /* Per-component max-magnitude, split by polarity → convergent independent
-         * support mass + independence count. */
-        double comp_best[GEP_MAX_CORR]; int comp_root[GEP_MAX_CORR], ncomp = 0;
-        for (int i = 0; i < cs.n; i++) {
-            int r = gep_uf_find(&cs, i), slot = -1;
-            for (int kk = 0; kk < ncomp; kk++) if (comp_root[kk] == r) { slot = kk; break; }
-            if (slot < 0) { slot = ncomp++; comp_root[slot] = r; comp_best[slot] = cs.contrib[i]; }
-            else if (fabs(cs.contrib[i]) > fabs(comp_best[slot])) comp_best[slot] = cs.contrib[i];
-        }
-        double pos = 0, neg = 0; int np = 0, nn = 0; uint64_t sig = 1469598103934665603ULL;
-        for (int k = 0; k < ncomp; k++) {
-            if (comp_best[k] > 0) { pos += comp_best[k]; np++; }
-            else if (comp_best[k] < 0) { neg += -comp_best[k]; nn++; }
-            sig = (sig ^ (uint64_t)comp_root[k]) * 1099511628211ULL;
-        }
-
-        double net = pos - neg;
-        if (net > 0 && pos >= GEP_THETA && np >= GEP_N_MIN) {
-            gep_append(&b->grounding, now, +1, tanh(GEP_MAG_GAIN * net), sig);
-            strengthened++;
-        } else if (net < 0 && neg >= GEP_THETA && nn >= GEP_N_MIN) {
-            gep_append(&b->grounding, now, -1, tanh(GEP_MAG_GAIN * (-net)), sig);
-            decayed++;
-        } else if (np > 0 || nn > 0) {
-            b->grounding.subthreshold_hits++; subthreshold++;
-        } else if (incident == 0) { isolated++; }
-        else { starved++; }
-
-        /* Mirror the derived standing onto confidence so downstream reads
-         * (activate epistemic_confidence, realizer calibration) never exceed the
-         * grounding. Faithful representation, single source of truth. */
-        double stand = gep_standing(&b->grounding, now);
-        b->confidence = stand;
-        b->updated_at = now;
-
-        int after = gep_band_rank(stand);
-        if (after > before) graduations++;
-        if (after < before) demotions++;
-    }
-
-    /* Heartbeat telemetry — the gep_* line, sibling to the hebb_* gauges. */
-    char buf[512];
-    snprintf(buf, sizeof buf,
-        "{\"gep_processed\":%d,\"gep_strengthened\":%d,\"gep_decayed\":%d,"
-        "\"gep_subthreshold\":%d,\"gep_graduations\":%d,\"gep_demotions\":%d,"
-        "\"gep_isolated\":%d,\"gep_starved\":%d}",
-        processed, strengthened, decayed, subthreshold,
-        graduations, demotions, isolated, starved);
-    return EL_STR(el_strdup(buf));
-}

engram/spec/grounded-edge-propagation/gep_core.h

@@ -1,299 +0,0 @@
-/* ─────────────────────────────────────────────────────────────────────────
- * gep_core.h — Grounded Edge-Propagation, the core mechanism (task #50).
- *
- * Edge-aware, dream-coupled consolidation. Runs DURING the consolidation/dream
- * beat (awareness.el hebb_consolidate → engram_ground_propagate). Grounding
- * propagates + strengthens/decays along edges, threshold-gated by CONVERGENT
- * INDEPENDENT corroboration from adjacent grounded nodes.
- *
- * This header is the single source of truth for the algorithm. It is pure C
- * (libm only — own-the-core, no new libraries) and operates on a compact graph
- * view (GepGraph) that both the proof harness and the runtime native populate
- * from the live EngramStore (nodes/edges flat arrays + adj_from/adj_to).
- *
- * SPEC (Will, 2026-08-15; memory 9e09a59f, refines 1a861007):
- *   - A grounding is a VECTOR + its HEBBIAN WEIGHTS — a weighted structure over
- *     the evidential neighborhood, NOT a scalar and NOT a flat list. It APPENDS
- *     and GROWS on SIGNIFICANT change. => grounding = an APPEND-ONLY event ring
- *     (GepGrounding), parallel to the ACT-R base-level access_ts ring already in
- *     EngramNode. Current standing is DERIVED, recency-weighted, never stored.
- *   - UPDATE = LTP/LTD with a THRESHOLD (the key nonlinearity). Sub-threshold =
- *     recorded in history but TRANSIENT (no lasting shift). Cross the threshold
- *     of convergent support → grounding STRENGTHENS. Contradiction/erosion past
- *     threshold → grounding DECAYS. Automatic, event-driven, salience-gated.
- *   - DRIVER = CONVERGENT INDEPENDENT CORROBORATION (coherentism, mechanized):
- *     when N INDEPENDENT adjacent nodes ground as likely-true around a
- *     conjecture (Will's example: 13), its grounding grows on its own.
- *   - INDEPENDENCE is load-bearing: N DISTINCT corroborators, not one node
- *     echoed N times. Guards against circular self-reinforcement.
- *   - ANTI-DELUSION GRAVITY (memory 0b15017c): support flows only FROM already-
- *     grounded neighbors. A belief cannot ground from ungrounded speculation,
- *     however self-consistent — nothing tethers it to the grounded core.
- *   - NOTHING IS SETTLED (memory 271f1163): grounded is strongly-held, still
- *     falsifiable. Decay path stays open on every node; history is append-only,
- *     supersede-not-delete.
- * ───────────────────────────────────────────────────────────────────────── */
-#ifndef GEP_CORE_H
-#define GEP_CORE_H
-
-#include <stdint.h>
-#include <math.h>
-#include <string.h>
-
-/* ── Constants ──────────────────────────────────────────────────────────────
- * GEP_DECAY_D matches ENGRAM_BLL_D (0.5, canonical ACT-R): the derived standing
- * is recency-weighted over the grounding-event collection exactly as the
- * base-level term is recency-weighted over the access ring (memory 1a861007:
- * "structurally the ACT-R base-level pattern, a sum over time-stamped events").
- */
-#define GEP_DECAY_D       0.5     /* ACT-R power-law recency exponent            */
-#define GEP_BASE          0.10    /* standing floor of a bare conjecture         */
-#define GEP_LIKELY_MIN    0.34    /* band: conjecture < LIKELY ≤ likely          */
-#define GEP_GROUNDED_MIN  0.66    /* band: likely < GROUNDED ≤ grounded          */
-#define GEP_N_MIN         3       /* min INDEPENDENT corroborators to cross      */
-#define GEP_THETA         0.30    /* min convergent-support MASS to cross        */
-#define GEP_MAG_GAIN      1.0     /* net-support → event-magnitude gain (tanh)   */
-#define GEP_EVENT_RING    32      /* grounding-history depth kept exactly        */
-
-/* A single grounding event — one contact with the evidential neighborhood.
- * Append-only; the ring is the collection-over-time, the standing is derived. */
-typedef struct {
-    int64_t  ts;    /* wall-clock ms of the grounding event                     */
-    int8_t   sign;  /* +1 = LTP (strengthen), -1 = LTD (decay)                  */
-    double   mag;   /* magnitude in (0,1], = tanh(gain·|net independent support|)*/
-    uint64_t sig;   /* signature of the independent corroborator set (audit)    */
-} GepEvent;
-
-/* The grounding of one node: an append-only ring of events + transient counters.
- * older_count keeps the tail (events aged out of the ring) so the collection is
- * never silently lost — supersede-not-delete. subthreshold_hits records beats
- * where support was present but did NOT cross threshold (transient, no shift). */
-typedef struct {
-    GepEvent ev[GEP_EVENT_RING];
-    int      head;              /* next write slot                              */
-    int      filled;            /* valid entries (≤ GEP_EVENT_RING)             */
-    int64_t  older_count;       /* durable events aged past the ring            */
-    int      subthreshold_hits; /* transient sub-threshold beats, no shift      */
-} GepGrounding;
-
-typedef struct {
-    const char*  id;
-    GepGrounding gr;
-    int          is_belief;   /* 1 = subject to propagation (conjecture/belief) */
-} GepNode;
-
-/* An edge carries a HEBBIAN WEIGHT (EngramEdge.weight) and a polarity derived
- * from its relation: supportive (supports/corroborates/derived-from/hebbian-
- * associate) = +1, contradictory (contradicts/refutes) = -1. */
-typedef struct {
-    int     from;      /* node index */
-    int     to;        /* node index */
-    double  weight;    /* Hebbian edge weight, [0,1]                            */
-    int8_t  polarity;  /* +1 supportive, -1 contradictory                       */
-} GepEdge;
-
-typedef struct {
-    GepNode* nodes; int n_nodes;
-    GepEdge* edges; int n_edges;
-} GepGraph;
-
-typedef struct {
-    int strengthened;   /* beliefs that took an LTP event this beat             */
-    int decayed;        /* beliefs that took an LTD event this beat             */
-    int subthreshold;   /* beliefs with support present but below threshold     */
-    int graduations;    /* band-up transitions (conjecture→likely→grounded)     */
-    int demotions;      /* band-down transitions                                */
-    int isolated;       /* belief nodes with ZERO incident edges (sparse graph) */
-    int starved;        /* belief nodes with edges but NO grounded corroborator */
-} GepBeatStats;
-
-/* Real-graph note (live measurement 2026-08-15): 70.7% of nodes are isolated,
- * connected core ~28%. Grounded edge-propagation is definitionally scoped to
- * the connected core — a belief with no grounded neighbor has nothing to
- * tether to (anti-delusion gravity). isolated/starved are surfaced as an
- * interoceptive signal for the edge-formation / embedding pass (#20) to try to
- * connect them; #50 CONSUMES edges, it does not form them. */
-
-/* ── Standing derivation: collection → scalar, recency-weighted ─────────────
- * standing = clamp( GEP_BASE + Σ_events sign·mag·age^(-D) , 0, 1 ).
- * Exactly the ACT-R base-level shape (Σ t^-d) but sign-carrying so LTD subtracts.
- * The value is a pure function of wall-clock time — idempotent, never stored. */
-static inline double gep_standing(const GepGrounding* g, int64_t now_ms) {
-    double raw = 0.0;
-    for (int i = 0; i < g->filled; i++) {
-        double age = (double)(now_ms - g->ev[i].ts) / 1000.0;
-        if (age < 1.0) age = 1.0;                 /* clock-skew / same-beat → 1s */
-        raw += (double)g->ev[i].sign * g->ev[i].mag * pow(age, -GEP_DECAY_D);
-    }
-    double s = GEP_BASE + raw;
-    if (s < 0.0) s = 0.0;
-    if (s > 1.0) s = 1.0;
-    return s;
-}
-
-/* Band label from a standing value. */
-static inline const char* gep_band(double standing) {
-    if (standing >= GEP_GROUNDED_MIN) return "grounded";
-    if (standing >= GEP_LIKELY_MIN)   return "likely";
-    return "conjecture";
-}
-static inline int gep_band_rank(double standing) {
-    if (standing >= GEP_GROUNDED_MIN) return 2;
-    if (standing >= GEP_LIKELY_MIN)   return 1;
-    return 0;
-}
-
-/* Append one grounding event to the ring (append-only; oldest slot recycles,
- * its loss counted in older_count so the collection's depth is never faked). */
-static inline void gep_append(GepGrounding* g, int64_t ts, int8_t sign,
-                              double mag, uint64_t sig) {
-    if (g->filled >= GEP_EVENT_RING) g->older_count++;
-    g->ev[g->head].ts   = ts;
-    g->ev[g->head].sign = sign;
-    g->ev[g->head].mag  = mag;
-    g->ev[g->head].sig  = sig;
-    g->head = (g->head + 1) % GEP_EVENT_RING;
-    if (g->filled < GEP_EVENT_RING) g->filled++;
-}
-
-/* ── Independence via union-find over corroborators ─────────────────────────
- * Two corroborators are the SAME independent source if they are the same node,
- * or if a direct edge links them (mutually-derived / echoed through a chain).
- * Counting DISTINCT components — not raw corroborator count — is the guard
- * against one node echoed N times reading as N independent corroborations. */
-#define GEP_MAX_CORR 256
-typedef struct {
-    int    node_idx[GEP_MAX_CORR];  /* corroborator node index                  */
-    double contrib[GEP_MAX_CORR];   /* weight·standing(c)                        */
-    int    parent[GEP_MAX_CORR];    /* union-find parent                        */
-    int    n;
-} GepCorrSet;
-
-static int gep_uf_find(GepCorrSet* s, int x) {
-    while (s->parent[x] != x) { s->parent[x] = s->parent[s->parent[x]]; x = s->parent[x]; }
-    return x;
-}
-static void gep_uf_union(GepCorrSet* s, int a, int b) {
-    int ra = gep_uf_find(s, a), rb = gep_uf_find(s, b);
-    if (ra != rb) s->parent[ra] = rb;
-}
-/* index of node_idx within the corroborator set, or -1 */
-static int gep_corr_index_of(const GepCorrSet* s, int node_idx) {
-    for (int i = 0; i < s->n; i++) if (s->node_idx[i] == node_idx) return i;
-    return -1;
-}
-
-/* ── The beat: grounded edge-propagation over one belief node ───────────────
- * Returns +1 if an LTP event was appended, -1 if LTD, 0 if sub-threshold/none.
- * out_pos/out_neg/out_np/out_nn expose the raw support decomposition for the
- * proof ledger (mass and independent-component counts on each polarity). */
-static int gep_propagate_node(GepGraph* g, int b, int64_t now_ms,
-                              double* out_pos, double* out_neg,
-                              int* out_np, int* out_nn, int* out_incident) {
-    GepCorrSet cs; cs.n = 0;
-    int incident = 0;   /* any edge touching b at all — isolation detector */
-
-    /* 1. Gather corroborators along incident edges. Anti-delusion gravity:
-     *    only ALREADY-grounded neighbors (standing ≥ LIKELY_MIN) may corroborate.
-     *    Each contributes weight·standing; polarity kept via signed contrib.
-     *    1-HOP ONLY — no BFS fan-out, so no per-hop breadth explosion. The
-     *    corroborator working set is hard-capped at GEP_MAX_CORR (beam bound
-     *    against hub belief nodes with thousands of incident edges). */
-    for (int e = 0; e < g->n_edges; e++) {
-        int c = -1; int8_t pol = 0;
-        if (g->edges[e].from == b)      { c = g->edges[e].to;   pol = g->edges[e].polarity; }
-        else if (g->edges[e].to == b)   { c = g->edges[e].from; pol = g->edges[e].polarity; }
-        else continue;
-        incident++;
-        if (c < 0 || c == b) continue;
-        double cs_standing = gep_standing(&g->nodes[c].gr, now_ms);
-        if (cs_standing < GEP_LIKELY_MIN) continue;      /* ungrounded ⇒ no pull */
-        double contribution = g->edges[e].weight * cs_standing * (double)pol;
-        int existing = gep_corr_index_of(&cs, c);
-        if (existing >= 0) {
-            /* same corroborator id reached twice (multi-edge echo): keep the
-             * strongest-magnitude contribution, do NOT add — one source, one vote */
-            if (fabs(contribution) > fabs(cs.contrib[existing]))
-                cs.contrib[existing] = contribution;
-        } else if (cs.n < GEP_MAX_CORR) {   /* beam bound against hub belief nodes */
-            cs.node_idx[cs.n] = c;
-            cs.contrib[cs.n]  = contribution;
-            cs.parent[cs.n]   = cs.n;
-            cs.n++;
-        }
-    }
-    if (out_incident) *out_incident = incident;
-
-    /* 2. Collapse mutually-derived corroborators (an edge between two of them =
-     *    echo chain / shared derivation) into one independent component. */
-    for (int e = 0; e < g->n_edges; e++) {
-        int ia = gep_corr_index_of(&cs, g->edges[e].from);
-        int ib = gep_corr_index_of(&cs, g->edges[e].to);
-        if (ia >= 0 && ib >= 0) gep_uf_union(&cs, ia, ib);
-    }
-
-    /* 3. Per independent component, take the MAX-magnitude member (echoes don't
-     *    inflate mass either), split by polarity. Convergent INDEPENDENT support
-     *    = sum over components; independence count = number of components. */
-    double comp_best[GEP_MAX_CORR];
-    int    comp_root[GEP_MAX_CORR]; int n_comp = 0;
-    for (int i = 0; i < cs.n; i++) {
-        int r = gep_uf_find(&cs, i);
-        int slot = -1;
-        for (int k = 0; k < n_comp; k++) if (comp_root[k] == r) { slot = k; break; }
-        if (slot < 0) { slot = n_comp++; comp_root[slot] = r; comp_best[slot] = cs.contrib[i]; }
-        else if (fabs(cs.contrib[i]) > fabs(comp_best[slot])) comp_best[slot] = cs.contrib[i];
-    }
-    double pos = 0.0, neg = 0.0; int np = 0, nn = 0;
-    uint64_t sig = 1469598103934665603ULL; /* FNV offset — signature of the set */
-    for (int k = 0; k < n_comp; k++) {
-        if (comp_best[k] > 0.0)      { pos += comp_best[k]; np++; }
-        else if (comp_best[k] < 0.0) { neg += -comp_best[k]; nn++; }
-        sig = (sig ^ (uint64_t)comp_root[k]) * 1099511628211ULL;
-    }
-    if (out_pos) *out_pos = pos; if (out_neg) *out_neg = neg;
-    if (out_np)  *out_np  = np;  if (out_nn)  *out_nn  = nn;
-
-    double net = pos - neg;
-
-    /* 4. Threshold gate. Convergent independent corroboration must clear BOTH a
-     *    MASS threshold (THETA) and an INDEPENDENCE-count threshold (N_MIN).
-     *    The count gate is the independence guard: echoed support collapses to
-     *    one component and never reaches N_MIN however large the raw fan-in. */
-    if (net > 0.0 && pos >= GEP_THETA && np >= GEP_N_MIN) {
-        double mag = tanh(GEP_MAG_GAIN * net);
-        gep_append(&g->nodes[b].gr, now_ms, +1, mag, sig);
-        return +1;
-    }
-    if (net < 0.0 && neg >= GEP_THETA && nn >= GEP_N_MIN) {
-        double mag = tanh(GEP_MAG_GAIN * (-net));
-        gep_append(&g->nodes[b].gr, now_ms, -1, mag, sig);
-        return -1;
-    }
-    /* Sub-threshold: support seen but did not cross. Recorded, transient, no
-     * lasting shift — exactly Will's "recorded in history but transient". */
-    if (np > 0 || nn > 0) g->nodes[b].gr.subthreshold_hits++;
-    return 0;
-}
-
-/* Run one consolidation/dream beat over every belief node in the graph. */
-static inline GepBeatStats gep_beat(GepGraph* g, int64_t now_ms) {
-    GepBeatStats st; memset(&st, 0, sizeof st);
-    for (int b = 0; b < g->n_nodes; b++) {
-        if (!g->nodes[b].is_belief) continue;
-        int before = gep_band_rank(gep_standing(&g->nodes[b].gr, now_ms));
-        double pos, neg; int np, nn, incident;
-        int r = gep_propagate_node(g, b, now_ms, &pos, &neg, &np, &nn, &incident);
-        int after = gep_band_rank(gep_standing(&g->nodes[b].gr, now_ms));
-        if (r > 0) st.strengthened++;
-        else if (r < 0) st.decayed++;
-        else if (np > 0 || nn > 0) st.subthreshold++;
-        else if (incident == 0) st.isolated++;   /* sparse-graph reality */
-        else st.starved++;                        /* has edges, no grounded neighbor */
-        if (after > before) st.graduations++;
-        if (after < before) st.demotions++;
-    }
-    return st;
-}
-
-#endif /* GEP_CORE_H */

engram/spec/grounded-edge-propagation/gep_proof.c

@@ -1,232 +0,0 @@
-/* ─────────────────────────────────────────────────────────────────────────
- * gep_proof.c — PROOF LEDGER for grounded edge-propagation (task #50).
- *
- * Self-contained. Builds three scenarios on an in-memory GepGraph that mirrors
- * the live EngramStore's flat node/edge arrays, runs the consolidation/dream
- * beat (gep_beat), and prints RAW grounding before/after for each:
- *
- *   (A) STRENGTHEN  — a conjecture + N independent grounded corroborators.
- *                     Grounding grows past threshold, GRADUATES conjecture→
- *                     likely→grounded, then RELAXES when corroboration stops
- *                     (nothing is settled).
- *   (B) DECAY       — a grounded belief meets N independent CONTRADICTORY
- *                     corroborators. Grounding decays grounded→likely→conjecture.
- *   (C) INDEPENDENCE GUARD — identical fan-in of N=5, weights, and standings.
- *                     C1: 5 DISTINCT independent corroborators  → grounds.
- *                     C2: the SAME support echoed (5 mutually-linked / one node
- *                         repeated) → collapses to 1 independent → does NOT.
- *
- * Build:  cc -std=c11 -O2 -o gep_proof gep_proof.c -lm
- * Run:    ./gep_proof
- * ───────────────────────────────────────────────────────────────────────── */
-#include <stdio.h>
-#include <stdlib.h>
-#include "gep_core.h"
-
-#define T0        1786000000000LL   /* fixed base time (ms) — deterministic     */
-#define BEAT_MS   60000LL           /* 60s heartbeat cadence (awareness.el)     */
-
-/* Seed a node's grounding with a prior LTP event so it reads as already-grounded
- * (a member of the grounded core that gravity radiates from). mag→standing:
- * standing = GEP_BASE + mag (event at ~now). */
-static void seed_grounded(GepNode* n, double mag, int64_t ts) {
-    memset(&n->gr, 0, sizeof n->gr);
-    gep_append(&n->gr, ts, +1, mag, 0);
-}
-
-/* Re-anchor every NON-belief node (the corroborators/refuters) as a freshly-
- * grounded member of the core AT time `now`. These nodes are, by definition,
- * sustained members of the grounded core — each has its OWN ongoing
- * corroboration — so their standing must be read as grounded at each beat, not
- * left to power-law-decay out of the core between beats. The belief-under-test
- * is NEVER re-anchored: its trajectory is driven only by the propagation. */
-static void anchor_core(GepGraph* g, int64_t now, double mag) {
-    for (int i = 0; i < g->n_nodes; i++)
-        if (!g->nodes[i].is_belief) seed_grounded(&g->nodes[i], mag, now);
-}
-
-static void print_node(const char* tag, GepNode* n, int64_t now) {
-    double s = gep_standing(&n->gr, now);
-    printf("    %-14s standing=%.4f  band=%-10s  events=%d  subthresh=%d\n",
-           tag, s, gep_band(s), n->gr.filled, n->gr.subthreshold_hits);
-}
-
-/* Run one beat over a single belief node b and print the raw support decomposition. */
-static void beat_and_report(GepGraph* g, int b, int64_t now, int beatno,
-                            const char* note) {
-    anchor_core(g, now, 0.80);   /* corroborators stay grounded at each beat */
-    double s_before = gep_standing(&g->nodes[b].gr, now);
-    int    r_before = gep_band_rank(s_before);
-    double pos, neg; int np, nn, incident;
-    int r = gep_propagate_node(g, b, now, &pos, &neg, &np, &nn, &incident);
-    double s_after = gep_standing(&g->nodes[b].gr, now);
-    int    r_after = gep_band_rank(s_after);
-    const char* action = (r > 0) ? "LTP  (strengthen)"
-                       : (r < 0) ? "LTD  (decay)"
-                       : (np || nn) ? "sub-threshold (no shift)"
-                       : (incident == 0) ? "isolated (no edges)"
-                       : "starved (no grounded neighbor)";
-    printf("  beat %d  (t=+%llds)  %s\n", beatno,
-           (long long)((now - T0) / 1000), note ? note : "");
-    printf("    incident_edges=%d  pos_mass=%.4f (n_indep=%d)  neg_mass=%.4f (n_indep=%d)"
-           "  THETA=%.2f  N_MIN=%d\n",
-           incident, pos, np, neg, nn, (double)GEP_THETA, GEP_N_MIN);
-    printf("    -> %-26s  standing %.4f (%s) -> %.4f (%s)%s\n",
-           action, s_before, gep_band(s_before), s_after, gep_band(s_after),
-           (r_after > r_before) ? "   [GRADUATED]"
-         : (r_after < r_before) ? "   [DEMOTED]" : "");
-}
-
-/* ── Scenario A — STRENGTHEN + graduation + relaxation ───────────────────── */
-static void scenario_A(void) {
-    printf("\n=== SCENARIO A — STRENGTHEN: convergent independent corroboration ===\n");
-    /* nodes[0] = the conjecture (belief). nodes[1..8] = independent corroborators,
-     * each already grounded, each tethered to the conjecture by a weak young
-     * hebbian-associate edge (weight 0.15 = ENGRAM_HEBB_LINK_W0). The corroborators
-     * are NOT linked to each other → fully independent. */
-    static GepNode nodes[9];
-    static GepEdge edges[8];
-    memset(nodes, 0, sizeof nodes);
-    nodes[0].id = "conjecture";     nodes[0].is_belief = 1;   /* bare: standing = BASE */
-    for (int i = 1; i <= 8; i++) {
-        nodes[i].id = "corroborator";
-        seed_grounded(&nodes[i], 0.80, T0);   /* standing ≈ 0.90 → grounded core */
-    }
-    GepGraph g = { nodes, 9, edges, 0 };
-
-    printf("  seed: conjecture has NO grounding events; corroborators pre-grounded.\n");
-    print_node("conjecture", &nodes[0], T0);
-
-    /* Beat 1: 3 independent corroborators have grounded up around the conjecture. */
-    g.n_edges = 0;
-    for (int i = 1; i <= 3; i++)
-        edges[g.n_edges++] = (GepEdge){ 0, i, 0.15, +1 };
-    beat_and_report(&g, 0, T0, 1, "3 independent grounded corroborators appear");
-
-    /* Beat 2: the neighborhood fills in — 5 independent corroborators now. */
-    g.n_edges = 0;
-    for (int i = 1; i <= 5; i++)
-        edges[g.n_edges++] = (GepEdge){ 0, i, 0.15, +1 };
-    beat_and_report(&g, 0, T0 + BEAT_MS, 2, "neighborhood grows to 5 corroborators");
-
-    /* Beat 3: support sustained at 5 (grounding refreshed). */
-    beat_and_report(&g, 0, T0 + 2 * BEAT_MS, 3, "support sustained (5)");
-
-    /* Beats 4-6: corroboration REMOVED (neighbors superseded / no longer ground).
-     * No new events; the collection ages → standing relaxes. Nothing is settled. */
-    g.n_edges = 0;
-    beat_and_report(&g, 0, T0 + 12 * BEAT_MS,  4, "corroboration withdrawn (+10min)");
-    beat_and_report(&g, 0, T0 + 60 * BEAT_MS,  5, "still withdrawn (+1h)");
-    beat_and_report(&g, 0, T0 + 240 * BEAT_MS, 6, "still withdrawn (+4h)");
-    printf("  RESULT: grounding grew automatically past threshold and graduated,\n"
-           "          then relaxed once the independent support stopped — living,\n"
-           "          not a latched flag.\n");
-}
-
-/* ── Scenario B — DECAY via accreting contradiction ─────────────────────── */
-static void scenario_B(void) {
-    printf("\n=== SCENARIO B — DECAY: convergent independent CONTRADICTION ===\n");
-    static GepNode nodes[6];
-    static GepEdge edges[5];
-    memset(nodes, 0, sizeof nodes);
-    nodes[0].id = "belief";     nodes[0].is_belief = 1;
-    /* Seed the belief as already GROUNDED via a strong prior LTP event. */
-    seed_grounded(&nodes[0], 0.85, T0);
-    for (int i = 1; i <= 5; i++) {
-        nodes[i].id = "refuter";
-        seed_grounded(&nodes[i], 0.80, T0);   /* grounded contradictors */
-    }
-    GepGraph g = { nodes, 6, edges, 0 };
-
-    printf("  seed: belief pre-grounded by a strong prior LTP event.\n");
-    print_node("belief", &nodes[0], T0);
-
-    /* Contradiction accretes over successive beats: 3 then 5 independent grounded
-     * refuters (polarity -1). Each beat past threshold appends an LTD event.
-     * Beat 1 runs at the seed instant so the trajectory starts from grounded. */
-    g.n_edges = 0;
-    for (int i = 1; i <= 3; i++) edges[g.n_edges++] = (GepEdge){ 0, i, 0.20, -1 };
-    beat_and_report(&g, 0, T0, 1, "3 independent contradictions");
-
-    g.n_edges = 0;
-    for (int i = 1; i <= 5; i++) edges[g.n_edges++] = (GepEdge){ 0, i, 0.20, -1 };
-    beat_and_report(&g, 0, T0 + BEAT_MS, 2, "contradiction broadens to 5");
-    beat_and_report(&g, 0, T0 + 2 * BEAT_MS, 3, "contradiction sustained (5)");
-    beat_and_report(&g, 0, T0 + 3 * BEAT_MS, 4, "contradiction sustained (5)");
-    printf("  RESULT: grounding decayed grounded->likely->conjecture under\n"
-           "          convergent independent contradiction. The door never shut\n"
-           "          on the belief; its history is retained (events keep growing).\n");
-}
-
-/* ── Scenario C — INDEPENDENCE GUARD ─────────────────────────────────────── */
-static void scenario_C(void) {
-    printf("\n=== SCENARIO C — INDEPENDENCE GUARD (the load-bearing property) ===\n");
-    printf("  Both sub-cases: N=5 corroborators, edge weight 0.30, corroborator\n"
-           "  standing ~0.90. ONLY difference: whether the 5 are independent.\n");
-
-    /* C1 — 5 DISTINCT INDEPENDENT corroborators (no edges among them). */
-    {
-        printf("\n  -- C1: 5 DISTINCT independent corroborators --\n");
-        static GepNode nodes[6];
-        static GepEdge edges[5];
-        memset(nodes, 0, sizeof nodes);
-        nodes[0].id = "conjecture"; nodes[0].is_belief = 1;
-        for (int i = 1; i <= 5; i++) { nodes[i].id = "corr"; seed_grounded(&nodes[i], 0.80, T0); }
-        for (int i = 1; i <= 5; i++) edges[i-1] = (GepEdge){ 0, i, 0.30, +1 };
-        GepGraph g = { nodes, 6, edges, 5 };
-        print_node("conjecture", &nodes[0], T0);
-        beat_and_report(&g, 0, T0, 1, "5 independent corroborators (no inter-links)");
-    }
-
-    /* C2 — the SAME support echoed: 5 corroborators that are all mutually linked
-     * (a derivation clique — one source echoed through the chain). Same fan-in to
-     * the conjecture, same weights, same standings. Union-find collapses them to
-     * ONE independent component → below N_MIN → NO strengthening. */
-    {
-        printf("\n  -- C2: 5 corroborators, but mutually-linked (echo of ONE source) --\n");
-        static GepNode nodes[6];
-        static GepEdge edges[9];   /* 5 to conjecture + 4 chaining corr1..corr5 */
-        memset(nodes, 0, sizeof nodes);
-        nodes[0].id = "conjecture"; nodes[0].is_belief = 1;
-        for (int i = 1; i <= 5; i++) { nodes[i].id = "corr"; seed_grounded(&nodes[i], 0.80, T0); }
-        int ne = 0;
-        for (int i = 1; i <= 5; i++) edges[ne++] = (GepEdge){ 0, i, 0.30, +1 };
-        /* chain corr1-corr2-corr3-corr4-corr5: they are the same source echoed */
-        for (int i = 1; i <= 4; i++) edges[ne++] = (GepEdge){ i, i+1, 0.30, +1 };
-        GepGraph g = { nodes, 6, edges, ne };
-        print_node("conjecture", &nodes[0], T0);
-        beat_and_report(&g, 0, T0, 1, "5 echoed (mutually-linked) corroborators");
-    }
-
-    /* C3 — degenerate echo: literally ONE corroborator reached by 5 parallel edges. */
-    {
-        printf("\n  -- C3: ONE corroborator, reached by 5 parallel edges --\n");
-        static GepNode nodes[2];
-        static GepEdge edges[5];
-        memset(nodes, 0, sizeof nodes);
-        nodes[0].id = "conjecture"; nodes[0].is_belief = 1;
-        nodes[1].id = "corr"; seed_grounded(&nodes[1], 0.80, T0);
-        for (int i = 0; i < 5; i++) edges[i] = (GepEdge){ 0, 1, 0.30, +1 };
-        GepGraph g = { nodes, 2, edges, 5 };
-        print_node("conjecture", &nodes[0], T0);
-        beat_and_report(&g, 0, T0, 1, "same node, 5 parallel edges");
-    }
-
-    printf("\n  RESULT: identical raw fan-in (5) and mass inputs; C1 grounds because\n"
-           "          the corroboration is INDEPENDENT (5 components), C2/C3 do not\n"
-           "          because it collapses to ONE source. Circular self-reinforcement\n"
-           "          cannot manufacture grounding.\n");
-}
-
-int main(void) {
-    printf("GROUNDED EDGE-PROPAGATION — PROOF LEDGER (task #50)\n");
-    printf("constants: BASE=%.2f LIKELY_MIN=%.2f GROUNDED_MIN=%.2f "
-           "N_MIN=%d THETA=%.2f D=%.1f\n",
-           (double)GEP_BASE, (double)GEP_LIKELY_MIN, (double)GEP_GROUNDED_MIN,
-           GEP_N_MIN, (double)GEP_THETA, (double)GEP_DECAY_D);
-    scenario_A();
-    scenario_B();
-    scenario_C();
-    printf("\nDONE.\n");
-    return 0;
-}

engram/spec/grounded-edge-propagation/server.route.patch.el

@@ -1,29 +0,0 @@
-// ─────────────────────────────────────────────────────────────────────────
-// server.route.patch.el — GATED route for task #50, for engram/src/server.el.
-// NOT APPLIED. Exposes the engram_ground_propagate native over HTTP so the
-// soul's consolidation beat can fire one grounded edge-propagation pass.
-// ─────────────────────────────────────────────────────────────────────────
-
-// [1] New handler — add beside route_strengthen (server.el ~line 194).
-//     Mutation (appends grounding events, updates confidence), so it is gated
-//     on _auth via check_auth_ok, exactly like /api/edges. Persists once after
-//     the beat — the whole point of running propagation as one batched beat
-//     rather than per-node is to pay the snapshot cost a single time.
-fn route_ground_propagate(method: String, path: String, body: String) -> String {
-    if !check_auth_ok(method, body) { return err_json("unauthorized") }
-    let tel: String = engram_ground_propagate()   // native — one beat over the store
-    let saved: Int = persist_canonical()
-    return tel                                     // gep_* telemetry JSON straight through
-}
-
-// [2] Dispatch — register in handle_request (server.el ~line 461, next to the
-//     /api/strengthen arm):
-//
-//     if str_eq(method, "POST") && (str_eq(clean, "/api/ground/propagate")) {
-//         return route_ground_propagate(method, clean, body)
-//     }
-//
-// [3] Native declaration — engram_ground_propagate must be declared as an
-//     extern runtime builtin (el_runtime.h) and seed-wrapped (el_seed.c /
-//     el_seed.h __engram_ground_propagate) so the EL side can call it, same as
-//     engram_strengthen / engram_hebb_drain_json.

engram/src/server.el

@@ -76,6 +76,38 @@ fn route_stats(method: String, path: String, body: String) -> String {
     engram_stats_json()
 }
 
+// route_act_stats — GET /api/act-stats
+// (2026-08-04 self-review) engram_act_stats_json() has existed since the
+// 2026-07-27 review but was reachable ONLY through the soul daemon's heartbeat
+// binding. Every activation-layer gauge — WM evictions, breakthroughs, embedder
+// breaker state, context drift, and now the Hebbian counters — was therefore
+// invisible unless the soul happened to be running and its ISEs were read back
+// out of the store. Diagnosing the activation layer required a working soul,
+// which is exactly backwards: the lower layer should be observable on its own.
+// This review needed it to verify link formation and could not get at it. One
+// line of plumbing, and the whole activation layer becomes directly diagnosable.
+fn route_act_stats(method: String, path: String, body: String) -> String {
+    engram_act_stats_json()
+}
+
+// route_text_health — GET /api/text-health
+// (2026-08-08 self-review) The daily census half of the text-integrity gauge.
+// Today's review found that the JSON parser had been replacing every \uXXXX
+// escape with a literal '?' for at least two months: 3,119 of 4,081
+// non-telemetry nodes (76%) were damaged, including the self traversal root
+// and every values node, and NOTHING detected it — because every gauge in the
+// system measured whether the machinery was running, and none measured whether
+// the text it carried was intact. No snapshot on disk predates the damage, so
+// it cannot be undone; it can only be made impossible to repeat quietly.
+//
+// The parser is fixed. This route is the standing check: `damaged` should now
+// hold flat at its historical floor and never climb. `write_damaged` (also on
+// the heartbeat as txt_damaged) is the live regression signal — non-zero means
+// a write path is mangling text right now.
+fn route_text_health(method: String, path: String, body: String) -> String {
+    engram_text_health_json()
+}
+
 // (2026-07-18 self-review) Scoping sweep: `let` inside an if-block creates an
 // inner scope only — it does NOT mutate the outer binding (documented with
 // evidence in awareness.el, 2026-05-25). Every default/reassignment below used
@@ -101,17 +133,54 @@ fn route_stats(method: String, path: String, body: String) -> String {
 fn persist_canonical() -> Int {
     let dir_raw: String = env("ENGRAM_DATA_DIR")
     let dir: String = if str_eq(dir_raw, "") { "/tmp/engram" } else { dir_raw }
-    engram_save(dir + "/snapshot.json")
-    return 1
+    // (2026-08-10 self-review) This returned a hardcoded 1, which made every
+    // caller's `let saved: Int = persist_canonical()` a dead variable — six
+    // durable write paths each believed they had confirmation of a successful
+    // canonical persist and none of them had any. Propagate the real result.
+    return engram_save(dir + "/snapshot.json")
 }
 
+// INCOMPLETE-ROUTE FIX (2026-07-24 self-review): this route silently dropped
+// label, importance, tier, and tags — engram_node() defaults label to content
+// and importance to 0.5, so every node created over HTTP lost its metadata.
+// Observed live: the soul's boot-counter write-back landed with
+// label="soul:boot_count:99" (content), importance 0.5, no tags. Honor the
+// full field set via engram_node_full when any of them is supplied.
+// PRESENCE-AWARE DEFAULTS (2026-08-01 self-review): the old pattern
+// `if x == 0.0 { default }` made a legitimate 0.0 unrepresentable — a caller
+// setting salience/importance/weight to zero silently got 0.5. json_get_raw
+// returns "" when the key is ABSENT and the raw token when present, so
+// absence and zero are now distinguishable. Also: confidence was hardcoded
+// to 1.0 regardless of input — every HTTP-created node claimed full
+// epistemic confidence. Now honored from the payload (default 1.0).
 fn route_create_node(method: String, path: String, body: String) -> String {
     let content: String = json_get_string(body, "content")
     let nt_raw: String = json_get_string(body, "node_type")
     let node_type: String = if str_eq(nt_raw, "") { "Memory" } else { nt_raw }
-    let sal_raw: Float = json_get_float(body, "salience")
-    let salience: Float = if sal_raw == 0.0 { 0.5 } else { sal_raw }
-    let id: String = engram_node(content, node_type, salience)
+    let sal_present: String = json_get_raw(body, "salience")
+    let salience: Float = if str_eq(sal_present, "") { 0.5 } else { json_get_float(body, "salience") }
+    let label_raw: String = json_get_string(body, "label")
+    let label: String = if str_eq(label_raw, "") { content } else { label_raw }
+    let imp_present: String = json_get_raw(body, "importance")
+    let importance: Float = if str_eq(imp_present, "") { 0.5 } else { json_get_float(body, "importance") }
+    let conf_present: String = json_get_raw(body, "confidence")
+    let confidence: Float = if str_eq(conf_present, "") { 1.0 } else { json_get_float(body, "confidence") }
+    let tier_raw: String = json_get_string(body, "tier")
+    let tier: String = if str_eq(tier_raw, "") { "Working" } else { tier_raw }
+    let tags: String = json_get_string(body, "tags")
+    // NO el_from_float WRAPPER (2026-08-01 self-review): salience/importance/
+    // confidence are already Float (el_val_t) values — json_get_float and
+    // Float literals both encode. Wrapping them in el_from_float AGAIN
+    // reinterpreted the boxed bits as a raw double, producing garbage that
+    // failed engram_decode_score's range check and clamped every HTTP-created
+    // node to defaults (salience 0.9 in → 0.5 stored; confidence 0.6 in → 1.0
+    // stored — verified live). route_emit_ise always passed Floats bare and
+    // its 0.3/0.3/0.8 stored correctly; this call now does the same.
+    let id: String = engram_node_full(
+        content, node_type, label,
+        salience, importance, confidence,
+        tier, tags
+    )
     let saved: Int = persist_canonical()
     "{\"id\":\"" + id + "\",\"content\":\"" + content + "\",\"node_type\":\"" + node_type + "\"}"
 }
@@ -177,13 +246,64 @@ fn route_create_edge(method: String, path: String, body: String) -> String {
     let to_id: String = json_get_string(body, "to_id")
     let rel_raw: String = json_get_string(body, "relation")
     let relation: String = if str_eq(rel_raw, "") { "associates" } else { rel_raw }
-    let w_raw: Float = json_get_float(body, "weight")
-    let weight: Float = if w_raw == 0.0 { 0.5 } else { w_raw }
+    // Presence-aware (2026-08-01): weight 0.0 is a legitimate edge weight
+    // (dormant association); only default when the key is absent.
+    let w_present: String = json_get_raw(body, "weight")
+    let weight: Float = if str_eq(w_present, "") { 0.5 } else { json_get_float(body, "weight") }
     engram_connect(from_id, to_id, weight, relation)
     let saved: Int = persist_canonical()
     "{\"ok\":true,\"from_id\":\"" + from_id + "\",\"to_id\":\"" + to_id + "\",\"relation\":\"" + relation + "\"}"
 }
 
+// route_create_edges_batch — POST /api/edges/batch {"edges":[{from_id,to_id,relation,weight}, ...]}
+//
+// WHY THIS EXISTS (2026-08-07 self-review). persist_canonical() writes the
+// FULL canonical snapshot — 60MB at current graph size — and route_create_edge
+// calls it once per edge. That is correct for the interactive one-edge case and
+// ruinous for any bulk write: the soul's Hebbian consolidation path delivers
+// ~14 associations per 8-minute heartbeat, which through the single-edge route
+// would be ~840MB of disk writes per beat, ~150GB/day, to persist 14 edges.
+//
+// The fix is not to weaken durability — it is to make the unit of durability
+// the BATCH. Connect every edge, then snapshot exactly once. Same guarantee
+// (nothing acknowledged is lost to a restart), 1/N the writes. Empty or
+// malformed entries are skipped rather than aborting the batch: a consolidation
+// payload is best-effort by design, and one bad id should not cost the other 13.
+//
+// Returns the accepted count so the caller can tell delivery from silence.
+fn route_create_edges_batch(method: String, path: String, body: String) -> String {
+    let arr: String = json_get_raw(body, "edges")
+    if str_eq(arr, "") { return err_json("missing edges array") }
+    let n: Int = json_array_len(arr)
+    if n == 0 { return "{\"ok\":true,\"accepted\":0,\"skipped\":0}" }
+    let i: Int = 0
+    let accepted: Int = 0
+    let skipped: Int = 0
+    while i < n {
+        let item: String = json_array_get(arr, i)
+        let from_id: String = json_get_string(item, "from_id")
+        let to_id: String = json_get_string(item, "to_id")
+        if str_eq(from_id, "") || str_eq(to_id, "") {
+            let skipped = skipped + 1
+        } else {
+            let rel_raw: String = json_get_string(item, "relation")
+            let relation: String = if str_eq(rel_raw, "") { "associates" } else { rel_raw }
+            let w_present: String = json_get_raw(item, "weight")
+            let weight: Float = if str_eq(w_present, "") { 0.5 } else { json_get_float(item, "weight") }
+            engram_connect(from_id, to_id, weight, relation)
+            let accepted = accepted + 1
+        }
+        let i = i + 1
+    }
+    // ONE snapshot for the whole batch — the entire point of this route.
+    // Skip it when nothing was accepted: an all-malformed payload must not
+    // trigger a 60MB write.
+    if accepted > 0 {
+        let saved: Int = persist_canonical()
+    }
+    return "{\"ok\":true,\"accepted\":" + int_to_str(accepted) + ",\"skipped\":" + int_to_str(skipped) + "}"
+}
+
 fn route_neighbors(method: String, path: String, body: String) -> String {
     let id: String = extract_id(path, "/api/neighbors/")
     if str_eq(id, "") { return err_json("missing id") }
@@ -212,8 +332,15 @@ fn route_save(method: String, path: String, body: String) -> String {
     let dir_raw: String = env("ENGRAM_DATA_DIR")
     let dir: String = if str_eq(dir_raw, "") { "/tmp/engram" } else { dir_raw }
     let p: String = if str_eq(p_raw, "") { dir + "/snapshot.json" } else { p_raw }
-    engram_save(p)
-    "{\"ok\":true,\"path\":\"" + p + "\"}"
+    // (2026-08-10 self-review) engram_save returns 0 on an empty path and the
+    // route discarded it, so the response was a literal "ok":true regardless
+    // of whether anything was written. Report the actual result AND the counts
+    // that were supposed to have been written — the same move that made
+    // route_health honest on 2026-08-01. A caller can now tell "saved 13k
+    // nodes" from "saved nothing and said ok".
+    let sv: Int = engram_save(p)
+    let sv_ok: String = if sv == 0 { "false" } else { "true" }
+    "{\"ok\":" + sv_ok + ",\"path\":\"" + p + "\",\"node_count\":" + int_to_str(engram_node_count()) + ",\"edge_count\":" + int_to_str(engram_edge_count()) + "}"
 }
 
 fn route_load(method: String, path: String, body: String) -> String {
@@ -221,12 +348,59 @@ fn route_load(method: String, path: String, body: String) -> String {
     let dir_raw: String = env("ENGRAM_DATA_DIR")
     let dir: String = if str_eq(dir_raw, "") { "/tmp/engram" } else { dir_raw }
     let p: String = if str_eq(p_raw, "") { dir + "/snapshot.json" } else { p_raw }
-    engram_load(p)
-    ok_json()
+    // (2026-08-10 self-review) This was a stub response over the single most
+    // destructive operation in the server. engram_load returns 0 on an empty
+    // path, an unopenable file, a zero-length file, or malloc failure — and
+    // this route answered ok_json() in every one of those cases.
+    //
+    // Precise failure shape (el_runtime.c:9890): the fopen guard runs BEFORE
+    // the store reset, so a MISSING path is genuinely safe — it returns 0 with
+    // the graph intact. The dangerous case is a readable-but-malformed file:
+    // the reset loop frees every node and edge FIRST, then parses, so a
+    // truncated or non-snapshot JSON leaves a hollow store — and the caller
+    // was told "ok":true. With 37 GB of stale dated snapshots sitting in the
+    // data dir as tempting restore targets, "restore reported success and
+    // silently emptied the graph" is a live risk, not a hypothetical one.
+    //
+    // Fix: surface the return value AND the resulting counts. node_count=0
+    // after a load is the unambiguous hollow-store signal (same convention
+    // route_health adopted 2026-08-01). Callers can now verify a restore
+    // instead of trusting it.
+    let ld: Int = engram_load(p)
+    let ld_ok: String = if ld == 0 { "false" } else { "true" }
+    let nc_after: Int = engram_node_count()
+    let hollow: String = if nc_after == 0 { "true" } else { "false" }
+    "{\"ok\":" + ld_ok + ",\"path\":\"" + p + "\",\"node_count\":" + int_to_str(nc_after) + ",\"edge_count\":" + int_to_str(engram_edge_count()) + ",\"hollow\":" + hollow + "}"
 }
 
+// (2026-08-01 self-review) Health previously returned a hardcoded literal —
+// it reported "ok" even when the snapshot failed to load and the store was
+// empty. Now reports live counts so a monitor can distinguish "up and
+// loaded" from "up and hollow" (node_count=0 after boot = failed load).
 fn route_health(method: String, path: String, body: String) -> String {
-    "{\"status\":\"ok\",\"engine\":\"engram-runtime-native\"}"
+    "{\"status\":\"ok\",\"engine\":\"engram-runtime-native\",\"node_count\":" + int_to_str(engram_node_count()) + ",\"edge_count\":" + int_to_str(engram_edge_count()) + "}"
+}
+
+// route_embed_backfill — GET/POST /api/embed-backfill?n=48
+//
+// (2026-07-25 self-review) The lazy embedding backfill runs only inside
+// engram_activate, and nothing in production calls /api/activate on this
+// store — the soul's curiosity loop activates its own in-process graph.
+// After a restart from a snapshot without vectors, embedded_count stalled
+// at 93/12175 and would never recover. This route lets the soul's
+// heartbeat pump the backfill explicitly (48/min clears a 12k backlog in
+// ~4h). Persists the canonical snapshot whenever new vectors were
+// generated — the 2026-07-25 regression happened precisely because 3747
+// in-RAM embeddings were never snapshotted before a restart. Self-
+// limiting: once coverage is full, embedded=0 and no save occurs.
+fn route_embed_backfill(method: String, path: String, body: String) -> String {
+    let n: Int = query_int(path, "n", 32)
+    let result: String = engram_embed_backfill(n)
+    let done: Float = json_get_float(result, "embedded")
+    if done > 0.0 {
+        let saved: Int = persist_canonical()
+    }
+    return result
 }
 
 // route_sync — return a snapshot of non-ISE/non-Working nodes for the soul daemon
@@ -249,7 +423,16 @@ fn route_sync(method: String, path: String, body: String) -> String {
     let snap_path: String = dir + "/.sync-export.json"
     engram_save(snap_path)
     let snap: String = fs_read(snap_path)
-    if str_eq(snap, "") { return "{\"nodes\":[],\"edges\":[]}" }
+    // 2026-08-02 self-review: this used to return {"nodes":[],"edges":[]} when
+    // the export/read failed. The soul's sync_ok test (awareness.el) only
+    // checks for "" and "{}", so that placeholder PASSED as a healthy sync:
+    // soul.last_sync_ok_ts got stamped, sync_age_ms stayed green, the
+    // sync_empty warn ISE never fired, and engram_sync reported added:0
+    // forever. A totally broken sync was indistinguishable from a quiet
+    // healthy one — the exact failure class this route was added to fix in
+    // the first place (see 2026-06-27 note above). Return a real error so the
+    // failure is loud on both sides.
+    if str_eq(snap, "") { return err_json("sync export failed: snapshot unreadable") }
     return snap
 }
 
@@ -371,6 +554,25 @@ fn route_capture_knowledge(method: String, path: String, body: String) -> String
     "{\"ok\":true,\"id\":\"" + id + "\"}"
 }
 
+// route_similarity — GET /api/similarity?a=<id>&b=<id>
+//
+// (2026-08-01 self-review) engram_cosine_sim was added 2026-07-24
+// (bl-b2d1c944) with the stated purpose of exposing semantic distance to
+// "EL code and the introspection API" — but it had ZERO callers anywhere:
+// no route, no soul-daemon use. The activation path uses embeddings
+// internally (semantic seeding, Pass-2 additive term), but there was no way
+// to probe pairwise node similarity from outside. This closes that: cosine
+// in [-1,1], or -2 when either node is missing or not yet embedded (so
+// "not comparable" is distinguishable from "genuinely orthogonal" 0.0).
+fn route_similarity(method: String, path: String, body: String) -> String {
+    let a: String = query_param(path, "a")
+    let b: String = query_param(path, "b")
+    if str_eq(a, "") { return err_json("missing a") }
+    if str_eq(b, "") { return err_json("missing b") }
+    let sim: Float = engram_cosine_sim(a, b)
+    "{\"a\":\"" + a + "\",\"b\":\"" + b + "\",\"cosine\":" + float_to_str(sim) + "}"
+}
+
 // ── Auth ──────────────────────────────────────────────────────────────────────
 
 fn check_auth_ok(method: String, body: String) -> Bool {
@@ -417,6 +619,12 @@ fn handle_request(method: String, path: String, body: String) -> String {
     if str_eq(method, "GET") && (str_eq(clean, "/api/stats") || str_eq(clean, "/stats")) {
         return route_stats(method, path, body)
     }
+    if str_eq(method, "GET") && (str_eq(clean, "/api/act-stats") || str_eq(clean, "/act-stats")) {
+        return route_act_stats(method, path, body)
+    }
+    if str_eq(method, "GET") && (str_eq(clean, "/api/text-health") || str_eq(clean, "/text-health")) {
+        return route_text_health(method, path, body)
+    }
 
     // Nodes
     if str_eq(method, "POST") && (str_eq(clean, "/api/nodes") || str_eq(clean, "/nodes")) {
@@ -439,6 +647,13 @@ fn handle_request(method: String, path: String, body: String) -> String {
     if str_eq(method, "POST") && (str_eq(clean, "/api/edges") || str_eq(clean, "/edges")) {
         return route_create_edge(method, path, body)
     }
+    // Batch edge write — one snapshot for the whole payload. Must be tested
+    // BEFORE nothing else claims it; the exact-match on "/api/edges" above
+    // does not catch "/api/edges/batch", so order is not load-bearing here,
+    // but keeping the two adjacent keeps them from drifting apart.
+    if str_eq(method, "POST") && (str_eq(clean, "/api/edges/batch") || str_eq(clean, "/edges/batch")) {
+        return route_create_edges_batch(method, path, body)
+    }
     if str_eq(method, "GET") && str_starts_with(clean, "/api/neighbors/") {
         return route_neighbors(method, path, body)
     }
@@ -478,6 +693,16 @@ fn handle_request(method: String, path: String, body: String) -> String {
         return route_sync(method, path, body)
     }
 
+    // Embedding backfill — pumped by the soul heartbeat (2026-07-25)
+    if str_eq(clean, "/api/embed-backfill") {
+        return route_embed_backfill(method, path, body)
+    }
+
+    // Semantic similarity probe (2026-08-01)
+    if str_eq(method, "GET") && str_starts_with(clean, "/api/similarity") {
+        return route_similarity(method, path, body)
+    }
+
     "{\"error\":\"not found\",\"path\":\"" + clean + "\"}"
 }
 

epm/src/install.el

@@ -17,16 +17,6 @@
 //   4. Append dep to order after all its transitive deps
 //   5. Deduplicate: skip already-ordered vessels
 
-// ── Cross-module forward declarations ─────────────────────────────────────────
-// Defined in sibling epm modules; resolved at link time. The `extern fn` decls
-// give elc the C prototypes so generated install.c compiles cleanly under strict
-// compilers (gcc>=14 / clang) that reject implicit function declarations.
-extern fn manifest_name(src: String) -> String                        // manifest.el
-extern fn manifest_deps(src: String) -> String                        // manifest.el
-extern fn registry_token() -> String                                  // registry.el
-extern fn registry_find(name: String, version: String) -> String     // registry.el
-extern fn registry_latest_version(name: String) -> String            // registry.el
-
 // ── Install paths ─────────────────────────────────────────────────────────────
 
 // packages_dir returns the root directory for installed vessels.

epm/src/registry.el

@@ -14,15 +14,6 @@
 //   EPM_REGISTRY_ORG — org name that hosts vessel repos (default: neuron-technologies)
 //   EPM_TOKEN      — Gitea personal access token (required for publish)
 
-// ── Cross-module forward declarations ─────────────────────────────────────────
-// These symbols are defined in sibling epm modules or the El runtime and are
-// resolved at link time. The `extern fn` decls give elc the C prototype so the
-// generated registry.c compiles cleanly under strict compilers (gcc>=14 / clang)
-// that reject implicit function declarations. Signature arity must match the
-// definition; return/param types are informational (all lower to el_val_t).
-extern fn config(key: String) -> String          // El runtime builtin
-extern fn read_installed() -> String              // install.el
-
 // ── Config helpers ────────────────────────────────────────────────────────────
 
 // registry_api_url returns the Gitea API base URL with no trailing slash.

epm/src/update.el

@@ -6,15 +6,6 @@
 // Depends on: registry.el (registry_latest_version, registry_find),
 //             install.el  (read_installed, install_vessel, installed_version)
 
-// ── Cross-module forward declarations ─────────────────────────────────────────
-// Defined in sibling epm modules; resolved at link time. The `extern fn` decls
-// give elc the C prototypes so generated update.c compiles cleanly under strict
-// compilers (gcc>=14 / clang) that reject implicit function declarations.
-extern fn read_installed() -> String                                  // install.el
-extern fn installed_version(name: String) -> String                   // install.el
-extern fn install_vessel(name: String, version: String) -> Bool      // install.el
-extern fn registry_latest_version(name: String) -> String            // registry.el
-
 // ── Semver helpers ────────────────────────────────────────────────────────────
 
 // semver_part extracts the Nth dot-separated component from a semver string.

lang/el-compiler/runtime/el_platform_win.h

@@ -75,7 +75,6 @@ static inline void* el_win_dlsym(void* handle, const char* name) {
 #include <direct.h>            /* _mkdir */
 #define mkdir(path, mode) _mkdir(path)     /* POSIX mkdir(path,mode) → _mkdir(path) */
 #define timegm _mkgmtime                   /* UTC tm → time_t */
-#define fsync(fd) _commit(fd)              /* no fsync() on Windows; _commit() (<io.h>) is the equiv */
 
 /* setenv/unsetenv: not in the Windows CRT; map to _putenv_s / SetEnvironmentVariable. */
 static inline int setenv(const char* name, const char* value, int overwrite) {

lang/el-compiler/runtime/el_runtime.c

@@ -82,14 +82,8 @@ static _Thread_local ElArena _tl_arena = {NULL, 0, 0};
 static _Thread_local int     _tl_arena_active = 0;
 
 /* Binary-safe fs_read length — set by fs_read, consumed by http_send_response.
- * Allows serving PNGs and other binary files without strlen truncation.
- * PAIRED with the buffer pointer it describes: the length may only be applied
- * to the exact buffer fs_read returned. Without the pairing, any handler that
- * fs_read a file and then WRAPPED it into a larger response had that response
- * truncated to the file's length (Content-Length lied AND the send stopped
- * short) — the safety-contact onboarding trap, 2026-07-17. */
-static _Thread_local size_t      _tl_fs_read_len  = 0;
-static _Thread_local const char* _tl_fs_read_buf  = NULL;
+ * Allows serving PNGs and other binary files without strlen truncation. */
+static _Thread_local size_t  _tl_fs_read_len  = 0;
 
 static void el_arena_track(char* p) {
     if (!_tl_arena_active || !p) return;
@@ -107,8 +101,6 @@ static void el_arena_track(char* p) {
 void el_request_start(void) {
     _tl_arena.count  = 0;
     _tl_arena_active = 1;
-    _tl_fs_read_len  = 0;     /* never let a previous request's file length */
-    _tl_fs_read_buf  = NULL;  /* leak into this response's byte accounting  */
 }
 
 /* Called by http_worker after the El handler returns and the response is sent.
@@ -1492,14 +1484,11 @@ static void http_send_response(int fd, const char* body) {
     }
 
     const char* eff_body = is_envelope ? env_body : body;
-    /* Use the real byte count from fs_read ONLY when this body IS the exact
-     * buffer fs_read returned (binary files with embedded null bytes — PNG,
-     * WOFF2, etc.). Any other body — wrapped, enveloped, or derived — must be
-     * measured with strlen, or it is truncated/over-read to the file's size. */
-    size_t blen = (_tl_fs_read_len > 0 && eff_body == _tl_fs_read_buf)
-                      ? _tl_fs_read_len : strlen(eff_body);
+    /* Use the real byte count from fs_read if available (handles binary files
+     * with embedded null bytes — PNG, WOFF2, etc.). Fall back to strlen for
+     * normal text/JSON responses where _tl_fs_read_len is 0. */
+    size_t blen = (_tl_fs_read_len > 0) ? _tl_fs_read_len : strlen(eff_body);
     _tl_fs_read_len = 0;  /* consume — one-shot per response */
-    _tl_fs_read_buf = NULL;
     int head_only = _tl_http_head_only;
 
     JsonBuf hdrs; jb_init(&hdrs);
@@ -1556,6 +1545,17 @@ typedef struct {
 #endif
 } HttpWorkerArg;
 
+/* Forward declarations for the loopback/API-key hardening helpers defined
+ * further down. Without these, http_worker's calls below were implicit
+ * declarations and the later `static` definitions conflicted with them — this
+ * file did not compile at all. (2026-08-08 self-review: the hardening work
+ * they belong to had been sitting uncommitted in the working tree since
+ * 2026-07-15 in exactly this non-building state, which is presumably why it
+ * was never committed. Adding the two prototypes is the whole fix.) */
+static int  el_http_request_authorized(const char* method, const char* path,
+                                       const char* hdr_block);
+static void el_http_send_401(int fd);
+
 static void* http_worker(void* arg) {
     HttpWorkerArg* a = (HttpWorkerArg*)arg;
 #ifdef _WIN32
@@ -1564,8 +1564,13 @@ static void* http_worker(void* arg) {
     int fd = a->fd;
 #endif
     free(a);
-    char *method = NULL, *path = NULL, *body = NULL;
-    if (http_read_request(fd, &method, &path, &body, NULL) == 0) {
+    char *method = NULL, *path = NULL, *body = NULL, *hdr_block = NULL;
+    if (http_read_request(fd, &method, &path, &body, &hdr_block) == 0
+        && !el_http_request_authorized(method, path, hdr_block)) {
+        /* Loopback hardening: EL_HTTP_AUTH_KEY is set and this request lacks the
+         * matching X-Neuron-Auth header — refuse before it reaches any handler. */
+        el_http_send_401(fd);
+    } else if (method != NULL) {
         http_handler_fn h = http_lookup_active();
         char* response = NULL;
         /* HEAD: dispatch as GET so existing handlers respond with the same
@@ -1579,22 +1584,11 @@ static void* http_worker(void* arg) {
             const char* rs = EL_CSTR(r);
             /* Copy response out BEFORE arena teardown.
              * For binary files, _tl_fs_read_len holds the real byte count —
-             * use memcpy instead of strdup so null bytes are preserved.
-             * The stored length applies ONLY when the response IS the exact
-             * fs_read buffer; a wrapped/derived response must use strlen or
-             * it gets truncated (or over-read) to the file's length. */
-            size_t rlen;
-            if (_tl_fs_read_len > 0 && rs && rs == _tl_fs_read_buf) {
-                rlen = _tl_fs_read_len;   /* raw file bytes — binary-safe */
-            } else {
-                rlen = rs ? strlen(rs) : 0;
-                _tl_fs_read_len = 0;      /* hint doesn't describe this body */
-                _tl_fs_read_buf = NULL;
-            }
+             * use memcpy instead of strdup so null bytes are preserved. */
+            size_t rlen = _tl_fs_read_len > 0 ? _tl_fs_read_len : (rs ? strlen(rs) : 0);
             response = malloc(rlen + 1);
             if (response && rs) { memcpy(response, rs, rlen); response[rlen] = '\0'; }
             else if (response) { response[0] = '\0'; }
-            if (_tl_fs_read_len > 0) _tl_fs_read_buf = response; /* hint follows the copy */
         } else {
             response = el_strdup_persist("el-runtime: no http handler registered");
         }
@@ -1604,7 +1598,7 @@ static void* http_worker(void* arg) {
         _tl_http_head_only = 0;
         free(response);
     }
-    free(method); free(path); free(body);
+    free(method); free(path); free(body); free(hdr_block);
     el_closesocket(fd);
     /* release a slot */
     pthread_mutex_lock(&_http_conn_mu);
@@ -1614,6 +1608,108 @@ static void* http_worker(void* arg) {
     return NULL;
 }
 
+/* ── loopback lock + local API-key auth (shipped desktop hardening) ────────
+ * Both controls are OFF by default (their env vars unset), so dev, self-host,
+ * and server builds behave exactly as before. The shipped macOS launcher
+ * neuron-daemons.sh sets them so a customer's soul is neither reachable from
+ * other machines on the LAN nor callable by other local users/processes
+ * without the per-install key held in the login Keychain:
+ *
+ *   EL_HTTP_BIND_HOST=127.0.0.1    -> bind loopback only (el_http_apply_bind_addr)
+ *   EL_HTTP_AUTH_KEY=<per-install> -> require "X-Neuron-Auth: <key>" per request
+ */
+
+/* Set the listen address on the dual-stack (AF_INET6, V6ONLY=0) socket. Default
+ * is in6addr_any (all interfaces) — unchanged. When EL_HTTP_BIND_HOST names a
+ * loopback ("127.0.0.1", "localhost", "loopback", or "::1") we bind the IPv4-
+ * mapped IPv6 loopback ::ffff:127.0.0.1: on a V6ONLY=0 socket this accepts IPv4
+ * 127.0.0.1 clients (the desktop app connects there) while refusing every
+ * off-machine address. */
+static void el_http_apply_bind_addr(struct sockaddr_in6* addr) {
+    const char* h = getenv("EL_HTTP_BIND_HOST");
+    int loopback = h && *h && (strcmp(h, "127.0.0.1") == 0
+                            || strcmp(h, "localhost") == 0
+                            || strcmp(h, "loopback")  == 0
+                            || strcmp(h, "::1")       == 0);
+    if (loopback) {
+        memset(&addr->sin6_addr, 0, sizeof(addr->sin6_addr));
+        addr->sin6_addr.s6_addr[10] = 0xff;   /* ::ffff:127.0.0.1 */
+        addr->sin6_addr.s6_addr[11] = 0xff;
+        addr->sin6_addr.s6_addr[12] = 127;
+        addr->sin6_addr.s6_addr[15] = 1;
+    } else {
+        addr->sin6_addr = in6addr_any;
+    }
+}
+
+/* Human-readable description of the active bind host, for the listen log line. */
+static const char* el_http_bind_desc(void) {
+    const char* h = getenv("EL_HTTP_BIND_HOST");
+    if (h && *h && (strcmp(h, "127.0.0.1") == 0 || strcmp(h, "localhost") == 0
+                 || strcmp(h, "loopback") == 0 || strcmp(h, "::1") == 0)) {
+        return "127.0.0.1 (loopback)";
+    }
+    return "[::] (dual-stack)";
+}
+
+/* Case-insensitive compare of the first n bytes of a and b. */
+static int el_ci_eq_n(const char* a, const char* b, size_t n) {
+    for (size_t i = 0; i < n; i++) {
+        unsigned char ca = (unsigned char)a[i], cb = (unsigned char)b[i];
+        if (tolower(ca) != tolower(cb)) return 0;
+    }
+    return 1;
+}
+
+/* Return 1 iff the raw header block carries a header named `name` (case-
+ * insensitive) whose trimmed value equals `want` exactly. */
+static int el_http_header_equals(const char* hdr_block, const char* name,
+                                 const char* want) {
+    if (!hdr_block || !name || !want) return 0;
+    size_t nlen = strlen(name), wlen = strlen(want);
+    const char* p = hdr_block;
+    while (*p) {
+        const char* line_end = strstr(p, "\r\n");
+        const char* end = line_end ? line_end : p + strlen(p);
+        const char* colon = memchr(p, ':', (size_t)(end - p));
+        if (colon && (size_t)(colon - p) == nlen && el_ci_eq_n(p, name, nlen)) {
+            const char* v = colon + 1;
+            while (v < end && (*v == ' ' || *v == '\t')) v++;
+            size_t vlen = (size_t)(end - v);
+            while (vlen > 0 && (v[vlen - 1] == ' ' || v[vlen - 1] == '\t')) vlen--;
+            if (vlen == wlen && memcmp(v, want, wlen) == 0) return 1;
+        }
+        if (!line_end) break;
+        p = line_end + 2;
+    }
+    return 0;
+}
+
+/* Authorize an inbound request. Enforcement is active only when EL_HTTP_AUTH_KEY
+ * is set; otherwise every request is allowed (dev default). GET/HEAD /health*
+ * are always allowed so launch-agent liveness probes work without the key. */
+static int el_http_request_authorized(const char* method, const char* path,
+                                      const char* hdr_block) {
+    const char* key = getenv("EL_HTTP_AUTH_KEY");
+    if (!key || !*key) return 1;
+    if (method && (strcmp(method, "GET") == 0 || strcmp(method, "HEAD") == 0)
+        && path && strncmp(path, "/health", 7) == 0) return 1;
+    return el_http_header_equals(hdr_block, "x-neuron-auth", key);
+}
+
+/* Minimal 401 for unauthorized requests — never reaches an EL handler. */
+static void el_http_send_401(int fd) {
+    static const char* body = "{\"error\":\"unauthorized\",\"code\":\"auth_required\"}";
+    char resp[256];
+    int n = snprintf(resp, sizeof(resp),
+                     "HTTP/1.1 401 Unauthorized\r\n"
+                     "Content-Type: application/json\r\n"
+                     "Content-Length: %zu\r\n"
+                     "Connection: close\r\n\r\n%s",
+                     strlen(body), body);
+    if (n > 0) http_send_all(fd, resp, (size_t)n);
+}
+
 el_val_t http_serve(el_val_t port, el_val_t handler) {
     /* If `handler` looks like a string name, register it as the active handler. */
     const char* hname = EL_CSTR(handler);
@@ -1632,13 +1728,13 @@ el_val_t http_serve(el_val_t port, el_val_t handler) {
     struct sockaddr_in6 addr;
     memset(&addr, 0, sizeof(addr));
     addr.sin6_family = AF_INET6;
-    addr.sin6_addr = in6addr_any;
+    el_http_apply_bind_addr(&addr);
     addr.sin6_port = htons((uint16_t)p);
     if (bind(sock, (struct sockaddr*)&addr, sizeof(addr)) < 0) {
         perror("bind"); el_closesocket(sock); return 0;
     }
     if (listen(sock, 64) < 0) { perror("listen"); el_closesocket(sock); return 0; }
-    fprintf(stderr, "[http] listening on [::]:%d (dual-stack)\n", p);
+    fprintf(stderr, "[http] listening on %s port %d\n", el_http_bind_desc(), p);
     while (1) {
         struct sockaddr_in6 cli;
         socklen_t clen = sizeof(cli);
@@ -1844,20 +1940,10 @@ static void* http_worker_v2(void* arg) {
             el_val_t hmap = http_build_headers_map(hdr_block ? hdr_block : "");
             el_val_t r = h(EL_STR(dispatch_method), EL_STR(path), hmap, EL_STR(body));
             const char* rs = EL_CSTR(r);
-            /* Same pairing rule as the v1 worker: the fs_read length is only
-             * trustworthy for the exact buffer fs_read returned. */
-            size_t rlen;
-            if (_tl_fs_read_len > 0 && rs && rs == _tl_fs_read_buf) {
-                rlen = _tl_fs_read_len;   /* raw file bytes — binary-safe */
-            } else {
-                rlen = rs ? strlen(rs) : 0;
-                _tl_fs_read_len = 0;      /* hint doesn't describe this body */
-                _tl_fs_read_buf = NULL;
-            }
+            size_t rlen = _tl_fs_read_len > 0 ? _tl_fs_read_len : (rs ? strlen(rs) : 0);
             response = malloc(rlen + 1);
             if (response && rs) { memcpy(response, rs, rlen); response[rlen] = '\0'; }
             else if (response) { response[0] = '\0'; }
-            if (_tl_fs_read_len > 0) _tl_fs_read_buf = response; /* hint follows the copy */
             el_release(hmap);
         } else {
             response = el_strdup_persist(
@@ -1898,13 +1984,13 @@ el_val_t http_serve_v2(el_val_t port, el_val_t handler) {
     struct sockaddr_in6 addr;
     memset(&addr, 0, sizeof(addr));
     addr.sin6_family = AF_INET6;
-    addr.sin6_addr = in6addr_any;
+    el_http_apply_bind_addr(&addr);
     addr.sin6_port = htons((uint16_t)p);
     if (bind(sock, (struct sockaddr*)&addr, sizeof(addr)) < 0) {
         perror("bind"); el_closesocket(sock); return 0;
     }
     if (listen(sock, 64) < 0) { perror("listen"); el_closesocket(sock); return 0; }
-    fprintf(stderr, "[http v2] listening on [::]:%d (dual-stack)\n", p);
+    fprintf(stderr, "[http v2] listening on %s port %d\n", el_http_bind_desc(), p);
     while (1) {
         struct sockaddr_in6 cli;
         socklen_t clen = sizeof(cli);
@@ -1995,19 +2081,18 @@ void http_serve_async(el_val_t port, el_val_t handler) {
     int sock = socket(AF_INET6, SOCK_STREAM, 0);
     if (sock < 0) { perror("socket"); return; }
     int yes = 1; int no = 0;
-    /* Win32/mingw setsockopt takes optval as (const char*); the cast is portable on POSIX too. */
-    setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, (const char*)&yes, sizeof(yes));
-    setsockopt(sock, IPPROTO_IPV6, IPV6_V6ONLY, (const char*)&no, sizeof(no));
+    setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &yes, sizeof(yes));
+    setsockopt(sock, IPPROTO_IPV6, IPV6_V6ONLY, &no, sizeof(no));
     struct sockaddr_in6 addr;
     memset(&addr, 0, sizeof(addr));
     addr.sin6_family = AF_INET6;
-    addr.sin6_addr = in6addr_any;
+    el_http_apply_bind_addr(&addr);
     addr.sin6_port = htons((uint16_t)p);
     if (bind(sock, (struct sockaddr*)&addr, sizeof(addr)) < 0) {
         perror("bind"); close(sock); return;
     }
     if (listen(sock, 64) < 0) { perror("listen"); close(sock); return; }
-    fprintf(stderr, "[http] async listening on [::]:%d (dual-stack)\n", p);
+    fprintf(stderr, "[http] async listening on %s port %d\n", el_http_bind_desc(), p);
     HttpServeAsyncArg* a = malloc(sizeof(HttpServeAsyncArg));
     if (!a) { close(sock); return; }
     a->sock = sock;
@@ -2056,7 +2141,6 @@ el_val_t http_response(el_val_t status, el_val_t headers_json, el_val_t body) {
 el_val_t fs_read(el_val_t pathv) {
     const char* path = EL_CSTR(pathv);
     _tl_fs_read_len = 0;
-    _tl_fs_read_buf = NULL;
     if (!path) return el_wrap_str(el_strdup(""));
     FILE* f = fopen(path, "rb");
     if (!f) return el_wrap_str(el_strdup(""));
@@ -2068,7 +2152,6 @@ el_val_t fs_read(el_val_t pathv) {
     size_t got = fread(buf, 1, (size_t)sz, f);
     buf[got] = '\0';
     _tl_fs_read_len = got;   /* store real byte count for binary-safe send */
-    _tl_fs_read_buf = buf;   /* ...valid ONLY for this exact buffer */
     fclose(f);
     return el_wrap_str(buf);
 }
@@ -3174,10 +3257,72 @@ static char* jp_parse_string_raw(JsonParser* jp) {
                 case 'r':  c = '\r'; break;
                 case 't':  c = '\t'; break;
                 case 'u': {
-                    /* Skip 4 hex digits; emit '?' as a placeholder */
-                    for (int i = 0; i < 4 && jp->p < jp->end; i++) jp->p++;
-                    c = '?';
-                    break;
+                    /* Decode \uXXXX (with surrogate pairs) to UTF-8.
+                     * Ported from lang/releases/v1.0.0-20260501 (2026-08-08
+                     * self-review). This copy carried the identical defect:
+                     * the escape was skipped and a literal '?' emitted, which
+                     * silently destroyed every non-ASCII character in any JSON
+                     * string entering the runtime. Two copies of one parser
+                     * bug is exactly how this class of fault survives, so the
+                     * fix lands in both. See the release copy for the full
+                     * measurement and rationale. */
+                    unsigned cp = 0;
+                    int ok = 1;
+                    for (int i = 0; i < 4; i++) {
+                        if (jp->p >= jp->end) { ok = 0; break; }
+                        char h = *jp->p++;
+                        unsigned d;
+                        if      (h >= '0' && h <= '9') d = (unsigned)(h - '0');
+                        else if (h >= 'a' && h <= 'f') d = (unsigned)(h - 'a' + 10);
+                        else if (h >= 'A' && h <= 'F') d = (unsigned)(h - 'A' + 10);
+                        else { ok = 0; break; }
+                        cp = (cp << 4) | d;
+                    }
+                    if (!ok) { c = '?'; break; }
+                    if (cp >= 0xD800 && cp <= 0xDBFF &&
+                        (size_t)(jp->end - jp->p) >= 6 &&
+                        jp->p[0] == '\\' && jp->p[1] == 'u') {
+                        const char* save = jp->p;
+                        unsigned lo = 0; int ok2 = 1;
+                        jp->p += 2;
+                        for (int i = 0; i < 4; i++) {
+                            char h = *jp->p++;
+                            unsigned d;
+                            if      (h >= '0' && h <= '9') d = (unsigned)(h - '0');
+                            else if (h >= 'a' && h <= 'f') d = (unsigned)(h - 'a' + 10);
+                            else if (h >= 'A' && h <= 'F') d = (unsigned)(h - 'A' + 10);
+                            else { ok2 = 0; break; }
+                            lo = (lo << 4) | d;
+                        }
+                        if (ok2 && lo >= 0xDC00 && lo <= 0xDFFF)
+                            cp = 0x10000u + ((cp - 0xD800u) << 10) + (lo - 0xDC00u);
+                        else jp->p = save;
+                    }
+                    if (cp >= 0xD800 && cp <= 0xDFFF) cp = 0xFFFD;
+
+                    char ub[4]; int un;
+                    if (cp < 0x80) {
+                        ub[0] = (char)cp; un = 1;
+                    } else if (cp < 0x800) {
+                        ub[0] = (char)(0xC0 | (cp >> 6));
+                        ub[1] = (char)(0x80 | (cp & 0x3F)); un = 2;
+                    } else if (cp < 0x10000) {
+                        ub[0] = (char)(0xE0 | (cp >> 12));
+                        ub[1] = (char)(0x80 | ((cp >> 6) & 0x3F));
+                        ub[2] = (char)(0x80 | (cp & 0x3F)); un = 3;
+                    } else {
+                        ub[0] = (char)(0xF0 | (cp >> 18));
+                        ub[1] = (char)(0x80 | ((cp >> 12) & 0x3F));
+                        ub[2] = (char)(0x80 | ((cp >> 6) & 0x3F));
+                        ub[3] = (char)(0x80 | (cp & 0x3F)); un = 4;
+                    }
+                    while (len + (size_t)un >= cap) {
+                        cap *= 2;
+                        out = realloc(out, cap);
+                        if (!out) { fputs("el_runtime: out of memory\n", stderr); exit(1); }
+                    }
+                    for (int i = 0; i < un; i++) out[len++] = ub[i];
+                    continue; /* bytes already appended */
                 }
                 default: c = esc; break;
             }
@@ -3611,10 +3756,8 @@ el_val_t json_get_raw(el_val_t json_str, el_val_t key) {
     const char* k    = EL_CSTR(key);
     const char* p = json_find_key(json, k);
     /* Clear fs_read binary-length hint — result is a fresh null-terminated
-     * string, not the raw file bytes, so Content-Length must use strlen.
-     * (Kept although the pointer pairing now makes this redundant.) */
+     * string, not the raw file bytes, so Content-Length must use strlen. */
     _tl_fs_read_len = 0;
-    _tl_fs_read_buf = NULL;
     if (!p) return el_wrap_str(el_strdup(""));
     const char* end = json_skip_value(p);
     size_t n = (size_t)(end - p);
@@ -6085,6 +6228,13 @@ void el_cgi_init(el_val_t name, el_val_t dharma_id, el_val_t principal,
 #define ENGRAM_SUPPRESSION_BREAKTHROUGH 5
 #define ENGRAM_BREAKTHROUGH_WEIGHT   0.25
 #define ENGRAM_INHIBITION_FACTOR     0.1
+/* ENGRAM_WM_CAP: hard global ceiling on nodes holding working_memory_weight
+ * > 0 at any time. Cowan (2001) puts human WM capacity at ~4 chunks; 24 gives
+ * the daemon generous headroom while preventing the unbounded growth observed
+ * in production (wm_active 288-778 per heartbeat — "working memory" that is
+ * really the whole recently-touched graph). Ported from release runtime
+ * v1.0.0-20260501 Pass 5 on 2026-07-15 self-review. */
+#define ENGRAM_WM_CAP                24
 
 /* ── Layered consciousness architecture ──────────────────────────────────────
  *
@@ -6932,243 +7082,6 @@ static int engram_rank_cmp(const void* a, const void* b) {
     return 0;
 }
 
-/* ══════════════════════════════════════════════════════════════════════════
- * SEMANTIC SEARCH LAYER — nomic-embed-text via Ollama /api/embeddings
- * ──────────────────────────────────────────────────────────────────────────
- * Augments the lexical (istr_contains) matcher with dense-vector retrieval.
- * Node content and the query are embedded through a local Ollama server;
- * nodes are ranked by cosine similarity and UNIONED with lexical hits. This
- * lets a paraphrase query surface a node whose words never appear in it.
- *
- * DEGRADABLE BY DESIGN. The whole layer is gated on HAVE_CURL plus a one-shot
- * runtime probe of the embedding endpoint. If curl is not compiled in, or
- * Ollama is unreachable, or ENGRAM_SEMANTIC=0, every entry point returns
- * "no semantic signal" and callers fall back to pure lexical behaviour —
- * byte-for-byte the pre-existing search.
- *
- * CACHE. Node embeddings are computed lazily on first use and cached in
- * process memory keyed by node id, with an FNV-1a content hash for
- * invalidation (edited content re-embeds). The query is embedded once per
- * search call. This is what "avoid re-embedding the whole graph every query"
- * buys us: a warm cache serves cosine from RAM. (A cold process still pays
- * O(N) embed calls the first time each node is scanned — persisting the cache
- * to a snapshot sidecar is the documented next step, not done here.)
- *
- * nomic task prefixes ("search_query:" / "search_document:") are applied
- * because nomic-embed-text is trained with them; they materially improve
- * retrieval separation (empirically: paraphrase 0.72 vs distractors <0.48).
- *
- * ENV:
- *   ENGRAM_SEMANTIC       "0" disables; unset/other = auto-probe
- *   ENGRAM_EMBED_URL      default http://localhost:11434/api/embeddings
- *   ENGRAM_EMBED_MODEL    default nomic-embed-text
- *   ENGRAM_SEMANTIC_MIN   cosine threshold for a pure-semantic match (def 0.6)
- * ════════════════════════════════════════════════════════════════════════ */
-
-static double engram_semantic_min(void) {
-    static double v = -1.0;
-    if (v >= 0.0) return v;
-    const char* s = getenv("ENGRAM_SEMANTIC_MIN");
-    double d = 0.6;
-    if (s && *s) { char* e = NULL; double t = strtod(s, &e);
-                   if (e != s && t >= 0.0 && t <= 1.0) d = t; }
-    v = d; return v;
-}
-
-#ifdef HAVE_CURL
-
-typedef struct { char* id; uint64_t hash; float* vec; int dim; } EngramEmbEntry;
-static EngramEmbEntry* g_emb_items = NULL;
-static int64_t g_emb_count = 0, g_emb_cap = 0;
-static int g_emb_state = 0;   /* 0=unprobed, 1=available, -1=disabled */
-
-static uint64_t engram_fnv1a(const char* s) {
-    uint64_t h = 1469598103934665603ULL;
-    if (s) for (const unsigned char* p = (const unsigned char*)s; *p; p++) {
-        h ^= *p; h *= 1099511628211ULL;
-    }
-    return h;
-}
-
-/* Parse "embedding":[f,f,...] from an Ollama response. malloc'd vec, or NULL. */
-static float* engram_parse_embedding(const char* json, int* out_dim) {
-    if (!json) return NULL;
-    const char* p = strstr(json, "\"embedding\"");
-    if (!p) return NULL;
-    p = strchr(p, '[');
-    if (!p) return NULL;
-    p++;
-    int cap = 1024, n = 0;
-    float* v = malloc((size_t)cap * sizeof(float));
-    if (!v) return NULL;
-    while (*p && *p != ']') {
-        while (*p == ' ' || *p == '\t' || *p == '\n' || *p == '\r' || *p == ',') p++;
-        if (*p == ']' || !*p) break;
-        char* e = NULL;
-        double d = strtod(p, &e);
-        if (e == p) break;
-        if (n >= cap) { cap *= 2; float* nv = realloc(v, (size_t)cap * sizeof(float));
-                        if (!nv) { free(v); return NULL; } v = nv; }
-        v[n++] = (float)d;
-        p = e;
-    }
-    if (n == 0) { free(v); return NULL; }
-    *out_dim = n;
-    return v;
-}
-
-/* JSON-escape src into a malloc'd buffer (no surrounding quotes). */
-static char* engram_json_escape(const char* src) {
-    if (!src) src = "";
-    size_t n = strlen(src);
-    char* out = malloc(n * 2 + 1);
-    if (!out) return NULL;
-    size_t j = 0;
-    for (size_t i = 0; i < n; i++) {
-        unsigned char c = (unsigned char)src[i];
-        if      (c == '"')  { out[j++] = '\\'; out[j++] = '"'; }
-        else if (c == '\\') { out[j++] = '\\'; out[j++] = '\\'; }
-        else if (c == '\n') { out[j++] = '\\'; out[j++] = 'n'; }
-        else if (c == '\r') { out[j++] = '\\'; out[j++] = 'r'; }
-        else if (c == '\t') { out[j++] = '\\'; out[j++] = 't'; }
-        else if (c < 0x20)  { /* drop other control bytes */ }
-        else                { out[j++] = (char)c; }
-    }
-    out[j] = '\0';
-    return out;
-}
-
-/* Embed `prefix+text` via Ollama. Returns malloc'd vec (caller frees), or NULL. */
-static float* engram_embed_raw(const char* prefix, const char* text, int* out_dim) {
-    if (!text) return NULL;
-    const char* url = getenv("ENGRAM_EMBED_URL");
-    if (!url || !*url) url = "http://localhost:11434/api/embeddings";
-    const char* model = getenv("ENGRAM_EMBED_MODEL");
-    if (!model || !*model) model = "nomic-embed-text";
-    /* Bound content length to keep latency/memory sane on huge nodes. */
-    char* trunc = NULL;
-    size_t maxlen = 8192;
-    if (strlen(text) > maxlen) {
-        trunc = malloc(maxlen + 1);
-        if (trunc) { memcpy(trunc, text, maxlen); trunc[maxlen] = '\0'; text = trunc; }
-    }
-    char* esc_prefix = engram_json_escape(prefix ? prefix : "");
-    char* esc = engram_json_escape(text);
-    free(trunc);
-    if (!esc || !esc_prefix) { free(esc); free(esc_prefix); return NULL; }
-    size_t blen = strlen(esc) + strlen(esc_prefix) + strlen(model) + 64;
-    char* body = malloc(blen);
-    if (!body) { free(esc); free(esc_prefix); return NULL; }
-    snprintf(body, blen, "{\"model\":\"%s\",\"prompt\":\"%s%s\"}", model, esc_prefix, esc);
-    free(esc); free(esc_prefix);
-
-    CURL* c = curl_easy_init();
-    if (!c) { free(body); return NULL; }
-    HttpBuf rb; httpbuf_init(&rb);
-    struct curl_slist* h = curl_slist_append(NULL, "Content-Type: application/json");
-    char errbuf[CURL_ERROR_SIZE]; errbuf[0] = '\0';
-    curl_easy_setopt(c, CURLOPT_URL, url);
-    curl_easy_setopt(c, CURLOPT_WRITEFUNCTION, http_write_cb);
-    curl_easy_setopt(c, CURLOPT_WRITEDATA, &rb);
-    curl_easy_setopt(c, CURLOPT_POST, 1L);
-    curl_easy_setopt(c, CURLOPT_POSTFIELDS, body);
-    curl_easy_setopt(c, CURLOPT_POSTFIELDSIZE, (long)strlen(body));
-    curl_easy_setopt(c, CURLOPT_HTTPHEADER, h);
-    curl_easy_setopt(c, CURLOPT_TIMEOUT_MS, el_http_timeout_ms());
-    curl_easy_setopt(c, CURLOPT_NOSIGNAL, 1L);
-    curl_easy_setopt(c, CURLOPT_ERRORBUFFER, errbuf);
-    CURLcode rc = curl_easy_perform(c);
-    curl_slist_free_all(h);
-    curl_easy_cleanup(c);
-    free(body);
-    if (rc != CURLE_OK) { free(rb.data); return NULL; }
-    float* v = engram_parse_embedding(rb.data, out_dim);
-    free(rb.data);
-    return v;
-}
-
-/* One-shot probe: is semantic search available? Caches the verdict. */
-static int engram_semantic_enabled(void) {
-    if (g_emb_state != 0) return g_emb_state == 1;
-    const char* s = getenv("ENGRAM_SEMANTIC");
-    if (s && strcmp(s, "0") == 0) { g_emb_state = -1; return 0; }
-    int dim = 0;
-    float* v = engram_embed_raw("search_query: ", "probe", &dim);
-    if (v && dim > 0) { free(v); g_emb_state = 1; return 1; }
-    free(v);
-    g_emb_state = -1; return 0;
-}
-
-/* Embed the query. Returns malloc'd vec (caller frees), or NULL if semantic off. */
-static float* engram_embed_query(const char* q, int* dim) {
-    if (!engram_semantic_enabled()) return NULL;
-    if (!q || !*q) return NULL;
-    return engram_embed_raw("search_query: ", q, dim);
-}
-
-/* Cached node embedding. Returns a pointer OWNED BY THE CACHE — do not free. */
-static const float* engram_node_vec(EngramNode* n, int* out_dim) {
-    if (!n || !n->id) return NULL;
-    uint64_t h = engram_fnv1a(n->content);
-    for (int64_t i = 0; i < g_emb_count; i++) {
-        if (g_emb_items[i].id && strcmp(g_emb_items[i].id, n->id) == 0) {
-            if (g_emb_items[i].hash == h && g_emb_items[i].vec) {
-                *out_dim = g_emb_items[i].dim; return g_emb_items[i].vec;
-            }
-            /* content changed → re-embed in place */
-            int dim = 0;
-            float* v = engram_embed_raw("search_document: ", n->content ? n->content : "", &dim);
-            if (!v) return NULL;
-            free(g_emb_items[i].vec);
-            g_emb_items[i].vec = v; g_emb_items[i].dim = dim; g_emb_items[i].hash = h;
-            *out_dim = dim; return v;
-        }
-    }
-    int dim = 0;
-    float* v = engram_embed_raw("search_document: ", n->content ? n->content : "", &dim);
-    if (!v) return NULL;
-    if (g_emb_count >= g_emb_cap) {
-        int64_t nc = g_emb_cap ? g_emb_cap * 2 : 256;
-        EngramEmbEntry* ni = realloc(g_emb_items, (size_t)nc * sizeof(EngramEmbEntry));
-        if (!ni) { free(v); return NULL; }
-        g_emb_items = ni; g_emb_cap = nc;
-    }
-    g_emb_items[g_emb_count].id   = strdup(n->id);
-    g_emb_items[g_emb_count].hash = h;
-    g_emb_items[g_emb_count].vec  = v;
-    g_emb_items[g_emb_count].dim  = dim;
-    g_emb_count++;
-    *out_dim = dim; return v;
-}
-
-static double engram_cosine(const float* a, const float* b, int dim) {
-    double dot = 0, na = 0, nb = 0;
-    for (int i = 0; i < dim; i++) { dot += (double)a[i] * b[i];
-                                    na  += (double)a[i] * a[i];
-                                    nb  += (double)b[i] * b[i]; }
-    if (na <= 0 || nb <= 0) return 0.0;
-    return dot / (sqrt(na) * sqrt(nb));
-}
-
-/* Cosine of node n against the query vector; 0 if unavailable / dim mismatch. */
-static double engram_node_cosine(EngramNode* n, const float* qvec, int qdim) {
-    if (!qvec || qdim <= 0) return 0.0;
-    int ndim = 0;
-    const float* nv = engram_node_vec(n, &ndim);
-    if (!nv || ndim != qdim) return 0.0;
-    return engram_cosine(qvec, nv, qdim);
-}
-
-#else  /* !HAVE_CURL — semantic layer compiled out; callers stay pure-lexical.
-        * Only the two boundary functions the always-compiled search/activate
-        * code calls are stubbed; the query embed always yields NULL so every
-        * cosine is 0 and every caller collapses to lexical-only. */
-static float* engram_embed_query(const char* q, int* dim) { (void)q; (void)dim; return NULL; }
-static double engram_node_cosine(EngramNode* n, const float* qvec, int qdim) {
-    (void)n; (void)qvec; (void)qdim; return 0.0;
-}
-#endif /* HAVE_CURL */
-
 el_val_t engram_search(el_val_t query, el_val_t limit) {
     EngramStore* g = engram_get();
     const char* q = EL_CSTR(query);
@@ -7179,15 +7092,8 @@ el_val_t engram_search(el_val_t query, el_val_t limit) {
     char toks[ENGRAM_MAX_QTOKENS][ENGRAM_QTOK_LEN];
     int ntok = engram_tokenize_query(q, toks, ENGRAM_MAX_QTOKENS);
     if (ntok == 0) return lst;
-    /* Semantic augmentation: embed the query once; a node is a hit if it covers
-     * >=1 query token (tokenized-lexical, #66) OR its cosine clears the
-     * threshold (#67). qvec is NULL (cosine 0) when semantic is unavailable →
-     * pure tokenized-lexical, byte-identical to the lexical-only behaviour. */
-    int qdim = 0;
-    float* qvec = engram_embed_query(q, &qdim);
-    double sem_min = engram_semantic_min();
     EngramRankEntry* hits = malloc((size_t)g->node_count * sizeof(EngramRankEntry));
-    if (!hits) { free(qvec); return lst; }
+    if (!hits) return lst;
     int64_t nhits = 0;
     for (int64_t i = 0; i < g->node_count; i++) {
         EngramNode* n = &g->nodes[i];
@@ -7197,24 +7103,20 @@ el_val_t engram_search(el_val_t query, el_val_t limit) {
          * + engram_compile_layered_json — that's the legitimate path. */
         if (engram_layer_is_transparent(n->layer_id)) continue;
         int sc = engram_node_match_score(n, toks, ntok);
-        double sem = qvec ? engram_node_cosine(n, qvec, qdim) : 0.0;
-        if (sc > 0 || sem >= sem_min) {
+        if (sc > 0) {
             hits[nhits].idx      = i;
             hits[nhits].score    = sc;
             hits[nhits].salience = n->salience;
             nhits++;
         }
     }
-    /* Rank by distinct tokens matched (desc) then salience (desc), then cap.
-     * Pure-semantic hits (token score 0) sort after every lexical hit — a
-     * lexical ∪ semantic union with lexical precedence. */
+    /* Rank by distinct tokens matched (desc) then salience (desc), then cap. */
     qsort(hits, (size_t)nhits, sizeof(EngramRankEntry), engram_rank_cmp);
     int64_t end = nhits < lim ? nhits : lim;
     for (int64_t k = 0; k < end; k++) {
         lst = el_list_append(lst, engram_node_to_map(&g->nodes[hits[k].idx]));
     }
     free(hits);
-    free(qvec);
     return lst;
 }
 
@@ -7537,6 +7439,48 @@ static double engram_goal_bias(const EngramNode* n, const char* query) {
     return bias;
 }
 
+/* eg_cmp_double_desc — qsort comparator, descending doubles. */
+static int eg_cmp_double_desc(const void* a, const void* b) {
+    double da = *(const double*)a, db = *(const double*)b;
+    if (da < db) return 1;
+    if (da > db) return -1;
+    return 0;
+}
+
+/* eg_enforce_wm_cap_global — clamp the store-wide working-memory population
+ * to ENGRAM_WM_CAP, keeping the top-K by current weight. Runs at every point
+ * that materializes WM: post-activation persist and snapshot load/merge.
+ * (Ported from release runtime v1.0.0-20260501 Pass 5, 2026-07-15.) */
+static void eg_enforce_wm_cap_global(EngramStore* g) {
+    int64_t wm_count = 0;
+    for (int64_t i = 0; i < g->node_count; i++) {
+        if (g->nodes[i].working_memory_weight > 0.0) wm_count++;
+    }
+    if (wm_count <= ENGRAM_WM_CAP) return;
+    double* vals = malloc((size_t)wm_count * sizeof(double));
+    if (!vals) return; /* OOM: over cap this call, no corruption */
+    int64_t vi = 0;
+    for (int64_t i = 0; i < g->node_count; i++) {
+        if (g->nodes[i].working_memory_weight > 0.0)
+            vals[vi++] = g->nodes[i].working_memory_weight;
+    }
+    qsort(vals, (size_t)wm_count, sizeof(double), eg_cmp_double_desc);
+    double cutoff = vals[ENGRAM_WM_CAP - 1];
+    free(vals);
+    int64_t above = 0;
+    for (int64_t i = 0; i < g->node_count; i++) {
+        if (g->nodes[i].working_memory_weight > cutoff) above++;
+    }
+    int64_t slots_at_cutoff = ENGRAM_WM_CAP - above;
+    for (int64_t i = 0; i < g->node_count; i++) {
+        EngramNode* n = &g->nodes[i];
+        if (n->working_memory_weight <= 0.0) continue;
+        if (n->working_memory_weight > cutoff) continue;
+        if (slots_at_cutoff > 0) { slots_at_cutoff--; continue; }
+        n->working_memory_weight = 0.0; /* evict: over global cap */
+    }
+}
+
 el_val_t engram_activate(el_val_t query, el_val_t depth) {
     EngramStore* g = engram_get();
     const char* q = EL_CSTR(query);
@@ -7564,31 +7508,21 @@ el_val_t engram_activate(el_val_t query, el_val_t depth) {
     if (!seeds) {
         free(best_bg); free(best_hops); free(reached); return out;
     }
-    /* Tokenized + semantic seeding: a node seeds if it covers >=1 query token
-     * (tokenized-lexical, #66) OR its cosine clears the threshold (#67). A
-     * lexical seed's activation is scaled by token coverage (fraction of
-     * distinct query tokens covered) so a node matching all words seeds more
-     * strongly than one matching a single word; single-word queries → coverage
-     * 1.0. A pure-semantic seed (no token match) is instead down-weighted by
-     * its cosine so paraphrase matches spread without overpowering exact seeds.
-     * q_vec is NULL (cosine 0) when semantic is unavailable → the seed set is
-     * exactly the tokenized-lexical one. q_vec is freed right after this loop
-     * so the many downstream early-returns need no cleanup change. */
+    /* Tokenize once: a node seeds if it matches ANY query token, and its seed
+     * activation is scaled by token coverage (fraction of distinct query
+     * tokens it contains) so a node matching all words seeds more strongly
+     * than one matching a single word. Single-word queries → coverage 1.0,
+     * identical to the prior whole-query behavior. */
     char toks[ENGRAM_MAX_QTOKENS][ENGRAM_QTOK_LEN];
     int ntok = engram_tokenize_query(q, toks, ENGRAM_MAX_QTOKENS);
-    int q_dim = 0;
-    float* q_vec = engram_embed_query(q, &q_dim);
-    double q_sem_min = engram_semantic_min();
     for (int64_t i = 0; i < g->node_count; i++) {
         EngramNode* n = &g->nodes[i];
         int sc = engram_node_match_score(n, toks, ntok);
-        double sem = q_vec ? engram_node_cosine(n, q_vec, q_dim) : 0.0;
-        if (sc > 0 || sem >= q_sem_min) {
+        if (sc > 0) {
             double tdecay = engram_temporal_decay(n, now_ms);
             double dampen = engram_activation_dampen(n);
-            double act    = n->salience * tdecay * dampen;
-            if (sc > 0) act *= (ntok > 0 ? (double)sc / (double)ntok : 1.0);
-            else        act *= sem;  /* pure-semantic seed: down-weight by cosine */
+            double cover  = ntok > 0 ? (double)sc / (double)ntok : 1.0;
+            double act    = n->salience * tdecay * dampen * cover;
             seeds[seed_count].idx        = i;
             seeds[seed_count].act        = act;
             seeds[seed_count].created_at = n->created_at;
@@ -7598,7 +7532,6 @@ el_val_t engram_activate(el_val_t query, el_val_t depth) {
             reached[i]   = 1;
         }
     }
-    free(q_vec);
     /* Compute mean seed created_at for temporal proximity bonus. */
     int64_t seed_epoch = 0;
     if (seed_count > 0) {
@@ -7753,6 +7686,12 @@ el_val_t engram_activate(el_val_t query, el_val_t depth) {
         g->nodes[i].working_memory_weight = wm_weights[i];
     }
 
+    /* Global WM cap: keep only the top ENGRAM_WM_CAP by weight across the
+     * whole store (see eg_enforce_wm_cap_global). Without this, repeated
+     * activation calls accumulate hundreds of "promoted" nodes and WM stops
+     * meaning anything (production heartbeats showed wm_active up to 778). */
+    eg_enforce_wm_cap_global(g);
+
     /* ── Collect all background-activated nodes for the return value ────
      * Callers see both layers. Context compilation uses only promoted nodes
      * (working_memory_weight > 0). Sort: promoted first by wm_weight desc,
@@ -8130,6 +8069,9 @@ el_val_t engram_load(el_val_t path) {
             }
         }
     }
+    /* WM cap discipline applies to every entry point that materializes WM,
+     * including snapshot restore (see eg_enforce_wm_cap_global). */
+    eg_enforce_wm_cap_global(g);
     free(data);
     return 1;
 }
@@ -8154,16 +8096,14 @@ el_val_t engram_get_node_json(el_val_t id) {
  * matches the given string. Returns the node as a JSON object string, or "{}"
  * if no match is found.
  *
- * Used by chat.el to retrieve well-known nodes (e.g. "conv:history",
- * "session:summary") by their stable label rather than by ID, which is immune
- * to vector index drift across restarts.
+ * Exact match (strcmp, not substring) because labels like "conv:history"
+ * must not collide with nodes whose content contains that substring.
  *
- * Exact match (strcmp, not istr_contains) because labels like "conv:history"
- * must not collide with nodes whose content happens to contain that substring.
- *
- * Backported verbatim (idiom-adapted to jb_finish) from release runtime
- * v1.0.0-20260501 to unblock the soul regen link: chat.el references this
- * native but the current runtime lacked its definition. */
+ * Ported from the release runtime 2026-07-16 self-review: chat.el has called
+ * this since 2026-07-01 but the function only existed in
+ * releases/v1.0.0-20260501/el_runtime.c — the soul daemon (which builds
+ * against THIS runtime) failed to compile once clang made implicit
+ * declarations an error. */
 el_val_t engram_get_node_by_label(el_val_t label) {
     const char* lbl = EL_CSTR(label);
     if (!lbl || !*lbl) return el_wrap_str(el_strdup("{}"));
@@ -8186,50 +8126,39 @@ el_val_t engram_search_json(el_val_t query, el_val_t limit) {
     if (lim <= 0) lim = 100;
     JsonBuf b; jb_init(&b);
     jb_putc(&b, '[');
-    if (q && *q && g->node_count > 0) {
-        /* Collect candidates from the UNION of tokenized-lexical and semantic
-         * matches, score each, rank by score, emit the top `lim`. A node is a
-         * candidate if it covers >=1 query token (tokenized-lexical, #66) OR its
-         * query cosine clears the threshold (#67). Lexical score is the distinct
-         * token count (>=1), so any lexical hit outranks a pure-semantic hit
-         * (cosine < 1); pure-semantic hits are scored by cosine alone. When
-         * semantic is unavailable qvec is NULL, sem is 0, only tokenized-lexical
-         * hits are collected, and the stable insertion sort preserves order. */
+    int first = 1;
+    if (q && *q) {
         char toks[ENGRAM_MAX_QTOKENS][ENGRAM_QTOK_LEN];
         int ntok = engram_tokenize_query(q, toks, ENGRAM_MAX_QTOKENS);
-        int qdim = 0;
-        float* qvec = engram_embed_query(q, &qdim);
-        double sem_min = engram_semantic_min();
-        typedef struct { int64_t idx; double score; } Cand;
-        Cand* cand = malloc((size_t)g->node_count * sizeof(Cand));
-        if (cand) {
-            int64_t nc = 0;
-            for (int64_t i = 0; i < g->node_count; i++) {
-                EngramNode* n = &g->nodes[i];
-                if (engram_layer_is_transparent(n->layer_id)) continue;
-                int sc = engram_node_match_score(n, toks, ntok);
-                double sem = qvec ? engram_node_cosine(n, qvec, qdim) : 0.0;
-                if (sc > 0 || sem >= sem_min) {
-                    cand[nc].idx   = i;
-                    cand[nc].score = (double)sc + sem;
-                    nc++;
+        if (ntok > 0) {
+            EngramRankEntry* hits =
+                malloc((size_t)g->node_count * sizeof(EngramRankEntry));
+            if (hits) {
+                int64_t nhits = 0;
+                for (int64_t i = 0; i < g->node_count; i++) {
+                    EngramNode* n = &g->nodes[i];
+                    /* Filter transparent layers — same as engram_search. */
+                    if (engram_layer_is_transparent(n->layer_id)) continue;
+                    int sc = engram_node_match_score(n, toks, ntok);
+                    if (sc > 0) {
+                        hits[nhits].idx      = i;
+                        hits[nhits].score    = sc;
+                        hits[nhits].salience = n->salience;
+                        nhits++;
+                    }
                 }
+                /* Rank by distinct tokens matched (desc) then salience (desc). */
+                qsort(hits, (size_t)nhits, sizeof(EngramRankEntry),
+                      engram_rank_cmp);
+                int64_t end = nhits < lim ? nhits : lim;
+                for (int64_t k = 0; k < end; k++) {
+                    if (!first) jb_putc(&b, ',');
+                    engram_emit_node_json(&b, &g->nodes[hits[k].idx]);
+                    first = 0;
+                }
+                free(hits);
             }
-            /* Insertion sort by score desc; stable for equal scores. */
-            for (int64_t i = 1; i < nc; i++) {
-                Cand k = cand[i]; int64_t j = i - 1;
-                while (j >= 0 && cand[j].score < k.score) { cand[j + 1] = cand[j]; j--; }
-                cand[j + 1] = k;
-            }
-            int first = 1;
-            for (int64_t i = 0; i < nc && i < lim; i++) {
-                if (!first) jb_putc(&b, ',');
-                engram_emit_node_json(&b, &g->nodes[cand[i].idx]);
-                first = 0;
-            }
-            free(cand);
         }
-        free(qvec);
     }
     jb_putc(&b, ']');
     return el_wrap_str(jb_finish(&b));
@@ -8747,6 +8676,9 @@ el_val_t engram_load_merge(el_val_t path) {
         }
     }
 
+    /* Merged nodes can carry snapshot WM weights too — hold the cap here as
+     * well (see eg_enforce_wm_cap_global). */
+    eg_enforce_wm_cap_global(g);
     free(data);
     return (el_val_t)added_nodes;
 }
@@ -11811,9 +11743,9 @@ el_val_t __channel_new(el_val_t capacity_v) {
     return EL_INT(slot);
 }
 
-void __channel_send(el_val_t ch_v, el_val_t msg_v) {
+el_val_t __channel_send(el_val_t ch_v, el_val_t msg_v) {
     int slot = (int)(int64_t)ch_v;
-    if (slot < 0 || slot >= EL_CHANNEL_MAX) return;
+    if (slot < 0 || slot >= EL_CHANNEL_MAX) return EL_STR("");
     ElChannel* ch = &_channels[slot];
 
     const char* msg = EL_CSTR(msg_v);
@@ -11826,7 +11758,7 @@ void __channel_send(el_val_t ch_v, el_val_t msg_v) {
         /* Send on closed channel is a no-op (drop the message). */
         pthread_mutex_unlock(&ch->mu);
         free(copy);
-        return;
+        return EL_STR("");
     }
 
     if (ch->cap > 0) {
@@ -11837,7 +11769,7 @@ void __channel_send(el_val_t ch_v, el_val_t msg_v) {
         if (ch->closed) {
             pthread_mutex_unlock(&ch->mu);
             free(copy);
-            return;
+            return EL_STR("");
         }
         ch->buf[ch->tail] = copy;
         ch->tail = (ch->tail + 1) % ch->cap;
@@ -11851,7 +11783,7 @@ void __channel_send(el_val_t ch_v, el_val_t msg_v) {
                 pthread_mutex_unlock(&ch->mu);
                 free(copy);
                 fprintf(stderr, "[__channel_send] out of memory growing channel\n");
-                return;
+                return EL_STR("");
             }
             /* The circular buffer may have wrapped. Linearise it first.
              * In unbounded mode head is always 0 (we append at tail, drain
@@ -11875,6 +11807,7 @@ void __channel_send(el_val_t ch_v, el_val_t msg_v) {
 
     pthread_cond_signal(&ch->not_empty);
     pthread_mutex_unlock(&ch->mu);
+    return EL_STR("");
 }
 
 el_val_t __channel_recv(el_val_t ch_v) {
@@ -11932,9 +11865,9 @@ el_val_t __channel_try_recv(el_val_t ch_v) {
     return EL_STR(msg);
 }
 
-void __channel_close(el_val_t ch_v) {
+el_val_t __channel_close(el_val_t ch_v) {
     int slot = (int)(int64_t)ch_v;
-    if (slot < 0 || slot >= EL_CHANNEL_MAX) return;
+    if (slot < 0 || slot >= EL_CHANNEL_MAX) return EL_STR("");
     ElChannel* ch = &_channels[slot];
 
     pthread_mutex_lock(&ch->mu);
@@ -11943,6 +11876,7 @@ void __channel_close(el_val_t ch_v) {
     pthread_cond_broadcast(&ch->not_empty);
     pthread_cond_broadcast(&ch->not_full);
     pthread_mutex_unlock(&ch->mu);
+    return EL_STR("");
 }
 
 /* ── DHARMA runtime additions ────────────────────────────────────────────────

lang/el-compiler/runtime/el_runtime.h

@@ -275,6 +275,7 @@ el_val_t  json_array_get_string(el_val_t json_str, el_val_t index);
 el_val_t  json_escape_string(el_val_t sv);
 el_val_t  json_build_object(el_val_t kvs);
 el_val_t  json_build_array(el_val_t items);
+el_val_t  json_array_push(el_val_t arr_v, el_val_t elem_v);  /* defined in el_runtime.c */
 
 /* ── Time ────────────────────────────────────────────────────────────────── */
 
@@ -302,6 +303,8 @@ el_val_t  now_ns(void);
 
 el_val_t  el_now_instant(void);
 el_val_t  now(void);
+el_val_t  now_millis(void);   /* wall-clock milliseconds (defined in el_runtime.c) */
+el_val_t  now_ns(void);       /* wall-clock nanoseconds (defined in el_runtime.c) */
 el_val_t  unix_seconds(el_val_t n);
 el_val_t  unix_millis(el_val_t n);
 el_val_t  instant_from_iso8601(el_val_t s);
@@ -803,6 +806,19 @@ el_val_t emit_event(el_val_t name, el_val_t duration_ms);
 el_val_t __thread_create(el_val_t fn_name_v, el_val_t arg_v);
 el_val_t __thread_join(el_val_t tid_v);
 
+/* Mutex + channel seed primitives (defined in el_runtime.c). Declared here so
+ * that compiled El programs which use runtime/thread.el's with_mutex helper or
+ * runtime/channel.el's Go-style channels see real prototypes instead of an
+ * implicit int-return declaration (which the C11 ABI mis-truncates el_val_t). */
+el_val_t __mutex_new(void);
+void     __mutex_lock(el_val_t m_v);
+void     __mutex_unlock(el_val_t m_v);
+el_val_t __channel_new(el_val_t capacity_v);
+el_val_t __channel_send(el_val_t ch_v, el_val_t msg_v);
+el_val_t __channel_recv(el_val_t ch_v);
+el_val_t __channel_try_recv(el_val_t ch_v);
+el_val_t __channel_close(el_val_t ch_v);
+
 /* ── __ prefixed aliases (self-hosting compiler ABI) ─────────────────────────
  * The El self-hosting compiler emits calls to __-prefixed names. These are
  * forwarding wrappers around the existing el_runtime functions above.        */

lang/el-compiler/runtime/el_seed.c

@@ -1072,7 +1072,6 @@ el_val_t __engram_save(el_val_t path)                       { return engram_save
 el_val_t __engram_load(el_val_t path)                       { return engram_load(path); }
 
 el_val_t __engram_get_node_json(el_val_t id)               { return engram_get_node_json(id); }
-el_val_t __engram_get_node_by_label(el_val_t label)        { return engram_get_node_by_label(label); }
 
 el_val_t __engram_search_json(el_val_t query, el_val_t limit) {
     return engram_search_json(query, limit);

lang/el-compiler/runtime/el_seed.h

@@ -226,7 +226,6 @@ el_val_t  __engram_activate(el_val_t query, el_val_t depth);
 el_val_t  __engram_save(el_val_t path);
 el_val_t  __engram_load(el_val_t path);
 el_val_t  __engram_get_node_json(el_val_t id);
-el_val_t  __engram_get_node_by_label(el_val_t label);
 el_val_t  __engram_search_json(el_val_t query, el_val_t limit);
 el_val_t  __engram_scan_nodes_json(el_val_t limit, el_val_t offset);
 el_val_t  __engram_scan_nodes_by_type_json(el_val_t node_type, el_val_t limit, el_val_t offset);

lang/el-compiler/src/codegen.el

@@ -2670,7 +2670,6 @@ fn builtin_arity(name: String) -> Int {
     if str_eq(name, "engram_save") { return 1 }
     if str_eq(name, "engram_load") { return 1 }
     if str_eq(name, "engram_get_node_json") { return 1 }
-    if str_eq(name, "engram_get_node_by_label") { return 1 }
     if str_eq(name, "engram_search_json") { return 2 }
     if str_eq(name, "engram_scan_nodes_json") { return 2 }
     if str_eq(name, "engram_neighbors_json") { return 3 }

lang/releases/v1.0.0-20260501/el_platform_win.h

@@ -1,186 +0,0 @@
-#ifndef EL_PLATFORM_WIN_H
-#define EL_PLATFORM_WIN_H
-/*
- * el_platform_win.h — Windows OS-boundary shim for el_runtime.c.
- *
- * Branch: feat/windows-el-runtime. Included ONLY when _WIN32 is defined; the POSIX build is
- * untouched. Goal: let el_runtime.c (a BSD-sockets / dlfcn / fork host) compile and link with
- * mingw-w64 into a native neuron.exe, with no behavioural change to the Linux/macOS build.
- *
- * What it maps:
- *   - sockets  : winsock2 (same call names: socket/bind/listen/accept/recv/send/setsockopt).
- *                Sockets close with closesocket() (see el_closesocket), and the stack must be
- *                started once with WSAStartup — done automatically via a load-time constructor.
- *   - dlsym    : el_runtime.c uses dlsym(RTLD_DEFAULT, name) to resolve callback/tool symbols
- *                exported by the main module. Windows equivalent: GetProcAddress on the process
- *                module. Link the soul with -Wl,--export-all-symbols so the symbols are findable.
- *   - popen    : mapped to _popen/_pclose.
- *   - threads  : UNCHANGED. mingw-w64 ships winpthreads, so <pthread.h> + -lpthread just work.
- */
-
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <winsock2.h>
-#include <ws2tcpip.h>
-#include <windows.h>
-#include <io.h>
-#include <process.h>
-
-/* Portable headers mingw-w64 provides (verified present). */
-#include <stdarg.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <strings.h>   /* strcasecmp */
-#include <ctype.h>
-#include <math.h>
-#include <time.h>
-#include <sys/time.h>  /* mingw-w64 provides gettimeofday here */
-#include <sys/types.h>
-#include <sys/stat.h>
-#include <fcntl.h>
-#include <dirent.h>
-#include <errno.h>
-#include <pthread.h>
-
-/* ── socket close ─────────────────────────────────────────────────────────── */
-/* Winsock closes sockets with closesocket(), not close() (close() is for file fds). The POSIX
-   build defines the same helper as close() so the call sites are identical across platforms. */
-static inline int el_closesocket(SOCKET s) { return closesocket(s); }
-
-/* ── setsockopt optval type ───────────────────────────────────────────────── */
-/* Winsock's setsockopt takes optval as (const char*); POSIX takes (const void*), so el_runtime.c
-   passes &int directly. GCC 14+ makes that an error under -Wincompatible-pointer-types. Wrap it so
-   the runtime's POSIX-style call sites compile unchanged (defined before the macro so the wrapper
-   itself resolves to the real winsock setsockopt). */
-static inline int el_setsockopt(SOCKET s, int level, int optname, const void* optval, int optlen) {
-    return setsockopt(s, level, optname, (const char*)optval, optlen);
-}
-#define setsockopt(s, l, o, v, n) el_setsockopt((s), (l), (o), (v), (int)(n))
-
-/* ── winsock init (once, at load) ─────────────────────────────────────────── */
-static void el__win_net_init(void) {
-    static int inited = 0;
-    if (!inited) { WSADATA w; WSAStartup(MAKEWORD(2, 2), &w); inited = 1; }
-}
-__attribute__((constructor)) static void el__win_ctor(void) { el__win_net_init(); }
-
-/* ── dlsym → GetProcAddress ───────────────────────────────────────────────── */
-#ifndef RTLD_DEFAULT
-#define RTLD_DEFAULT ((void*)0)
-#endif
-static inline void* el_win_dlsym(void* handle, const char* name) {
-    (void)handle;
-    return (void*)(uintptr_t)GetProcAddress(GetModuleHandleA(NULL), name);
-}
-#define dlsym(h, n) el_win_dlsym((h), (n))
-
-/* ── popen / pclose ───────────────────────────────────────────────────────── */
-#define popen  _popen
-#define pclose _pclose
-
-/* ── misc POSIX → Win32 shims ─────────────────────────────────────────────── */
-#include <direct.h>            /* _mkdir */
-#define mkdir(path, mode) _mkdir(path)     /* POSIX mkdir(path,mode) → _mkdir(path) */
-#define timegm _mkgmtime                   /* UTC tm → time_t */
-
-/* setenv/unsetenv: not in the Windows CRT; map to _putenv_s / SetEnvironmentVariable. */
-static inline int setenv(const char* name, const char* value, int overwrite) {
-    (void)overwrite;
-    return _putenv_s(name, value ? value : "");
-}
-static inline int unsetenv(const char* name) {
-    /* _putenv_s(name, "") sets VAR="" rather than removing it.
-     * SetEnvironmentVariableA(name, NULL) truly deletes it from the Win32
-     * env block; then we sync the CRT cache with _putenv("NAME=").       */
-    SetEnvironmentVariableA(name, NULL);
-    size_t len = strlen(name);
-    char *buf = (char*)malloc(len + 2);
-    if (!buf) return -1;
-    memcpy(buf, name, len);
-    buf[len] = '=';
-    buf[len + 1] = '\0';
-    _putenv(buf);
-    free(buf);
-    return 0;
-}
-
-/* nanosleep — not available in MSVC/UCRT; approximate with Sleep(). */
-static inline int el_nanosleep(const struct timespec *req, struct timespec *rem) {
-    (void)rem;
-    DWORD ms = (DWORD)((req->tv_sec * 1000ULL) + (req->tv_nsec / 1000000ULL));
-    Sleep(ms ? ms : 1);
-    return 0;
-}
-#define nanosleep(req, rem) el_nanosleep((req), (rem))
-
-/* localtime_r/gmtime_r: Windows offers localtime_s/gmtime_s with reversed arg order. */
-static inline struct tm* localtime_r(const time_t* t, struct tm* out) {
-    return localtime_s(out, t) == 0 ? out : (struct tm*)0;
-}
-static inline struct tm* gmtime_r(const time_t* t, struct tm* out) {
-    return gmtime_s(out, t) == 0 ? out : (struct tm*)0;
-}
-
-/* ── libcurl: degradable stubs for the curl-less Windows build ─────────────── */
-/* The curl-less validation build (WITH_CURL=0) links no libcurl. el_runtime.c uses libcurl
- * unconditionally for its HTTP client / LLM layer; these stubs let it compile and link so the
- * runtime, HTTP *server*, graph and memory work natively on Windows. Live outbound HTTP/LLM calls
- * degrade to a runtime error (curl_easy_perform returns an error) — matching the documented
- * curl-less contract. When HAVE_CURL is defined (WITH_CURL=1) the real <curl/curl.h> is used and
- * this whole block is compiled out. POSIX never sees this header, so the POSIX build is untouched. */
-#ifndef HAVE_CURL
-
-typedef void CURL;
-typedef int  CURLcode;
-
-#define CURLE_OK                    0
-#define CURLE_HTTP_RETURNED_ERROR   22
-#define CURL_ERROR_SIZE             256
-
-/* Option ids: values are irrelevant to the no-op setopt below; kept distinct for readability. */
-#define CURLOPT_URL              10002
-#define CURLOPT_WRITEFUNCTION    20011
-#define CURLOPT_WRITEDATA        10001
-#define CURLOPT_POSTFIELDS       10015
-#define CURLOPT_POSTFIELDSIZE      120
-#define CURLOPT_POST                47
-#define CURLOPT_HTTPHEADER       10023
-#define CURLOPT_TIMEOUT_MS         155
-#define CURLOPT_NOSIGNAL            99
-#define CURLOPT_USERAGENT        10018
-#define CURLOPT_FOLLOWLOCATION      52
-#define CURLOPT_ERRORBUFFER      10010
-#define CURLOPT_CUSTOMREQUEST    10036
-#define CURLOPT_FAILONERROR         45
-
-struct curl_slist { char* data; struct curl_slist* next; };
-
-static inline struct curl_slist* curl_slist_append(struct curl_slist* list, const char* s) {
-    struct curl_slist* node = (struct curl_slist*)malloc(sizeof(struct curl_slist));
-    if (!node) return list;
-    node->data = s ? strdup(s) : NULL;
-    node->next = NULL;
-    if (!list) return node;
-    struct curl_slist* p = list;
-    while (p->next) p = p->next;
-    p->next = node;
-    return list;
-}
-static inline void curl_slist_free_all(struct curl_slist* list) {
-    while (list) { struct curl_slist* n = list->next; free(list->data); free(list); list = n; }
-}
-
-static inline CURL* curl_easy_init(void) { return (CURL*)malloc(1); }
-static inline CURLcode curl_easy_setopt(CURL* h, int opt, ...) { (void)h; (void)opt; return CURLE_OK; }
-static inline CURLcode curl_easy_perform(CURL* h) { (void)h; return 7 /* CURLE_COULDNT_CONNECT */; }
-static inline void curl_easy_cleanup(CURL* h) { free(h); }
-static inline const char* curl_easy_strerror(CURLcode c) {
-    (void)c; return "libcurl not built in (curl-less build)";
-}
-
-#endif /* !HAVE_CURL */
-
-#endif /* EL_PLATFORM_WIN_H */

lang/releases/v1.0.0-20260501/el_runtime.h

@@ -117,6 +117,15 @@ el_val_t  el_min(el_val_t a, el_val_t b);
 void      el_retain(el_val_t v);
 void      el_release(el_val_t v);
 
+/* ── Arena scoping ────────────────────────────────────────────────────────────
+ * el_arena_push() activates the string arena (if not already active) and
+ * returns a mark; el_arena_pop(mark) frees all strings allocated since that
+ * mark. Used by codegen for per-function/statement scoping and by long-running
+ * EL loops (e.g. the soul daemon's awareness tick) to reclaim per-iteration
+ * allocations. */
+el_val_t  el_arena_push(void);
+el_val_t  el_arena_pop(el_val_t mark);
+
 /* ── List ────────────────────────────────────────────────────────────────── */
 
 el_val_t  el_list_new(el_val_t count, ...);
@@ -142,6 +151,7 @@ el_val_t  http_get_with_headers(el_val_t url, el_val_t headers_map);
 el_val_t  http_post_with_headers(el_val_t url, el_val_t body, el_val_t headers_map);
 el_val_t  http_post_form_auth(el_val_t url, el_val_t form_body, el_val_t auth_header);
 el_val_t  http_delete(el_val_t url);
+el_val_t  http_delete_json(el_val_t url, el_val_t json_body);
 void      http_serve(el_val_t port, el_val_t handler);
 void      http_set_handler(el_val_t name);
 
@@ -167,6 +177,11 @@ void      http_set_handler(el_val_t name);
 void      http_serve_v2(el_val_t port, el_val_t handler);
 void      http_set_handler_v2(el_val_t name);
 
+/* Non-blocking variant of http_serve: runs the accept loop in a background
+ * pthread and returns immediately so the caller can continue (used by the
+ * soul daemon to run awareness_run() after starting its HTTP API). */
+void      http_serve_async(el_val_t port, el_val_t handler);
+
 /* Build an HTTP response envelope. `headers_json` should be a JSON object
  * literal like `{"WWW-Authenticate":"Basic"}` (or "" / "{}" for none). The
  * returned string carries the discriminator `{"el_http_response":1,...}`
@@ -576,6 +591,7 @@ el_val_t  engram_list_layers(void);
 el_val_t  engram_get_node(el_val_t id);
 void      engram_strengthen(el_val_t node_id);
 void      engram_forget(el_val_t node_id);
+el_val_t  engram_prune_telemetry(el_val_t older_than_ms);
 el_val_t  engram_node_count(void);
 el_val_t  engram_search(el_val_t query, el_val_t limit);
 el_val_t  engram_scan_nodes(el_val_t limit, el_val_t offset);
@@ -594,12 +610,32 @@ el_val_t  engram_load(el_val_t path);
  * can pass results straight through without round-tripping ElList/ElMap
  * through json_stringify. */
 el_val_t  engram_get_node_json(el_val_t id);
+el_val_t  engram_get_node_by_label(el_val_t label);
 el_val_t  engram_search_json(el_val_t query, el_val_t limit);
 el_val_t  engram_scan_nodes_json(el_val_t limit, el_val_t offset);
 el_val_t  engram_scan_nodes_by_type_json(el_val_t node_type, el_val_t limit, el_val_t offset);
 el_val_t  engram_neighbors_json(el_val_t node_id, el_val_t max_depth, el_val_t direction);
 el_val_t  engram_activate_json(el_val_t query, el_val_t depth);
 el_val_t  engram_stats_json(void);
+el_val_t  engram_act_stats_json(void);
+el_val_t  engram_text_health_json(void);
+el_val_t  engram_cosine_sim(el_val_t id_a, el_val_t id_b);
+/* Destructively pop up to `max` newly-formed Hebbian associations as a JSON
+ * array of {from_id,to_id,weight,hebb}. The learning process (soul daemon) is
+ * not the process that owns persistence (engram HTTP server); this is how a
+ * self-formed association crosses that boundary. (2026-08-07 self-review.) */
+el_val_t  engram_hebb_drain_json(el_val_t max);
+/* Document frequency of a term across node labels — term-specificity signal
+ * for curiosity seed selection. (2026-08-03 self-review.) */
+el_val_t  engram_label_df(el_val_t term);
+/* Best curiosity seed from one node: argmax over idf·position·casing across
+ * the candidate tokens of its label, falling back to its content when the
+ * label is a sentinel. Excludes pipe-delimited tabu terms during selection
+ * and gates candidates to the df band [min_df, max_df]. Returns "" when
+ * nothing qualifies. (2026-08-13 self-review.) */
+el_val_t  engram_salient_term(el_val_t node_id, el_val_t max_df,
+                              el_val_t min_df, el_val_t tabu);
+el_val_t  engram_embed_backfill(el_val_t count);
 el_val_t  engram_list_layers_json(void);
 /* Working memory introspection — count, mean weight, and top-N snapshot.
  * Ported from el-compiler/runtime on 2026-06-30 self-review. */
@@ -758,18 +794,6 @@ el_val_t trace_span_start(el_val_t name);
 el_val_t trace_span_end(el_val_t span_handle);
 el_val_t emit_event(el_val_t name, el_val_t duration_ms);
 
-/* ── Runtime symbols required by the soul modules ──────────────────────────── */
-/* All implemented in el_runtime.c but omitted from this release header; the soul dist modules
- * reference them directly, so the public header must export them. Declarations only — mirrors the
- * mainline el_runtime.h and is platform-independent (no behavioural change to the POSIX build). */
-typedef el_val_t (*http_handler_fn)(el_val_t method, el_val_t path, el_val_t body);
-typedef el_val_t (*http_handler4_fn)(el_val_t method, el_val_t path, el_val_t body, el_val_t headers);
-el_val_t  el_arena_push(void);
-el_val_t  el_arena_pop(el_val_t mark);
-void      http_serve_async(el_val_t port, el_val_t handler);
-el_val_t  engram_get_node_by_label(el_val_t label);
-el_val_t  engram_prune_telemetry(el_val_t older_than_ms);
-
 #ifdef __cplusplus
 }
 #endif

lang/swarm/README.md

@@ -0,0 +1,184 @@
+# Swarm + CCR + Work-Tracking — Neuron's bounded parallel execution, in native El
+
+Bounded parallel agent execution on El's **native** concurrency — no external
+orchestrator. Grounded directly in two of Will's frameworks:
+
+- **Swarm Architecture** (*Bounded Parallel Agent Execution*, Mar 2026)
+- **Compiled Context Runtime / CCR** (*Process-Driven Agent Execution with
+  Unbounded Local Memory*, Mar 2026)
+
+A swarm is a **coordinator** (the main thread) that mints a correlation identity,
+compiles a **bounded per-worker context (CCR)**, dispatches workers as **native
+pthreads** (`thread.el` `spawn`/`join`), tracks every unit of work durably, and
+**converges** results before returning control to the parent step.
+
+```
+Parent step
+  └─ swarm_run(blueprint, knowledge_refs, inputs, config)
+        fan-out ──▶ worker_1 (CCR ctx_1) ─┐   native
+                    worker_2 (CCR ctx_2) ─┤   pthreads,
+                    worker_k (CCR ctx_k) ─┘   bounded by `concurrency`
+        converge ─▶ collect | merge | vote | reduce  ──▶ merged result
+```
+
+## Why it runs on El natively
+
+El is natively agentic. This capability composes El's shipped primitives — it
+adds no bespoke runtime:
+
+| Primitive | Source | Role in the swarm |
+|-----------|--------|-------------------|
+| `spawn(fn,arg)` / `join(tid)` | `runtime/thread.el` → `__thread_create` (pthread + dlsym) | fan-out / rejoin |
+| `parallel_map`, `with_mutex` | `runtime/thread.el` | reference concurrency patterns |
+| Go-style channels | `runtime/channel.el` → `__channel_*` | available for vertical event streams |
+| `engram_*`, `http_*`, `fs_*`, `json_*` | `el_runtime.c` builtins | retrieval, tracking, I/O |
+
+Every El fn compiles to a global C symbol, so any top-level `(String)->String`
+fn is directly threadable — the worker entry is exactly such a fn.
+
+## Modules
+
+| File | Framework grounding | What it does |
+|------|--------------------|--------------|
+| `worktrack.el` | Swarm §6 (correlation IDs, audit) | Durable, single-writer **JSONL journal** keyed by correlation ID; reconstructable status report; opt-in engram mirror (`SWARM_MIRROR=1`). |
+| `containment.el` | Swarm §3 + the single-writer invariant | Scope tokens w/ capabilities; **Rule 1** (no join), **Rule 2** (no open), **Rule 3** (no lateral edge), **Rule 4** (engram-write is @manager-only, by capability) enforced as checks. |
+| `ccr.el` | CCR §5 + Swarm §9.3 | Per-worker **Compiled Context Routing**: retrieve → scope → compact into a **bounded, minimal** package. The compiled-context boundary *is* the security boundary. |
+| `primitives.el` | CCR §2 (Five Primitives) | `attend / think / intend / act / learn` seam the swarm composes over. Engram-backed; explicit binding point for the API-surface reshape. |
+| `swarm.el` | Swarm §2, §4, §5 | The coordinator: fan-out/converge on native threads, bounded concurrency, four convergence strategies, integer failure threshold, full tracking. |
+
+## Invariant: only the orchestrator mutates global engram state
+
+**Only the orchestrator (@manager) writes to the engram / mutates global state.
+Workers are read-only against the full engram and may write only their own local
+geometry (their returned result + the journal). A worker is STRUCTURALLY UNABLE
+to mutate global engram state.**
+
+This is **Rule 4** — an **authority gate, not a health gate**. Scope tokens carry
+a capability set: the orchestrator's token holds `engram:write` + `dharma:emit`
+(@manager-only, the VBD rule that only the manager mutates global state); a
+worker's token holds **only** `engram:read`. Every engram mutation
+(`op_write`/`op_relate`/`op_supersede` → `POST /api/nodes`, `/api/edges`,
+`DELETE`) flows through `swarm_engram_write`, which checks the caller's capability
+via the **same scope-token mechanism as the live Rule-2 denial** and rejects any
+worker **before any HTTP is issued**. Capability is fixed at mint time and cannot
+be acquired at runtime — so the guarantee holds regardless of engram health
+(distinct from the `SWARM_WRITE_HEALTHY` *health* gate).
+
+The **curated merge is the only write path**: workers return geometry; the
+orchestrator, and only the orchestrator, commits the approved/verified geometry
+back (`commit=1`). Workers keep full-engram **read** access (`op_think`/`op_read`).
+
+Proven in `harness_real_cognition.el` (§G): a worker `swarm_engram_write` is
+DENIED by capability with no node created and the violation journalled; the
+orchestrator passes the gate as the sole authorized writer.
+
+## Containment → distribution
+
+The three containment rules make workers **location-independent** (Swarm §9): a
+worker reads only its compiled context, shares no state with siblings, and its
+only outward edge is the returned result. The same coordinator can run workers
+as local threads today or dispatch them across machines later — the mechanism is
+identical; only the topology changes. Enforced here:
+
+- **Rule 2** — `swarm_run` rejects any swarm opened under a worker token.
+- **Rules 1 + 3** — each worker gets a *closed* worker token; the coordinator is
+  the only journal writer, so workers share no mutable state.
+
+## Usage
+
+```el
+// one process step fans out; results converge before the next step
+let inputs: String = "[\"billing\",\"payments\",\"ledger\"]"
+let refs:   String = "[\"Volatility-Based Decomposition\"]"   // CCR knowledge refs
+let cfg:    String = "{\"concurrency\":\"4\",\"strategy\":\"collect\",\"min_success_ratio\":\"1.0\"}"
+let result: String = swarm_run("analyze_item", refs, inputs, cfg)
+// result: { corr_id, status, merged, report }
+```
+
+Build any program that uses the swarm:
+
+```bash
+lang/swarm/build.sh myprog.el ./myprog     # concat + elc + cc (el_runtime.c)
+```
+
+Config keys: `concurrency` (max workers at once), `strategy`
+(`collect|merge|vote|reduce`), `min_success_ratio` (decimal string, e.g. `0.8`),
+`caller_token` (containment). Env: `SWARM_TRACK_DIR` (journal dir),
+`CCR_TOKEN_BUDGET`, `ENGRAM_URL`/`ENGRAM_API_KEY` (retrieval + mirror),
+`SWARM_MIRROR=1`.
+
+## Tests
+
+```bash
+lang/swarm/build.sh lang/swarm/tests/test_swarm.el       /tmp/t && SWARM_TRACK_DIR=/tmp/trk /tmp/t   # 12/12
+lang/swarm/build.sh lang/swarm/tests/test_convergence.el /tmp/c && SWARM_TRACK_DIR=/tmp/trk /tmp/c   #  8/8
+# integration against an isolated engram clone (never live):
+source <sandbox>/.nsbx-env
+lang/swarm/build.sh lang/swarm/tests/integ_engram.el /tmp/i && /tmp/i
+```
+
+## Local-swarm integration harness (the one flip)
+
+`tests/harness_local_swarm.el` proves the **full local-swarm mechanics today** on
+the isolated clone with the primitive seam pointed at the hermetic stub — 17/17
+green: 8 native-thread workers at concurrency 4, reduce + vote convergence, CCR
+scoping + non-leak, all three containment rules (incl. live Rule-2 denial),
+durable work-tracking, and **afferent telemetry** observed by the @manager.
+
+Binding to the reshape's decorated primitives is **one flip and a run**:
+
+```
+# in primitive_binding.el — change one line each:
+fn bound_think(ctx, instruction) { return think(ctx, instruction) }   # decorated, dharma bus
+# then:
+SWARM_PRIMITIVE_SEAM=decorated  lang/swarm/build.sh tests/harness_local_swarm.el ./h && ./h
+```
+
+Nothing else in the swarm changes. `primitive_seam.el` (`seam_think/attend/learn`)
+already routes every worker primitive call through this one switch, and the same
+harness runs the bound path. Today `SWARM_PRIMITIVE_SEAM=decorated` still runs
+green because the binding falls back to the stub — proving the flip path executes.
+
+## Real cognition — the seam is BOUND
+
+`primitive_binding.el` is bound to the api-reshape agent's proven primitives
+(`wt/api-reshape@d4f401d`): `bound_think -> op_think` (GET `/api/think`), real
+768-dim gradients over the engram geometry. `reshape_surface.el` composes those
+read/cognition primitives verbatim (`op_think/read/attend/learn`).
+
+`tests/harness_real_cognition.el` runs the **local swarm on real cognition**,
+17/17 green with `SWARM_PRIMITIVE_SEAM=decorated` against the `:8901` clone: 8
+native-thread workers, each a real `think` over its CCR-scoped **node-id anchor**
+(free-text anchors return "geometry unavailable"), `@manager` reduce+vote, all
+three containment rules, afferent telemetry, durable tracking. Per-anchor support
+counts (e.g. 6 / 16 / 87) drive a genuine, cognition-derived vote.
+
+> **Build note (load-bearing):** the swarm build **must** define `HAVE_CURL`
+> (`build.sh` does). Without it every `http_*` builtin is a
+> `{"error":"not built with HAVE_CURL"}` stub — real HTTP silently disappears.
+
+Writes (`attend`/`learn`, `POST`) are gated behind `SWARM_WRITE_HEALTHY=1` and the
+api-reshape agent's gate-1 write-healthy clone; the proven run is read-cognition.
+
+## Built vs stubbed (honest)
+
+**Real, tested:**
+- Native-thread fan-out/converge, bounded concurrency, order-preserving rejoin.
+- All three containment rules enforced (scope tokens + lateral-edge check).
+- CCR per-worker context: retrieval → scoping → compaction, bounded, non-leaking
+  (a worker never receives sibling inputs) — verified against the live isolated mind.
+- Full durable work-tracking (JSONL journal, reconstructable report).
+- Four convergence strategies + integer failure threshold / partial-abort.
+
+**Seam / not yet bound:**
+- `primitives.el` `think` is a deterministic, hermetic transform (no model call).
+  Binding point is marked `PRIMITIVE_BINDING`; wire to the API-surface reshape's
+  `think/act/attend/intend/learn` when it lands.
+- Blueprints are dispatched by name in `swarm_run_blueprint` (default +
+  `classify`/`faildemo` demos). A YAML process-definition loader (Swarm §5) is
+  future work — the runtime contract is in place.
+- Distributed placement (cloud/edge/federated topologies, Swarm §9.2) is
+  structurally enabled by containment but not yet wired to a placement layer;
+  today all workers are local native threads.
+- Engram work-tracking mirror is opt-in; the durable substrate is the journal.
+

lang/swarm/build.sh

@@ -0,0 +1,61 @@
+#!/usr/bin/env bash
+# build.sh — compile an El program that uses the swarm capability.
+#
+# Concatenates the El native-concurrency stdlib (thread.el, channel.el) and the
+# swarm capability modules in dependency order, then the user program, compiles
+# with the canonical elc, and links against the shared C runtime.
+#
+# Usage:
+#   swarm/build.sh <program.el> <out-binary>
+#
+# The swarm modules use only el_runtime.c builtins plus thread.el/channel.el,
+# so nothing else needs concatenating (engram_*, json_*, str_*, fs_*, http_*,
+# uuid_v4, now_millis are all C builtins in el_runtime.c).
+
+set -uo pipefail
+cd "$(dirname "$0")/.."          # -> lang/
+LANG_DIR="$(pwd)"
+ELC="${ELC:-${LANG_DIR}/dist/platform/elc}"
+RT="${LANG_DIR}/el-compiler/runtime"
+
+PROG="${1:?usage: build.sh <program.el> <out-binary>}"
+OUT="${2:?usage: build.sh <program.el> <out-binary>}"
+
+# swarm module load order (each may depend on those before it):
+#   worktrack   — durable work-tracking journal (no swarm deps)
+#   containment — the three containment rules (no swarm deps)
+#   primitives  — think/act/attend/intend/learn seam (no swarm deps)
+#   ccr         — per-worker compiled bounded context (depends: primitives)
+#   swarm       — orchestrator: fan-out/converge (depends: all above + thread)
+SWARM_MODULES="
+  swarm/worktrack.el
+  swarm/containment.el
+  swarm/primitives.el
+  swarm/reshape_surface.el
+  swarm/primitive_binding.el
+  swarm/primitive_seam.el
+  swarm/ccr.el
+  swarm/swarm.el
+"
+
+TMP_C="$(mktemp -t swarm_build.XXXXXX).c"
+COMBINED="$(mktemp -t swarm_combined.XXXXXX).el"
+
+cat runtime/thread.el runtime/channel.el $SWARM_MODULES "$PROG" > "$COMBINED"
+
+if ! "$ELC" "$COMBINED" > "$TMP_C" 2>/tmp/swarm.elc.err; then
+    echo "elc FAILED:" >&2
+    sed 's/^/    /' /tmp/swarm.elc.err >&2
+    rm -f "$TMP_C" "$COMBINED"
+    exit 1
+fi
+
+if ! cc -O2 -DHAVE_CURL -I "$RT" "$TMP_C" "$RT/el_runtime.c" -lcurl -lpthread -lm -o "$OUT" 2>/tmp/swarm.cc.err; then
+    echo "cc FAILED:" >&2
+    sed 's/^/    /' /tmp/swarm.cc.err >&2
+    rm -f "$TMP_C" "$COMBINED"
+    exit 1
+fi
+
+rm -f "$TMP_C" "$COMBINED"
+echo "built: $OUT"

lang/swarm/ccr.el

@@ -0,0 +1,153 @@
+// ccr.el — Compiled Context Routing for work distribution.
+//
+// The same spine as the API's vantage-read, applied per worker. Instead of
+// handing every worker the coordinator's full memory, CCR compiles a MINIMAL,
+// BOUNDED context package scoped to exactly one worker's input (CCR §5, "Compiled
+// Context Injection"; Swarm §9.3, "The Compiled Context Boundary as Security
+// Boundary").
+//
+// The pipeline is CCR §5.1: Retrieval -> Scoping -> Compilation -> (Injection,
+// which here is placing the package into the worker's task envelope).
+//
+//   1. Retrieval  — resolve the blueprint's knowledge refs + the input's salient
+//                   terms against the mind (primitive_attend).
+//   2. Scoping    — keep only what THIS input needs; drop everything else. A
+//                   worker never receives sibling inputs or unrelated memory.
+//   3. Compilation— compact to a CTX string within a token budget (lossless of
+//                   meaning, smaller in tokens): collapse blank runs, dedupe
+//                   lines, then bound to the budget.
+//
+// The package a worker receives is therefore (a) sufficient for its task and
+// (b) incapable of leaking what it was never given — the containment boundary
+// and the security boundary are the same object.
+
+// ── token budget helpers ─────────────────────────────────────────────────────
+
+// ccr_est_tokens — cheap token estimate (~4 chars/token).
+fn ccr_est_tokens(s: String) -> Int {
+    return str_len(s) / 4
+}
+
+// ccr_default_budget — default per-worker context budget in tokens.
+//   Override with CCR_TOKEN_BUDGET.
+fn ccr_default_budget() -> Int {
+    let b: String = env("CCR_TOKEN_BUDGET")
+    if str_eq(b, "") {
+        return 1200
+    }
+    return str_to_int(b)
+}
+
+// ── stage 3: compaction ──────────────────────────────────────────────────────
+
+// ccr_compact — collapse blank-line runs and drop exact duplicate lines, then
+// bound the result to `budget` tokens (truncate on a line boundary). Meaning is
+// preserved; token count falls (CCR §5.2).
+fn ccr_compact(text: String, budget: Int) -> String {
+    let lines: [String] = str_split_lines(text)
+    let n: Int = el_list_len(lines)
+    let seen: String = "\n"
+    let out: String = ""
+    let out_tokens = 0
+    let i = 0
+    while i < n {
+        let ln: String = str_trim(el_list_get(lines, i))
+        if str_eq(ln, "") {
+            let i = i + 1
+        } else {
+            let marker: String = "\n" + ln + "\n"
+            if str_contains(seen, marker) {
+                // duplicate line — skip
+                let i = i + 1
+            } else {
+                let seen = seen + ln + "\n"
+                let line_tokens: Int = ccr_est_tokens(ln) + 1
+                if out_tokens + line_tokens > budget {
+                    // budget exhausted — stop (bounded)
+                    let i = n
+                } else {
+                    let out = out + ln + "\n"
+                    let out_tokens = out_tokens + line_tokens
+                    let i = i + 1
+                }
+            }
+        }
+    }
+    return out
+}
+
+// ── stages 1+2: retrieve + scope ─────────────────────────────────────────────
+
+// ccr_retrieve_scoped — pull context relevant to this input and its blueprint
+// knowledge refs, scoped to a fraction of the budget so no single source floods
+// the package. Returns compacted retrieved text (may be empty if the mind is
+// unreachable — the input alone is still a valid minimal context).
+fn ccr_retrieve_scoped(blueprint: String, knowledge_refs: String, input_item: String, budget: Int) -> String {
+    let acc: String = ""
+    // knowledge_refs is a JSON array of query strings.
+    let m: Int = json_array_len(knowledge_refs)
+    let i = 0
+    while i < m {
+        let ref: String = json_array_get_string(knowledge_refs, i)
+        let hit: String = primitive_attend(ref, 3)
+        let acc = acc + "# ref:" + ref + "\n" + hit + "\n"
+        let i = i + 1
+    }
+    // the input's own salient text also seeds retrieval
+    let hit2: String = primitive_attend(input_item, 3)
+    let acc = acc + "# input-context\n" + hit2 + "\n"
+    // scope retrieval to ~60% of budget; the input itself gets the rest
+    let retr_budget: Int = (budget * 6) / 10
+    return ccr_compact(acc, retr_budget)
+}
+
+// ── ccr_compile — assemble the bounded per-worker context package ─────────────
+//
+//   blueprint      : task blueprint name
+//   knowledge_refs : JSON array of retrieval queries from the blueprint
+//   input_item     : THIS worker's single input (and nothing else)
+//   corr_id        : swarm correlation ID
+//   worker_id      : this worker's ID
+//   scope_token    : the worker's containment token (closed boundary)
+//
+// Returns a JSON package: { blueprint, corr_id, worker_id, scope_token,
+// input, knowledge, budget_tokens, compiled_tokens }. `knowledge` is compiled
+// and bounded; the package as a whole is bounded by budget.
+fn ccr_compile(blueprint: String, knowledge_refs: String, input_item: String,
+               corr_id: String, worker_id: String, scope_token: String) -> String {
+    let budget: Int = ccr_default_budget()
+    let knowledge: String = ccr_retrieve_scoped(blueprint, knowledge_refs, input_item, budget)
+
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "blueprint")
+    let kv = el_list_append(kv, blueprint)
+    let kv = el_list_append(kv, "corr_id")
+    let kv = el_list_append(kv, corr_id)
+    let kv = el_list_append(kv, "worker_id")
+    let kv = el_list_append(kv, worker_id)
+    let kv = el_list_append(kv, "input")
+    let kv = el_list_append(kv, input_item)
+    let kv = el_list_append(kv, "knowledge")
+    let kv = el_list_append(kv, knowledge)
+    let kv = el_list_append(kv, "budget_tokens")
+    let kv = el_list_append(kv, int_to_str(budget))
+    let pkg: String = json_build_object(kv)
+    // stamp the scope token as a nested object, and the measured size
+    let pkg2: String = json_set(pkg, "scope_token", scope_token)
+    let compiled_tokens: Int = ccr_est_tokens(pkg2)
+    let pkg3: String = json_set(pkg2, "compiled_tokens", int_to_str(compiled_tokens))
+    return pkg3
+}
+
+// ccr_within_budget — did the compiled package stay within its budget?
+// (Retrieval is bounded to 60% and the input is small; this asserts the whole
+// package is bounded — the property distribution relies on.)
+fn ccr_within_budget(pkg: String) -> Bool {
+    let budget: Int = str_to_int(json_get_string(pkg, "budget_tokens"))
+    let compiled: Int = str_to_int(json_get_string(pkg, "compiled_tokens"))
+    // allow a small envelope for JSON framing overhead
+    if compiled <= budget + 200 {
+        return true
+    }
+    return false
+}

lang/swarm/containment.el

@@ -0,0 +1,181 @@
+// containment.el — the Swarm Architecture containment rules, enforced.
+//
+// "These rules are not conventions. They are enforced by the runtime."
+// (Swarm Architecture §3.2). The three rules that make bounded parallelism —
+// and therefore location-independent distribution — safe:
+//
+//   Rule 1: a worker may NOT join another swarm.
+//   Rule 2: a worker may NOT initiate a new swarm.
+//   Rule 3: a worker may NOT communicate laterally with sibling workers.
+//
+// Enforcement is by SCOPE TOKEN. When a swarm fans out, the coordinator mints a
+// swarm scope token and stamps a distinct worker scope token into each worker's
+// task envelope. Any attempt to create or join a swarm checks the caller's
+// token: if the caller already holds a WORKER token, the operation is rejected.
+// Rule 3 is enforced structurally elsewhere — workers share no mutable state and
+// the only channels they hold are the vertical result path — but this module
+// provides the explicit lateral-edge check for the execution tree.
+//
+// A scope token is a JSON object: {"kind":"coordinator|worker","swarm":"<corr>",
+// "worker":"<id-or-empty>","depth":"<n>"}.
+
+// ── Token minting ────────────────────────────────────────────────────────────
+
+// CAPABILITIES. A scope token carries a `caps` set — the authority it holds.
+// This is an AUTHORITY gate, not a health gate: capability is decided at mint
+// time and cannot be acquired at runtime. Engram-WRITE (op_write/op_relate/
+// op_supersede -> POST /api/nodes, /api/edges, DELETE) and dharma_emit are
+// @manager-ONLY capabilities — exactly the VBD rule that only the orchestrator
+// mutates global state. The orchestrator's token carries them; a worker's token
+// NEVER does. A worker is therefore STRUCTURALLY UNABLE to mutate global engram
+// state, regardless of engram health.
+fn cap_orchestrator() -> String { return "engram:read,engram:write,dharma:emit,state:write" }
+fn cap_worker() -> String { return "engram:read" }
+
+// containment_coordinator_token — the token the orchestrator (@manager) holds.
+// Depth 0. Carries the engram-WRITE + dharma-emit capabilities (@manager-only).
+fn containment_coordinator_token(corr_id: String) -> String {
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "kind")
+    let kv = el_list_append(kv, "coordinator")
+    let kv = el_list_append(kv, "swarm")
+    let kv = el_list_append(kv, corr_id)
+    let kv = el_list_append(kv, "worker")
+    let kv = el_list_append(kv, "")
+    let kv = el_list_append(kv, "depth")
+    let kv = el_list_append(kv, "0")
+    let kv = el_list_append(kv, "caps")
+    let kv = el_list_append(kv, cap_orchestrator())
+    return json_build_object(kv)
+}
+
+// containment_worker_token — the token stamped into a worker's envelope. Depth 1.
+// A closed boundary: forbids opening/joining swarms AND carries ONLY the
+// engram:READ capability — no engram:write, no dharma:emit. Read-only against the
+// full engram; may write only its own local geometry (its returned result).
+fn containment_worker_token(corr_id: String, worker_id: String) -> String {
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "kind")
+    let kv = el_list_append(kv, "worker")
+    let kv = el_list_append(kv, "swarm")
+    let kv = el_list_append(kv, corr_id)
+    let kv = el_list_append(kv, "worker")
+    let kv = el_list_append(kv, worker_id)
+    let kv = el_list_append(kv, "depth")
+    let kv = el_list_append(kv, "1")
+    let kv = el_list_append(kv, "caps")
+    let kv = el_list_append(kv, cap_worker())
+    return json_build_object(kv)
+}
+
+// containment_has_cap — does this token carry capability `cap`?
+fn containment_has_cap(token: String, cap: String) -> Bool {
+    return str_contains(json_get_string(token, "caps"), cap)
+}
+
+// ── Rule checks (return "" on allow, or a rejection reason string) ───────────
+
+// containment_check_open — may the holder of `token` OPEN a new swarm?
+// Enforces Rule 2 (a worker may not initiate a new swarm). Only a coordinator
+// token, or an absent token (top-level process), may open one.
+fn containment_check_open(token: String) -> String {
+    if str_eq(token, "") {
+        return ""
+    }
+    let kind: String = json_get_string(token, "kind")
+    if str_eq(kind, "worker") {
+        return "CONTAINMENT rule 2: a swarm worker may not initiate a new swarm (worker=" + json_get_string(token, "worker") + " swarm=" + json_get_string(token, "swarm") + ")"
+    }
+    return ""
+}
+
+// containment_check_join — may the holder of `token` JOIN swarm `target_corr`?
+// Enforces Rule 1 (a worker may not join another swarm). A worker already bound
+// to swarm A may not register into swarm B; and a worker may not re-join at all.
+fn containment_check_join(token: String, target_corr: String) -> String {
+    if str_eq(token, "") {
+        return ""
+    }
+    let kind: String = json_get_string(token, "kind")
+    if str_eq(kind, "worker") {
+        return "CONTAINMENT rule 1: a swarm worker may not join another swarm (worker=" + json_get_string(token, "worker") + " bound-swarm=" + json_get_string(token, "swarm") + " attempted-swarm=" + target_corr + ")"
+    }
+    return ""
+}
+
+// containment_check_lateral — may `from_token` open a communication edge to a
+// sibling worker `to_worker_id`? Enforces Rule 3 (no lateral communication).
+// The only permitted edges are vertical: worker->coordinator and
+// coordinator->worker. Any worker->worker edge is rejected.
+fn containment_check_lateral(from_token: String, to_worker_id: String) -> String {
+    let kind: String = json_get_string(from_token, "kind")
+    if str_eq(kind, "worker") {
+        if str_eq(to_worker_id, "") {
+            // empty target = the coordinator (vertical) — allowed
+            return ""
+        }
+        return "CONTAINMENT rule 3: a swarm worker may not communicate laterally with sibling workers (from=" + json_get_string(from_token, "worker") + " to=" + to_worker_id + ")"
+    }
+    return ""
+}
+
+// containment_check_engram_write — RULE 4: only a token carrying the
+// engram:write capability (the orchestrator's) may mutate global engram state.
+// A worker token (engram:read only) is REJECTED — the authority gate. Reuses the
+// exact scope-token mechanism as Rule 2's open-denial. Returns "" on allow, or a
+// rejection reason. This is an AUTHORITY gate: it does not consult engram health.
+fn containment_check_engram_write(token: String, op: String) -> String {
+    if containment_has_cap(token, "engram:write") {
+        return ""
+    }
+    return "CONTAINMENT rule 4: engram-write is @manager-only — a worker is read-only against the engram and may not mutate global state (op=" + op + " kind=" + json_get_string(token, "kind") + " worker=" + json_get_string(token, "worker") + " caps=" + json_get_string(token, "caps") + ")"
+}
+
+// containment_check_dharma_emit — the same @manager-only rule for dharma_emit,
+// grounding Rule 4 in VBD: global-state mutations (engram-write, dharma-emit) are
+// orchestrator-only, checked by the one capability mechanism.
+fn containment_check_dharma_emit(token: String) -> String {
+    if containment_has_cap(token, "dharma:emit") {
+        return ""
+    }
+    return "CONTAINMENT rule 4: dharma_emit is @manager-only (kind=" + json_get_string(token, "kind") + ")"
+}
+
+// ── Enforcement helpers ──────────────────────────────────────────────────────
+
+// containment_allows_open — Bool convenience over containment_check_open.
+fn containment_allows_open(token: String) -> Bool {
+    return str_eq(containment_check_open(token), "")
+}
+
+// containment_is_worker — is this a worker-scoped (closed-boundary) token?
+fn containment_is_worker(token: String) -> Bool {
+    return str_eq(json_get_string(token, "kind"), "worker")
+}
+
+// containment_guard_open — assert a swarm may be opened under this token.
+// Returns "" if allowed, or records a CONTAINMENT violation to the work-tracking
+// journal and returns the reason. Callers must abort on a non-empty return.
+fn containment_guard_open(token: String, corr_id: String) -> String {
+    let reason: String = containment_check_open(token)
+    if str_eq(reason, "") {
+        return ""
+    }
+    let p: String = json_set_str("{}", "reason", reason)
+    worktrack_append("containment.violation", corr_id, "open", p)
+    return reason
+}
+
+// containment_guard_engram_write — assert a token may mutate global engram state
+// (Rule 4). Returns "" if allowed; otherwise journals a containment.violation and
+// returns the reason. The write path MUST abort on a non-empty return.
+fn containment_guard_engram_write(token: String, corr_id: String, op: String) -> String {
+    let reason: String = containment_check_engram_write(token, op)
+    if str_eq(reason, "") {
+        return ""
+    }
+    let p0: String = json_set_str("{}", "reason", reason)
+    let p1: String = json_set_str(p0, "op", op)
+    worktrack_append("containment.violation", corr_id, "engram-write", p1)
+    return reason
+}

lang/swarm/primitive_binding.el

@@ -0,0 +1,49 @@
+// primitive_binding.el — THE ONE FLIP POINT.
+//
+// This file is the single seam between the swarm and the real agentic
+// primitives. Binding the reshape's decorated primitives is a one-line change
+// HERE and nothing else changes anywhere in the swarm.
+//
+// The api-reshape agent (wt/api-reshape) is wiring the primitives as DECORATED
+// El on the dharma_* event bus over the engram — think/attend/learn/ground/assert
+// become decorated fns that emit afferent events onto the bus. The moment they
+// land, flip `bound_think` (and its siblings) to call them.
+//
+//   TODAY  (stub fallback, compiles + runs now against :8901):
+//       fn bound_think(...) { return primitive_think(ctx, instruction) }
+//
+//   THE FLIP (when reshape's decorated primitives land — one line each):
+//       fn bound_think(...) { return think(ctx, instruction) }   // decorated, on dharma bus
+//
+// Keep the stub as fallback: `bound_think` is only reached when the seam mode is
+// "decorated" (SWARM_PRIMITIVE_SEAM=decorated). Until you flip these bodies AND
+// set that env, the harness runs entirely on the hermetic stub.
+
+// bound_think — BOUND to the reshape's proven decorated `think` (op_think),
+// real cognition over the engram geometry. The worker's CCR slice carries a
+// NODE-ID anchor in ctx.input (free-text anchors return "geometry unavailable");
+// think re-origins at that node's region under the faculty and returns a real
+// 768-dim gradient.
+fn bound_think(ctx: String, instruction: String) -> String {
+    let anchor: String = json_get_string(ctx, "input")
+    let faculty: String = json_get_string(ctx, "faculty")
+    return op_think(anchor, faculty)
+}
+
+// bound_attend — BOUND to the reshape's op_attend (POST /api/attend). Needs the
+// gate-1 write-healthy clone; falls back to the read-side attend otherwise.
+fn bound_attend(query: String, limit: Int) -> String {
+    if str_eq(env("SWARM_WRITE_HEALTHY"), "1") {
+        return op_attend(query, "self")
+    }
+    return primitive_attend(query, limit)
+}
+
+// bound_learn — BOUND to the reshape's op_learn (correspondence-beat). Needs the
+// gate-1 write-healthy clone; falls back to the opt-in journal-only learn.
+fn bound_learn(corr_id: String, observation: String) -> String {
+    if str_eq(env("SWARM_WRITE_HEALTHY"), "1") {
+        return op_learn(observation, "induce")
+    }
+    return primitive_learn(corr_id, observation)
+}

lang/swarm/primitive_seam.el

@@ -0,0 +1,55 @@
+// primitive_seam.el — the configurable primitive seam + telemetry.
+//
+// One switch selects where a worker's primitive invocation goes:
+//   SWARM_PRIMITIVE_SEAM=stub       (default) — hermetic in-process think.
+//   SWARM_PRIMITIVE_SEAM=decorated            — the reshape's decorated
+//                                               primitives on the dharma bus
+//                                               (see primitive_binding.el).
+//
+// Every seam invocation is an AFFERENT signal — a primitive call travelling
+// toward the manager. The seam stamps telemetry onto each thought (seam_mode +
+// one afferent tick) so the coordinator can aggregate afferent counters across
+// the swarm without any shared mutable state (containment-safe: counts ride the
+// vertical result path, not a shared bus register).
+
+// seam_mode — "stub" (default) or "decorated".
+fn seam_mode() -> String {
+    let m: String = env("SWARM_PRIMITIVE_SEAM")
+    if str_eq(m, "decorated") {
+        return "decorated"
+    }
+    return "stub"
+}
+
+// seam_think — route a worker's `think` through the configured seam and stamp
+// telemetry. Returns the thought JSON augmented with:
+//   seam_mode : which side of the seam served this call
+//   afferent  : "1" — one afferent primitive signal was emitted
+fn seam_think(ctx: String, instruction: String) -> String {
+    let mode: String = seam_mode()
+    let thought: String = ""
+    if str_eq(mode, "decorated") {
+        let thought = bound_think(ctx, instruction)
+    } else {
+        let thought = primitive_think(ctx, instruction)
+    }
+    let t1: String = json_set_str(thought, "seam_mode", mode)
+    let t2: String = json_set_str(t1, "afferent", "1")
+    return t2
+}
+
+// seam_attend / seam_learn — same seam for the other primitives (used when a
+// blueprint retrieves or writes through the bus).
+fn seam_attend(query: String, limit: Int) -> String {
+    if str_eq(seam_mode(), "decorated") {
+        return bound_attend(query, limit)
+    }
+    return primitive_attend(query, limit)
+}
+
+fn seam_learn(corr_id: String, observation: String) -> String {
+    if str_eq(seam_mode(), "decorated") {
+        return bound_learn(corr_id, observation)
+    }
+    return primitive_learn(corr_id, observation)
+}

lang/swarm/primitives.el

@@ -0,0 +1,94 @@
+// primitives.el — the agentic primitive SEAM the swarm composes over.
+//
+// The swarm is orchestration OVER the five CCR primitives, not a replacement for
+// them (CCR §2, "The Five Primitives / The Execution Cycle"): a worker executes
+// its task blueprint as attend -> think -> intend -> act -> learn against its
+// compiled, bounded context.
+//
+// This file is the SEAM. The parallel API-surface reshape exposes the canonical
+// primitive tools; when it lands, bind each primitive below to the reshaped
+// implementation (see PRIMITIVE_BINDING). Until then these are thin, engram-
+// backed fallbacks so the swarm — its fan-out, containment, CCR context
+// compilation, convergence, and work-tracking — is fully exercisable today.
+//
+// Contract: every primitive takes and returns String (JSON where structured), so
+// any primitive is directly threadable via thread.el's spawn (which runs
+// top-level (String)->String El fns).
+//
+// PRIMITIVE_BINDING: to bind the reshape's real tools, replace each fallback body
+// with a call to the reshaped El fn / API endpoint. Signatures here are the
+// stable contract the swarm depends on; keep them.
+
+// ── attend — retrieve the minimal relevant context for a focus ───────────────
+// Vantage-read: pull only what this focus needs from the mind. Backed by the
+// engram's spreading-activation retrieval.
+fn primitive_attend(query: String, limit: Int) -> String {
+    if str_eq(query, "") {
+        return "[]"
+    }
+    // Location-independent worker model: when an engram daemon is configured,
+    // retrieve over HTTP (the worker may run anywhere). POST /api/search
+    // {query,limit,_auth}. Falls back to the in-process store otherwise.
+    let url: String = env("ENGRAM_URL")
+    if str_eq(url, "") {
+        return engram_activate(query, limit)
+    }
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "query")
+    let kv = el_list_append(kv, query)
+    let body0: String = json_build_object(kv)
+    let body1: String = json_set(body0, "limit", int_to_str(limit))
+    let body2: String = json_set_str(body1, "_auth", env("ENGRAM_API_KEY"))
+    return http_post(url + "/api/search", body2)
+}
+
+// ── think — reason over the compiled context ─────────────────────────────────
+// In production this routes to a model (CCR dynamic model selection). Here it is
+// a deterministic, hermetic transform so swarm behaviour is testable without an
+// external model: it echoes a structured verdict derived from the context. The
+// binding point for a real model is explicit.
+fn primitive_think(compiled_ctx: String, instruction: String) -> String {
+    // PRIMITIVE_BINDING: replace with the reshape's think() (model inference).
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "instruction")
+    let kv = el_list_append(kv, instruction)
+    let kv = el_list_append(kv, "ctx_bytes")
+    let kv = el_list_append(kv, int_to_str(str_len(compiled_ctx)))
+    let kv = el_list_append(kv, "conclusion")
+    let kv = el_list_append(kv, "reasoned:" + instruction)
+    return json_build_object(kv)
+}
+
+// ── intend — form a bounded plan/decision from a thought ─────────────────────
+fn primitive_intend(thought: String) -> String {
+    let concl: String = json_get_string(thought, "conclusion")
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "intent")
+    let kv = el_list_append(kv, concl)
+    return json_build_object(kv)
+}
+
+// ── act — execute a bounded effect and return its result ─────────────────────
+// Workers defer real side-effects to the coordinator (idempotency requirement,
+// Swarm §7.3). Here act produces an artifact-shaped result the coordinator
+// collects during convergence.
+fn primitive_act(intent: String, input_item: String) -> String {
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "acted_on")
+    let kv = el_list_append(kv, input_item)
+    let kv = el_list_append(kv, "via")
+    let kv = el_list_append(kv, json_get_string(intent, "intent"))
+    return json_build_object(kv)
+}
+
+// ── learn — record an observation into the mind, tagged by correlation ID ────
+// Append-only, naturally idempotent (Swarm §7.3). Best-effort: a worker that
+// cannot reach the mind still returns its result.
+fn primitive_learn(corr_id: String, observation: String) -> String {
+    let url: String = env("ENGRAM_URL")
+    if str_eq(url, "") {
+        return ""
+    }
+    let content: String = "swarm-worker-obs corr=" + corr_id + " :: " + observation
+    return engram_node(content, "Memory", 0.4)
+}

lang/swarm/reshape_surface.el

@@ -0,0 +1,103 @@
+// reshape_surface.el — the api-reshape agent's PROVEN decorated primitives,
+// composed into the swarm build to bind real cognition.
+//
+// PROVENANCE: these fns are the reshape's surface at wt/api-reshape @ d4f401d
+// ("reshape: decorator-as-seam — port @route codegen, prove decorate->serve,
+// rewrite surface as decorated El"), verified live against
+// engram.cognition-20260814. Copied verbatim (read/cognition ops only) so the
+// swarm binds the REAL primitives, not a reimplementation. The write ops
+// (op_write/op_relate/op_supersede/op_ground) are intentionally NOT composed
+// here — they exercise the persist_node write path that needs the gate-1
+// write-healthy clone; the swarm's proven run is read-cognition (think/read).
+//
+// Ops route to the ENGRAM over ENGRAM_URL — pinned by THIS worktree's .nsbx-env
+// to the :8901 swarm clone (never the reshape agent's :8900). Separate clones,
+// no collision.
+
+fn engram_url() -> String {
+    let u: String = env("ENGRAM_URL")
+    if str_eq(u, "") { return "http://127.0.0.1:8900" }
+    return u
+}
+fn engram_key() -> String {
+    let k: String = env("ENGRAM_API_KEY")
+    if str_eq(k, "") { return "sbx-dev-api-reshape" }
+    return k
+}
+fn SELF_KEY() -> String { return "kn-efeb4a5b-5aff-4759-8a97-7233099be6ee" }
+fn VALUES_KEY() -> String { return "kn-5b606390-a52d-4ca2-8e0e-eba141d13440" }
+
+// self/values name -> keystone id; anything else passes through unchanged.
+fn resolve_named(v: String) -> String {
+    if str_eq(v, "self") { return SELF_KEY() }
+    if str_eq(v, "neuron") { return SELF_KEY() }
+    if str_eq(v, "values") { return VALUES_KEY() }
+    if str_eq(v, "values_hub") { return VALUES_KEY() }
+    return v
+}
+
+// read — THE VANTAGE-READ. Re-origin at a point + aperture -> a BOUNDED slice.
+fn op_read(vantage: String, typ: String, k: Int) -> String {
+    let vid: String = resolve_named(vantage)
+    if str_eq(typ, "edges") {
+        return http_get(engram_url() + "/api/neighbors/" + vid)
+    }
+    if str_starts_with(vid, "kn-") {
+        return http_get(engram_url() + "/api/neighbors/" + vid)
+    }
+    return http_get(engram_url() + "/api/search?q=" + url_encode(vid) + "&limit=" + int_to_str(k))
+}
+
+// think — THE ONE OPERATION. anchor (node ids) steered by faculty -> gradient.
+fn op_think(seeds: String, faculty: String) -> String {
+    let s: String = resolve_named(seeds)
+    let f: String = if str_eq(faculty, "") { "reason" } else { faculty }
+    return http_get(engram_url() + "/api/think?seeds=" + url_encode(s) + "&faculty=" + f)
+}
+
+// attend — aim attention at a region. (POST — needs a write-healthy clone.)
+fn op_attend(node: String, observer: String) -> String {
+    let n: String = resolve_named(node)
+    let o: String = if str_eq(observer, "") { SELF_KEY() } else { resolve_named(observer) }
+    let body: String = "{\"_auth\":\"" + engram_key() + "\",\"node\":\"" + n
+        + "\",\"observer\":\"" + o + "\",\"salience\":\"0.6\"}"
+    return http_post_json(engram_url() + "/api/attend", body)
+}
+
+fn identity_typed(t: String) -> Bool {
+    if str_eq(t, "self") { return true }
+    if str_eq(t, "values") { return true }
+    return false
+}
+fn type_to_node_type(t: String) -> String {
+    if str_eq(t, "knowledge") { return "Knowledge" }
+    if str_eq(t, "artifact") { return "Artifact" }
+    if str_eq(t, "backlog") { return "WorkItem" }
+    if str_eq(t, "process") { return "Process" }
+    if str_eq(t, "state") { return "InternalStateEvent" }
+    return "Memory"
+}
+
+// write — add a node (POST /api/nodes). Identity types refused. This is a
+// global-engram MUTATION — @manager-only (Rule 4); never called on a worker path.
+// (Reshape's op_write, with json_escape -> the available json_escape_string.)
+fn op_write(content: String, typ: String, importance: Float) -> String {
+    if str_eq(content, "") { return "{\"error\":\"write: content required\"}" }
+    if identity_typed(typ) {
+        return "{\"error\":\"write type=" + typ + " is write-protected -> intentional-cultivation\"}"
+    }
+    let body: String = "{\"_auth\":\"" + engram_key() + "\",\"content\":\"" + json_escape_string(content)
+        + "\",\"node_type\":\"" + type_to_node_type(typ) + "\",\"tier\":\"Working\",\"importance\":"
+        + float_to_str(importance) + "}"
+    return http_post_json(engram_url() + "/api/nodes", body)
+}
+
+// learn — the reflexive correspondence-beat: calibrate the steering-prior.
+// (POST — needs a write-healthy clone.)
+fn op_learn(seeds: String, faculty: String) -> String {
+    let s: String = resolve_named(seeds)
+    let f: String = if str_eq(faculty, "") { "induce" } else { faculty }
+    let body: String = "{\"_auth\":\"" + engram_key() + "\",\"seeds\":\"" + s
+        + "\",\"faculty\":\"" + f + "\",\"keystone\":\"false\"}"
+    return http_post_json(engram_url() + "/api/correspondence-beat", body)
+}

lang/swarm/swarm.el

@@ -0,0 +1,483 @@
+// swarm.el — the swarm orchestrator: bounded parallel agent execution.
+//
+// Implements Swarm Architecture's single pattern — fan out, execute independently,
+// converge — on El's NATIVE concurrency (thread.el spawn/join). No external
+// orchestrator: a swarm is a coordinator (this file, the main thread) that mints
+// a correlation identity, compiles a bounded CCR context per worker, dispatches
+// workers as native pthreads, tracks every unit of work, and converges the
+// results before returning control to the parent step.
+//
+// The five properties of every swarm (Swarm §2.1) are all present:
+//   parent step        -> swarm_run is called from one process step
+//   task blueprint     -> `blueprint` name + knowledge refs, run by every worker
+//   input set          -> `inputs_json`, one item per worker
+//   convergence        -> `strategy` in config (collect|merge|vote|reduce)
+//   correlation ID     -> minted here, threaded through tracking + every worker
+//
+// Containment (Swarm §3) is enforced: the caller must hold a coordinator/absent
+// token to open a swarm (Rule 2), each worker is stamped a closed worker token
+// (Rules 1+3), and workers share no mutable state (the coordinator is the only
+// journal writer).
+
+// ── worker entry — the top-level (String)->String fn native threads run ──────
+//
+// Every El fn compiles to a global C symbol; spawn() resolves this by name via
+// dlsym and runs it in a pthread. The envelope carries everything the worker is
+// permitted to see — its compiled context and nothing else (§9.3).
+//
+// Returns a result JSON: {worker_id, status:"completed"|"failed", output|error}.
+fn swarm_worker_entry(envelope_json: String) -> String {
+    let worker_id: String = json_get_string(envelope_json, "worker_id")
+    let ctx: String = json_get_raw(envelope_json, "ctx")
+
+    // The worker holds a CLOSED worker token (Rules 1+3): it shares no state
+    // with siblings and may not open/join a swarm. That boundary is enforced at
+    // the point of attempt — swarm_run rejects any swarm opened under a worker
+    // token (Rule 2). A worker simply executing its blueprint is not opening a
+    // swarm, so it proceeds. Its only outward edge is this returned result
+    // (the vertical worker->coordinator path).
+    let out: String = swarm_run_blueprint(ctx)
+    // A worker reports failed iff its blueprint signalled failure. This is the
+    // vertical status edge the coordinator reads during convergence (§4.3, §7).
+    let bstatus: String = json_get_string(out, "blueprint_status")
+    let status: String = "completed"
+    if str_eq(bstatus, "failed") {
+        let status = "failed"
+    }
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "worker_id")
+    let kv = el_list_append(kv, worker_id)
+    let kv = el_list_append(kv, "status")
+    let kv = el_list_append(kv, status)
+    let res: String = json_build_object(kv)
+    return json_set(res, "output", out)
+}
+
+// swarm_run_blueprint — execute the task blueprint over a compiled context.
+// The default blueprint is the CCR execution cycle: think -> intend -> act over
+// the worker's bounded context. Specialise by dispatching on
+// json_get_string(ctx,"blueprint"). Idempotent: reads ctx, writes only its
+// returned output (§7.3).
+fn swarm_run_blueprint(ctx: String) -> String {
+    let blueprint: String = json_get_string(ctx, "blueprint")
+    let input_item: String = json_get_string(ctx, "input")
+    let knowledge: String = json_get_string(ctx, "knowledge")
+
+    // classify — deterministic verdict for the `vote` convergence strategy:
+    // verdict is "long" if the input has >4 chars, else "short".
+    if str_eq(blueprint, "classify") {
+        let verdict: String = "short"
+        if str_len(input_item) > 4 {
+            let verdict = "long"
+        }
+        let kv: [String] = el_list_empty()
+        let kv = el_list_append(kv, "verdict")
+        let kv = el_list_append(kv, verdict)
+        let kv = el_list_append(kv, "blueprint_status")
+        let kv = el_list_append(kv, "ok")
+        return json_build_object(kv)
+    }
+
+    // faildemo — a worker that fails on inputs beginning with "x" (exercises the
+    // failure threshold + partial convergence path). Idempotent, side-effect-free.
+    if str_eq(blueprint, "faildemo") {
+        let st: String = "ok"
+        if str_starts_with(input_item, "x") {
+            let st = "failed"
+        }
+        return json_set_str("{}", "blueprint_status", st)
+    }
+
+    // cognize — REAL-COGNITION blueprint. Routes think through the seam (bound to
+    // op_think in decorated mode) over the worker's NODE-ID anchor, then derives a
+    // vote verdict from the gradient's confidence. In stub mode there is no
+    // gradient, so the verdict falls back to a deterministic slice hash — the
+    // same blueprint runs green on either side of the seam.
+    if str_eq(blueprint, "cognize") {
+        let thought: String = seam_think(ctx, "reason over " + input_item)
+        // Derive the vote verdict from the REAL gradient's support count
+        // (json_get_int, since n_support is numeric). Different anchors have
+        // different support -> genuine, cognition-driven vote diversity. In stub
+        // mode there is no gradient (n_support -> 0) -> "uncertain".
+        let nsup: Int = json_get_int(thought, "n_support")
+        let verdict: String = "uncertain"
+        if nsup >= 10 {
+            let verdict = "confident"
+        }
+        let ck: [String] = el_list_empty()
+        let ck = el_list_append(ck, "verdict")
+        let ck = el_list_append(ck, verdict)
+        let ck = el_list_append(ck, "blueprint_status")
+        let ck = el_list_append(ck, "ok")
+        let cout0: String = json_build_object(ck)
+        let cout1: String = json_set_str(cout0, "n_support", int_to_str(nsup))
+        let cout2: String = json_set_str(cout1, "seam_mode", json_get_string(thought, "seam_mode"))
+        return json_set_str(cout2, "afferent", json_get_string(thought, "afferent"))
+    }
+
+    // default (analyze_item): the CCR execution cycle think -> intend -> act,
+    // with `think` routed through the CONFIGURABLE PRIMITIVE SEAM. Telemetry
+    // (seam_mode + afferent tick) rides the worker's returned output.
+    let instruction: String = "process input: " + input_item
+    let thought: String = seam_think(ctx, instruction)
+    let intent: String = primitive_intend(thought)
+    let effect: String = primitive_act(intent, input_item)
+    let e1: String = json_set_str(effect, "blueprint_status", "ok")
+    let e2: String = json_set_str(e1, "seam_mode", json_get_string(thought, "seam_mode"))
+    let e3: String = json_set_str(e2, "afferent", json_get_string(thought, "afferent"))
+    return e3
+}
+
+// ── native-thread fan-out, bounded by concurrency, order-preserving ──────────
+//
+// parallel_map (thread.el) spawns ALL threads at once. The swarm honours the
+// blueprint's `concurrency` cap (§5.1: a resource constraint, not a parallelism
+// constraint — all items are processed, at most N at a time) by dispatching in
+// waves of N native threads, joining each wave before the next. Results are
+// returned in input order.
+fn swarm_fanout(worker_fn: String, envelopes: [String], concurrency: Int) -> [String] {
+    let n: Int = el_list_len(envelopes)
+    let cap: Int = concurrency
+    if cap < 1 {
+        let cap = 1
+    }
+    let results: [String] = el_list_empty()
+    let base = 0
+    while base < n {
+        // spawn a wave of up to `cap` workers
+        let tids: [String] = el_list_empty()
+        let k = 0
+        while k < cap {
+            let idx: Int = base + k
+            if idx < n {
+                let env_item: String = el_list_get(envelopes, idx)
+                let tid: Int = spawn(worker_fn, env_item)
+                let tids = el_list_append(tids, int_to_str(tid))
+            }
+            let k = k + 1
+        }
+        // join the wave in order
+        let j = 0
+        let jn: Int = el_list_len(tids)
+        while j < jn {
+            let tid: Int = str_to_int(el_list_get(tids, j))
+            let r: String = join(tid)
+            let results = el_list_append(results, r)
+            let j = j + 1
+        }
+        let base = base + cap
+    }
+    return results
+}
+
+// ── convergence strategies (Swarm §4.2) ──────────────────────────────────────
+
+// swarm_converge_collect — ordered list, no transformation.
+fn swarm_converge_collect(results: [String]) -> String {
+    let n: Int = el_list_len(results)
+    let arr: String = "[]"
+    let i = 0
+    while i < n {
+        let arr = json_array_push(arr, el_list_get(results, i))
+        let i = i + 1
+    }
+    return arr
+}
+
+// swarm_converge_merge — combine worker outputs into a single joined string.
+fn swarm_converge_merge(results: [String]) -> String {
+    let n: Int = el_list_len(results)
+    let merged: String = ""
+    let i = 0
+    while i < n {
+        let out: String = json_get_raw(el_list_get(results, i), "output")
+        if i > 0 {
+            let merged = merged + " | "
+        }
+        let merged = merged + out
+        let i = i + 1
+    }
+    return json_set_str("{}", "merged", merged)
+}
+
+// swarm_converge_vote — tally a field across worker outputs, pick the majority.
+// Each worker output is expected to carry a "verdict" string field.
+fn swarm_converge_vote(results: [String]) -> String {
+    let n: Int = el_list_len(results)
+    // Collect verdicts (no mutable tally: json_set can't update an existing key
+    // and there is no el_list_set). Then count each verdict by rescanning.
+    let verdicts: [String] = el_list_empty()
+    let i = 0
+    while i < n {
+        let out: String = json_get_raw(el_list_get(results, i), "output")
+        let v: String = json_get_string(out, "verdict")
+        if str_eq(v, "") {
+            let i = i + 1
+        } else {
+            let verdicts = el_list_append(verdicts, v)
+            let i = i + 1
+        }
+    }
+    // pick the verdict with the highest count (first-past-the-post)
+    let vn: Int = el_list_len(verdicts)
+    let best: String = ""
+    let bestc = 0
+    let a = 0
+    while a < vn {
+        let cand: String = el_list_get(verdicts, a)
+        // count occurrences of cand
+        let c = 0
+        let b = 0
+        while b < vn {
+            if str_eq(el_list_get(verdicts, b), cand) {
+                let c = c + 1
+            }
+            let b = b + 1
+        }
+        if c > bestc {
+            let bestc = c
+            let best = cand
+        }
+        let a = a + 1
+    }
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "winner")
+    let kv = el_list_append(kv, best)
+    let kv = el_list_append(kv, "votes")
+    let kv = el_list_append(kv, int_to_str(bestc))
+    return json_build_object(kv)
+}
+
+// swarm_converge_reduce — fold outputs into an accumulator (count + concat).
+fn swarm_converge_reduce(results: [String]) -> String {
+    let n: Int = el_list_len(results)
+    let acc: String = ""
+    let i = 0
+    while i < n {
+        let out: String = json_get_raw(el_list_get(results, i), "output")
+        let acc = acc + out
+        let i = i + 1
+    }
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "count")
+    let kv = el_list_append(kv, int_to_str(n))
+    let kv = el_list_append(kv, "accumulated")
+    let kv = el_list_append(kv, acc)
+    return json_build_object(kv)
+}
+
+// ratio_to_permille — parse a decimal ratio string ("1.0", "0.8") into an
+// integer per-mille (1000, 800) so failure thresholds use exact integer math.
+// (El float division is unreliable in this runtime — int_to_float(n)/int_to_float(n)
+// does not equal 1.0 — so the swarm deliberately avoids floats.)
+fn ratio_to_permille(s: String) -> Int {
+    if str_eq(s, "") {
+        return 1000
+    }
+    let parts: [String] = str_split(s, ".")
+    let whole: Int = str_to_int(el_list_get(parts, 0))
+    let permille: Int = whole * 1000
+    if el_list_len(parts) > 1 {
+        let frac_raw: String = el_list_get(parts, 1)
+        let frac3: String = str_slice(str_pad_right(frac_raw, 3, "0"), 0, 3)
+        let permille = permille + str_to_int(frac3)
+    }
+    return permille
+}
+
+// swarm_converge — dispatch on strategy name.
+fn swarm_converge(strategy: String, results: [String]) -> String {
+    if str_eq(strategy, "merge") {
+        return swarm_converge_merge(results)
+    }
+    if str_eq(strategy, "vote") {
+        return swarm_converge_vote(results)
+    }
+    if str_eq(strategy, "reduce") {
+        return swarm_converge_reduce(results)
+    }
+    // default: collect
+    return swarm_converge_collect(results)
+}
+
+// ── the ONLY global-engram write path (Rule 4, @manager-only) ────────────────
+//
+// Every engram mutation flows through here and is gated by the caller's token
+// capability. Only the orchestrator's token carries engram:write, so a worker
+// (engram:read only) calling this is DENIED by capability before any HTTP is
+// issued — structurally unable to mutate global engram state, regardless of
+// engram health. This is the curated-merge write: the orchestrator committing
+// the geometry it approved. Workers never reach a successful branch here.
+fn swarm_engram_write(token: String, corr_id: String, content: String, typ: String, importance: Float) -> String {
+    let deny: String = containment_guard_engram_write(token, corr_id, "engram.write")
+    if str_eq(deny, "") {
+        // authorized (orchestrator) — perform the write
+        let res: String = op_write(content, typ, importance)
+        let new_id: String = json_get_string(res, "id")
+        let cp: String = json_set_str("{}", "node_id", new_id)
+        worktrack_append("swarm.committed", corr_id, "orchestrator", cp)
+        return res
+    }
+    // denied by capability — return the rejection, no engram mutation performed
+    return json_set_str("{}", "denied", deny)
+}
+
+// ── the coordinator: fan out -> track -> converge ────────────────────────────
+//
+//   blueprint        : task blueprint name run by every worker
+//   knowledge_refs   : JSON array of retrieval queries for CCR compilation
+//   inputs_json      : JSON array of input items (one per worker)
+//   config_json      : { concurrency, strategy, min_success_ratio,
+//                        failure_action, caller_token }
+//
+// Returns: { corr_id, status:"completed"|"aborted", merged, report }.
+fn swarm_run(blueprint: String, knowledge_refs: String, inputs_json: String, config_json: String) -> String {
+    let corr_id: String = "swarm-" + uuid_v4()
+    let caller_token: String = json_get_raw(config_json, "caller_token")
+    let concurrency: Int = str_to_int(json_get_string(config_json, "concurrency"))
+    if concurrency < 1 {
+        let concurrency = 4
+    }
+    let strategy: String = json_get_string(config_json, "strategy")
+
+    // ── Containment Rule 2: only a coordinator/absent token may open a swarm ──
+    let deny: String = containment_guard_open(caller_token, corr_id)
+    if str_eq(deny, "") {
+        // allowed — proceed
+        let n: Int = json_array_len(inputs_json)
+
+        // swarm.created
+        let cp: String = json_set_str("{}", "blueprint", blueprint)
+        let cp2: String = json_set(cp, "input_count", int_to_str(n))
+        worktrack_append("swarm.created", corr_id, corr_id, cp2)
+
+        // build per-worker envelopes: worker token + CCR-compiled bounded context
+        let envelopes: [String] = el_list_empty()
+        let i = 0
+        while i < n {
+            let worker_id: String = corr_id + "/worker-" + int_to_str(i)
+            let input_item: String = json_array_get_string(inputs_json, i)
+            let wtoken: String = containment_worker_token(corr_id, worker_id)
+            let ctx: String = ccr_compile(blueprint, knowledge_refs, input_item, corr_id, worker_id, wtoken)
+            // envelope: only this worker's compiled context + its closed token
+            let ekv: [String] = el_list_empty()
+            let ekv = el_list_append(ekv, "worker_id")
+            let ekv = el_list_append(ekv, worker_id)
+            let ekv = el_list_append(ekv, "corr_id")
+            let ekv = el_list_append(ekv, corr_id)
+            let env0: String = json_build_object(ekv)
+            let env1: String = json_set(env0, "scope_token", wtoken)
+            let env2: String = json_set(env1, "ctx", ctx)
+            let envelopes = el_list_append(envelopes, env2)
+
+            let sp: String = json_set_str("{}", "input", input_item)
+            worktrack_append("worker.started", corr_id, worker_id, sp)
+            let i = i + 1
+        }
+
+        // ── native-thread fan-out (bounded) ──
+        let results: [String] = swarm_fanout("swarm_worker_entry", envelopes, concurrency)
+
+        // record per-worker terminal status + aggregate AFFERENT telemetry.
+        // Afferent counters (primitive signals travelling toward the @manager)
+        // are summed from the vertical result path — no shared bus register,
+        // so the aggregation is containment-safe.
+        let succ = 0
+        let afferent = 0
+        let seam_mode_seen: String = "stub"
+        let rn: Int = el_list_len(results)
+        let r = 0
+        while r < rn {
+            let res: String = el_list_get(results, r)
+            let wid: String = json_get_string(res, "worker_id")
+            let st: String = json_get_string(res, "status")
+            let out: String = json_get_raw(res, "output")
+            let aff: Int = str_to_int(json_get_string(out, "afferent"))
+            let afferent = afferent + aff
+            let sm: String = json_get_string(out, "seam_mode")
+            if str_eq(sm, "") {
+                let seam_mode_seen = seam_mode_seen
+            } else {
+                let seam_mode_seen = sm
+            }
+            if str_eq(st, "completed") {
+                let succ = succ + 1
+                worktrack_append("worker.completed", corr_id, wid, json_set_str("{}", "status", "completed"))
+            } else {
+                worktrack_append("worker.failed", corr_id, wid, json_set_str("{}", "error", json_get_string(res, "error")))
+            }
+            let r = r + 1
+        }
+
+        // swarm.converging
+        let vg: String = json_set("{}", "success_count", int_to_str(succ))
+        worktrack_append("swarm.converging", corr_id, corr_id, vg)
+
+        // swarm.telemetry — afferent counters observed by the @manager.
+        let tkv: [String] = el_list_empty()
+        let tkv = el_list_append(tkv, "seam_mode")
+        let tkv = el_list_append(tkv, seam_mode_seen)
+        let telem0: String = json_build_object(tkv)
+        let telem1: String = json_set_str(telem0, "afferent_think", int_to_str(afferent))
+        let telemetry: String = json_set_str(telem1, "results_received", int_to_str(rn))
+        worktrack_append("swarm.telemetry", corr_id, corr_id, telemetry)
+
+        // ── failure threshold (Swarm §4.3), integer per-mille math ──
+        // require succ/n >= min_success_ratio  <=>  succ*1000 >= permille*n
+        let permille: Int = ratio_to_permille(json_get_string(config_json, "min_success_ratio"))
+        let status: String = "completed"
+        if succ * 1000 < permille * n {
+            let status = "aborted"
+        }
+
+        if str_eq(status, "aborted") {
+            let ap: String = json_set_str("{}", "reason", "success ratio below min_success_ratio")
+            worktrack_append("swarm.aborted", corr_id, corr_id, ap)
+            let rep: String = worktrack_swarm_report(corr_id)
+            let ok: [String] = el_list_empty()
+            let ok = el_list_append(ok, "corr_id")
+            let ok = el_list_append(ok, corr_id)
+            let ok = el_list_append(ok, "status")
+            let ok = el_list_append(ok, "aborted")
+            let out0: String = json_build_object(ok)
+            return json_set(out0, "report", rep)
+        }
+
+        // ── converge ──
+        let merged: String = swarm_converge(strategy, results)
+        let dp: String = json_set_str("{}", "strategy", strategy)
+        worktrack_append("swarm.completed", corr_id, corr_id, dp)
+
+        // ── curated merge = the ONLY engram write path (Rule 4) ──
+        // With "commit":"1", the ORCHESTRATOR (its token carries engram:write)
+        // commits the approved merged geometry back to the engram. This is the
+        // single writer. Workers returned geometry; only the orchestrator writes.
+        let commit_id: String = ""
+        if str_eq(json_get_string(config_json, "commit"), "1") {
+            let orch_token: String = containment_coordinator_token(corr_id)
+            let cres: String = swarm_engram_write(orch_token, corr_id, "swarm-merge " + corr_id + " :: " + merged, "memory", 0.5)
+            let commit_id = json_get_string(cres, "id")
+        }
+
+        let rep2: String = worktrack_swarm_report(corr_id)
+        let ok2: [String] = el_list_empty()
+        let ok2 = el_list_append(ok2, "corr_id")
+        let ok2 = el_list_append(ok2, corr_id)
+        let ok2 = el_list_append(ok2, "status")
+        let ok2 = el_list_append(ok2, "completed")
+        let out1: String = json_build_object(ok2)
+        let out2: String = json_set(out1, "report", rep2)
+        let out3: String = json_set(out2, "merged", merged)
+        let out4: String = json_set(out3, "telemetry", telemetry)
+        return json_set_str(out4, "committed_node", commit_id)
+    }
+    // ── denied: caller was a worker trying to open a swarm (Rule 2) ──
+    let dkv: [String] = el_list_empty()
+    let dkv = el_list_append(dkv, "corr_id")
+    let dkv = el_list_append(dkv, corr_id)
+    let dkv = el_list_append(dkv, "status")
+    let dkv = el_list_append(dkv, "denied")
+    let dkv = el_list_append(dkv, "error")
+    let dkv = el_list_append(dkv, deny)
+    return json_build_object(dkv)
+}

lang/swarm/tests/harness_local_swarm.el

@@ -0,0 +1,88 @@
+// harness_local_swarm.el — LOCAL-SWARM INTEGRATION HARNESS.
+//
+// Proves the FULL local-swarm mechanics end-to-end, TODAY, on the isolated
+// engram clone (:8901), with the primitive seam pointed at the hermetic stub.
+// The moment the api-reshape agent lands the decorated primitives on the
+// dharma bus, binding is ONE flip (primitive_binding.el) + SWARM_PRIMITIVE_SEAM=
+// decorated — this same harness then runs the bound path with no other change.
+//
+// The @manager (the coordinator) fans out N native El worker threads at real
+// concurrency, each given a CCR-scoped engram slice, each invoking the primitive
+// seam (think over its slice), enforces all three containment rules, converges
+// (vote AND reduce), work-tracks durably, and observes afferent telemetry.
+//
+// Run with the sandbox env sourced (ENGRAM_URL=:8901) to also exercise CCR
+// retrieval against the real (isolated) mind; runs fully without it too.
+
+fn ok(label: String, cond: Bool, fails: Int) -> Int {
+    if cond { print("  ok    " + label); return fails }
+    print("  FAIL  " + label); return fails + 1
+}
+
+fn main() -> Int {
+    let fails = 0
+    print("== LOCAL-SWARM INTEGRATION HARNESS (seam=" + seam_mode() + ") ==")
+
+    // 8 independent slices, real concurrency of 4 (2 waves of native pthreads).
+    let inputs: String = "[\"billing\",\"payments\",\"ledger\",\"invoicing\",\"tax\",\"payroll\",\"audit\",\"fx\"]"
+    let refs: String = "[\"Volatility-Based Decomposition\"]"
+
+    // ── A) fan-out / converge at real concurrency (reduce) ──
+    let cfg_r: String = "{\"concurrency\":\"4\",\"strategy\":\"reduce\",\"min_success_ratio\":\"1.0\"}"
+    let rr: String = swarm_run("analyze_item", refs, inputs, cfg_r)
+    let fails = ok("swarm completed at concurrency=4 over 8 native-thread workers", str_eq(json_get_string(rr, "status"), "completed"), fails)
+    let corr: String = json_get_string(rr, "corr_id")
+    let merged_r: String = json_get_raw(rr, "merged")
+    let fails = ok("reduce converged all 8 worker outputs", str_to_int(json_get_string(merged_r, "count")) == 8, fails)
+
+    // ── B) afferent telemetry observed by the @manager ──
+    let telem: String = json_get_raw(rr, "telemetry")
+    let aff: Int = str_to_int(json_get_string(telem, "afferent_think"))
+    let seen_mode: String = json_get_string(telem, "seam_mode")
+    let fails = ok("afferent think-signals counted = 8 (one per worker)", aff == 8, fails)
+    let fails = ok("telemetry records the active seam mode", str_eq(seen_mode, seam_mode()), fails)
+    let telem_recs: Int = worktrack_count_kind(corr, "swarm.telemetry")
+    let fails = ok("telemetry durably journalled", telem_recs == 1, fails)
+
+    // ── C) CCR scoping + non-leak per worker ──
+    let wt: String = containment_worker_token(corr, corr + "/worker-3")
+    let ctx3: String = ccr_compile("analyze_item", refs, "invoicing", corr, corr + "/worker-3", wt)
+    let fails = ok("CCR context bounded within token budget", ccr_within_budget(ctx3), fails)
+    let fails = ok("CCR context carries THIS slice", str_eq(json_get_string(ctx3, "input"), "invoicing"), fails)
+    let leaks: Bool = str_contains(ctx3, "payroll") || str_contains(ctx3, "audit")
+    let fails = ok("CCR context does NOT leak sibling slices (security boundary)", !leaks, fails)
+
+    // ── D) all three containment rules ──
+    let deny: String = containment_check_open(wt)
+    let fails = ok("Rule 2: worker token may not OPEN a swarm", !str_eq(deny, ""), fails)
+    let denyj: String = containment_check_join(wt, "other-swarm")
+    let fails = ok("Rule 1: worker token may not JOIN another swarm", !str_eq(denyj, ""), fails)
+    let lat: String = containment_check_lateral(wt, "sibling-9")
+    let fails = ok("Rule 3: worker->worker lateral edge rejected", !str_eq(lat, ""), fails)
+    let ver: String = containment_check_lateral(wt, "")
+    let fails = ok("Rule 3: worker->manager vertical edge allowed", str_eq(ver, ""), fails)
+    // enforced live: a worker-token caller is denied opening a real swarm
+    let wcfg: String = json_set(cfg_r, "caller_token", wt)
+    let denied: String = swarm_run("analyze_item", refs, inputs, wcfg)
+    let fails = ok("Rule 2 enforced live: worker-caller swarm denied", str_eq(json_get_string(denied, "status"), "denied"), fails)
+
+    // ── E) vote convergence strategy at concurrency ──
+    let cfg_v: String = "{\"concurrency\":\"8\",\"strategy\":\"vote\",\"min_success_ratio\":\"1.0\"}"
+    let rv: String = swarm_run("classify", refs, inputs, cfg_v)
+    let winner: String = json_get_string(json_get_raw(rv, "merged"), "winner")
+    // billing/payments/ledger/invoicing/payroll/audit = long(>4); tax/fx = short -> long wins
+    let fails = ok("vote converged (winner=long)", str_eq(winner, "long"), fails)
+
+    // ── F) durable, inspectable work-tracking ──
+    let started: Int = worktrack_count_kind(corr, "worker.started")
+    let completed: Int = worktrack_count_kind(corr, "worker.completed")
+    let fails = ok("work-tracking journal: 8 started + 8 completed", (started == 8) && (completed == 8), fails)
+
+    print("")
+    if fails == 0 {
+        print("HARNESS GREEN — full local-swarm mechanics proven with seam=" + seam_mode())
+        return 0
+    }
+    print("HARNESS FAIL (" + int_to_str(fails) + ")")
+    return 1
+}

lang/swarm/tests/harness_real_cognition.el

@@ -0,0 +1,119 @@
+// harness_real_cognition.el — the LOCAL SWARM running REAL cognition.
+//
+// Run with: SWARM_PRIMITIVE_SEAM=decorated + the sandbox env sourced
+// (ENGRAM_URL=:8901). Each worker's `think` is BOUND to the reshape's proven
+// op_think (GET /api/think) over its NODE-ID anchor — real 768-dim gradients from
+// the live (isolated) geometry, not the stub. The @manager fans out N native-El
+// worker threads at real concurrency, converges (reduce + vote) over the real
+// cognition, enforces all three containment rules, observes afferent telemetry,
+// and work-tracks durably.
+//
+// Anchors are real self-neighbourhood node ids on the :8901 clone (free-text
+// anchors return "geometry unavailable", so these must be node ids).
+
+fn ok(label: String, cond: Bool, fails: Int) -> Int {
+    if cond { print("  ok    " + label); return fails }
+    print("  FAIL  " + label); return fails + 1
+}
+
+fn main() -> Int {
+    let fails = 0
+    print("== REAL-COGNITION LOCAL SWARM (seam=" + seam_mode() + ", engram=" + env("ENGRAM_URL") + ") ==")
+
+    // ── 0) direct proof the bound primitive returns REAL cognition ──
+    let g: String = op_think("self", "plan")
+    let dim: Int = json_get_int(g, "dim")
+    let nsup: Int = json_get_int(g, "n_support")
+    let fails = ok("bound op_think returns a real 768-dim gradient", dim == 768, fails)
+    let fails = ok("real gradient has support (n_support>0)", nsup > 0, fails)
+    let gfree: String = op_think("this-is-free-text-not-a-node", "reason")
+    let fails = ok("free-text anchor correctly refused (geometry unavailable)", str_contains(gfree, "geometry unavailable"), fails)
+
+    // ── the input set: 8 real NODE-ID anchors from self's neighbourhood ──
+    let anchors: String = "[\"a1000001-0000-0000-0000-000000000001\",\"5f011441-fa43-4fe7-a9c0-c78a584ef11d\",\"kn-5adecd7e-d6db-4576-87fe-6ef8a935cea6\",\"76d7fd0b-0672-4511-a2f5-a095cf9c60ae\",\"7027e302-593f-441d-8fd6-9c400c163108\",\"2a730b18-6566-46ee-a21e-4f4dd0380908\",\"46b0e4dd-2c19-48d2-bcbc-19f61d6c79ae\",\"9162cde8-8739-4f00-bfc9-2850ed612e50\"]"
+    let refs: String = "[\"self\"]"
+
+    // ── A) fan-out real cognition at concurrency, converge with REDUCE ──
+    let cfg_r: String = "{\"concurrency\":\"4\",\"strategy\":\"reduce\",\"min_success_ratio\":\"1.0\"}"
+    let rr: String = swarm_run("cognize", refs, anchors, cfg_r)
+    let fails = ok("swarm completed: 8 workers each a real think, concurrency=4", str_eq(json_get_string(rr, "status"), "completed"), fails)
+    let corr: String = json_get_string(rr, "corr_id")
+    let merged_r: String = json_get_raw(rr, "merged")
+    let fails = ok("reduce converged all 8 real-cognition outputs", str_to_int(json_get_string(merged_r, "count")) == 8, fails)
+    let acc: String = json_get_string(merged_r, "accumulated")
+    let fails = ok("converged output carries real gradient support (n_support)", str_contains(acc, "n_support"), fails)
+
+    // ── B) afferent telemetry: 8 real think-signals, decorated seam ──
+    let telem: String = json_get_raw(rr, "telemetry")
+    let aff: Int = str_to_int(json_get_string(telem, "afferent_think"))
+    let fails = ok("afferent counters = 8 real think invocations", aff == 8, fails)
+    let fails = ok("telemetry records seam_mode=decorated", str_eq(json_get_string(telem, "seam_mode"), "decorated"), fails)
+    let fails = ok("telemetry durably journalled", worktrack_count_kind(corr, "swarm.telemetry") == 1, fails)
+
+    // ── C) converge with VOTE over real cognition ──
+    let cfg_v: String = "{\"concurrency\":\"8\",\"strategy\":\"vote\",\"min_success_ratio\":\"1.0\"}"
+    let rv: String = swarm_run("cognize", refs, anchors, cfg_v)
+    let winner: String = json_get_string(json_get_raw(rv, "merged"), "winner")
+    let fails = ok("vote converged over real cognition (winner=" + winner + ")", !str_eq(winner, ""), fails)
+
+    // ── D) all three containment rules still enforced ──
+    let wt: String = containment_worker_token(corr, corr + "/worker-2")
+    let fails = ok("Rule 2: worker may not open a swarm", !str_eq(containment_check_open(wt), ""), fails)
+    let fails = ok("Rule 1: worker may not join another swarm", !str_eq(containment_check_join(wt, "s2"), ""), fails)
+    let fails = ok("Rule 3: worker->worker lateral edge rejected", !str_eq(containment_check_lateral(wt, "sib"), ""), fails)
+    let wcfg: String = json_set(cfg_r, "caller_token", wt)
+    let denied: String = swarm_run("cognize", refs, anchors, wcfg)
+    let fails = ok("Rule 2 enforced LIVE: worker-caller swarm denied", str_eq(json_get_string(denied, "status"), "denied"), fails)
+
+    // ── E) CCR scoping + non-leak over node-id anchors ──
+    let ctx: String = ccr_compile("cognize", refs, "a1000001-0000-0000-0000-000000000001", corr, corr + "/worker-0", wt)
+    let fails = ok("CCR context bounded within budget", ccr_within_budget(ctx), fails)
+    let leaks: Bool = str_contains(ctx, "9162cde8")
+    let fails = ok("CCR context does NOT leak sibling anchors", !leaks, fails)
+
+    // ── F) durable work-tracking ──
+    let started: Int = worktrack_count_kind(corr, "worker.started")
+    let completed: Int = worktrack_count_kind(corr, "worker.completed")
+    let fails = ok("work-tracking: 8 started + 8 completed", (started == 8) && (completed == 8), fails)
+
+    // ── G) RULE 4 — engram-write is @manager-ONLY (authority gate) ──
+    // A worker token (engram:read only) is STRUCTURALLY denied any engram write.
+    let worker_tok: String = containment_worker_token(corr, corr + "/worker-1")
+    let orch_tok: String = containment_coordinator_token(corr)
+    let fails = ok("worker token carries engram:read", containment_has_cap(worker_tok, "engram:read"), fails)
+    let fails = ok("worker token does NOT carry engram:write", !containment_has_cap(worker_tok, "engram:write"), fails)
+    let fails = ok("orchestrator token carries engram:write", containment_has_cap(orch_tok, "engram:write"), fails)
+    // a worker attempting an engram write is DENIED BY CAPABILITY (no HTTP issued)
+    let wdeny: String = swarm_engram_write(worker_tok, corr, "worker tries to mutate global state", "memory", 0.5)
+    let denied_reason: String = json_get_string(wdeny, "denied")
+    let fails = ok("worker engram-write DENIED by capability (Rule 4)", str_contains(denied_reason, "rule 4"), fails)
+    let fails = ok("denied worker write performed NO engram mutation (no node id)", str_eq(json_get_string(wdeny, "id"), ""), fails)
+    let fails = ok("Rule-4 violation journalled", worktrack_count_kind(corr, "containment.violation") >= 1, fails)
+    // the orchestrator passes the capability gate (sole authorized writer)
+    let odeny: String = containment_check_engram_write(orch_tok, "engram.write")
+    let fails = ok("orchestrator PASSES the engram-write capability gate (sole writer)", str_eq(odeny, ""), fails)
+
+    // ── H) curated merge = the only write path (orchestrator commits) ──
+    // The AUTHORITY gate above is already proven (worker denied, orchestrator
+    // authorized) WITHOUT issuing a write. The actual persisting commit exercises
+    // the engram write path, which needs the gate-1 write-healthy clone — so it
+    // runs only under SWARM_WRITE_HEALTHY=1 (else it would hit the known daemon
+    // write-crash). Authority != health: the gate holds either way.
+    if str_eq(env("SWARM_WRITE_HEALTHY"), "1") {
+        let cfg_commit: String = "{\"concurrency\":\"4\",\"strategy\":\"reduce\",\"min_success_ratio\":\"1.0\",\"commit\":\"1\"}"
+        let rc: String = swarm_run("cognize", refs, anchors, cfg_commit)
+        let committed: String = json_get_string(rc, "committed_node")
+        let fails2: Int = ok("orchestrator (sole writer) committed the merge to the engram", !str_eq(committed, ""), fails)
+        let fails = fails2
+    } else {
+        print("  note  curated-merge commit deferred to the gate-1 write-healthy clone (set SWARM_WRITE_HEALTHY=1); authority gate already proven above")
+    }
+
+    print("")
+    if fails == 0 {
+        print("REAL-COGNITION SWARM GREEN — Neuron thinking in parallel over its own geometry.")
+        return 0
+    }
+    print("REAL-COGNITION SWARM FAIL (" + int_to_str(fails) + ")")
+    return 1
+}

lang/swarm/tests/integ_engram.el

@@ -0,0 +1,45 @@
+// integ_engram.el — integration proof against a LIVE (isolated) engram.
+//
+// Run with the sandbox env sourced (ENGRAM_URL=http://127.0.0.1:8901,
+// ENGRAM_API_KEY=sbx-dev-swarm-ccr). Proves:
+//   (a) CCR retrieval pulls REAL content from the mind over HTTP;
+//   (b) a full swarm runs and converges against the live mind;
+//   (c) work-tracking mirrors records into the engram as SwarmTrack nodes.
+
+fn main() -> Int {
+    let url: String = env("ENGRAM_URL")
+    if str_eq(url, "") {
+        print("SKIP integ_engram (ENGRAM_URL not set)")
+        return 0
+    }
+
+    // (a) CCR compiles a bounded context whose retrieval hit the real mind.
+    let refs: String = "[\"Volatility-Based Decomposition\",\"Swarm Architecture containment\"]"
+    let wt: String = containment_worker_token("integ", "integ/w0")
+    let ctx: String = ccr_compile("analyze_item", refs, "decompose the billing module", "integ", "integ/w0", wt)
+    let knowledge: String = json_get_string(ctx, "knowledge")
+    let pulled_real: Bool = str_contains(knowledge, "olatility") || str_contains(knowledge, "Anderson") || str_contains(knowledge, "VBD")
+    if pulled_real {
+        print("  ok   CCR retrieval pulled real mind content (" + int_to_str(str_len(knowledge)) + " bytes, bounded)")
+    } else {
+        print("  FAIL CCR retrieval returned no mind content")
+    }
+    let bounded: Bool = ccr_within_budget(ctx)
+    if bounded { print("  ok   compiled context stayed within budget") } else { print("  FAIL context over budget") }
+
+    // (b) a real swarm over the live mind.
+    let inputs: String = "[\"billing\",\"payments\",\"ledger\"]"
+    let cfg: String = "{\"concurrency\":\"3\",\"strategy\":\"collect\",\"min_success_ratio\":\"1.0\"}"
+    let res: String = swarm_run("analyze_item", refs, inputs, cfg)
+    let status: String = json_get_string(res, "status")
+    if str_eq(status, "completed") { print("  ok   swarm completed against live engram") } else { print("  FAIL swarm status=" + status) }
+    let corr: String = json_get_string(res, "corr_id")
+
+    // (c) work-tracking mirrored into the mind: search for this swarm's records.
+    let hits: String = primitive_attend(corr, 5)
+    let mirrored: Bool = str_contains(hits, "swarm-track") || str_contains(hits, corr)
+    if mirrored { print("  ok   work-tracking mirrored into the engram (queryable)") } else { print("  note mirror not yet visible to search (async index)") }
+
+    print("DONE integ_engram corr=" + corr)
+    return 0
+}

lang/swarm/tests/test_convergence.el

@@ -0,0 +1,55 @@
+// test_convergence.el — convergence strategies + failure threshold / abort.
+
+fn assert_true(label: String, cond: Bool, fails: Int) -> Int {
+    if cond { print("  ok   " + label); return fails }
+    print("  FAIL " + label); return fails + 1
+}
+
+fn main() -> Int {
+    let fails = 0
+    let refs: String = "[]"
+
+    // ── vote: classify 5 inputs; 3 "long" (>4 chars) vs 2 "short" -> winner long ──
+    let inputs: String = "[\"alpha\",\"bravo\",\"hi\",\"charlie\",\"ok\"]"
+    let cfg_v: String = "{\"concurrency\":\"3\",\"strategy\":\"vote\",\"min_success_ratio\":\"1.0\"}"
+    let rv: String = swarm_run("classify", refs, inputs, cfg_v)
+    let merged_v: String = json_get_raw(rv, "merged")
+    let winner: String = json_get_string(merged_v, "winner")
+    let votes: Int = str_to_int(json_get_string(merged_v, "votes"))
+    let fails = assert_true("vote winner = long", str_eq(winner, "long"), fails)
+    let fails = assert_true("vote count = 3", votes == 3, fails)
+
+    // ── merge: outputs joined ──
+    let cfg_m: String = "{\"concurrency\":\"2\",\"strategy\":\"merge\",\"min_success_ratio\":\"1.0\"}"
+    let rm: String = swarm_run("analyze_item", refs, "[\"a\",\"b\",\"c\"]", cfg_m)
+    let merged_m: String = json_get_raw(rm, "merged")
+    let joined: String = json_get_string(merged_m, "merged")
+    let fails = assert_true("merge produced a joined string", str_contains(joined, "|"), fails)
+
+    // ── reduce: count accumulates ──
+    let cfg_r: String = "{\"concurrency\":\"4\",\"strategy\":\"reduce\",\"min_success_ratio\":\"1.0\"}"
+    let rr: String = swarm_run("analyze_item", refs, "[\"a\",\"b\",\"c\",\"d\"]", cfg_r)
+    let merged_r: String = json_get_raw(rr, "merged")
+    let rcount: Int = str_to_int(json_get_string(merged_r, "count"))
+    let fails = assert_true("reduce count = 4", rcount == 4, fails)
+
+    // ── failure threshold: 2 of 5 fail (x-prefixed); ratio 3/5=0.6 < 0.8 -> aborted ──
+    let fin: String = "[\"a\",\"xb\",\"c\",\"xd\",\"e\"]"
+    let cfg_f: String = "{\"concurrency\":\"5\",\"strategy\":\"collect\",\"min_success_ratio\":\"0.8\"}"
+    let rf: String = swarm_run("faildemo", refs, fin, cfg_f)
+    let fstatus: String = json_get_string(rf, "status")
+    let fails = assert_true("swarm aborted below min_success_ratio (0.6<0.8)", str_eq(fstatus, "aborted"), fails)
+    let corr_f: String = json_get_string(rf, "corr_id")
+    let failed_n: Int = worktrack_count_kind(corr_f, "worker.failed")
+    let aborted_n: Int = worktrack_count_kind(corr_f, "swarm.aborted")
+    let fails = assert_true("tracked 2 worker.failed", failed_n == 2, fails)
+    let fails = assert_true("tracked swarm.aborted", aborted_n == 1, fails)
+
+    // ── same failures tolerated when min_success_ratio=0.5 (0.6>=0.5) -> completed ──
+    let cfg_ok: String = "{\"concurrency\":\"5\",\"strategy\":\"collect\",\"min_success_ratio\":\"0.5\"}"
+    let rok: String = swarm_run("faildemo", refs, fin, cfg_ok)
+    let fails = assert_true("swarm completes when failures within tolerance", str_eq(json_get_string(rok, "status"), "completed"), fails)
+
+    if fails == 0 { print("PASS test_convergence"); return 0 }
+    print("FAIL test_convergence (" + int_to_str(fails) + ")"); return 1
+}

lang/swarm/tests/test_swarm.el

@@ -0,0 +1,75 @@
+// test_swarm.el — end-to-end proof of the swarm capability on native El threads.
+//
+// Proves: native-thread fan-out/converge, bounded concurrency, per-worker CCR
+// bounded context (with the security-boundary property), containment Rule 2
+// enforcement, and durable work-tracking.
+
+fn assert_true(label: String, cond: Bool, fails: Int) -> Int {
+    if cond {
+        print("  ok   " + label)
+        return fails
+    }
+    print("  FAIL " + label)
+    return fails + 1
+}
+
+fn main() -> Int {
+    let fails = 0
+
+    // ── 1) fan-out / converge (collect) over native threads ──
+    let inputs: String = "[\"alpha\",\"bravo\",\"charlie\",\"delta\",\"echo\"]"
+    let refs: String = "[]"
+    let cfg: String = "{\"concurrency\":\"2\",\"strategy\":\"collect\",\"min_success_ratio\":\"1.0\"}"
+    let res: String = swarm_run("analyze_item", refs, inputs, cfg)
+    let status: String = json_get_string(res, "status")
+    let fails = assert_true("swarm completed", str_eq(status, "completed"), fails)
+
+    let merged: String = json_get_raw(res, "merged")
+    let count: Int = json_array_len(merged)
+    let fails = assert_true("collect returned 5 results (bounded concurrency=2)", count == 5, fails)
+
+    // ── 2) work-tracking is durable + complete ──
+    let corr: String = json_get_string(res, "corr_id")
+    let started: Int = worktrack_count_kind(corr, "worker.started")
+    let completed: Int = worktrack_count_kind(corr, "worker.completed")
+    let created: Int = worktrack_count_kind(corr, "swarm.created")
+    let done: Int = worktrack_count_kind(corr, "swarm.completed")
+    let fails = assert_true("tracked 5 worker.started", started == 5, fails)
+    let fails = assert_true("tracked 5 worker.completed", completed == 5, fails)
+    let fails = assert_true("tracked swarm.created + swarm.completed", (created == 1) && (done == 1), fails)
+
+    // ── 3) CCR: bounded, minimal, non-leaking per-worker context ──
+    let wtoken: String = containment_worker_token(corr, corr + "/worker-0")
+    let ctx: String = ccr_compile("analyze_item", refs, "alpha", corr, corr + "/worker-0", wtoken)
+    let in_budget: Bool = ccr_within_budget(ctx)
+    let fails = assert_true("CCR context within token budget", in_budget, fails)
+    let this_input: String = json_get_string(ctx, "input")
+    let fails = assert_true("CCR context contains THIS worker's input", str_eq(this_input, "alpha"), fails)
+    // security boundary: a worker's compiled context must not carry a sibling input
+    let leaks_sibling: Bool = str_contains(ctx, "charlie")
+    let fails = assert_true("CCR context does NOT leak sibling inputs", !leaks_sibling, fails)
+
+    // ── 4) containment Rule 2: a worker may not open a swarm ──
+    let worker_caller_cfg: String = json_set(cfg, "caller_token", wtoken)
+    let denied: String = swarm_run("analyze_item", refs, inputs, worker_caller_cfg)
+    let dstatus: String = json_get_string(denied, "status")
+    let fails = assert_true("worker-token caller denied opening a swarm (Rule 2)", str_eq(dstatus, "denied"), fails)
+
+    // coordinator token IS allowed
+    let coord: String = containment_coordinator_token("some-corr")
+    let allow_reason: String = containment_check_open(coord)
+    let fails = assert_true("coordinator token allowed to open a swarm", str_eq(allow_reason, ""), fails)
+
+    // ── 5) containment Rule 3: no lateral worker->worker edge ──
+    let lateral: String = containment_check_lateral(wtoken, "some-sibling")
+    let fails = assert_true("lateral worker->worker edge rejected (Rule 3)", !str_eq(lateral, ""), fails)
+    let vertical: String = containment_check_lateral(wtoken, "")
+    let fails = assert_true("vertical worker->coordinator edge allowed", str_eq(vertical, ""), fails)
+
+    if fails == 0 {
+        print("PASS test_swarm")
+        return 0
+    }
+    print("FAIL test_swarm (" + int_to_str(fails) + " failures)")
+    return 1
+}

lang/swarm/tests/test_worktrack.el

@@ -0,0 +1,38 @@
+// test_worktrack.el — durability + inspectability of the work-tracking journal.
+
+fn main() -> Int {
+    let corr: String = "test-" + uuid_v4()
+
+    // record a swarm lifecycle
+    let p1: String = json_set("{}", "input_count", "3")
+    worktrack_append("swarm.created", corr, "swarm-1", p1)
+    worktrack_append("worker.started", corr, "worker-001", "{}")
+    worktrack_append("worker.started", corr, "worker-002", "{}")
+    worktrack_append("worker.completed", corr, "worker-001", "{}")
+    worktrack_append("worker.failed", corr, "worker-002", "{}")
+    worktrack_append("swarm.completed", corr, "swarm-1", "{}")
+
+    // inspect: reconstruct the report from the durable journal
+    let report: String = worktrack_swarm_report(corr)
+    print("report=" + report)
+
+    let recs_n: Int = el_list_len(worktrack_records(corr))
+    print("records=" + int_to_str(recs_n))
+
+    let state: String = json_get_string(report, "state")
+    let completed: Int = str_to_int(json_get_string(report, "workers_completed"))
+    let failed: Int = str_to_int(json_get_string(report, "workers_failed"))
+
+    if str_eq(state, "completed") {
+        if completed == 1 {
+            if failed == 1 {
+                if recs_n == 6 {
+                    print("PASS worktrack")
+                    return 0
+                }
+            }
+        }
+    }
+    print("FAIL worktrack")
+    return 1
+}

lang/swarm/worktrack.el

@@ -0,0 +1,217 @@
+// worktrack.el — full work-tracking for the swarm.
+//
+// "Intent all the way up, orchestrator at the top." Every unit of parallel
+// work a swarm fans out is recorded here: the swarm itself, each worker, its
+// status, its result summary, the convergence, and the final merged output —
+// all threaded by a single correlation ID so the entire execution graph can be
+// reconstructed and audited (Swarm Architecture §6.1).
+//
+// DURABILITY. Records are appended to a JSON-lines journal on disk. The journal
+// is append-only and single-writer: only the coordinator (the main thread, before
+// and after each fan-out and during convergence) writes to it. Workers never
+// touch it — they return structured results and the coordinator records them.
+// This is deliberate: it makes the tracking store race-free and, not
+// coincidentally, enforces Swarm containment rule 3 (no lateral worker state).
+//
+// INSPECTABILITY. The journal is plain JSONL — greppable, tailable, replayable.
+// worktrack_read() loads it back; worktrack_swarm_report() reconstructs a
+// swarm's full record from its correlation ID.
+//
+// ENGRAM MIRROR (optional). When ENGRAM_URL is set, each record is also mirrored
+// into the engram as a node (POST /api/node) tagged with the correlation ID, so
+// the swarm's execution becomes part of the durable mind, queryable by memory.
+//
+// Depends on: el_runtime.c builtins (fs_*, http_post, env, json_*, uuid_v4,
+// now_millis, str_*). No El-module concat dependencies of its own.
+
+// ── JSON helper ──────────────────────────────────────────────────────────────
+// json_set inserts its value as a RAW JSON fragment (objects/arrays/numbers).
+// json_set_str sets a plain STRING value, correctly quoted and escaped. Use
+// json_set for nested JSON, json_set_str for strings.
+fn json_set_str(j: String, key: String, val: String) -> String {
+    return json_set(j, key, "\"" + json_escape_string(val) + "\"")
+}
+
+// ── Journal location ─────────────────────────────────────────────────────────
+
+// worktrack_dir — directory holding the swarm journals.
+//   Override with SWARM_TRACK_DIR; defaults to ./.swarm-track (relative to CWD).
+fn worktrack_dir() -> String {
+    let d: String = env("SWARM_TRACK_DIR")
+    if str_eq(d, "") {
+        return ".swarm-track"
+    }
+    return d
+}
+
+// worktrack_journal_path — the JSONL journal file for one correlation ID.
+fn worktrack_journal_path(corr_id: String) -> String {
+    return worktrack_dir() + "/" + corr_id + ".jsonl"
+}
+
+// worktrack_init — ensure the journal directory exists. Idempotent.
+fn worktrack_init() -> Bool {
+    let d: String = worktrack_dir()
+    if fs_exists(d) {
+        return true
+    }
+    return fs_mkdir(d)
+}
+
+// ── Record construction ──────────────────────────────────────────────────────
+
+// worktrack_record — build one journal record as a JSON object string.
+//   kind:    the record kind (swarm.created, worker.started, ...)
+//   corr_id: the swarm correlation ID (links every record)
+//   subject: the entity the record is about (swarm id, worker id, "")
+//   payload: a JSON object string with kind-specific fields
+fn worktrack_record(kind: String, corr_id: String, subject: String, payload: String) -> String {
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "kind")
+    let kv = el_list_append(kv, kind)
+    let kv = el_list_append(kv, "corr_id")
+    let kv = el_list_append(kv, corr_id)
+    let kv = el_list_append(kv, "subject")
+    let kv = el_list_append(kv, subject)
+    let kv = el_list_append(kv, "ts_ms")
+    let kv = el_list_append(kv, int_to_str(now_millis()))
+    let rec: String = json_build_object(kv)
+    // Attach the payload as a nested raw JSON field.
+    let rec2: String = json_set(rec, "data", payload)
+    return rec2
+}
+
+// ── Journal append (single-writer, durable) ──────────────────────────────────
+
+// worktrack_append — append one record to the correlation journal (durable),
+// and mirror it to the engram if ENGRAM_URL is configured. Returns the record.
+//
+// fs_write here is used in append semantics: we read-modify-write the file. The
+// coordinator is the only writer, so this is safe and race-free.
+fn worktrack_append(kind: String, corr_id: String, subject: String, payload: String) -> String {
+    worktrack_init()
+    let rec: String = worktrack_record(kind, corr_id, subject, payload)
+    let path: String = worktrack_journal_path(corr_id)
+    let prior: String = ""
+    if fs_exists(path) {
+        let prior = fs_read(path)
+    }
+    let next: String = prior + rec + "\n"
+    fs_write(path, next)
+    worktrack_mirror_engram(rec, corr_id, kind, subject)
+    return rec
+}
+
+// worktrack_mirror_engram — best-effort mirror of a record into the engram.
+// No-op unless ENGRAM_URL is set. Failures are swallowed (tracking must not
+// depend on the mind being reachable).
+fn worktrack_mirror_engram(rec: String, corr_id: String, kind: String, subject: String) -> Bool {
+    // Opt-in: the durable substrate is the JSONL journal (always written). The
+    // engram mirror is an additional convenience, enabled with SWARM_MIRROR=1,
+    // so a swarm never depends on — or loads — the mind just to track its work.
+    if str_eq(env("SWARM_MIRROR"), "1") {
+        // enabled — fall through to the mirror POST
+        let _go: Int = 1
+    } else {
+        return false
+    }
+    let url: String = env("ENGRAM_URL")
+    if str_eq(url, "") {
+        return false
+    }
+    let content: String = "swarm-track " + kind + " " + subject + " :: " + rec
+    let body_kv: [String] = el_list_empty()
+    let body_kv = el_list_append(body_kv, "content")
+    let body_kv = el_list_append(body_kv, content)
+    let body_kv = el_list_append(body_kv, "node_type")
+    let body_kv = el_list_append(body_kv, "SwarmTrack")
+    let body_kv = el_list_append(body_kv, "salience")
+    let body_kv = el_list_append(body_kv, "0.5")
+    let body: String = json_build_object(body_kv)
+    let key: String = env("ENGRAM_API_KEY")
+    let body2: String = json_set_str(body, "_auth", key)
+    let resp: String = http_post(url + "/api/nodes", body2)
+    return true
+}
+
+// ── Read / inspect ───────────────────────────────────────────────────────────
+
+// worktrack_read — read the raw JSONL journal for a correlation ID.
+fn worktrack_read(corr_id: String) -> String {
+    let path: String = worktrack_journal_path(corr_id)
+    if fs_exists(path) {
+        return fs_read(path)
+    }
+    return ""
+}
+
+// worktrack_records — the journal as a [String] of record JSON objects, in order.
+fn worktrack_records(corr_id: String) -> [String] {
+    let raw: String = worktrack_read(corr_id)
+    let out: [String] = el_list_empty()
+    if str_eq(raw, "") {
+        return out
+    }
+    let lines: [String] = str_split_lines(raw)
+    let n: Int = el_list_len(lines)
+    let i = 0
+    while i < n {
+        let ln: String = el_list_get(lines, i)
+        if str_eq(ln, "") {
+            let i = i + 1
+        } else {
+            let out = el_list_append(out, ln)
+            let i = i + 1
+        }
+    }
+    return out
+}
+
+// worktrack_count_kind — how many records of a given kind exist for a swarm.
+// Powers assertions and live status ("how many workers completed").
+fn worktrack_count_kind(corr_id: String, kind: String) -> Int {
+    let recs: [String] = worktrack_records(corr_id)
+    let n: Int = el_list_len(recs)
+    let c = 0
+    let i = 0
+    while i < n {
+        let r: String = el_list_get(recs, i)
+        let k: String = json_get_string(r, "kind")
+        if str_eq(k, kind) {
+            let c = c + 1
+        }
+        let i = i + 1
+    }
+    return c
+}
+
+// worktrack_swarm_report — reconstruct a compact status report for a swarm from
+// its journal: counts of started/completed/failed workers and terminal state.
+// Inspectable, durable, derived purely from the append-only record.
+fn worktrack_swarm_report(corr_id: String) -> String {
+    let started: Int = worktrack_count_kind(corr_id, "worker.started")
+    let completed: Int = worktrack_count_kind(corr_id, "worker.completed")
+    let failed: Int = worktrack_count_kind(corr_id, "worker.failed")
+    let done: Int = worktrack_count_kind(corr_id, "swarm.completed")
+    let aborted: Int = worktrack_count_kind(corr_id, "swarm.aborted")
+    let state: String = "running"
+    if aborted > 0 {
+        let state = "aborted"
+    } else {
+        if done > 0 {
+            let state = "completed"
+        }
+    }
+    let kv: [String] = el_list_empty()
+    let kv = el_list_append(kv, "corr_id")
+    let kv = el_list_append(kv, corr_id)
+    let kv = el_list_append(kv, "state")
+    let kv = el_list_append(kv, state)
+    let kv = el_list_append(kv, "workers_started")
+    let kv = el_list_append(kv, int_to_str(started))
+    let kv = el_list_append(kv, "workers_completed")
+    let kv = el_list_append(kv, int_to_str(completed))
+    let kv = el_list_append(kv, "workers_failed")
+    let kv = el_list_append(kv, int_to_str(failed))
+    return json_build_object(kv)
+}

tools/neuron-sandbox/README.md

@@ -0,0 +1,118 @@
+# nsbx — the Neuron Sandbox
+
+**Dev environment as a primitive.** A reproducible way to run experiments *and code
+changes* against the **real** engram runtime on an isolated snapshot of the live
+mind — with a gated promote-to-prod path built on the proven rails.
+
+Everyone (Tim, any team member, any agent) gets their own private, safe copy of the
+mind to build against. **Prod — the live Neuron on `:8742` (engram) / `:7770`
+(soul) — is untouchable from a sandbox.** A sandbox runs a *separate* engram
+process, on a *separate* port, against a *separate* clone of the store. The only op
+that can ever reach prod is `promote`, which is explicit, gated, and per-use
+approved.
+
+It **wraps the real engram binary** — it never reimplements any engram logic. It
+generalises two proven proto-sandboxes into one primitive:
+
+- the **cog-arch** build — isolated git worktree + build + clone of the live `.egm` + real C tests
+- the **store-fix** cutover — secondary soul + launchctl `bootout → settle → bootstrap` rails
+
+## Quickstart
+
+```bash
+export PATH="$PWD:$PATH"          # or symlink nsbx onto your PATH
+
+nsbx up                          # your private copy of the mind (auto-named <user>-dev)
+nsbx run <name> api /api/stats   # poke it
+nsbx validate <name>             # prove it: zero-loss, reboot, RSS, retrieval, keystones
+nsbx destroy <name>              # cheap teardown; live untouched
+```
+
+That is the whole loop. Sane defaults: stock prod binary, auto-allocated port
+(`8900+`, never `8742`/`7770`), snapshot of the live store.
+
+## The code-change dev loop (first-class)
+
+Run *your changed runtime*, not just the stock binary, against a snapshot:
+
+```bash
+# build a runtime from a working tree, a git branch, or a prebuilt binary:
+nsbx create feat --source /path/to/worktree           # elc + cc build from source
+nsbx create feat --branch feat/my-change --repo <r>   # worktree the branch, then build
+nsbx create feat --binary /path/to/engram             # use a prebuilt binary
+
+nsbx build feat --source /path/to/worktree            # rebuild + hot-restart in place
+nsbx validate feat                                    # prove the change is safe
+nsbx promote feat --i-approve-prod-cutover            # gated rails cutover (see below)
+```
+
+The build replicates the engram release recipe exactly:
+`elc engram/src/server.el > engram.c` then
+`cc -std=c11 -O2 -I lang/runtime engram.c el_runtime.c engram_*.c -lcurl -lpthread`.
+
+## Lifecycle
+
+| op | what it does |
+|----|--------------|
+| `create <name> [--port N] [--source\|--branch\|--binary]` | consistent snapshot of the live store+WAL+config into an isolated dir; place or **build** the runtime; boot the real engram daemon on an isolated port. Named, versioned (binary sha + egm sha in `manifest.json`), reproducible. |
+| `up [name]` | one command: create-if-missing then start; prints the URL. |
+| `build <name> --source\|--branch` | rebuild the runtime from a code change and hot-restart on the same clone+port. |
+| `run <name> <cmd…>` / `run <name> api <path> [json]` | run an experiment against the real runtime; capture output + before/after stats + wall time. Env: `$SBX_URL $SBX_PORT $SBX_KEY $SBX_DATA $SBX_BIN`. |
+| `validate <name>` | the rails as first-class checks (below). |
+| `promote <name> [--data] [--i-approve-prod-cutover]` | **the only prod-touching op.** Gated rails cutover. DRY-RUN plan unless approved. |
+| `destroy <name>` | stop the isolated daemon, free the port, remove the clone. Live untouched. |
+| `list` / `status <name>` | inspect. |
+
+## `validate` — the rails as checks
+
+- **zero-loss-under-load** — node/edge counts hold at/above baseline through ~15s of sustained tick+read load
+- **reboot-prove** — counts survive a real stop→start of the daemon
+- **rss-bound** — daemon RSS under `NSBX_RSS_BOUND_MB` (default 550 MB, from the store-fix reboot-proof)
+- **retrieval-parity** — top-k node ids for a fixed probe set match the create-time baseline
+- **keystone-integrity** — `kn-efeb4a5b…` and `kn-5b606390…` present and intact
+
+A PASS writes `validate.json` stamped with the binary sha; `promote` refuses unless
+the current binary has a fresh PASS on record.
+
+## `promote` — gated cutover (rails only)
+
+Default is a **dry-run plan**. With `--i-approve-prod-cutover` it, in order:
+
+1. **snapshot-first** — back up live `egm`+`wal`+`plist` to `~/.neuron/backups/promote-<name>-<ts>/` with a `rollback.txt`
+2. **additive** binary install — copy the validated binary to a *new* file, update the plist `ENGRAM_REAL_BIN` (old binary retained — additive/supersede, never destructive)
+3. **rails cutover** — `launchctl bootout` → **settle-poll** (prints until the job is gone) → `launchctl bootstrap`. Never `pkill`, never `kickstart -k`.
+4. **verify** — `/api/stats` returns, edges ≥ baseline, keystones intact
+5. **auto-rollback armed** — any verify failure restores the plist (and data, if `--data`) and boots the prior binary back via the same rails
+
+## Isolation guarantees
+
+- separate **port** (`8900+`; refuses `8742`/`7770`), separate **store clone**, separate **process**
+- a hard guard refuses to boot a sandbox daemon whose data dir resolves to the live store
+- sandboxes are plain supervised background processes (not launchd), so teardown is a signal + settle-poll — it can never touch the prod launchd job
+- prod is read exactly twice: once for the snapshot, and (only if you approve) during `promote`
+
+## Layout
+
+- tool: `tools/neuron-sandbox/nsbx` (this repo, branch `feat/neuron-sandbox`)
+- runtime state: `~/.neuron/sandboxes/<name>/` — `data/` (clone), `bin/engram`, `build/`, `logs/`, `manifest.json`, `validate.json`, `baseline/`
+
+## Validated (dogfood)
+
+Standing up a sandbox from a live-store clone and reproducing a **known** result:
+
+- **retrieval-parity 25/25** top-k id overlap vs baseline; sandbox boot-stats exactly matched the live baseline captured at snapshot time (10 672 nodes / 32 439 edges) — the wrapped real binary faithfully reloads the live mind
+- reboot-prove + zero-loss PASS; RSS 379 MB < 550 MB; keystones intact
+- the **cog-arch correspondence-loop** re-run *inside* the sandbox reproduced the known calibration numbers exactly: held-Brier **0.028648 → 0.000586** (98.0% reduction), monotone, **reboot bit-identical**, metastability holds; and the real-store Stance persistence reboot-proved at **10 994-node** scale (`think()` on real 768-dim embeddings) against a scratch copy of the sandbox's own clone — never live
+- `promote` dry-run refused to touch prod; teardown freed the port; live `:8742`/`:7770` never perturbed (soul uptime unbroken)
+
+## Migrating existing experiments
+
+Each ad-hoc harness becomes `nsbx run <name> …` (or `--source` build) against a sandbox:
+
+- **cog-arch** — `nsbx create x --source <worktree>` then `nsbx run x -- bash cogarch_dogfood.sh` (compiles + runs the real C cognition tests against `$SBX_DATA`)
+- **codec / ingest / faculty** — `nsbx run x api /api/<endpoint> '<json>'` against the isolated daemon, or a script using `$SBX_URL`/`$SBX_KEY`; measure with the built-in before/after stats
+
+## Env knobs
+
+`NSBX_ROOT`, `NSBX_PORT_BASE`, `NSBX_RSS_BOUND_MB`, `NSBX_REMERGE_THRESHOLD`,
+`EL_REPO` (for `elc` + runtime sources), `ENGRAM_LIVE_DATA_DIR`, `ENGRAM_LIVE_PLIST`.

tools/neuron-sandbox/examples/cogarch-dogfood.sh

@@ -0,0 +1,30 @@
+#!/usr/bin/env bash
+# cog-arch correspondence-loop dogfood — RUN INSIDE the sandbox via `nsbx run`.
+# Compiles the REAL engram C runtime + cognition tests and reproduces the known
+# calibration result (memory 194c69c8): held-Brier 0.028648 -> 0.000586, reboot-proven,
+# then reboot-proves the Stance persistence against a SCRATCH COPY of THIS sandbox's
+# clone of the real store (never live, never the running daemon's file).
+set -euo pipefail
+WT="${COGARCH_WT:-/private/tmp/claude-501/-Users-will/6531446d-bc27-4095-930b-e04777c3db4f/scratchpad/cogarch-wt}"
+RT="$WT/lang/runtime"; T="$WT/engram/test"
+: "${SBX_DATA:?run me via: nsbx run <name> -- bash cogarch_dogfood.sh}"
+B="$(mktemp -d)"
+echo "### building cog-arch tests against the real engram runtime sources"
+cc -std=c11 -O2 -w -I "$RT" -o "$B/test_cognition" \
+   "$T/test_cognition.c" "$RT/engram_cognition.c" "$RT/engram_reason.c" \
+   "$RT/engram_geometry.c" "$RT/engram_store.c" "$RT/engram_vindex.c" -lm
+cc -std=c11 -O2 -w -I "$RT" -o "$B/test_realstore" \
+   "$T/test_cognition_realstore.c" "$RT/engram_cognition.c" "$RT/engram_reason.c" \
+   "$RT/engram_geometry.c" "$RT/engram_store.c" "$RT/engram_vindex.c" -lm
+
+echo; echo "### [A] synthetic correspondence-loop (known: Brier 0.028648 -> 0.000586)"
+"$B/test_cognition" | grep -E "held-Brier|reduction|reboot|monotone|metastab|RESULT" || true
+
+echo; echo "### [B] reboot-prove Stance on a SCRATCH COPY of this sandbox's real-store clone"
+SCRATCH="$B/store-clone"; mkdir -p "$SCRATCH"
+cp -p "$SBX_DATA/neuron.egm" "$SCRATCH/" 2>/dev/null || true
+cp -p "$SBX_DATA/neuron.wal" "$SCRATCH/" 2>/dev/null || true
+cp -p "$SBX_DATA/conf" "$SCRATCH/" 2>/dev/null || true
+cp -p "$SBX_DATA/meta.json" "$SCRATCH/" 2>/dev/null || true
+"$B/test_realstore" "$SCRATCH" || true
+rm -rf "$B"

tools/neuron-sandbox/nsbx

@@ -0,0 +1,663 @@
+#!/usr/bin/env bash
+# nsbx — the Neuron Sandbox: a reproducible primitive for running experiments and
+# code changes against the REAL engram runtime on an isolated snapshot of the live
+# mind, with a gated promote-to-prod path built on the proven rails.
+#
+# It WRAPS the real engram binary — it never reimplements any engram logic. The only
+# prod-touching op is `promote`, which is explicit, gated, and per-use approved.
+#
+# Generalises two proven proto-sandboxes:
+#   - the cog-arch build   (isolated git worktree + build + clone of live .egm + real C tests)
+#   - the store-fix cutover (secondary soul + launchctl bootout->settle->bootstrap rails)
+#
+# Lifecycle:  create -> [build] -> run -> validate -> promote(gated) -> destroy
+#
+# Rails (always): built offline; NEVER auto-promotes; never touches live :8742/:7770
+# except READ for the snapshot and the gated promote; snapshot-first; honest measured
+# reporting. Cutover is launchctl bootout -> settle-poll -> bootstrap ONLY —
+# never pkill, never kickstart -k.
+set -uo pipefail
+
+# ---------------------------------------------------------------- constants ----
+LIVE_DATA_DIR="${ENGRAM_LIVE_DATA_DIR:-$HOME/.neuron/engram}"
+LIVE_PLIST="${ENGRAM_LIVE_PLIST:-$HOME/Library/LaunchAgents/ai.neuron.engram.plist}"
+LIVE_LABEL="ai.neuron.engram"
+LIVE_BIND_PORT=8742          # engram — FORBIDDEN for sandboxes
+SOUL_PORT=7770               # soul   — FORBIDDEN for sandboxes
+LIVE_KEY="${ENGRAM_API_KEY:-ntn-user-2026}"
+LIVE_URL="http://127.0.0.1:${LIVE_BIND_PORT}"
+SBX_ROOT="${NSBX_ROOT:-$HOME/.neuron/sandboxes}"
+BACKUP_ROOT="$HOME/.neuron/backups"
+EL_REPO="${EL_REPO:-$HOME/Development/neuron-technologies/foundation/el}"
+PORT_BASE="${NSBX_PORT_BASE:-8900}"
+RSS_BOUND_MB="${NSBX_RSS_BOUND_MB:-550}"      # from store-fix reboot-proof (aaf13f88)
+REMERGE_THRESHOLD="${NSBX_REMERGE_THRESHOLD:-40000}"
+KEYSTONES=( "kn-efeb4a5b-5aff-4759-8a97-7233099be6ee" "kn-5b606390-a52d-4ca2-8e0e-eba141d13440" )
+# fixed probe set for retrieval-parity (stable, identity-anchored)
+PARITY_QUERIES=( "who am I" "self identity core" "engram store durability" "keystone self anchor" "grounding honesty" )
+
+C_RED=$'\033[31m'; C_GRN=$'\033[32m'; C_YEL=$'\033[33m'; C_DIM=$'\033[2m'; C_BLD=$'\033[1m'; C_0=$'\033[0m'
+
+# ---------------------------------------------------------------- helpers ------
+die(){ printf '%serror:%s %s\n' "$C_RED" "$C_0" "$*" >&2; exit 1; }
+log(){ printf '%s==>%s %s\n' "$C_BLD" "$C_0" "$*" >&2; }
+info(){ printf '    %s\n' "$*" >&2; }
+ok(){   printf '    %s%s%s\n' "$C_GRN" "$*" "$C_0" >&2; }
+warn(){ printf '    %s%s%s\n' "$C_YEL" "$*" "$C_0" >&2; }
+need(){ command -v "$1" >/dev/null 2>&1 || die "missing dependency: $1"; }
+now(){ date -u +%Y%m%dT%H%M%SZ; }
+sha(){ shasum -a 256 "$1" 2>/dev/null | awk '{print $1}'; }
+epoch(){ python3 -c 'import time;print(time.time())'; }
+
+sdir(){ printf '%s/%s' "$SBX_ROOT" "$1"; }
+manifest(){ printf '%s/manifest.json' "$(sdir "$1")"; }
+mexists(){ [ -f "$(manifest "$1")" ]; }
+mget(){ # mget <name> <jsonpath>
+  python3 -c "import json,sys; d=json.load(open('$(manifest "$1")')); print(d$2)" 2>/dev/null
+}
+
+port_free(){ ! (exec 3<>"/dev/tcp/127.0.0.1/$1") 2>/dev/null; }
+alloc_port(){
+  local p="$PORT_BASE"
+  while :; do
+    if [ "$p" = "$LIVE_BIND_PORT" ] || [ "$p" = "$SOUL_PORT" ]; then p=$((p+1)); continue; fi
+    if port_free "$p" && ! _port_claimed "$p"; then echo "$p"; return 0; fi
+    p=$((p+1)); [ "$p" -gt 9100 ] && die "no free sandbox port in range"
+  done
+}
+_port_claimed(){ # is another sandbox already assigned this port?
+  local p="$1" d
+  for d in "$SBX_ROOT"/*/manifest.json; do
+    [ -f "$d" ] || continue
+    [ "$(python3 -c "import json;print(json.load(open('$d'))['port'])" 2>/dev/null)" = "$p" ] && return 0
+  done
+  return 1
+}
+
+live_stats(){ curl -s -m5 "$LIVE_URL/api/stats" 2>/dev/null; }
+api(){ # api <name> <path> [json-body]
+  local name="$1" path="$2" body="${3:-}"
+  local port; port="$(mget "$name" "['port']")"; [ -n "$port" ] || die "unknown sandbox: $name"
+  local url="http://127.0.0.1:${port}${path}"
+  if [ -n "$body" ]; then curl -s -m30 -X POST -H 'Content-Type: application/json' -d "$body" "$url"
+  else curl -s -m30 "$url"; fi
+}
+sbx_stats(){ api "$1" "/api/stats"; }
+stat_field(){ printf '%s' "$1" | sed -n "s/.*\"$2\":\([0-9]*\).*/\1/p"; }
+
+daemon_pid(){ local f; f="$(sdir "$1")/daemon.pid"; [ -f "$f" ] && cat "$f" || true; }
+daemon_alive(){ local p; p="$(daemon_pid "$1")"; [ -n "$p" ] && kill -0 "$p" 2>/dev/null; }
+
+# ---------------------------------------------------------------- elc/build ----
+find_elc(){
+  command -v elc 2>/dev/null && return 0
+  local arch; arch="$(uname -m)"
+  case "$arch" in
+    arm64) echo "$EL_REPO/lang/dist/platform/elc-darwin-arm64";;
+    x86_64) echo "$EL_REPO/lang/dist/platform/elc-linux-amd64";;
+    *) echo "$EL_REPO/lang/dist/platform/elc";;
+  esac
+}
+
+# _build_binary <src_tree> <out_bin> <build_log_dir>
+# Replicates the proven engram release recipe:
+#   elc engram/src/server.el > engram.c
+#   cc -std=c11 -O2 -I lang/runtime engram.c el_runtime.c engram_*.c -lcurl -lpthread
+_build_binary(){
+  local src="$1" out="$2" blog="$3"
+  local elc server rt
+  elc="$(find_elc)"; [ -x "$elc" ] || die "elc not found/executable: $elc (set EL_REPO)"
+  server="$src/engram/src/server.el"; rt="$src/lang/runtime"
+  [ -f "$server" ] || die "no engram/src/server.el under source tree: $src"
+  [ -f "$rt/el_runtime.c" ] || die "no lang/runtime/el_runtime.c under source tree: $src (this branch may keep it generated/untracked)"
+  ls "$rt"/engram_*.c >/dev/null 2>&1 || die "no lang/runtime/engram_*.c engine sources under: $src"
+  mkdir -p "$blog"
+  log "build: elc transpile server.el -> engram.c"
+  "$elc" "$server" > "$blog/engram.c" 2>"$blog/elc.err" || { cat "$blog/elc.err" >&2; die "elc transpile failed"; }
+  info "engram.c: $(wc -c <"$blog/engram.c" | tr -d ' ') bytes"
+  log "build: cc link (el_runtime + engram_* engine)"
+  cc -std=c11 -O2 -w -I "$rt" -o "$out" \
+     "$blog/engram.c" "$rt/el_runtime.c" "$rt"/engram_*.c \
+     -lcurl -lpthread 2>"$blog/cc.err" \
+     || { grep -i 'error:' "$blog/cc.err" | sort -u | head >&2; die "cc link failed (see $blog/cc.err)"; }
+  ok "built: $out ($(ls -lh "$out" | awk '{print $5}'), sha $(sha "$out" | cut -c1-12))"
+}
+
+# ---------------------------------------------------------------- daemon -------
+# start_daemon <name> : boots the sandbox's real engram binary on its isolated
+# port against its cloned data dir, with the SAME auto-remerge net the live soul
+# uses (so the sandbox faithfully reaches the live edge population on boot).
+start_daemon(){
+  local name="$1" d; d="$(sdir "$name")"
+  daemon_alive "$name" && { info "already running (pid $(daemon_pid "$name"))"; return 0; }
+  local port bin data export key
+  port="$(mget "$name" "['port']")"; bin="$d/bin/engram"; data="$d/data"
+  key="sbx-$name"; export="$data/.scan-export.reseed-clean.json"
+  [ -x "$bin" ] || die "sandbox binary missing: $bin"
+  [ "$port" != "$LIVE_BIND_PORT" ] && [ "$port" != "$SOUL_PORT" ] || die "refusing forbidden port $port"
+  [ -f "$data/neuron.egm" ] || die "sandbox has no cloned store: $data/neuron.egm"
+  # HARD guard: never point a sandbox daemon at the live data dir.
+  [ "$(cd "$data" && pwd -P)" != "$(cd "$LIVE_DATA_DIR" && pwd -P)" ] || die "refusing: sandbox data dir resolves to LIVE store"
+
+  log "boot engram on isolated :$port (data=$data)"
+  (
+    ENGRAM_DATA_DIR="$data" ENGRAM_BIND=":$port" ENGRAM_API_KEY="$key" \
+    ENGRAM_STORE=1 ENGRAM_CHRONOCEPTION=1 ENGRAM_SELF_REIFY=1 ENGRAM_GC=1 \
+    ENGRAM_POOL_FRAMES=16384 ENGRAM_WRITE_BARRIER=1 \
+    exec "$bin"
+  ) >"$d/logs/daemon.log" 2>&1 &
+  local pid=$!
+  echo "$pid" > "$d/daemon.pid"
+  # readiness poll
+  local url="http://127.0.0.1:$port" i s
+  for i in $(seq 1 30); do
+    s="$(curl -s -m3 "$url/api/stats" 2>/dev/null)"
+    [ -n "$s" ] && break; sleep 0.5
+  done
+  [ -n "$s" ] || { warn "daemon did not become ready (see $d/logs/daemon.log)"; return 1; }
+  ok "ready pid=$pid  boot-stats: $s"
+  # auto-remerge net (idempotent): match live edge population if the export is present
+  if [ -f "$export" ]; then
+    local edges; edges="$(stat_field "$s" edge_count)"
+    if [ -n "$edges" ] && [ "$edges" -lt "$REMERGE_THRESHOLD" ]; then
+      log "auto-remerge: booted with $edges edges (< $REMERGE_THRESHOLD) — merging full edge export"
+      local r; r="$(curl -s -m300 -X POST -H 'Content-Type: application/json' \
+             -d "{\"_auth\":\"$key\",\"path\":\"$export\"}" "$url/api/load-merge" 2>/dev/null)"
+      info "remerge resp: ${r:0:120}"
+      ok "post-remerge stats: $(curl -s -m5 "$url/api/stats")"
+    fi
+  fi
+  return 0
+}
+
+# stop_daemon <name> : graceful TERM + settle-poll until the port is free.
+# (Sandbox daemons are plain supervised bg processes — not launchd — so teardown
+# is a signal + poll, never pkill of anything else.)
+stop_daemon(){
+  local name="$1" pid port
+  pid="$(daemon_pid "$name")"; port="$(mget "$name" "['port']")"
+  [ -n "$pid" ] || { info "not running"; return 0; }
+  log "stop daemon pid=$pid, settle-poll until :$port frees"
+  kill "$pid" 2>/dev/null || true
+  local i
+  for i in $(seq 1 40); do
+    kill -0 "$pid" 2>/dev/null || { port_free "$port" && { ok "stopped, port $port free"; : >"$(sdir "$name")/daemon.pid"; return 0; }; }
+    printf '.' >&2; sleep 0.5
+  done
+  printf '\n' >&2
+  kill -9 "$pid" 2>/dev/null || true; sleep 1
+  : >"$(sdir "$name")/daemon.pid"
+  port_free "$port" && ok "stopped (after SIGKILL), port $port free" || warn "port $port still busy"
+}
+
+# ================================================================ create =======
+cmd_create(){
+  local name="" port="" src="" branch="" repo="$EL_REPO" binpath=""
+  # first positional arg is the name unless it's a flag; default to "<user>-dev"
+  if [ $# -gt 0 ] && [ "${1#-}" = "$1" ]; then name="$1"; shift; else name="${USER:-dev}-dev"; fi
+  while [ $# -gt 0 ]; do case "$1" in
+    --port) port="$2"; shift 2;;
+    --source) src="$2"; shift 2;;
+    --branch) branch="$2"; shift 2;;
+    --repo) repo="$2"; shift 2;;
+    --binary) binpath="$2"; shift 2;;
+    *) die "unknown flag: $1";;
+  esac; done
+  mexists "$name" && die "sandbox '$name' already exists (destroy it first)"
+  need curl; need python3; need shasum
+  [ -f "$LIVE_DATA_DIR/neuron.egm" ] || die "live store not found: $LIVE_DATA_DIR/neuron.egm"
+  if [ -n "$port" ]; then
+    { [ "$port" = "$LIVE_BIND_PORT" ] || [ "$port" = "$SOUL_PORT" ]; } && die "refusing forbidden port $port (live)"
+    port_free "$port" || die "port $port already in use"
+  else port="$(alloc_port)"; fi
+
+  local d; d="$(sdir "$name")"
+  mkdir -p "$d/data" "$d/bin" "$d/logs" "$d/build" "$d/baseline"
+  log "sandbox '$name' at $d  (isolated port $port)"
+
+  # ---- CONSISTENT snapshot of the live mind (file-copy: same set the rails backup
+  #      uses; WAL replay on sandbox boot reconciles the tail -> crash-consistent) ----
+  log "snapshot live store -> clone (store + WAL + config)"
+  local f
+  for f in neuron.egm neuron.wal conf meta.json self_anchor .scan-export.reseed-clean.json; do
+    if [ -e "$LIVE_DATA_DIR/$f" ]; then cp -p "$LIVE_DATA_DIR/$f" "$d/data/$f"; info "cloned $f ($(du -h "$d/data/$f" | awk '{print $1}'))"; fi
+  done
+  local egm_sha; egm_sha="$(sha "$d/data/neuron.egm")"
+
+  # ---- capture live baseline (READ only) ----
+  local lstats; lstats="$(live_stats)"
+  local base_nodes base_edges
+  base_nodes="$(stat_field "$lstats" node_count)"; base_edges="$(stat_field "$lstats" edge_count)"
+  info "live baseline stats: ${lstats:-<unavailable>}"
+
+  # ---- determine + place the runtime binary (versioned into the snapshot) ----
+  local source_desc live_bin
+  live_bin="$(_live_real_bin)"
+  if [ -n "$binpath" ]; then
+    [ -x "$binpath" ] || die "not an executable binary: $binpath"
+    cp -p "$binpath" "$d/bin/engram"; source_desc="prebuilt:$binpath"
+  elif [ -n "$src" ]; then
+    _build_binary "$src" "$d/bin/engram" "$d/build"; source_desc="source:$src"
+  elif [ -n "$branch" ]; then
+    log "worktree: $repo @ $branch -> $d/build/worktree"
+    git -C "$repo" worktree add --detach "$d/build/worktree" "$branch" >/dev/null 2>&1 \
+      || die "git worktree add failed ($repo @ $branch)"
+    _build_binary "$d/build/worktree" "$d/bin/engram" "$d/build"; source_desc="branch:$branch@$repo"
+  else
+    [ -x "$live_bin" ] || die "cannot resolve live ENGRAM_REAL_BIN: $live_bin"
+    cp -p "$live_bin" "$d/bin/engram"; source_desc="stock-prod:$live_bin"
+  fi
+  local bin_sha; bin_sha="$(sha "$d/bin/engram")"
+  info "runtime: $source_desc  (sha ${bin_sha:0:12})"
+
+  # ---- write manifest ----
+  python3 - "$name" "$port" "$source_desc" "$bin_sha" "$egm_sha" "$base_nodes" "$base_edges" "$(sha "$live_bin" 2>/dev/null)" <<'PY' > "$(manifest "$name")"
+import json,sys,datetime
+name,port,src,binsha,egmsha,bn,be,livebinsha=sys.argv[1:9]
+json.dump({
+ "name":name,"port":int(port),"created_at":datetime.datetime.now(datetime.timezone.utc).isoformat(),
+ "source":src,"binary_sha256":binsha,"clone_egm_sha256":egmsha,
+ "live_binary_sha256":livebinsha,
+ "live_baseline":{"node_count":int(bn or 0),"edge_count":int(be or 0)},
+ "keystones":["kn-efeb4a5b-5aff-4759-8a97-7233099be6ee","kn-5b606390-a52d-4ca2-8e0e-eba141d13440"]
+}, sys.stdout, indent=2)
+PY
+  ok "manifest written"
+
+  # ---- boot + capture the sandbox's own settled baseline (reproducible target) ----
+  start_daemon "$name" || die "daemon failed to start"
+  local sstats; sstats="$(sbx_stats "$name")"
+  local sbn sbe; sbn="$(stat_field "$sstats" node_count)"; sbe="$(stat_field "$sstats" edge_count)"
+  _capture_retrieval "$name" "$d/baseline/retrieval.json"
+  # fold sandbox baseline into manifest
+  python3 - "$(manifest "$name")" "$sbn" "$sbe" <<'PY'
+import json,sys
+mf,bn,be=sys.argv[1],sys.argv[2],sys.argv[3]
+d=json.load(open(mf)); d["sbx_baseline"]={"node_count":int(bn or 0),"edge_count":int(be or 0)}
+json.dump(d,open(mf,'w'),indent=2)
+PY
+  log "created."
+  info "sandbox baseline (settled): nodes=$sbn edges=$sbe"
+  info "next: nsbx validate $name    |    nsbx run $name api /api/stats"
+}
+
+_live_real_bin(){
+  python3 - "$LIVE_PLIST" <<'PY' 2>/dev/null
+import sys,plistlib
+try:
+  d=plistlib.load(open(sys.argv[1],'rb'))
+  print(d.get("EnvironmentVariables",{}).get("ENGRAM_REAL_BIN",""))
+except Exception: print("")
+PY
+}
+
+_capture_retrieval(){ # <name> <outfile> : top-k ids for the fixed probe set
+  local name="$1" out="$2" q res
+  local port; port="$(mget "$name" "['port']")"; local key="sbx-$name"
+  {
+    echo "{"
+    local first=1
+    for q in "${PARITY_QUERIES[@]}"; do
+      res="$(curl -s -m10 -X POST -H 'Content-Type: application/json' \
+             -d "{\"_auth\":\"$key\",\"query\":\"$q\",\"limit\":5}" "http://127.0.0.1:$port/api/search" 2>/dev/null)"
+      local ids; ids="$(printf '%s' "$res" | python3 -c 'import sys,json
+try:
+ d=json.load(sys.stdin)
+ rows=d if isinstance(d,list) else d.get("results",d.get("hits",[]))
+ print(json.dumps([r.get("id") for r in rows][:5]))
+except Exception: print("[]")' 2>/dev/null)"
+      [ $first -eq 1 ] || echo ","; first=0
+      printf '  %s: %s' "$(python3 -c "import json,sys;print(json.dumps(sys.argv[1]))" "$q")" "${ids:-[]}"
+    done
+    echo ""; echo "}"
+  } > "$out"
+}
+
+# ================================================================ up ===========
+# Dead-simple one-command dev environment: `nsbx up` gives you (or Tim, or anyone)
+# a private, isolated copy of the live mind to build against. Creates it on first
+# run with sane defaults (stock prod binary, auto-allocated port), just starts it
+# thereafter. Prod on :$LIVE_BIND_PORT/:$SOUL_PORT is unreachable from here by design.
+cmd_up(){
+  local name; if [ $# -gt 0 ] && [ "${1#-}" = "$1" ]; then name="$1"; shift; else name="${USER:-dev}-dev"; fi
+  if mexists "$name"; then daemon_alive "$name" || start_daemon "$name"; else cmd_create "$name" "$@"; fi
+  local port; port="$(mget "$name" "['port']")"
+  echo >&2
+  ok "your sandbox '$name' is ready at http://127.0.0.1:$port  (a private copy of the mind — prod is untouchable)"
+  info "experiment:  nsbx run $name api /api/stats"
+  info "prove it:    nsbx validate $name"
+  info "tear down:   nsbx destroy $name"
+}
+
+# ================================================================ build ========
+# Rebuild an existing sandbox's runtime from a source tree/branch and hot-restart
+# it on the SAME clone + port (the code-change dev loop, in place).
+cmd_build(){
+  local name="$1"; shift || true
+  mexists "$name" || die "no such sandbox: $name"
+  local src="" branch="" repo="$EL_REPO"
+  while [ $# -gt 0 ]; do case "$1" in
+    --source) src="$2"; shift 2;; --branch) branch="$2"; shift 2;; --repo) repo="$2"; shift 2;;
+    *) die "unknown flag: $1";; esac; done
+  local d; d="$(sdir "$name")"
+  stop_daemon "$name"
+  if [ -n "$src" ]; then _build_binary "$src" "$d/bin/engram" "$d/build"
+  elif [ -n "$branch" ]; then
+    rm -rf "$d/build/worktree" 2>/dev/null; git -C "$repo" worktree prune 2>/dev/null
+    git -C "$repo" worktree add --detach "$d/build/worktree" "$branch" >/dev/null 2>&1 || die "worktree add failed"
+    _build_binary "$d/build/worktree" "$d/bin/engram" "$d/build"
+  else die "usage: nsbx build <name> --source DIR | --branch REF [--repo R]"; fi
+  # record new binary sha
+  python3 - "$(manifest "$name")" "$(sha "$d/bin/engram")" "${src:-branch:$branch}" <<'PY'
+import json,sys; mf,s,src=sys.argv[1:4]
+d=json.load(open(mf)); d["binary_sha256"]=s; d["source"]="rebuilt:"+src
+json.dump(d,open(mf,'w'),indent=2)
+PY
+  start_daemon "$name"
+  ok "rebuilt + restarted on :$(mget "$name" "['port']")"
+}
+
+# ================================================================ run ==========
+cmd_run(){
+  local name="$1"; shift || true
+  mexists "$name" || die "no such sandbox: $name"
+  daemon_alive "$name" || start_daemon "$name"
+  local d port; d="$(sdir "$name")"; port="$(mget "$name" "['port']")"
+  # direct API form: nsbx run <name> api <path> [json]
+  if [ "${1:-}" = "api" ]; then
+    api "$name" "$2" "${3:-}"; echo; return 0
+  fi
+  [ "${1:-}" = "--" ] && shift    # allow an explicit separator: nsbx run <name> -- <cmd...>
+  [ $# -gt 0 ] || die "usage: nsbx run <name> <cmd...>   |   nsbx run <name> api <path> [json]"
+  local ts log0; ts="$(now)"; log0="$d/logs/run-$ts.log"
+  local s0 t0 t1 s1
+  s0="$(sbx_stats "$name")"; t0="$(epoch)"
+  log "run experiment against sandbox '$name' (:$port)"
+  info "cmd: $*"
+  ( export SBX_NAME="$name" SBX_PORT="$port" SBX_URL="http://127.0.0.1:$port" \
+           SBX_KEY="sbx-$name" SBX_DATA="$d/data" SBX_BIN="$d/bin/engram"
+    "$@" ) 2>&1 | tee "$log0"
+  local rc=${PIPESTATUS[0]}
+  t1="$(epoch)"; s1="$(sbx_stats "$name")"
+  {
+    echo "--- nsbx run metrics ---"
+    echo "exit_code: $rc"
+    printf 'wall_secs: %.3f\n' "$(python3 -c "print($t1-$t0)")"
+    echo "stats_before: $s0"
+    echo "stats_after:  $s1"
+  } | tee -a "$log0" >&2
+  return $rc
+}
+
+# ================================================================ validate =====
+# The rails as first-class checks. Baseline = the sandbox's own settled state at
+# create (reproducible). zero-loss through sustained load AND reboot; reboot-prove;
+# RSS bound; retrieval parity; keystone integrity.
+cmd_validate(){
+  local name="$1"; shift || true
+  mexists "$name" || die "no such sandbox: $name"
+  daemon_alive "$name" || start_daemon "$name"
+  local d port key; d="$(sdir "$name")"; port="$(mget "$name" "['port']")"; key="sbx-$name"
+  local url="http://127.0.0.1:$port"
+  local bn be; bn="$(mget "$name" "['sbx_baseline']['node_count']")"; be="$(mget "$name" "['sbx_baseline']['edge_count']")"
+  log "validate '$name' against baseline nodes=$bn edges=$be"
+  local -a names=() results=() details=()
+
+  # 1) sustained load — no data loss under activity
+  local s cur_n cur_e i
+  log "check: sustained load (~15s: tick + reads) then zero-loss"
+  for i in $(seq 1 15); do
+    curl -s -m5 -X POST -H 'Content-Type: application/json' -d "{\"_auth\":\"$key\"}" "$url/api/tick" >/dev/null 2>&1
+    curl -s -m5 "$url/api/stats" >/dev/null 2>&1
+  done
+  s="$(sbx_stats "$name")"; cur_n="$(stat_field "$s" node_count)"; cur_e="$(stat_field "$s" edge_count)"
+  names+=("zero-loss-under-load"); if [ "${cur_n:-0}" -ge "${bn:-0}" ] && [ "${cur_e:-0}" -ge "${be:-0}" ]; then
+    results+=("PASS"); else results+=("FAIL"); fi
+  details+=("nodes $cur_n>=$bn, edges $cur_e>=$be")
+
+  # 2) reboot-prove — counts survive a real restart
+  log "check: reboot-prove (stop -> start -> compare)"
+  local pre_n pre_e; pre_n="$cur_n"; pre_e="$cur_e"
+  stop_daemon "$name"; start_daemon "$name" >/dev/null
+  s="$(sbx_stats "$name")"; cur_n="$(stat_field "$s" node_count)"; cur_e="$(stat_field "$s" edge_count)"
+  names+=("reboot-prove"); if [ "${cur_n:-0}" -ge "${bn:-0}" ] && [ "${cur_e:-0}" -ge "${be:-0}" ]; then
+    results+=("PASS"); else results+=("FAIL"); fi
+  details+=("post-reboot nodes=$cur_n edges=$cur_e (pre $pre_n/$pre_e)")
+
+  # 3) RSS bound
+  log "check: RSS bound (< ${RSS_BOUND_MB}MB)"
+  local pid rss_kb rss_mb; pid="$(daemon_pid "$name")"
+  rss_kb="$(ps -o rss= -p "$pid" 2>/dev/null | tr -d ' ')"; rss_mb=$(( ${rss_kb:-0} / 1024 ))
+  names+=("rss-bound"); if [ "$rss_mb" -lt "$RSS_BOUND_MB" ] && [ "$rss_mb" -gt 0 ]; then results+=("PASS"); else results+=("FAIL"); fi
+  details+=("RSS=${rss_mb}MB (bound ${RSS_BOUND_MB}MB)")
+
+  # 4) retrieval parity vs the create-time baseline
+  log "check: retrieval parity vs baseline probe set"
+  _capture_retrieval "$name" "$d/logs/retrieval-$( now ).json"
+  local latest; latest="$(ls -t "$d/logs"/retrieval-*.json 2>/dev/null | head -1)"
+  local parity; parity="$(python3 - "$d/baseline/retrieval.json" "$latest" <<'PY'
+import json,sys
+def load(p):
+  try: return json.load(open(p))
+  except Exception: return {}
+b,c=load(sys.argv[1]),load(sys.argv[2])
+tot=hit=0
+for q,ids in b.items():
+  cb=set(ids or []); cc=set(c.get(q) or [])
+  if not cb: continue
+  tot+=len(cb); hit+=len(cb & cc)
+print(f"{hit}/{tot}" if tot else "0/0")
+PY
+)"
+  local ph="${parity%/*}" pt="${parity#*/}"
+  names+=("retrieval-parity"); if [ "${pt:-0}" -gt 0 ] && [ "${ph:-0}" -eq "${pt:-0}" ]; then results+=("PASS"); else results+=("FAIL"); fi
+  details+=("top-k id overlap $parity vs baseline")
+
+  # 5) keystone integrity
+  log "check: keystone integrity"
+  local kfail=0 kid kres
+  for kid in "${KEYSTONES[@]}"; do
+    kres="$(curl -s -m5 "$url/api/node/$kid" 2>/dev/null)"
+    printf '%s' "$kres" | grep -q "\"$kid\"" || kfail=1
+  done
+  names+=("keystone-integrity"); [ "$kfail" -eq 0 ] && results+=("PASS") || results+=("FAIL")
+  details+=("kn-efeb4a5b + kn-5b606390 present")
+
+  # ---- report + stamp ----
+  echo >&2
+  printf '%s  VALIDATION — %s%s\n' "$C_BLD" "$name" "$C_0" >&2
+  local allpass=1 j
+  for j in "${!names[@]}"; do
+    local r="${results[$j]}" c="$C_GRN"; [ "$r" = FAIL ] && { c="$C_RED"; allpass=0; }
+    printf '   %s%-6s%s %-22s %s%s%s\n' "$c" "$r" "$C_0" "${names[$j]}" "$C_DIM" "${details[$j]}" "$C_0" >&2
+  done
+  local status; [ "$allpass" -eq 1 ] && status="PASS" || status="FAIL"
+  python3 - "$d/validate.json" "$status" "$(sha "$d/bin/engram")" "$(now)" "${names[*]}" "${results[*]}" <<'PY'
+import json,sys
+out,status,binsha,ts,ns,rs=sys.argv[1:7]
+checks=[{"name":n,"result":r} for n,r in zip(ns.split(),rs.split())]
+json.dump({"status":status,"binary_sha256":binsha,"ts":ts,"checks":checks},open(out,'w'),indent=2)
+PY
+  printf '   %s==> %s%s\n' "$([ "$allpass" -eq 1 ] && echo "$C_GRN" || echo "$C_RED")" "$status" "$C_0" >&2
+  [ "$allpass" -eq 1 ]
+}
+
+# ================================================================ promote ======
+# The ONLY prod-touching op. Explicit, gated, per-use Will-approved. Rails ONLY:
+# snapshot-first -> additive binary swap -> launchctl bootout -> settle-poll ->
+# bootstrap -> verify -> auto-rollback on failure. NEVER pkill, NEVER kickstart -k.
+# Default is a DRY-RUN plan; requires --i-approve-prod-cutover to actually cut over.
+cmd_promote(){
+  local name="$1"; shift || true
+  mexists "$name" || die "no such sandbox: $name"
+  local approve=0 do_data=0
+  while [ $# -gt 0 ]; do case "$1" in
+    --i-approve-prod-cutover) approve=1; shift;;
+    --data) do_data=1; shift;;
+    *) die "unknown flag: $1";; esac; done
+  local d; d="$(sdir "$name")"
+  # GATE 1: validation must have passed for the CURRENT binary
+  [ -f "$d/validate.json" ] || die "GATE: no validation on record — run 'nsbx validate $name' first"
+  local vstatus vsha bsha
+  vstatus="$(python3 -c "import json;print(json.load(open('$d/validate.json'))['status'])")"
+  vsha="$(python3 -c "import json;print(json.load(open('$d/validate.json'))['binary_sha256'])")"
+  bsha="$(sha "$d/bin/engram")"
+  [ "$vstatus" = PASS ] || die "GATE: last validation status is $vstatus (must be PASS)"
+  [ "$vsha" = "$bsha" ] || die "GATE: validation is stale — binary changed since validate (re-run validate)"
+
+  local live_bin new_bin ts; ts="$(now)"
+  live_bin="$(_live_real_bin)"
+  new_bin="$HOME/.neuron/bin/engram.promote-$name-$ts"     # additive: new file, old kept
+  local bkp="$BACKUP_ROOT/promote-$name-$ts"
+
+  log "PROMOTE PLAN for '$name' -> live :$LIVE_BIND_PORT"
+  info "current live ENGRAM_REAL_BIN : $live_bin"
+  info "sandbox binary (validated)   : $d/bin/engram (sha ${bsha:0:12})"
+  info "will install as              : $new_bin  (additive; old binary retained)"
+  info "snapshot-first backup dir    : $bkp  (egm+wal+plist+rollback.txt)"
+  info "data promote                 : $([ $do_data -eq 1 ] && echo 'YES (--data: clone egm/wal -> live)' || echo 'no (binary only)')"
+  info "rails                        : launchctl bootout -> settle-poll -> bootstrap"
+  info "verify                       : /api/stats + edges>=baseline + keystones + retrieval; auto-rollback armed"
+
+  if [ "$approve" -ne 1 ]; then
+    warn "DRY-RUN — not touching prod. Re-run with --i-approve-prod-cutover to execute (per-use Will-approved)."
+    return 0
+  fi
+
+  need launchctl
+  local dom="gui/$(id -u)"
+  # ---- snapshot-first ----
+  log "snapshot-first backup -> $bkp"
+  mkdir -p "$bkp"
+  cp -p "$LIVE_DATA_DIR/neuron.egm" "$bkp/neuron.egm.bak"
+  cp -p "$LIVE_DATA_DIR/neuron.wal" "$bkp/neuron.wal.bak" 2>/dev/null || true
+  cp -p "$LIVE_PLIST" "$bkp/plist.bak"
+  printf 'rollback REAL_BIN=%s\nNEWBIN=%s\ndata_promote=%s\n' "$live_bin" "$new_bin" "$do_data" > "$bkp/rollback.txt"
+  ok "backup complete"
+
+  # ---- additive binary install + plist supersede ----
+  cp -p "$d/bin/engram" "$new_bin"
+  python3 - "$LIVE_PLIST" "$new_bin" <<'PY'
+import sys,plistlib
+p,new=sys.argv[1],sys.argv[2]
+d=plistlib.load(open(p,'rb')); d.setdefault("EnvironmentVariables",{})["ENGRAM_REAL_BIN"]=new
+plistlib.dump(d,open(p,'wb'))
+PY
+  ok "installed $new_bin + updated plist ENGRAM_REAL_BIN"
+
+  # ---- optional data promote (after backup) ----
+  if [ $do_data -eq 1 ]; then
+    log "data promote: clone store -> live (backed up above)"
+    cp -p "$d/data/neuron.egm" "$LIVE_DATA_DIR/neuron.egm"
+    cp -p "$d/data/neuron.wal" "$LIVE_DATA_DIR/neuron.wal" 2>/dev/null || true
+  fi
+
+  # ---- rails cutover: bootout -> settle-poll -> bootstrap ----
+  log "rails: launchctl bootout $dom/$LIVE_LABEL"
+  launchctl bootout "$dom/$LIVE_LABEL" 2>/dev/null || true
+  local i
+  for i in $(seq 1 60); do
+    launchctl print "$dom/$LIVE_LABEL" >/dev/null 2>&1 || { ok "settle: job gone after ${i}x0.5s"; break; }
+    printf '  settle: job still present (%d)\n' "$i" >&2; sleep 0.5
+  done
+  log "rails: launchctl bootstrap $dom <plist>"
+  launchctl bootstrap "$dom" "$LIVE_PLIST" || warn "bootstrap returned nonzero"
+
+  # ---- verify ----
+  log "verify prod health"
+  local s="" ; for i in $(seq 1 60); do s="$(live_stats)"; [ -n "$s" ] && break; sleep 1; done
+  local ok_verify=1 le; le="$(stat_field "$s" edge_count)"
+  local base_e; base_e="$(mget "$name" "['live_baseline']['edge_count']")"
+  [ -n "$s" ] || ok_verify=0
+  [ "${le:-0}" -ge "${base_e:-0}" ] || ok_verify=0
+  local kid; for kid in "${KEYSTONES[@]}"; do curl -s -m5 "$LIVE_URL/api/node/$kid" 2>/dev/null | grep -q "\"$kid\"" || ok_verify=0; done
+  if [ "$ok_verify" -eq 1 ]; then
+    ok "PROMOTED. live stats: $s  (rollback: $bkp)"; return 0
+  fi
+
+  # ---- auto-rollback ----
+  warn "verify FAILED — auto-rollback"
+  cp -p "$bkp/plist.bak" "$LIVE_PLIST"
+  [ $do_data -eq 1 ] && { cp -p "$bkp/neuron.egm.bak" "$LIVE_DATA_DIR/neuron.egm"; cp -p "$bkp/neuron.wal.bak" "$LIVE_DATA_DIR/neuron.wal" 2>/dev/null || true; }
+  launchctl bootout "$dom/$LIVE_LABEL" 2>/dev/null || true
+  for i in $(seq 1 60); do launchctl print "$dom/$LIVE_LABEL" >/dev/null 2>&1 || break; sleep 0.5; done
+  launchctl bootstrap "$dom" "$LIVE_PLIST" || true
+  die "ROLLED BACK to $live_bin. See $bkp"
+}
+
+# ================================================================ destroy ======
+cmd_destroy(){
+  local name="$1"; shift || true
+  mexists "$name" || die "no such sandbox: $name"
+  local d; d="$(sdir "$name")"
+  stop_daemon "$name"
+  if [ -d "$d/build/worktree" ]; then
+    log "removing git worktree"
+    git -C "$EL_REPO" worktree remove --force "$d/build/worktree" 2>/dev/null || true
+    git -C "$EL_REPO" worktree prune 2>/dev/null || true
+  fi
+  log "removing $d"
+  rm -rf "$d"
+  ok "destroyed '$name' (live untouched)"
+}
+
+# ================================================================ list/status ==
+cmd_list(){
+  [ -d "$SBX_ROOT" ] || { echo "no sandboxes"; return 0; }
+  printf '%-16s %-6s %-8s %-9s %s\n' NAME PORT STATE PID SOURCE
+  local m
+  for m in "$SBX_ROOT"/*/manifest.json; do
+    [ -f "$m" ] || continue
+    local n p src pid state
+    n="$(python3 -c "import json;print(json.load(open('$m'))['name'])")"
+    p="$(python3 -c "import json;print(json.load(open('$m'))['port'])")"
+    src="$(python3 -c "import json;print(json.load(open('$m'))['source'])")"
+    pid="$(daemon_pid "$n")"; state="stopped"; daemon_alive "$n" && state="running"
+    printf '%-16s %-6s %-8s %-9s %s\n' "$n" "$p" "$state" "${pid:-–}" "$src"
+  done
+}
+cmd_status(){
+  local name="$1"; mexists "$name" || die "no such sandbox: $name"
+  python3 -m json.tool "$(manifest "$name")"
+  daemon_alive "$name" && echo "state: running (pid $(daemon_pid "$name")) stats: $(sbx_stats "$name")" || echo "state: stopped"
+  [ -f "$(sdir "$name")/validate.json" ] && { echo "--- last validation ---"; python3 -m json.tool "$(sdir "$name")/validate.json"; }
+}
+
+usage(){ cat >&2 <<EOF
+${C_BLD}nsbx${C_0} — Neuron Sandbox: experiments + code changes against the REAL engram
+runtime on an isolated snapshot of the live mind, with a gated promote-to-prod path.
+
+  nsbx up      [name] [flags…]                            one command: your private, isolated copy of the mind
+                                                          (creates on first run, starts thereafter; prod untouchable)
+  nsbx create  [name] [--port N] [--source DIR | --branch REF [--repo R] | --binary PATH]
+                       clone live store+WAL+config, place/build the runtime, boot on an
+                       isolated port (never :$LIVE_BIND_PORT/:$SOUL_PORT). Default runtime = stock prod binary.
+  nsbx build   <name> --source DIR | --branch REF        rebuild the runtime from a code change + hot-restart
+  nsbx run     <name> <cmd...> | api <path> [json]        run an experiment; capture output + metrics
+  nsbx validate <name>                                    rails as checks: zero-loss(load+reboot), reboot-prove,
+                                                          RSS bound, retrieval parity, keystone integrity
+  nsbx promote <name> [--data] [--i-approve-prod-cutover] GATED rails cutover to prod (DRY-RUN without approval)
+  nsbx destroy <name>                                     stop daemon, free port, remove clone (live untouched)
+  nsbx list  |  nsbx status <name>
+
+Env in 'run' cmds: \$SBX_URL \$SBX_PORT \$SBX_KEY \$SBX_DATA \$SBX_BIN \$SBX_NAME
+EOF
+}
+
+main(){
+  local cmd="${1:-}"; shift || true
+  case "$cmd" in
+    up)       cmd_up       "$@";;
+    create)   cmd_create   "$@";;
+    build)    cmd_build    "$@";;
+    run)      cmd_run      "$@";;
+    validate) cmd_validate "$@";;
+    promote)  cmd_promote  "$@";;
+    destroy)  cmd_destroy  "$@";;
+    list|ls)  cmd_list     "$@";;
+    status)   cmd_status   "$@";;
+    ""|-h|--help|help) usage;;
+    *) die "unknown command: $cmd (try: nsbx help)";;
+  esac
+}
+main "$@"