code wiki / _hdl_build / nx_vizsla_graph_gate.nx
`nx_vizsla_graph_gate.nx` source

↩ module page · 225 lines · 10061 B
1// nx_vizsla_graph_gate.nx -- VIZSLA intro-graph gate. Construction-known oracle.
2// Graph (undirected):  me--alice  alice--bob  bob--carol  me--dave  dave--carol
3//   me->carol: me>dave>carol (len 2) BEATS me>alice>bob>carol (len 3)  => BFS shortest = via dave
4//   alice->carol: alice>bob>carol (len 2)
5//   me->eve: eve not in graph => no path
6//   link a b and link b a = the SAME canonical edge (undirected dedup)
7// Rows:
8//   1 link             link me alice -> new=1
9//   2 undirected-dedup link alice me (reversed) -> new=0 (same canonical edge)
10//   3 neighbors        neighbors me -> count=2, alice + dave present
11//   4 shortest-path    path me carol -> length=2 via=dave path=me>dave>carol (3-hop NOT taken)
12//   5 symmetric        path carol me -> length=2 (undirected)
13//   6 multi-hop        path alice carol -> length=2 via=bob path=alice>bob>carol
14//   7 no-path          path me eve -> length=-1 via=NONE path=NONE
15//   8 self-path        path me me -> length=0
16//   9 neg-self-loop    link bob bob -> fail loud exit 1
17// Evidence: VIZSLA-GRAPH-GATE -> stdout + knowledge/status/vizsla_gate.log; exit 0 iff 9/9.
18// license_tier: ORIGINAL
19import "nx_syscalls.nx"
20import "nx_gate_verdict.nx"
21
22func og_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
23func og_p(s: *u8) -> i64 { sys_write(1, s, og_slen(s)); return 0 }
24
25func og_cat(dst: *u8, off: i64, s: *u8) -> i64 {
  var i: i64 = 0
  while s[i] != (0 as u8) { dst[off + i] = s[i]; i = i + 1 }
  return off + i
29}
30
31func og_catn(dst: *u8, off: i64, v: i64) -> i64 {
  var o: i64 = off
  var m: i64 = v
  if m < 0 { dst[o] = 45 as u8; o = o + 1; m = 0 - m }
  let t: *u8 = sys_mmap(28)
  var k: i64 = 0
  if m == 0 { t[0] = 48 as u8; k = 1 }
  while m > 0 { t[k] = (48 + (m % 10)) as u8; m = m / 10; k = k + 1 }
  var i: i64 = 0
  while i < k { dst[o + i] = t[k - 1 - i]; i = i + 1 }
  return o + k
42}
43
44func og_readall(path: *u8, szout: *i64) -> *u8 {
  let fd: i64 = sys_openat_rd(path)
  if fd < 0 { szout[0] = 0 - 1; return 0 as *u8 }
  let sz: i64 = sys_lseek(fd, 0, 2)
  sys_lseek(fd, 0, 0)
  let buf: *u8 = sys_mmap(sz + 64)
  var got: i64 = 0
  var n: i64 = 1
  while n > 0 { n = sys_read(fd, (buf as i64 + got) as *u8, 65536); if n > 0 { got = got + n } }
  sys_close(fd)
  szout[0] = got
  return buf
56}
57
58func og_runv(elf: *u8, args: *i64, outpath: *u8) -> i64 {
  let pid: i64 = sys_fork()
  if pid == 0 {
      if (outpath as i64) != 0 {
          let ofd: i64 = sys_openat_wr(outpath, 0x1a4)
          if ofd >= 0 { sys_dup3(ofd, 1, 0); sys_dup3(ofd, 2, 0) }
      }
      let argv: *i64 = sys_mmap(128) as *i64
      argv[0] = elf as i64
      var i: i64 = 0
      var go: i64 = 1
      while go == 1 { if args[i] == 0 { go = 0 } else { argv[i + 1] = args[i]; i = i + 1 } }
      argv[i + 1] = 0
      let envp: *i64 = sys_mmap(16) as *i64
      envp[0] = 0
      sys_execve(elf, argv, envp)
      sys_exit(127)
  }
  let st: *i64 = sys_mmap(16) as *i64
  sys_wait4(pid, st, 0)
  let sig: i64 = st[0] & 0x7f
  if sig != 0 { return 128 + sig }
  return (st[0] >> 8) & 0xff
81}
82
83func og_idx(buf: *u8, sz: i64, needle: *u8) -> i64 {
  let n: i64 = og_slen(needle)
  if n == 0 { return 0 - 1 }
  var i: i64 = 0
  while i + n <= sz {
      var ok: i64 = 1
      var j: i64 = 0
      while j < n { if buf[i + j] != needle[j] { ok = 0; j = n } else { j = j + 1 } }
      if ok == 1 { return i }
      i = i + 1
  }
  return 0 - 1
95}
96
97func og_has(path: *u8, needle: *u8) -> i64 {
  let szp: *i64 = sys_mmap(16) as *i64
  let b: *u8 = og_readall(path, szp)
  if og_idx(b, szp[0], needle) >= 0 { return 1 }
  return 0
102}
103
104func og_row(name: *u8, pass: i64) -> i64 {
  og_p("ROW " as *u8); og_p(name)
  if pass == 1 { og_p(" PASS\n" as *u8) } else { og_p(" FAIL\n" as *u8) }
  return pass
108}
109
110func og_args(a1: *u8, a2: *u8, a3: *u8, a4: *u8, a5: *u8, a6: *u8) -> *i64 {
  let a: *i64 = sys_mmap(64) as *i64
  a[0] = a1 as i64; a[1] = a2 as i64; a[2] = a3 as i64; a[3] = a4 as i64; a[4] = a5 as i64; a[5] = a6 as i64; a[6] = 0
  return a
114}
115
116func main(argc: i64, argv: *i64) -> i64 {
  og_p("=== VIZSLA GRAPH GATE: intro-graph / who-knows-whom (BFS warm-intro path) ===\n" as *u8)
  var ob: *u8 = "buildroot/_build/nx_vizsla_graph.sov.elf" as *u8
  if argc > 1 { ob = argv[1] as *u8 }
  let pr: i64 = sys_openat_rd(ob)
  if pr >= 0 { sys_close(pr) }
  else {
      og_p(" instrument missing -> rebuilding via durable runner\n" as *u8)
      og_runv("_offc/nx_sov_build_run.elf" as *u8, og_args("nx_vizsla_graph" as *u8, 0 as *u8, 0 as *u8, 0 as *u8, 0 as *u8, 0 as *u8), "/tmp/vxg_rebuild.out" as *u8)
  }
126
  let pfx: *u8 = sys_mmap(128)
  var po: i64 = 0
  po = og_cat(pfx, po, "/tmp/vxgG" as *u8); po = og_catn(pfx, po, sys_now_us()); po = og_cat(pfx, po, "-" as *u8)
  pfx[po] = 0 as u8
131
  var pass: i64 = 0
  var r: i64 = 0
134
  // 1 link me--alice
  let rc1: i64 = og_runv(ob, og_args("link" as *u8, pfx, "me" as *u8, "alice" as *u8, "2026-01-01" as *u8, 0 as *u8), "/tmp/vxg_l1.txt" as *u8)
  r = 0
  if rc1 == 0 { if og_has("/tmp/vxg_l1.txt" as *u8, "VIZSLA-GRAPH-LINK a=me b=alice new=1" as *u8) == 1 { r = 1 } }
  pass = pass + og_row("link" as *u8, r)
140
  // 2 reversed link -> same canonical edge -> new=0
  let rc2: i64 = og_runv(ob, og_args("link" as *u8, pfx, "alice" as *u8, "me" as *u8, "2026-01-01" as *u8, 0 as *u8), "/tmp/vxg_l2.txt" as *u8)
  r = 0
  if rc2 == 0 { if og_has("/tmp/vxg_l2.txt" as *u8, "VIZSLA-GRAPH-LINK a=alice b=me new=0" as *u8) == 1 { r = 1 } }
  pass = pass + og_row("undirected-dedup" as *u8, r)
146
  // setup the rest of the graph
  og_runv(ob, og_args("link" as *u8, pfx, "alice" as *u8, "bob" as *u8, "2026-01-01" as *u8, 0 as *u8), "/tmp/vxg_s1.txt" as *u8)
  og_runv(ob, og_args("link" as *u8, pfx, "bob" as *u8, "carol" as *u8, "2026-01-01" as *u8, 0 as *u8), "/tmp/vxg_s2.txt" as *u8)
  og_runv(ob, og_args("link" as *u8, pfx, "me" as *u8, "dave" as *u8, "2026-01-01" as *u8, 0 as *u8), "/tmp/vxg_s3.txt" as *u8)
  og_runv(ob, og_args("link" as *u8, pfx, "dave" as *u8, "carol" as *u8, "2026-01-01" as *u8, 0 as *u8), "/tmp/vxg_s4.txt" as *u8)
152
  // 3 neighbors me -> alice + dave, count=2
  og_runv(ob, og_args("neighbors" as *u8, pfx, "me" as *u8, 0 as *u8, 0 as *u8, 0 as *u8), "/tmp/vxg_n.txt" as *u8)
  r = 0
  if og_has("/tmp/vxg_n.txt" as *u8, "count=2" as *u8) == 1 {
      if og_has("/tmp/vxg_n.txt" as *u8, "alice" as *u8) == 1 { if og_has("/tmp/vxg_n.txt" as *u8, "dave" as *u8) == 1 { r = 1 } }
  }
  pass = pass + og_row("neighbors" as *u8, r)
160
  // 4 shortest path me->carol = via dave (len 2), NOT the 3-hop via alice/bob
  og_runv(ob, og_args("path" as *u8, pfx, "me" as *u8, "carol" as *u8, 0 as *u8, 0 as *u8), "/tmp/vxg_p1.txt" as *u8)
  r = 0
  if og_has("/tmp/vxg_p1.txt" as *u8, "VIZSLA-GRAPH-PATH from=me to=carol length=2 via=dave path=me>dave>carol" as *u8) == 1 {
      if og_has("/tmp/vxg_p1.txt" as *u8, "me>alice>bob>carol" as *u8) == 0 { r = 1 }
  }
  pass = pass + og_row("shortest-path" as *u8, r)
168
  // 5 symmetric: carol->me also length 2
  og_runv(ob, og_args("path" as *u8, pfx, "carol" as *u8, "me" as *u8, 0 as *u8, 0 as *u8), "/tmp/vxg_p2.txt" as *u8)
  r = og_has("/tmp/vxg_p2.txt" as *u8, "from=carol to=me length=2" as *u8)
  pass = pass + og_row("symmetric" as *u8, r)
173
  // 6 multi-hop alice->carol = via bob
  og_runv(ob, og_args("path" as *u8, pfx, "alice" as *u8, "carol" as *u8, 0 as *u8, 0 as *u8), "/tmp/vxg_p3.txt" as *u8)
  r = og_has("/tmp/vxg_p3.txt" as *u8, "VIZSLA-GRAPH-PATH from=alice to=carol length=2 via=bob path=alice>bob>carol" as *u8)
  pass = pass + og_row("multi-hop" as *u8, r)
178
  // 7 no path to a stranger
  og_runv(ob, og_args("path" as *u8, pfx, "me" as *u8, "eve" as *u8, 0 as *u8, 0 as *u8), "/tmp/vxg_p4.txt" as *u8)
  r = og_has("/tmp/vxg_p4.txt" as *u8, "from=me to=eve length=-1 via=NONE path=NONE" as *u8)
  pass = pass + og_row("no-path" as *u8, r)
183
  // 8 self path
  og_runv(ob, og_args("path" as *u8, pfx, "me" as *u8, "me" as *u8, 0 as *u8, 0 as *u8), "/tmp/vxg_p5.txt" as *u8)
  r = og_has("/tmp/vxg_p5.txt" as *u8, "from=me to=me length=0" as *u8)
  pass = pass + og_row("self-path" as *u8, r)
188
  // 9 neg self-loop link
  let rc9: i64 = og_runv(ob, og_args("link" as *u8, pfx, "bob" as *u8, "bob" as *u8, "2026-01-01" as *u8, 0 as *u8), "/tmp/vxg_neg.txt" as *u8)
  r = 0
  if rc9 == 1 { r = 1 }
  pass = pass + og_row("neg-self-loop" as *u8, r)
194
  let permil: i64 = (pass * 1000) / 9
  let logfd: i64 = sys_openat_append("knowledge/status/vizsla_gate.log" as *u8, 0x1a4)
  var fdi: i64 = 0
  while fdi < 2 {
      var fd: i64 = 1
      if fdi == 1 { fd = logfd }
      if fd > 0 {
          let line: *u8 = sys_mmap(256)
          var o: i64 = 0
          o = og_cat(line, o, "VIZSLA-GRAPH-GATE epoch=" as *u8)
          o = og_catn(line, o, sys_now_realtime_sec())
          o = og_cat(line, o, " rows=9 pass=" as *u8)
          o = og_catn(line, o, pass)
          o = og_cat(line, o, " permil=" as *u8)
          o = og_catn(line, o, permil)
          if pass == 9 { o = og_cat(line, o, " verdict=GREEN\n" as *u8) } else { o = og_cat(line, o, " verdict=RED\n" as *u8) }
          sys_write(fd, line, o)
      }
      fdi = fdi + 1
  }
  if logfd > 0 { sys_close(logfd) }
  // MIGRATED onto nx_gate_verdict by nx_gate_dry_apply (D001, minimal form): every check
  // row above is untouched, so the PASS/FAIL vector cannot change; only the hand-rolled
  // verdict emission is replaced by the ONE shared base class. Proven by nx_gate_migrate verify.
  let ctr__dry: *i64 = gv_ctr()
  ctr__dry[0] = pass
  ctr__dry[1] = 9
  let rc__dry: i64 = gv_verdict("VIZSLA-GRAPH-GATE" as *u8, ctr__dry, "teeth unchanged; verdict emission migrated onto the shared base class" as *u8)
  sys_exit(rc__dry)
  return rc__dry
225}
nx_vizsla_graph_gate.nx source

`nx_vizsla_graph_gate.nx` source
