`nx_memroot.nx` source

↩ module page · 447 lines · 17940 B
1// nx_memroot.nx -- FROM-GOD ROOTING FOR THE MEMORY PLANE. node -> parent -> ... -> ORIGIN.
2//
3// CONVERTED TO nx_memplane_lib 2026-08-07. It now owns only the rooting: the BFS, the declared-edge
4// authority, the lineage emitter and the parent proposals. Walk, name table, link scanner, read,
5// join and the derived-artefact test come from the lib.
6//
7// THE MISS THIS ORGAN CORRECTS (operator)
8// ---------------------------------------
9// "it should be a logical from god does this already exist ... to give feedback on parents and
10//  descendents to give the ability to triangulate and get context and understand what is happening
11//  vs a flat directory where naming and guessing are key"
12//
13// A whole session of lexical instruments -- slug similarity, rarity weighting, BM25 -- all COMPENSATE
14// FOR A FLAT DIRECTORY by getting better at guessing names. The estate had already written the
15// correction 22 days earlier, in a memory whose filename is the problem:
16// feedback-sprawl-orphans-use-fromgod-rooting-systems -- "USE the operator's established FROM-GOD +
17// DEPENDENCY-GRAPH + NO-ORPHANS systems FIRST ... do NOT propose a NEW ladder when the system exists."
18// ★★★★★★ THE ANTI-PATTERN HAS A MEMORY FILE, AND I REPRODUCED IT ANYWAY -- WHICH IS THE ADOPTION GAP
19// THE FILE DESCRIBES: A DOCTRINE THAT IS WRITTEN BUT UNROOTED IS NOT REACHABLE WHEN IT WOULD MATTER.
20//
21// MEASURED GAP: 1,514 files declare `node_type: memory` -- graph nodes BY DECLARATION -- and the
22// parent edge was absent from all of them. Declared and unwired, so the corpus behaves as a flat
23// directory of 2,181 files. That is the root cause under every symptom measured this session.
24//
25// MATCHED KNOWN GOOD: nx_build_rooted_gate, the NO-ORPHANS enforcer for organs -- root every node to
26// ORIGIN, census the FLOATING ones as the OPERATOR-PACED worklist; floating is not dead, it is
27// unrooted. Same shape, applied to the memory plane, rather than a new ladder.
28//
29// DECLARED EDGES ARE THE AUTHORITY; citation edges are the fallback. A node's derived parent is the
30// file that first cites it on a breadth-first walk from ORIGIN, so DEPTH is the true distance from
31// the front door. ⚠The declared pass runs AFTER the walk: applied before it, a declared parent has no
32// depth yet, so every declared node still received an accidental citation parent.
33// ★ AN AUTHORITY APPLIED BEFORE THE DATA IT DEPENDS ON EXISTS IS NOT AN AUTHORITY.
34//
35// usage:  nx_memroot [--dir D] [--apply] [--floating] [--suggest]
36// exit:   0 = every node rooted (GREEN);  1 = floating nodes exist (the worklist)
37// Sovereign: imports nx_memplane_lib. license_tier: ORIGINAL
38import "nx_memplane_lib.nx"
39
40const MR_DIR:  *u8 = "/mnt/c/Users/elder/.claude/projects/C--Users-elder/memory"
41const MR_ORIG: *u8 = "MEMORY.md"
42const MR_OUT:  *u8 = "reference-memory-lineage.md"
43const MR_FBUF: i64 = 1048576
44const MR_OBUF: i64 = 4194304
45const MR_MSG:  i64 = 16384
46const MR_HUBS: i64 = 96
47const MR_TOK:  i64 = 8192
48
49// ---- topic fingerprints, used only by --suggest ------------------------------------------------
50
51func mr_tokput(set: *i64, h: i64) -> i64 {
  var p: i64 = h & (MR_TOK - 1)
  var r: i64 = 0
  var go: i64 = 1
  while go == 1 {
      if set[p] == 0 { set[p] = h; r = 1; go = 0 } else {
          if set[p] == h { go = 0 } else { p = (p + 1) & (MR_TOK - 1) }
      }
  }
  return r
61}
62
63func mr_tokhas(set: *i64, h: i64) -> i64 {
  var p: i64 = h & (MR_TOK - 1)
  var r: i64 = 0
  var go: i64 = 1
  while go == 1 {
      if set[p] == 0 { go = 0 } else {
          if set[p] == h { r = 1; go = 0 } else { p = (p + 1) & (MR_TOK - 1) }
      }
  }
  return r
73}
74
75func mr_tokset(buf: *u8, n: i64, set: *i64) -> i64 {
  var h: i64 = 2166136261
  var ln: i64 = 0
  var i: i64 = 0
  var c2: i64 = 0
  while i <= n {
      var c: i64 = 0 - 1
      if i < n {
          let b: u8 = buf[i]
          if b >= (65 as u8) { if b <= (90 as u8) { c = (b as i64) + 32 } }
          if b >= (97 as u8) { if b <= (122 as u8) { c = b as i64 } }
          if b >= (48 as u8) { if b <= (57 as u8) { c = b as i64 } }
      }
      if c >= 0 {
          h = h ^ c
          h = (h * 16777619) & 1073741823
          ln = ln + 1
      } else {
          if ln >= 6 { if h != 0 { c2 = c2 + mr_tokput(set, h) } }
          h = 2166136261
          ln = 0
      }
      i = i + 1
  }
  return c2
100}
101
102func mr_score(buf: *u8, n: i64, hub: *i64) -> i64 {
  let seen: *i64 = sys_mmap(8 * MR_TOK) as *i64
  var z: i64 = 0
  while z < MR_TOK { seen[z] = 0; z = z + 1 }
  var h: i64 = 2166136261
  var ln: i64 = 0
  var i: i64 = 0
  var sc: i64 = 0
  while i <= n {
      var c: i64 = 0 - 1
      if i < n {
          let b: u8 = buf[i]
          if b >= (65 as u8) { if b <= (90 as u8) { c = (b as i64) + 32 } }
          if b >= (97 as u8) { if b <= (122 as u8) { c = b as i64 } }
          if b >= (48 as u8) { if b <= (57 as u8) { c = b as i64 } }
      }
      if c >= 0 {
          h = h ^ c
          h = (h * 16777619) & 1073741823
          ln = ln + 1
      } else {
          if ln >= 6 { if h != 0 { if mr_tokput(seen, h) == 1 { if mr_tokhas(hub, h) == 1 { sc = sc + 1 } } } }
          h = 2166136261
          ln = 0
      }
      i = i + 1
  }
  return sc
130}
131
132func main(argc: i64, argv: *i64) -> i64 {
  var dir: *u8 = MR_DIR
  var apply: i64 = 0
  var listfloat: i64 = 0
  var suggest: i64 = 0
  var ai: i64 = 1
  while ai < argc {
      let a: *u8 = argv[ai] as *u8
      if mp_streq(a, "--apply" as *u8) == 1 { apply = 1 }
      if mp_streq(a, "--floating" as *u8) == 1 { listfloat = 1 }
      if mp_streq(a, "--suggest" as *u8) == 1 { suggest = 1 }
      if mp_streq(a, "--dir" as *u8) == 1 { if ai + 1 < argc { dir = argv[ai + 1] as *u8; ai = ai + 1 } }
      ai = ai + 1
  }
146
  let msg:    *u8 = sys_mmap(MR_MSG)
  let names:  *u8 = sys_mmap(MP_MAXF * MP_SLOT)
  let tbl:    *i64 = sys_mmap(8 * MP_HASH) as *i64
  let parent: *i64 = sys_mmap(8 * MP_MAXF) as *i64
  let depth:  *i64 = sys_mmap(8 * MP_MAXF) as *i64
  let kids:   *i64 = sys_mmap(8 * MP_MAXF) as *i64
  let queue:  *i64 = sys_mmap(8 * MP_MAXF) as *i64
  let decl:   *i64 = sys_mmap(8 * MP_MAXF) as *i64
  let fbuf:   *u8 = sys_mmap(MR_FBUF)
  let obuf:   *u8 = sys_mmap(MR_OBUF)
  let path:   *u8 = sys_mmap(4096)
  let probe:  *u8 = sys_mmap(1024)
  let slug:   *u8 = sys_mmap(MP_SLOT * 2)
  let out:    *i64 = sys_mmap(64) as *i64
161
  let cnt: i64 = mp_scan(dir, names, tbl, MP_MAXF)
  if cnt < 0 {
      var e: i64 = mp_cat(msg, 0, "nx_memroot: REFUSED -- cannot open the memory dir.\n" as *u8)
      mp_say(msg, e)
      return 1
  }
  var i: i64 = 0
  while i < cnt { parent[i] = 0 - 1; depth[i] = 0 - 1; kids[i] = 0; decl[i] = 0 - 1; i = i + 1 }
170
  // ---- PASS A: read DECLARED edges. The registry is the authority for organs; frontmatter is the
  // authority here, because the edge belongs ON the node, not in a side-car (and not in a TSV).
  var declared: i64 = 0
  i = 0
  while i < cnt {
      mp_join(path, dir, mp_nameptr(names, i))
      let tl: i64 = mp_readf(path, fbuf, MR_FBUF)
      if tl > 0 {
          let sl: i64 = mp_declparent(fbuf, tl, slug)
          if sl > 0 {
              var hit: i64 = mp_get(tbl, names, slug, sl)
              if hit < 0 {
                  slug[sl] = 46 as u8
                  slug[sl + 1] = 109 as u8
                  slug[sl + 2] = 100 as u8
                  slug[sl + 3] = 0 as u8
                  hit = mp_get(tbl, names, slug, sl + 3)
              }
              if hit >= 0 { if hit != i { decl[i] = hit; declared = declared + 1 } }
          }
      }
      i = i + 1
  }
194
  let orig: i64 = mp_get(tbl, names, MR_ORIG, mp_len(MR_ORIG))
  if orig < 0 {
      var e2: i64 = mp_cat(msg, 0, "nx_memroot: REFUSED -- no MEMORY.md; the memory plane has no ORIGIN to root to.\n" as *u8)
      mp_say(msg, e2)
      return 1
  }
  var qh: i64 = 0
  var qt: i64 = 0
  depth[orig] = 0
  parent[orig] = orig
  queue[qt] = orig
  qt = qt + 1
  var rooted: i64 = 1
  var maxd: i64 = 0
  var declrooted: i64 = 0
210
  // ---- BFS. The parent is the SHALLOWEST citer, so depth is the true distance from the front door.
  while qh < qt {
      let cur: i64 = queue[qh]
      qh = qh + 1
      let cname: *u8 = mp_nameptr(names, cur)
      var total: i64 = 0
      if mp_is_dump(cname) == 0 {
          mp_join(path, dir, cname)
          total = mp_readf(path, fbuf, MR_FBUF)
          // ⚠ DO NOT WALK THROUGH A DERIVED ARTEFACT. Asking the FILE, not a name list: this organ's
          // own output silenced the orphan metric in three separate organs before the marker existed.
          if mp_is_derived(fbuf, total) == 1 { total = 0 }
      }
      var from: i64 = 0
      var go: i64 = 1
      while go == 1 {
          if total <= 0 { go = 0 } else {
              if mp_link_next(fbuf, total, from, out) == 1 {
                  from = out[3]
                  let hit: i64 = mp_resolve(fbuf, out, names, tbl, probe)
                  if hit >= 0 {
                      if depth[hit] < 0 {
                          depth[hit] = depth[cur] + 1
                          parent[hit] = cur
                          kids[cur] = kids[cur] + 1
                          if depth[hit] > maxd { maxd = depth[hit] }
                          queue[qt] = hit
                          qt = qt + 1
                          rooted = rooted + 1
                      }
                  }
              } else { go = 0 }
          }
      }
  }
246
  // ---- DECLARED EDGES WIN, applied AFTER the walk (see header) ----
  var pass: i64 = 0
  while pass < 64 {
      var changed: i64 = 0
      i = 0
      while i < cnt {
          if decl[i] >= 0 {
              if parent[i] != decl[i] {
                  if depth[decl[i]] >= 0 {
                      if i != orig {
                          if parent[i] >= 0 { if kids[parent[i]] > 0 { kids[parent[i]] = kids[parent[i]] - 1 } }
                          if depth[i] < 0 { rooted = rooted + 1 }
                          parent[i] = decl[i]
                          depth[i] = depth[decl[i]] + 1
                          kids[decl[i]] = kids[decl[i]] + 1
                          if depth[i] > maxd { maxd = depth[i] }
                          declrooted = declrooted + 1
                          changed = 1
                      }
                  }
              }
          }
          i = i + 1
      }
      if changed == 0 { pass = 64 } else { pass = pass + 1 }
  }
273
  let floating: i64 = cnt - rooted
275
  // ---- emit the lineage registry ----
  if apply == 1 {
      var o: i64 = 0
      o = mp_cat(obuf, o, "# Memory lineage -- GENERATED by nx_memroot, do not hand-edit\n" as *u8)
      o = mp_cat(obuf, o, MP_DERIVED_MARK)
      o = mp_cat(obuf, o, "\n\n" as *u8)
      o = mp_cat(obuf, o, "Every ROOTED memory below carries `node -> parent -> ... -> ORIGIN(MEMORY.md)`. The parent is the\nSHALLOWEST file that cites it, so DEPTH is the true distance from the front door: how many hops a\nsession must make before it can reach that memory at all.\n\n" as *u8)
      o = mp_cat(obuf, o, "FLOATING nodes have no citer anywhere. Floating is NOT dead -- it is UNROOTED, and rooting is\noperator-paced, exactly as nx_build_rooted_gate treats floating organs.\n\n## ROOTED\n\n" as *u8)
      var d: i64 = 0
      while d <= maxd {
          var wrote: i64 = 0
          i = 0
          while i < cnt {
              if depth[i] == d {
                  if wrote == 0 {
                      o = mp_cat(obuf, o, "\n### depth " as *u8)
                      o = mp_catn(obuf, o, d)
                      o = mp_cat(obuf, o, "\n" as *u8)
                      wrote = 1
                  }
                  o = mp_cat(obuf, o, "- [" as *u8)
                  o = mp_cat(obuf, o, mp_nameptr(names, i))
                  o = mp_cat(obuf, o, "](" as *u8)
                  o = mp_cat(obuf, o, mp_nameptr(names, i))
                  o = mp_cat(obuf, o, ") parent=" as *u8)
                  o = mp_cat(obuf, o, mp_nameptr(names, parent[i]))
                  if kids[i] > 0 {
                      o = mp_cat(obuf, o, " children=" as *u8)
                      o = mp_catn(obuf, o, kids[i])
                  }
                  o = mp_cat(obuf, o, "\n" as *u8)
              }
              i = i + 1
          }
          d = d + 1
      }
      o = mp_cat(obuf, o, "\n## FLOATING -- unrooted, the operator-paced worklist\n\n" as *u8)
      i = 0
      while i < cnt {
          if depth[i] < 0 {
              o = mp_cat(obuf, o, "- [" as *u8)
              o = mp_cat(obuf, o, mp_nameptr(names, i))
              o = mp_cat(obuf, o, "](" as *u8)
              o = mp_cat(obuf, o, mp_nameptr(names, i))
              o = mp_cat(obuf, o, ")\n" as *u8)
          }
          i = i + 1
      }
      o = mp_cat(obuf, o, "\nROOTED " as *u8)
      o = mp_catn(obuf, o, rooted)
      o = mp_cat(obuf, o, " / FLOATING " as *u8)
      o = mp_catn(obuf, o, floating)
      o = mp_cat(obuf, o, " / max depth " as *u8)
      o = mp_catn(obuf, o, maxd)
      o = mp_cat(obuf, o, "\n" as *u8)
331
      mp_join(path, dir, MR_OUT)
      let tmp: *u8 = ((path as i64) + 2048) as *u8
      var t2: i64 = mp_cat(tmp, 0, path)
      t2 = mp_cat(tmp, t2, ".mrtmp" as *u8)
      tmp[t2] = 0 as u8
      let wfd: i64 = sys_openat_wr(tmp, 420)
      if wfd < 0 { return 1 }
      let w2: i64 = mp_write_all(wfd, obuf, o)
      sys_close(wfd)
      if w2 != o { return 1 }
      if sys_renameat(tmp, path) != 0 { return 1 }
  }
344
  // ---- --suggest: PROPOSE a parent for every floating node; never assign one ----
  if suggest == 1 {
      let hubs: *i64 = sys_mmap(8 * MR_HUBS) as *i64
      var nh: i64 = 0
      var need: i64 = 3
      while need >= 1 {
          i = 0
          while i < cnt {
              if nh < MR_HUBS {
                  if kids[i] >= need {
                      var dup: i64 = 0
                      var z: i64 = 0
                      while z < nh { if hubs[z] == i { dup = 1 } z = z + 1 }
                      if dup == 0 { hubs[nh] = i; nh = nh + 1 }
                  }
              }
              i = i + 1
          }
          need = need - 1
      }
      let hsets: *i64 = sys_mmap(8 * MR_HUBS * MR_TOK) as *i64
      var h: i64 = 0
      while h < nh {
          let base: i64 = h * MR_TOK
          var z2: i64 = 0
          while z2 < MR_TOK { hsets[base + z2] = 0; z2 = z2 + 1 }
          mp_join(path, dir, mp_nameptr(names, hubs[h]))
          let hl: i64 = mp_readf(path, fbuf, MR_FBUF)
          mr_tokset(fbuf, hl, ((hsets as i64) + base * 8) as *i64)
          h = h + 1
      }
      var proposed: i64 = 0
      i = 0
      while i < cnt {
          if depth[i] < 0 {
              mp_join(path, dir, mp_nameptr(names, i))
              let fl: i64 = mp_readf(path, fbuf, MR_FBUF)
              var best: i64 = 0 - 1
              var bs: i64 = 0
              h = 0
              while h < nh {
                  let sc: i64 = mr_score(fbuf, fl, ((hsets as i64) + (h * MR_TOK) * 8) as *i64)
                  if sc > bs { bs = sc; best = h }
                  h = h + 1
              }
              if best >= 0 { if bs >= 3 {
                  var d2: i64 = mp_cat(msg, 0, "  parent: " as *u8)
                  d2 = mp_cat(msg, d2, mp_nameptr(names, hubs[best]))
                  d2 = mp_cat(msg, d2, "   <- " as *u8)
                  d2 = mp_cat(msg, d2, mp_nameptr(names, i))
                  d2 = mp_cat(msg, d2, "  (shared=" as *u8)
                  d2 = mp_catn(msg, d2, bs)
                  d2 = mp_cat(msg, d2, ")\n" as *u8)
                  mp_say(msg, d2)
                  proposed = proposed + 1
              } }
          }
          i = i + 1
      }
      var sm: i64 = mp_cat(msg, 0, "  -- " as *u8)
      sm = mp_catn(msg, sm, proposed)
      sm = mp_cat(msg, sm, " proposals from " as *u8)
      sm = mp_catn(msg, sm, nh)
      sm = mp_cat(msg, sm, " hubs. PROPOSALS ONLY -- nothing was written. Approve by adding `parent: <slug>` to the node's frontmatter.\n" as *u8)
      mp_say(msg, sm)
  }
411
  if listfloat == 1 {
      var shown: i64 = 0
      i = 0
      while i < cnt {
          if depth[i] < 0 {
              if shown < 25 {
                  var l: i64 = mp_cat(msg, 0, "  FLOATING  " as *u8)
                  l = mp_cat(msg, l, mp_nameptr(names, i))
                  l = mp_cat(msg, l, "\n" as *u8)
                  mp_say(msg, l)
                  shown = shown + 1
              }
          }
          i = i + 1
      }
  }
428
  var m: i64 = mp_cat(msg, 0, "nx_memroot: " as *u8)
  m = mp_catn(msg, m, cnt)
  m = mp_cat(msg, m, " memory nodes; DECLARED parents " as *u8)
  m = mp_catn(msg, m, declared)
  m = mp_cat(msg, m, " (rooted via declaration " as *u8)
  m = mp_catn(msg, m, declrooted)
  m = mp_cat(msg, m, "), ROOTED to ORIGIN " as *u8)
  m = mp_catn(msg, m, rooted)
  m = mp_cat(msg, m, ", FLOATING " as *u8)
  m = mp_catn(msg, m, floating)
  m = mp_cat(msg, m, ", max depth " as *u8)
  m = mp_catn(msg, m, maxd)
  if floating == 0 { m = mp_cat(msg, m, "  GREEN: every node roots to god.\n" as *u8) } else {
      m = mp_cat(msg, m, "  -- floating is UNROOTED, not dead; rooting is operator-paced.\n" as *u8)
  }
  mp_say(msg, m)
  if floating > 0 { return 1 }
  return 0
447}
nx_memroot.nx source

`nx_memroot.nx` source
