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

↩ module page · 937 lines · 64432 B
1// nx_docportal_search_seg_gate.nx -- GATE for the SOVEREIGN seg_store-native onsite search (nx_docportal_search_seg).
2// Writes 3 PUBLIC docs into a test shard through the RAW sovereign store (doc:<cid> keys, text values so
3// ss_write_seg builds .terms), then drives dss_search end-to-end over the REAL seg_store -- proving the sovereign
4// path (ss_open -> ss_term postings -> ss_hget -> rank) with NO tsv anywhere. Negative controls: absent term -> 0,
5// absent shard -> 0 (isolation, not a crash). license_tier: ORIGINAL
6import "nx_docportal_search_seg.nx"
7import "nx_gate_verdict.nx"   // D001 migration 2026-09-16: every tooth is a gv_check, the exit code carries the verdict
8
9// evidence-line builders (local, so this gate stays self-contained)
10func dsg_cat(b: *u8, off: i64, s: *u8) -> i64 { var o: i64 = off; var i: i64 = 0; while s[i] != (0 as u8) { b[o] = s[i]; o = o + 1; i = i + 1 } return o }
11func dsg_catn(b: *u8, off: i64, v: i64) -> i64 {
  var m: i64 = v
  if m < 0 { m = 0 }
  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 o: i64 = off
  var i: i64 = 0
  while i < k { b[o] = t[k - 1 - i]; o = o + 1; i = i + 1 }
  return o
22}
23
24func g_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 }
25func g_num(v: i64) -> i64 {
  let bb: *u8 = sys_mmap(28); var m: i64 = v
  if m < 0 { sys_write(1, "-" as *u8, 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 { bb[i] = t[k - 1 - i]; i = i + 1 }
  sys_write(1, bb, k); return 0
33}
34func g_strlen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
35
36// S7 fixture builder: head, then npre unique pad tokens (" zq<tag>p<k>"), then mid (if any), then npost more pads.
37// Pads are unique per document so they match no query term and raise no term's document frequency; the byte
38// length is what the fixture tunes (BM25 length normalisation reads |d| in BYTES). Returns the byte length.
39func s7_build(buf: *u8, head: *u8, tag: *u8, npre: i64, mid: *u8, npost: i64) -> i64 {
  var o: i64 = dsg_cat(buf, 0, head)
  var k: i64 = 0
  while k < npre { o = dsg_cat(buf, o, " zq" as *u8); o = dsg_cat(buf, o, tag); o = dsg_cat(buf, o, "p" as *u8); o = dsg_catn(buf, o, k); k = k + 1 }
  if mid[0] != (0 as u8) { o = dsg_cat(buf, o, " " as *u8); o = dsg_cat(buf, o, mid) }
  while k < npre + npost { o = dsg_cat(buf, o, " zq" as *u8); o = dsg_cat(buf, o, tag); o = dsg_cat(buf, o, "p" as *u8); o = dsg_catn(buf, o, k); k = k + 1 }
  buf[o] = 0 as u8
  return o
47}
48// one check: got n results with cids_out[0]==want_top (want_top<0 = don't care about top); expect_n<0 = don't care
49func g_check(name: *u8, got_n: i64, cids: *i64, expect_n: i64, want_top: i64, ctr: *i64) -> i64 {
  var ok: i64 = 1
  if expect_n >= 0 { if got_n != expect_n { ok = 0 } }
  if want_top >= 0 { if got_n < 1 { ok = 0 } else { if cids[0] != want_top { ok = 0 } } }
  g_puts(name); g_puts(" n="); g_num(got_n)
  g_puts("\n")
  gv_check(name, ok, ctr)
  return 0
57}
58
59// S9 fixture and tooth constants (2026-09-17): the three planted pages, the page the teeth read, the matching total
60const S9G_DOC_CONTENT: i64 = 850   // the long biography carrying the whole name once
61const S9G_DOC_RESULTS: i64 = 851   // another engine's results page repeating the name
62const S9G_DOC_RARE: i64 = 852      // the page carrying only the rare word
63const S9G_DOC_SCATTER: i64 = 853   // both words present but far apart (co-occurrence is not a name)
64const S9G_RANK_FOURTH: i64 = 3     // zero-based slot of the fourth result
65const S9G_ENT_SLOTS: i64 = 4       // S11: entity announce box
66const S9G_DOC_ABSENT: i64 = 999    // S11: a pinned cid that is not in the shard
67const S9G_FILE_MODE: i64 = 420     // 0644 for the fixture table
68const S9G_FE_101: i64 = 1789600000   // S12: planted fetch epochs (doc 103 deliberately carries none)
69const S9G_FE_102: i64 = 1789650000
70const S9G_FE_NOW: i64 = 1789660000   // S12: the clock the arithmetic teeth read
71const S9G_FE_YOUNG: i64 = 5          // S12: a third observed age for the odd-count median
72const S9G_CH_Z: i64 = 122          // S11-b: the fixture jp name is zq
73const S9G_CH_Q: i64 = 113
74const S9G_PAGE: i64 = 10           // one result page
75const S9G_MATCHING: i64 = 14       // 850, 851, 852, 853 and the ten fillers all match the name query
76const S9G_TOP3: i64 = 3            // the three planted pages the order teeth read
77const S9G_TOTAL_SLOTS: i64 = 2     // dss_search_off_div's totalout pair
78const S9G_RANK_THIRD: i64 = 2      // zero-based slot of the third result
79const S9G_BUF_4K: i64 = 4096       // one page: the long-doc and S7 fixture builders
80// S11: a fixture table for the entity pin (truncate-written, never the production path)
81func s9g_write_file(path: *u8, s: *u8) -> i64 {
  let fd: i64 = sys_openat_wr(path, S9G_FILE_MODE)
  if fd < 0 { return 0 - 1 }
  let n: i64 = g_strlen(s)
  var w: i64 = 0
  var bad: i64 = 0
  while w < n { if bad == 1 { w = n } else { let k: i64 = sys_write(fd, ((s as i64) + w) as *u8, n - w); if k <= 0 { bad = 1 } else { w = w + k } } }
  sys_close(fd)
  return n
90}
91func main(argc: i64, argv: *i64) -> i64 {
  g_puts("=== nx_docportal_search_seg gate (SOVEREIGN seg_store search, no tsv) ===\n")
  // --- write a test PUBLIC shard through the raw sovereign store ---
  let prefix: *u8 = "knowledge/store/dp-ssgatetest-pub-" as *u8
  let d1: *u8 = "Estate Planning wills living trusts probate inheritance executor" as *u8
  let d2: *u8 = "Family Law divorce child custody support alimony parenting plans" as *u8
  let d3: *u8 = "Business Law llc corporation formation contracts operating agreement" as *u8
  // consent rows (same segment, deterministic re-runs): 104 opted OUT of search (pol=2 = AI_BLOG only),
  // 105 opted IN (pol=1). 101-103 stay pol-FREE = the absent-pol default-searchable path.
  let d4: *u8 = "Adoption confidential retainer matters" as *u8
  let d5: *u8 = "Municipal annexation ordinance guidance" as *u8
  // IDEMPOTENT FIXTURE (2026-09-16): a seg_store commit APPENDS its segment to the shard's existing manifest, so a
  // fixture shard that outlives the gate carries every generation of the fixture ever written -- on the NAS the
  // exact-count teeth (T1 probate -> exactly one doc) read n=2 against docs an older generation of this file wrote,
  // while the same binary read 51/51 on a laptop whose shard was born of the current generation. A gate that is not
  // idempotent reports on its first run and lies about every run after. Readers see only the segments the manifest
  // names, so unlinking the manifest before the commit gives every run a shard holding exactly this file's docs
  // (the rewritten seg-1 replaces the old; unreferenced older segments are inert). Both fixture shards.
  sys_unlinkat("knowledge/store/dp-ssgatetest-pub-manifest.txt" as *u8)
  sys_unlinkat("knowledge/store/dp-ssgatefuse-pub-manifest.txt" as *u8)
  let w: *i64 = ss_begin()
  ss_add(w, 1, "doc:101" as *u8, d1, g_strlen(d1))
  ss_add(w, 1, "doc:102" as *u8, d2, g_strlen(d2))
  ss_add(w, 1, "doc:103" as *u8, d3, g_strlen(d3))
  // url rows for the site: field-filter rows (103 deliberately has NO url = not site-attributable)
  ss_add(w, 1, "url:101" as *u8, "https://en.wikipedia.org/wiki/Trust_law" as *u8, 39)
  ss_add(w, 1, "url:102" as *u8, "https://law.example.com/family" as *u8, 30)
  ss_add(w, 1, "fe:101" as *u8, "1789600000" as *u8, 10)   // S12: fetch epochs beside two docs; 103 has none on purpose
  ss_add(w, 1, "fe:102" as *u8, "1789650000" as *u8, 10)
  ss_add(w, 1, "doc:104" as *u8, d4, g_strlen(d4))
  ss_add(w, 1, "pol:104" as *u8, "2" as *u8, 1)
  ss_add(w, 1, "doc:105" as *u8, d5, g_strlen(d5))
  ss_add(w, 1, "pol:105" as *u8, "1" as *u8, 1)
  // IDF fixture (T9): idfrare lives in ONE doc (106); idfcommon in FOUR (107-110). Equal tf. The OLD
  // distinct+tf scorer TIED 106 vs 107 (first candidate won = 107, postings order); only IDF ranking
  // puts the rare-term doc on top -- this row fails on the old scorer BY CONSTRUCTION.
  let d6: *u8 = "idfrare idfrare notice" as *u8
  let d7: *u8 = "idfcommon idfcommon memo" as *u8
  let d8: *u8 = "idfcommon lorem" as *u8
  let d9: *u8 = "idfcommon ipsum" as *u8
  let d10: *u8 = "idfcommon dolor" as *u8
  ss_add(w, 1, "doc:106" as *u8, d6, g_strlen(d6))
  ss_add(w, 1, "doc:107" as *u8, d7, g_strlen(d7))
  ss_add(w, 1, "doc:108" as *u8, d8, g_strlen(d8))
  ss_add(w, 1, "doc:109" as *u8, d9, g_strlen(d9))
  ss_add(w, 1, "doc:110" as *u8, d10, g_strlen(d10))
  // length-norm fixture (T14): the LONG doc (126) is inserted FIRST -- under b=0 equal tf tied and
  // candidate order won (126); full BM25's verbosity correction must put the SHORT doc (127) on top.
  let dlong: *u8 = sys_mmap(S9G_BUF_4K)
  var dlo: i64 = 0
  var lr: i64 = 0
  while lr < 80 { let wf: *u8 = "verbose filler prose words continue onward " as *u8; var wj: i64 = 0; while wf[wj] != (0 as u8) { dlong[dlo] = wf[wj]; dlo = dlo + 1; wj = wj + 1 } lr = lr + 1 }
  let lm: *u8 = "lennorm appears once here" as *u8
  var lj: i64 = 0
  while lm[lj] != (0 as u8) { dlong[dlo] = lm[lj]; dlo = dlo + 1; lj = lj + 1 }
  let dshort: *u8 = "lennorm short focused note" as *u8
  ss_add(w, 1, "doc:126" as *u8, dlong, dlo)
  ss_add(w, 1, "doc:127" as *u8, dshort, g_strlen(dshort))
  // stemming fixture (T18): a doc that only says the INFLECTED form -- query stem-expansion must recall it
  let dstem: *u8 = "stemtoken indexing crawlers were ranking pages" as *u8
  ss_add(w, 1, "doc:128" as *u8, dstem, g_strlen(dstem))
  // pagination fixture (T10): 15 pgseg docs -> offset/total behavior is provable (page sizes 10/5/0)
  let dpg: *u8 = "pgseg pagination fixture entry" as *u8
  let pgkey: *u8 = sys_mmap(24)
  var pgi: i64 = 111
  while pgi <= 125 {
      var ko: i64 = 0
      let kp: *u8 = "doc:" as *u8
      while kp[ko] != (0 as u8) { pgkey[ko] = kp[ko]; ko = ko + 1 }
      pgkey[ko] = (48 + (pgi / 100)) as u8
      pgkey[ko + 1] = (48 + ((pgi / 10) % 10)) as u8
      pgkey[ko + 2] = (48 + (pgi % 10)) as u8
      pgkey[ko + 3] = 0 as u8
      ss_add(w, 1, pgkey, dpg, g_strlen(dpg))
      pgi = pgi + 1
  }
  // host-diversity fixture (T22/T23): 5 docs on crowd.example.com (tf=2) + 2 on other.example.com (tf=1),
  // all matching "diversitytest". WITHOUT the cap (webdiv=0) the 5 tf=2 crowd docs take the top 5 slots
  // (cids[3]=304); WITH the cap (webdiv=1, DSS_HOSTCAP=3) an OTHER-host doc is promoted into slot 3
  // (cids[3]=306) once crowd hits the cap -- distinguishing by construction (the old scorer had no cap).
  let dcrowd: *u8 = "diversitytest diversitytest note" as *u8
  let dother: *u8 = "diversitytest memo" as *u8
  ss_add(w, 1, "doc:301" as *u8, dcrowd, g_strlen(dcrowd))
  ss_add(w, 1, "url:301" as *u8, "https://crowd.example.com/1" as *u8, 27)
  ss_add(w, 1, "doc:302" as *u8, dcrowd, g_strlen(dcrowd))
  ss_add(w, 1, "url:302" as *u8, "https://crowd.example.com/2" as *u8, 27)
  ss_add(w, 1, "doc:303" as *u8, dcrowd, g_strlen(dcrowd))
  ss_add(w, 1, "url:303" as *u8, "https://crowd.example.com/3" as *u8, 27)
  ss_add(w, 1, "doc:304" as *u8, dcrowd, g_strlen(dcrowd))
  ss_add(w, 1, "url:304" as *u8, "https://crowd.example.com/4" as *u8, 27)
  ss_add(w, 1, "doc:305" as *u8, dcrowd, g_strlen(dcrowd))
  ss_add(w, 1, "url:305" as *u8, "https://crowd.example.com/5" as *u8, 27)
  ss_add(w, 1, "doc:306" as *u8, dother, g_strlen(dother))
  ss_add(w, 1, "url:306" as *u8, "https://other.example.com/6" as *u8, 27)
  ss_add(w, 1, "doc:307" as *u8, dother, g_strlen(dother))
  ss_add(w, 1, "url:307" as *u8, "https://other.example.com/7" as *u8, 27)
  // authority fusion fixture (T28/T29): two docs identical content (equal BM25), different urls; doc 601's url
  // carries a high pr: prior, doc 600's has none. webdiv=0 -> tie broken by candidate order (600 first);
  // webdiv=1 -> the PageRank prior lifts 601 over 600 (distinguishing: pre-fuse, webdiv=1 also gave 600).
  let dae: *u8 = "authorityterm equalcontent alpha" as *u8
  let u600: *u8 = "https://plain.example/b" as *u8
  let u601: *u8 = "https://authority.example/a" as *u8
  ss_add(w, 1, "doc:600" as *u8, dae, g_strlen(dae))
  ss_add(w, 1, "url:600" as *u8, u600, g_strlen(u600))
  ss_add(w, 1, "doc:601" as *u8, dae, g_strlen(dae))
  ss_add(w, 1, "url:601" as *u8, u601, g_strlen(u601))
  let prk: *u8 = sys_mmap(48)
  dss_prkey(dss_urlcid(u601, g_strlen(u601)), prk)
  let prv: *i64 = sys_mmap(16) as *i64
  prv[0] = 500000000
  ss_add(w, 1, prk, prv as *u8, 8)
  // url-dedup fixture (T30/T31): docs 700+701 = two crawl SNAPSHOTS of the SAME url (identical content ->
  // equal BM25; distinct content cids in prod, distinct doc keys here). webdiv=1 must serve ONE.
  let ddup: *u8 = "zqduppage snapshot content for url dedup" as *u8
  let udup: *u8 = "https://dup.example.com/page" as *u8
  ss_add(w, 1, "doc:700" as *u8, ddup, g_strlen(ddup))
  ss_add(w, 1, "url:700" as *u8, udup, g_strlen(udup))
  ss_add(w, 1, "doc:701" as *u8, ddup, g_strlen(ddup))
  ss_add(w, 1, "url:701" as *u8, udup, g_strlen(udup))
  // entity-collapse fixture (T32/T33): 710/711/712 are the SAME article under three LANGUAGE
  // subdomains -- identical PATH, hosts differing only in their leading label -- which is the real
  // shape measured on 2026-08-17 (20 of 30 SERP slots were one Wikipedia article in ~20 editions).
  // This is NOT the T30/T31 case: those are two snapshots of ONE url, these are FOUR DISTINCT urls.
  // 713 IS THE NEGATIVE CONTROL and it is the whole reason this fixture can fail honestly: it sits on
  // the SAME domain family but a DIFFERENT path, so a rule that collapsed by host-suffix alone would
  // wrongly swallow it. Without 713 an entity key that merged everything on a domain would score 100%.
  // All four carry IDENTICAL content so BM25 ties and candidate order decides -- which makes the cap
  // the ONLY thing that can move the order, and makes the control/fire pair distinguishing by
  // construction (the pre-change code has no entity key at all).
  let dent: *u8 = "zqentitypage shared article body" as *u8
  let uen: *u8 = "https://en.wikitest.org/wiki/Entity" as *u8
  let usv: *u8 = "https://sv.wikitest.org/wiki/Entity" as *u8
  let uit: *u8 = "https://it.wikitest.org/wiki/Entity" as *u8
  let uot: *u8 = "https://en.wikitest.org/wiki/Other" as *u8
  ss_add(w, 1, "doc:710" as *u8, dent, g_strlen(dent))
  ss_add(w, 1, "url:710" as *u8, uen, g_strlen(uen))
  ss_add(w, 1, "doc:711" as *u8, dent, g_strlen(dent))
  ss_add(w, 1, "url:711" as *u8, usv, g_strlen(usv))
  ss_add(w, 1, "doc:712" as *u8, dent, g_strlen(dent))
  ss_add(w, 1, "url:712" as *u8, uit, g_strlen(uit))
  ss_add(w, 1, "doc:713" as *u8, dent, g_strlen(dent))
  ss_add(w, 1, "url:713" as *u8, uot, g_strlen(uot))
  // proximity fixture (T-prox, R1b): 801 (scattered) + 800 (clustered) have the SAME length + SAME tf
  // -> IDENTICAL BM25; ONLY the proximity boost distinguishes them. 801 is indexed FIRST (so a naive
  // tie would pick 801); the CLUSTERED 800 must win via proximity. proxterma/proxtermb/zfil* are unique.
  let dpxs: *u8 = "proxterma zfila zfilb zfilc zfild zfile zfilf proxtermb" as *u8
  let dpxc: *u8 = "zfilg zfilh zfili zfilj proxterma proxtermb zfilk zfill" as *u8
  ss_add(w, 1, "doc:801" as *u8, dpxs, g_strlen(dpxs))
  ss_add(w, 1, "doc:800" as *u8, dpxc, g_strlen(dpxc))
  // title-field fixture (T-title, R1c): 901 (body) + 900 (title) have SAME length + SAME tf -> IDENTICAL
  // BM25; only the title-field boost distinguishes. 901 indexed FIRST; the TITLE-match 900 must win.
  let dttl: *u8 = "titletok aaa1 aaa2 aaa3 aaa4 aaa5 aaa6 aaa7" as *u8
  let dbod: *u8 = "bbb1 bbb2 bbb3 bbb4 bbb5 bbb6 titletok bbb7" as *u8
  ss_add(w, 1, "doc:901" as *u8, dbod, g_strlen(dbod))
  ss_add(w, 1, "doc:900" as *u8, dttl, g_strlen(dttl))
  // multilingual fixture (2026-07-23, T33-T36): Russian (Cyrillic word tokens, case-folded),
  // Japanese (Han bigrams), Korean (Hangul bigrams) -- end-to-end through the FULL dss path
  // (query tokenize -> postings -> BM25 tf-scan re-tokenizing the doc). Unique terms, no fixture overlap.
  let dru: *u8 = "\xD1\x81\xD1\x83\xD0\xB4 \xD0\xBF\xD0\xBE \xD0\xBD\xD0\xB0\xD1\x81\xD0\xBB\xD0\xB5\xD0\xB4\xD1\x81\xD1\x82\xD0\xB2\xD1\x83 \xD0\xB2 \xD0\xBC\xD0\xBE\xD1\x81\xD0\xBA\xD0\xB2\xD0\xB5 \xD1\x80\xD0\xB0\xD1\x81\xD1\x81\xD0\xBC\xD0\xBE\xD1\x82\xD1\x80\xD0\xB5\xD0\xBB \xD0\xB4\xD0\xB5\xD0\xBB\xD0\xBE" as *u8
  let dja: *u8 = "\xE6\x9D\xB1\xE4\xBA\xAC\xE5\xA4\xA7\xE5\xAD\xA6 \xE7\xA0\x94\xE7\xA9\xB6" as *u8
  let dko: *u8 = "\xED\x95\x9C\xEA\xB5\xAD \xEA\xB2\x80\xEC\x83\x89 \xEC\x97\x94\xEC\xA7\x84 \xEA\xB0\x9C\xEB\xB0\x9C" as *u8
  ss_add(w, 1, "doc:950" as *u8, dru, g_strlen(dru))
  ss_add(w, 1, "doc:951" as *u8, dja, g_strlen(dja))
  ss_add(w, 1, "doc:952" as *u8, dko, g_strlen(dko))
  // R2b url-scope fixture (T37-T40, 2026-08-04): four docs share the term "subgadget"; only 960 lives
  // under /r/gadgetlab on reddit. 963 = the SEGMENT-ANCHOR decoy (/r/gadgetlabmemes must NOT satisfy
  // r/gadgetlab). 962 = the off-reddit control for inurl: (its url carries no "comments").
  let dsr1: *u8 = "subgadget review thread alpha" as *u8
  let dsr2: *u8 = "subgadget review thread beta" as *u8
  let dsr3: *u8 = "subgadget review blogpost" as *u8
  let dsr4: *u8 = "subgadget meme collection" as *u8
  ss_add(w, 1, "doc:960" as *u8, dsr1, g_strlen(dsr1))
  let u960: *u8 = "https://old.reddit.com/r/gadgetlab/comments/ab1/thread/" as *u8
  ss_add(w, 1, "url:960" as *u8, u960, g_strlen(u960))
  ss_add(w, 1, "doc:961" as *u8, dsr2, g_strlen(dsr2))
  let u961: *u8 = "https://old.reddit.com/r/cooking/comments/cd2/thread/" as *u8
  ss_add(w, 1, "url:961" as *u8, u961, g_strlen(u961))
  ss_add(w, 1, "doc:962" as *u8, dsr3, g_strlen(dsr3))
  let u962: *u8 = "https://techblog.example.com/subgadget-review" as *u8
  ss_add(w, 1, "url:962" as *u8, u962, g_strlen(u962))
  ss_add(w, 1, "doc:963" as *u8, dsr4, g_strlen(dsr4))
  let u963: *u8 = "https://old.reddit.com/r/gadgetlabmemes/xyz" as *u8
  ss_add(w, 1, "url:963" as *u8, u963, g_strlen(u963))
  // S7 bm25q-fusion fixture (T49, 2026-09-16) in its OWN shard (dp-ssgatefuse-pub-), so the tooth is IDEMPOTENT:
  // the shared fixture shard accumulates a version of every doc per run and write-time dcount counts versions, so
  // any expectation that leans on an idf RATIO drifts run over run (measured: the same corpus read moved=2 on one
  // run and moved=0 on the next). Here the repeated term and the rare term sit in EXACTLY the same number of docs
  // (x in 970/971/972, z in 971/972/973), so their idfs are equal on every run whatever the version count, and the
  // cycle is set by LENGTH alone: 970 = the repeated term six times at the candidate mean (tfnorm 1.83), 971 = it
  // once beside z at 0.69x the mean (tfnorm 1.15), 972 = the same one pad longer, 973 = z alone in a long doc.
  // Every x-doc has x at token 0, so the title bonus plus proximity saturate its factor at 2x and cancel. Plain
  // weights the repeat 2x: 970 (7.3w) > 971 (6.9w) > 972 > 973; BM25Q weights it 1.374x: 971 (5.4w) > 972 > 970
  // (5.0w) > 973 -- a 3-cycle, so the fusion moves 970 and 971 (moved=2); coordination then drops 970 (no z) and
  // 971 serves first. The tooth prints the byte lengths so a drift is readable.
  let prefix2: *u8 = "knowledge/store/dp-ssgatefuse-pub-" as *u8
  let w2: *i64 = ss_begin()
  let s7buf: *u8 = sys_mmap(S9G_BUF_4K)
  let s7l970: i64 = s7_build(s7buf, "zqxrep zqxrep zqxrep zqxrep zqxrep zqxrep" as *u8, "a" as *u8, 24, "" as *u8, 0)
  ss_add(w2, 1, "doc:970" as *u8, s7buf, s7l970)
  let s7l971: i64 = s7_build(s7buf, "zqxrep" as *u8, "b" as *u8, 19, "zqzrare" as *u8, 0)
  ss_add(w2, 1, "doc:971" as *u8, s7buf, s7l971)
  let s7l972: i64 = s7_build(s7buf, "zqxrep" as *u8, "c" as *u8, 20, "zqzrare" as *u8, 0)
  ss_add(w2, 1, "doc:972" as *u8, s7buf, s7l972)
  let s7l973: i64 = s7_build(s7buf, "zqzrare" as *u8, "d" as *u8, 47, "" as *u8, 0)
  ss_add(w2, 1, "doc:973" as *u8, s7buf, s7l973)
  // S9 ENTITY DISCRIMINATOR fixture (T50-T52, 2026-09-17): 850 = a content page carrying both name words once;
  // (ids and page sizes named below so the magic ratchet reads purpose, not values)
  // 851 = another engine's RESULTS PAGE (url /search?q=) repeating both words six times; 852 = a content page
  // carrying only the RARE word sixteen times (the poem-form-article shape: under plain BM25 it outscores the
  // page carrying the whole name); 860-869 make zqnamea the COMMON word so zqnameb's idf carries 852.
  // 850 is LONG on purpose: a real profile page mentions the name once inside a biography, and BM25 length
  // normalisation plus the 0.5x results-page multiplier still leaves a short results page repeating the name
  // ABOVE it (the live shape 2026-09-16: content 88M, results pages 38M = 77M raw). The tier is what fixes it.
  let d850: *u8 = "zqnamea zqnameb profile biography born career early life education family works awards filmography agency debut studio released series photobook interview magazine cover television appearance radio host event stage collaboration brand ambassador charity sport hobby travel language music instrument reading writing painting cooking garden pets childhood school university degree thesis mentor colleague friend partner marriage children residence hometown region country citizenship heritage ancestry retirement legacy archive museum exhibition catalogue foundation scholarship prize nomination ceremony gala festival premiere audience critic review rating chart sales" as *u8
  let d851: *u8 = "zqnamea zqnameb zqnamea zqnameb zqnamea zqnameb zqnamea zqnameb zqnamea zqnameb zqnamea zqnameb results" as *u8
  let d852: *u8 = "zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb zqnameb poem" as *u8
  let u850: *u8 = "https://content.example.com/people/zqnamea-zqnameb" as *u8
  let u851: *u8 = "https://engine.example.com/search?q=zqnamea+zqnameb" as *u8
  let u852: *u8 = "https://content.example.com/poems/zqnameb" as *u8
  ss_add(w, 1, "doc:850" as *u8, d850, g_strlen(d850)); ss_add(w, 1, "url:850" as *u8, u850, g_strlen(u850))
  ss_add(w, 1, "doc:851" as *u8, d851, g_strlen(d851)); ss_add(w, 1, "url:851" as *u8, u851, g_strlen(u851))
  ss_add(w, 1, "doc:852" as *u8, d852, g_strlen(d852)); ss_add(w, 1, "url:852" as *u8, u852, g_strlen(u852))
  // 853 (S9b): both words, SCATTERED -- the first word opens the page, the second closes it. Coverage 2, no phrase.
  let d853: *u8 = "zqnamea opens this note about many unrelated things weather harvest markets travel lodging recipes tools repairs gardens letters accounts errands neighbours meetings schedules budgets receipts invoices ledgers archives catalogues indexes registers rosters calendars almanacs journals diaries memoirs essays reports surveys reviews digests summaries abstracts glossaries manuals handbooks guides primers tutorials lessons courses lectures seminars workshops clinics forums panels debates and closes with zqnameb" as *u8
  let u853: *u8 = "https://content.example.com/notes/zq" as *u8
  ss_add(w, 1, "doc:853" as *u8, d853, g_strlen(d853)); ss_add(w, 1, "url:853" as *u8, u853, g_strlen(u853))
  let dfil: *u8 = "zqnamea filler note" as *u8
  ss_add(w, 1, "doc:860" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:860" as *u8, "https://f0.example.com/p" as *u8, g_strlen("https://f0.example.com/p" as *u8))
  ss_add(w, 1, "doc:861" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:861" as *u8, "https://f1.example.com/p" as *u8, g_strlen("https://f1.example.com/p" as *u8))
  ss_add(w, 1, "doc:862" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:862" as *u8, "https://f2.example.com/p" as *u8, g_strlen("https://f2.example.com/p" as *u8))
  ss_add(w, 1, "doc:863" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:863" as *u8, "https://f3.example.com/p" as *u8, g_strlen("https://f3.example.com/p" as *u8))
  ss_add(w, 1, "doc:864" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:864" as *u8, "https://f4.example.com/p" as *u8, g_strlen("https://f4.example.com/p" as *u8))
  ss_add(w, 1, "doc:865" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:865" as *u8, "https://f5.example.com/p" as *u8, g_strlen("https://f5.example.com/p" as *u8))
  ss_add(w, 1, "doc:866" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:866" as *u8, "https://f6.example.com/p" as *u8, g_strlen("https://f6.example.com/p" as *u8))
  ss_add(w, 1, "doc:867" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:867" as *u8, "https://f7.example.com/p" as *u8, g_strlen("https://f7.example.com/p" as *u8))
  ss_add(w, 1, "doc:868" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:868" as *u8, "https://f8.example.com/p" as *u8, g_strlen("https://f8.example.com/p" as *u8))
  ss_add(w, 1, "doc:869" as *u8, dfil, g_strlen(dfil)); ss_add(w, 1, "url:869" as *u8, "https://f9.example.com/p" as *u8, g_strlen("https://f9.example.com/p" as *u8))
  ss_commit(prefix2, w2, 1)
  ss_commit(prefix, w, 1)
  g_puts("wrote 40 docs (+2 pol, +7 host-crowding, +2 authority +1 pr:, +2 url-dup, +4 url-scope) -> dp-ssgatetest-pub-\n")
331
  let ctr: *i64 = gv_ctr()
  let cids: *i64 = sys_mmap(64 * 8) as *i64
  let scores: *i64 = sys_mmap(64 * 8) as *i64
  let dom: *u8 = "ssgatetest" as *u8
336
  // T1: "probate" -> exactly doc 101 (only estate mentions probate)
  let q1: *u8 = "probate" as *u8
  let n1: i64 = dss_search(dom, q1, g_strlen(q1), cids, scores, 10)
  g_check("T1 probate->101" as *u8, n1, cids, 1, 101, ctr)
341
  // T2: "divorce custody" -> doc 102 top (matches BOTH terms)
  let q2: *u8 = "divorce custody" as *u8
  let n2: i64 = dss_search(dom, q2, g_strlen(q2), cids, scores, 10)
  g_check("T2 divorce+custody->102" as *u8, n2, cids, 1, 102, ctr)
346
  // T3: "law contracts" -> doc 103 TOP (matches law+contracts=2) above 102 (law=1). 2 candidates.
  let q3: *u8 = "law contracts" as *u8
  let n3: i64 = dss_search(dom, q3, g_strlen(q3), cids, scores, 10)
  g_check("T3 law+contracts->103 top" as *u8, n3, cids, 2, 103, ctr)
351
  // T4: "law" -> both 102 (Family Law) and 103 (Business Law); 101 has no 'law'
  let q4: *u8 = "law" as *u8
  let n4: i64 = dss_search(dom, q4, g_strlen(q4), cids, scores, 10)
  g_check("T4 law->2 docs" as *u8, n4, cids, 2, 0 - 1, ctr)
356
  // T5 NEG: absent term -> 0 results (no false hit)
  let q5: *u8 = "zzznotpresentanywhere" as *u8
  let n5: i64 = dss_search(dom, q5, g_strlen(q5), cids, scores, 10)
  g_check("T5 NEG absent-term->0" as *u8, n5, cids, 0, 0 - 1, ctr)
361
  // T6 NEG (isolation): a domain with NO shard -> 0, not -2, not a crash
  let q6: *u8 = "probate" as *u8
  let n6: i64 = dss_search("nosuchdomain" as *u8, q6, g_strlen(q6), cids, scores, 10)
  g_check("T6 NEG absent-shard->0" as *u8, n6, cids, 0, 0 - 1, ctr)
366
  // T7 NEG (owner consent): doc 104 exists in the pub shard but its pol row LACKS the search bit
  // (pol=2 = AI_BLOG only) -> query-time consent filter EXCLUDES it (the retired tsv emitter's
  // emission-time enforcement, now live per hit)
  let q7: *u8 = "adoption" as *u8
  let n7: i64 = dss_search(dom, q7, g_strlen(q7), cids, scores, 10)
  g_check("T7 NEG consent opt-out excluded" as *u8, n7, cids, 0, 0 - 1, ctr)
373
  // T8 (owner consent): doc 105's pol row HAS the search bit (pol=1) -> included
  let q8: *u8 = "annexation" as *u8
  let n8: i64 = dss_search(dom, q8, g_strlen(q8), cids, scores, 10)
  g_check("T8 consent opt-in included" as *u8, n8, cids, 1, 105, ctr)
378
  // T9 (IDF ranking): query "idfcommon idfrare" -- 5 candidates; the RARE-term doc (106) must be TOP.
  // idf(idfrare)=log2(N/1) >> idf(idfcommon)=log2(N/4); tf equal (2 each for 106/107). The retired
  // distinct+tf scorer tied them and candidate order picked 107 -- this row is the ranking-rung proof.
  let q9: *u8 = "idfcommon idfrare" as *u8
  let n9: i64 = dss_search(dom, q9, g_strlen(q9), cids, scores, 10)
  g_check("T9 IDF: rare-term doc outranks common-term doc" as *u8, n9, cids, 5, 106, ctr)
385
  // T10 (pagination): 15 pgseg docs -- offset windows must return 10/5/0 with total=15 and disjoint pages
  let qp: *u8 = "pgseg" as *u8
  let tot: *i64 = sys_mmap(16) as *i64
  let np0: i64 = dss_search_off(dom, qp, g_strlen(qp), cids, scores, 10, 0, tot)
  let p0top: i64 = cids[0]
  let np1: i64 = dss_search_off(dom, qp, g_strlen(qp), cids, scores, 10, 10, tot)
  let p1top: i64 = cids[0]
  let np2: i64 = dss_search_off(dom, qp, g_strlen(qp), cids, scores, 10, 20, tot)
  var t10: i64 = 0
  if np0 == 10 { if np1 == 5 { if np2 == 0 { if tot[0] == 15 { if p0top != p1top { t10 = 1 } } } } }
  g_puts("T10 pagination offsets 10/5/0 total=15 disjoint")
  g_puts("\n")
  gv_check("T10-pagination-offsets-10/5/0-total=15-disjoint", t10, ctr)
399
  // T11 (+term AND): "law +contracts" keeps ONLY the doc that carries contracts (plain OR returned 2)
  let q11: *u8 = "law +contracts" as *u8
  let n11: i64 = dss_search(dom, q11, g_strlen(q11), cids, scores, 10)
  g_check("T11 +term AND filter" as *u8, n11, cids, 1, 103, ctr)
404
  // T12 did-you-mean: an unknown term corrects to the closest dictionary term (probete -> probate)
  let fix: *u8 = sys_mmap(256)
  let fl: i64 = dss_correct(dom, "probete" as *u8, 7, fix, 255)
  var t12: i64 = 0
  if fl == 7 {
      let want: *u8 = "probate" as *u8
      var eq12: i64 = 1
      var z12: i64 = 0
      while z12 < 7 { if fix[z12] != want[z12] { eq12 = 0; z12 = 7 } else { z12 = z12 + 1 } }
      t12 = eq12
  }
  g_puts("T12 did-you-mean probete->probate")
  g_puts("\n")
  gv_check("T12-did-you-mean-probete->probate", t12, ctr)
419
  // T13 suggest: the dictionary completes "prob" (top completion = probate)
  let sg: *u8 = sys_mmap(8 * 64)
  let n13: i64 = dss_suggest(dom, "prob" as *u8, 4, sg, 8)
  var t13: i64 = 0
  if n13 >= 1 {
      let w13: *u8 = "probate" as *u8
      var eq13: i64 = 1
      var z13: i64 = 0
      while z13 < 8 { if sg[z13] != w13[z13] { eq13 = 0; z13 = 8 } else { z13 = z13 + 1 } }
      t13 = eq13
  }
  g_puts("T13 suggest prob->probate")
  g_puts("\n")
  gv_check("T13-suggest-prob->probate", t13, ctr)
434
  // T14 (BM25 length norm): equal tf, wildly different lengths -- the SHORT doc must outrank the LONG
  // one (b=0 tied them and insertion order picked the long 126; b=0.75 must pick 127)
  let q14: *u8 = "lennorm" as *u8
  let n14: i64 = dss_search(dom, q14, g_strlen(q14), cids, scores, 10)
  g_check("T14 length-norm: short doc outranks verbose doc" as *u8, n14, cids, 2, 127, ctr)
440
  // T15/T16 PHRASE through dss: d1 carries "... living trusts ..." adjacent -- the quoted phrase
  // matches; the REVERSED phrase must not (order-sensitive adjacency via the NXQ1 sidecar)
  let q15: *u8 = "\"living trusts\"" as *u8
  let n15: i64 = dss_search(dom, q15, g_strlen(q15), cids, scores, 10)
  g_check("T15 phrase [living trusts] -> doc 101" as *u8, n15, cids, 1, 101, ctr)
  let q16: *u8 = "\"trusts living\"" as *u8
  let n16: i64 = dss_search(dom, q16, g_strlen(q16), cids, scores, 10)
  g_check("T16 NEG phrase [trusts living] -> 0" as *u8, n16, cids, 0, 0 - 1, ctr)
449
  // T17 (-term NOT): "law -contracts" -- OR gave both law docs; the exclusion drops the contracts one
  let q17: *u8 = "law -contracts" as *u8
  let n17: i64 = dss_search(dom, q17, g_strlen(q17), cids, scores, 10)
  g_check("T17 -term exclusion (law -contracts -> 102 only)" as *u8, n17, cids, 1, 102, ctr)
454
  // T18b (NO ZERO-SCORE NOISE, operator-reported "julia kyoka" bug): doc 128 has "ranking" (matched via
  // stem) but NOT "zznomatch". A 2-term query "ranking zznomatch" must return ONLY positively-scored docs;
  // no doc may appear at score 0. Assert every returned score is > 0.
  let qzs: *u8 = "ranking zznomatchword" as *u8
  let nzs: i64 = dss_search(dom, qzs, g_strlen(qzs), cids, scores, 20)
  var allpos: i64 = 1
  var zi: i64 = 0
  while zi < nzs { if scores[zi] <= 0 { allpos = 0 } zi = zi + 1 }
  g_puts("T18b no zero-score results (n="); g_num(nzs); g_puts(")")
  var tzs: i64 = 0
  if allpos == 1 { if nzs >= 1 { tzs = 1 } }
  g_puts(" allpos="); g_num(allpos); g_puts("
467")
  gv_check("T18b-no-zero-score-results-shown", tzs, ctr)
469
  // T18 (STEMMING recall): the doc says "indexing"/"crawlers"/"ranking"; queries for the STEM-shared
  // forms "index"/"crawler"/"rank" must recall it via query-time dictionary stem-expansion (no index change)
  let q18a: *u8 = "index" as *u8
  let n18a: i64 = dss_search(dom, q18a, g_strlen(q18a), cids, scores, 10)
  var t18: i64 = 0
  if n18a >= 1 {
      // 128 must be among the results (its only 'index'-family token is 'indexing')
      var f18: i64 = 0
      var z18: i64 = 0
      while z18 < n18a { if cids[z18] == 128 { f18 = 1 } z18 = z18 + 1 }
      // and a query for "crawler" must recall 128 (which only says "crawlers")
      let n18b: i64 = dss_search(dom, "crawler" as *u8, 7, cids, scores, 10)
      var f18b: i64 = 0
      var z18b: i64 = 0
      while z18b < n18b { if cids[z18b] == 128 { f18b = 1 } z18b = z18b + 1 }
      if f18 == 1 { if f18b == 1 { t18 = 1 } }
  }
  g_puts("T18 stemming recall (index->indexing, crawler->crawlers)")
  g_puts("\n")
  gv_check("T18-stemming-recall", t18, ctr)
490
  // T19-T21 (site: FIELD FILTER, the faceted rung): "law" matches 102 (law.example.com) + 103 (no url).
  // site:example.com keeps only 102 (dot-suffix host match; url-less 103 dropped as not site-attributable)
  let q19: *u8 = "law site:example.com" as *u8
  let n19: i64 = dss_search(dom, q19, g_strlen(q19), cids, scores, 10)
  g_check("T19 site: filter (law site:example.com -> 102 only)" as *u8, n19, cids, 1, 102, ctr)
  // cross-host NEG: no "law" doc lives on wikipedia.org
  let q20: *u8 = "law site:wikipedia.org" as *u8
  let n20: i64 = dss_search(dom, q20, g_strlen(q20), cids, scores, 10)
  g_check("T20 NEG site: cross-host (law site:wikipedia.org -> 0)" as *u8, n20, cids, 0, 0 - 1, ctr)
  // suffix-boundary NEG: kipedia.org must NOT match en.wikipedia.org (the '.' boundary rule)
  let q21: *u8 = "trusts site:kipedia.org" as *u8
  let n21: i64 = dss_search(dom, q21, g_strlen(q21), cids, scores, 10)
  var t21b: i64 = 0
  if n21 == 0 {
      let q21b: *u8 = "trusts site:wikipedia.org" as *u8
      let n21b: i64 = dss_search(dom, q21b, g_strlen(q21b), cids, scores, 10)
      if n21b == 1 { if cids[0] == 101 { t21b = 1 } }
  }
  g_puts("T21 suffix boundary (kipedia.org->0, wikipedia.org->101)")
  g_puts("\n")
  gv_check("T21-suffix-boundary", t21b, ctr)
512
  // T22 (host-diversity CONTROL, webdiv=0): no cap -> the 5 tf=2 crowd-host docs fill the top 5, so the
  // 4th result (cids[3]) is a crowd-host doc (304). Non-web scopes (site/trusted) always use this path.
  let qd: *u8 = "diversitytest" as *u8
  let td: *i64 = sys_mmap(16) as *i64
  let nd0: i64 = dss_search_off_div(dom, qd, g_strlen(qd), cids, scores, 10, 0, td, 0)
  var t22: i64 = 0
  if nd0 == 7 { if cids[3] == 304 { t22 = 1 } }
  g_puts("T22 host-cap CONTROL (webdiv=0: crowd fills top, cids[3]=304)")
  g_puts(" cids[3]="); g_num(cids[3]); g_puts(" n="); g_num(nd0); g_puts("\n")
  gv_check("T22-host-cap-CONTROL", t22, ctr)
523
  // T23 (host-diversity CAP, webdiv=1): crowd host caps at DSS_HOSTCAP=3, so an OTHER-host doc (306) is
  // promoted into slot 3 -- and ALL 7 still return (over-cap crowd docs overflow via phase B, never
  // deleted). Fails on the old code by construction (no cap -> cids[3]=304).
  let nd1: i64 = dss_search_off_div(dom, qd, g_strlen(qd), cids, scores, 10, 0, td, 1)
  var t23: i64 = 0
  if nd1 == 7 { if cids[3] == 306 { t23 = 1 } }
  g_puts("T23 host-cap FIRES (webdiv=1: cids[3]=306, all 7 still returned)")
  g_puts(" cids[3]="); g_num(cids[3]); g_puts(" n="); g_num(nd1); g_puts("\n")
  gv_check("T23-host-cap-FIRES", t23, ctr)
533
  // T32 (entity-collapse CONTROL, webdiv=0): no entity cap -> the three language editions of ONE
  // article keep consecutive slots, so cids[1] is another edition (711). This is the state the SERP
  // was actually in on 2026-08-17.
  let qe: *u8 = "zqentitypage" as *u8
  let te: *i64 = sys_mmap(16) as *i64
  let ne0: i64 = dss_search_off_div(dom, qe, g_strlen(qe), cids, scores, 10, 0, te, 0)
  var t32: i64 = 0
  if ne0 == 4 { if cids[1] == 711 { t32 = 1 } }
  g_puts("T32 entity-cap CONTROL (webdiv=0: editions stay adjacent, cids[1]=711)")
  g_puts(" cids[1]="); g_num(cids[1]); g_puts(" n="); g_num(ne0); g_puts("\n")
  gv_check("T32-entity-cap-CONTROL", t32, ctr)
545
  // T33 (entity-collapse FIRES, webdiv=1): one edition is served, then the DIFFERENT-path article on
  // the same domain family (713) takes slot 1 -- proving the key collapses editions WITHOUT swallowing
  // a genuinely different page. All 4 still return: over-cap editions overflow via phase B, so this
  // DOWN-RANKS and never deletes. Fails on the pre-change code by construction (no entity key exists).
  let ne1: i64 = dss_search_off_div(dom, qe, g_strlen(qe), cids, scores, 10, 0, te, 1)
  var t33: i64 = 0
  if ne1 == 4 { if cids[1] == 713 { t33 = 1 } }
  g_puts("T33 entity-cap FIRES (webdiv=1: cids[1]=713 different-path survives, all 4 returned)")
  g_puts(" cids[1]="); g_num(cids[1]); g_puts(" n="); g_num(ne1); g_puts("\n")
  gv_check("T33-entity-cap-FIRES", t33, ctr)
556
  // T24 (dss_is_web predicate): only the exact "web" shard triggers the cap; site domains + "trusted" +
  // a "web"-prefixed decoy do NOT (so a customer site named web*.com is never wrongly capped).
  var t24: i64 = 0
  if dss_is_web("web" as *u8) == 1 { if dss_is_web("trusted" as *u8) == 0 { if dss_is_web("andelinwest.com" as *u8) == 0 { if dss_is_web("weblog.com" as *u8) == 0 { t24 = 1 } } } }
  g_puts("T24 dss_is_web exact-match (web=1; trusted/site/web*=0)")
  g_puts("\n")
  gv_check("T24-dss_is_web-exact-match", t24, ctr)
564
  // T25 (dss_hosthash): same host -> same fingerprint; different host -> different; no url host -> 0.
  let hscr2: *u8 = sys_mmap(256)
  let hh_a: i64 = dss_hosthash("https://crowd.example.com/x" as *u8, 27, hscr2)
  let hh_b: i64 = dss_hosthash("https://crowd.example.com/y" as *u8, 27, hscr2)
  let hh_c: i64 = dss_hosthash("https://other.example.com/z" as *u8, 27, hscr2)
  let hh_d: i64 = dss_hosthash("relative/path/nohost" as *u8, 20, hscr2)
  var t25: i64 = 0
  if hh_a == hh_b { if hh_a != hh_c { if hh_a != 0 { if hh_d == 0 { t25 = 1 } } } }
  g_puts("T25 dss_hosthash (same-host eq, diff-host neq, no-host=0)")
  g_puts("\n")
  gv_check("T25-dss_hosthash", t25, ctr)
576
  // T28 (P1 authority CONTROL, webdiv=0): equal-BM25 tie -> candidate order -> doc 600 first (no pr fusion)
  let qa: *u8 = "authorityterm" as *u8
  let ta: *i64 = sys_mmap(16) as *i64
  let na0: i64 = dss_search_off_div(dom, qa, g_strlen(qa), cids, scores, 10, 0, ta, 0)
  g_check("T28 authority CONTROL (webdiv=0: tie -> 600)" as *u8, na0, cids, 2, 600, ctr)
  // T29 (P1 authority FUSION, webdiv=1): doc 601's PageRank prior lifts it above the equal-BM25 doc 600
  let na1: i64 = dss_search_off_div(dom, qa, g_strlen(qa), cids, scores, 10, 0, ta, 1)
  g_check("T29 authority FUSION (webdiv=1: pr: prior -> 601 first)" as *u8, na1, cids, 2, 601, ctr)
585
  // T30 URL-DEDUP CONTROL (webdiv=0): both snapshots of one url serve; site/trusted stay byte-identical
  let qd: *u8 = "zqduppage" as *u8
  let nd0: i64 = dss_search_off_div(dom, qd, g_strlen(qd), cids, scores, 10, 0, ta, 0)
  g_check("T30 url-dedup CONTROL (webdiv=0: both snapshots serve)" as *u8, nd0, cids, 2, 700, ctr)
  // T31 URL-DEDUP (webdiv=1): ONE result per url (tie -> first candidate) and totals = DISTINCT pages
  let nd1: i64 = dss_search_off_div(dom, qd, g_strlen(qd), cids, scores, 10, 0, ta, 1)
  var t31: i64 = 0
  if nd1 == 1 { if cids[0] == 700 { if ta[0] == 1 { t31 = 1 } } }
  g_puts("T31 url-dedup (webdiv=1: 1 result, cid 700, total=1)")
  g_puts("\n")
  gv_check("T31-url-dedup", t31, ctr)
597
  // T-prox (R1b PROXIMITY): 800 (clustered) and 801 (scattered) carry IDENTICAL BM25 (same len+tf);
  // the proximity boost must rank the CLUSTERED doc 800 first even though 801 was indexed first. This
  // row FAILS by construction without the boost (tie -> indexed-first 801) and PASSES with it.
  let qpx: *u8 = "proxterma proxtermb" as *u8
  let npx: i64 = dss_search(dom, qpx, g_strlen(qpx), cids, scores, 10)
  g_check("T-prox clustered 800 outranks scattered 801" as *u8, npx, cids, 2, 800, ctr)
604
  // T-title (R1c): 900 (query term in the TITLE) vs 901 (in the BODY), IDENTICAL BM25; the title-field
  // boost must rank the TITLE-match doc 900 first even though 901 was indexed first.
  let qtt: *u8 = "titletok" as *u8
  let ntt: i64 = dss_search(dom, qtt, g_strlen(qtt), cids, scores, 10)
  g_check("T-title: title-field match 900 outranks body match 901" as *u8, ntt, cids, 2, 900, ctr)
610
  // T33 RUSSIAN end-to-end: Cyrillic query term -> doc 950 (word tokens through the whole dss path)
  let q33: *u8 = "\xD0\xBD\xD0\xB0\xD1\x81\xD0\xBB\xD0\xB5\xD0\xB4\xD1\x81\xD1\x82\xD0\xB2\xD1\x83" as *u8
  let n33: i64 = dss_search(dom, q33, g_strlen(q33), cids, scores, 10)
  g_check("T33 russian (nasledstvu)->950" as *u8, n33, cids, 1, 950, ctr)
  // T34 JAPANESE end-to-end: 4-char Han query -> overlapping bigrams -> doc 951
  let q34: *u8 = "\xE6\x9D\xB1\xE4\xBA\xAC\xE5\xA4\xA7\xE5\xAD\xA6" as *u8
  let n34: i64 = dss_search(dom, q34, g_strlen(q34), cids, scores, 10)
  g_check("T34 japanese (toukyoudaigaku)->951" as *u8, n34, cids, 1, 951, ctr)
  // T35 KOREAN end-to-end: Hangul bigram query -> doc 952
  let q35: *u8 = "\xEA\xB2\x80\xEC\x83\x89" as *u8
  let n35: i64 = dss_search(dom, q35, g_strlen(q35), cids, scores, 10)
  g_check("T35 korean (geomsaek)->952" as *u8, n35, cids, 1, 952, ctr)
  // T36 CYRILLIC CASE-FOLD: uppercase query MOSKVE matches the lowercase doc
  let q36: *u8 = "\xD0\x9C\xD0\x9E\xD0\xA1\xD0\x9A\xD0\x92\xD0\x95" as *u8
  let n36: i64 = dss_search(dom, q36, g_strlen(q36), cids, scores, 10)
  g_check("T36 cyrillic case-fold (MOSKVE)->950" as *u8, n36, cids, 1, 950, ctr)
627
  // T37 SUBREDDIT idiom (R2b, 2026-08-04): "r/GadgetLab subgadget" implies site:reddit.com + a case-
  // folded, segment-anchored /r/gadgetlab path -> ONLY 960. 961 = other sub, 962 = off-reddit, 963 =
  // /r/gadgetlabmemes (the anchor decoy). The pre-rewrite engine returned all four ("r" died at the
  // tokenizer's 2-char floor) -- this tooth fails without the fix BY CONSTRUCTION.
  let q37: *u8 = "r/GadgetLab subgadget" as *u8
  let n37: i64 = dss_search(dom, q37, g_strlen(q37), cids, scores, 10)
  g_check("T37 r/<sub> scopes to the subreddit (960 only)" as *u8, n37, cids, 1, 960, ctr)
  // T38 inurl: general URL filter, ANY site: docs whose url carries "comments" = 960+961 exactly
  let q38: *u8 = "inurl:comments subgadget" as *u8
  let n38: i64 = dss_search(dom, q38, g_strlen(q38), cids, scores, 10)
  g_check("T38 inurl:comments -> the two thread docs" as *u8, n38, cids, 2, 0 - 1, ctr)
  // T39 CONTROL: the bare term returns ALL FOUR docs -- queries without a url-scope clause are
  // byte-identical to the pre-R2b engine (the ruler-safety claim, positively controlled)
  let q39: *u8 = "subgadget" as *u8
  let n39: i64 = dss_search(dom, q39, g_strlen(q39), cids, scores, 10)
  g_check("T39 CONTROL bare term -> all 4 docs" as *u8, n39, cids, 4, 0 - 1, ctr)
  // T40 NEG: an unknown subreddit -> honest 0, never a silent fallback to unscoped results
  let q40: *u8 = "r/nosuchsub subgadget" as *u8
  let n40: i64 = dss_search(dom, q40, g_strlen(q40), cids, scores, 10)
  g_check("T40 NEG r/nosuchsub -> 0" as *u8, n40, cids, 0, 0 - 1, ctr)
648
  // T41 (R2d stuffing penalty): KATs on the factored decision, pinned to the MEASURED live docs
  // (nx_doc_lexstat 2026-08-04). bign=150000, common dcnt=40000 (blood/pressure class),
  // rare dcnt=120 (entity name). Spam blogspot tf34/825 -> 512; real paper tf14/1226 -> 1024;
  // a RARE name at profile density tf40/800 -> 1024 (the julia exemption); tiny doc + small
  // corpus -> inert 1024 (why every fixture tooth above stays byte-identical).
  var t41: i64 = 1
  if dss_stuff_factor(34, 825, 40000, 150000) != 512 { t41 = 0 }
  if dss_stuff_factor(14, 1226, 40000, 150000) != 1024 { t41 = 0 }
  if dss_stuff_factor(40, 800, 120, 150000) != 1024 { t41 = 0 }
  if dss_stuff_factor(30, 40, 40000, 150000) != 1024 { t41 = 0 }
  if dss_stuff_factor(34, 825, 40000, 500) != 1024 { t41 = 0 }
  g_puts("T41 stuffing factor: spam 512 / real+rare+tiny+small-corpus 1024")
  g_puts("\n")
  gv_check("T41-stuffing-factor", t41, ctr)
663
  // T42 (R2d brand-label exemption): a dense term that IS a host label of the doc's url is the
  // term's owner, not a stuffer -- and a substring without a boundary earns NOTHING (the fix for
  // the 368->297 navigational regression; the measured spam domain must stay penalized).
  let t42scr: *u8 = sys_mmap(256)
  var t42: i64 = 1
  let u42a: *u8 = "https://github.com/features" as *u8
  let u42b: *u8 = "https://highbloodpressure67.blogspot.com/" as *u8
  let u42c: *u8 = "https://www.rust-lang.org/learn" as *u8
  if dss_host_label_match(u42a, g_strlen(u42a), "github" as *u8, t42scr) != 1 { t42 = 0 }
  if dss_host_label_match(u42b, g_strlen(u42b), "blood" as *u8, t42scr) != 0 { t42 = 0 }
  if dss_host_label_match(u42b, g_strlen(u42b), "pressure" as *u8, t42scr) != 0 { t42 = 0 }
  if dss_host_label_match(u42c, g_strlen(u42c), "rust" as *u8, t42scr) != 1 { t42 = 0 }
  if dss_host_label_match(u42a, g_strlen(u42a), "hub" as *u8, t42scr) != 0 { t42 = 0 }
  g_puts("T42 brand-label: github/rust exempt, blood/pressure/hub substrings not")
  g_puts("\n")
  gv_check("T42-brand-label", t42, ctr)
680
  // ---- S7 (2026-09-16) SERVED BM25Q FUSION: unit teeth on the pure pieces, then the wire through dss_search ----
  // T43 qtf map: alpha beta alpha gamma beta alpha -> repeats=2, firsts 1 1 0 1 0 0, counts 3 and 2 at the firsts
  let s7ts: *u8 = sys_mmap(6 * 64)
  let s7tp: *i64 = sys_mmap(6 * 8) as *i64
  let s7w0: *u8 = "alpha" as *u8
  let s7w1: *u8 = "beta" as *u8
  let s7w2: *u8 = "gamma" as *u8
  var s7k: i64 = 0
  while s7k < 6 {
      var s7src: *u8 = s7w0
      if s7k == 1 { s7src = s7w1 }
      if s7k == 3 { s7src = s7w2 }
      if s7k == 4 { s7src = s7w1 }
      let s7d: *u8 = (s7ts as i64 + s7k * 64) as *u8
      var s7i: i64 = 0
      while s7src[s7i] != (0 as u8) { s7d[s7i] = s7src[s7i]; s7i = s7i + 1 }
      s7d[s7i] = 0 as u8
      s7tp[s7k] = s7d as i64
      s7k = s7k + 1
  }
  let s7qf: *i64 = sys_mmap(6 * 8) as *i64
  let s7qc: *i64 = sys_mmap(6 * 8) as *i64
  let s7rep: i64 = dss_qtf_map(s7tp, 6, s7qf, s7qc)
  var t43: i64 = 1
  if s7rep != 2 { t43 = 0 }
  if s7qf[0] != 1 { t43 = 0 }
  if s7qf[1] != 1 { t43 = 0 }
  if s7qf[2] != 0 { t43 = 0 }
  if s7qf[3] != 1 { t43 = 0 }
  if s7qf[4] != 0 { t43 = 0 }
  if s7qf[5] != 0 { t43 = 0 }
  if s7qc[0] != 3 { t43 = 0 }
  if s7qc[1] != 2 { t43 = 0 }
  if s7qc[3] != 1 { t43 = 0 }
  g_puts("T43 qtf-map: repeats="); g_num(s7rep); g_puts(" firsts="); g_num(s7qf[0]); g_num(s7qf[1]); g_num(s7qf[2]); g_num(s7qf[3]); g_num(s7qf[4]); g_num(s7qf[5]); g_puts(" counts="); g_num(s7qc[0]); g_puts(","); g_num(s7qc[1]); g_puts(","); g_num(s7qc[3])
  g_puts("\n")
  gv_check("T43-qtf-map", t43, ctr)
  // T44 fuse identity: equal arms -> moved=0 and every score untouched
  let s7p: *i64 = sys_mmap(8 * 8) as *i64
  let s7q: *i64 = sys_mmap(8 * 8) as *i64
  s7p[0] = 50; s7p[1] = 40; s7p[2] = 30; s7p[3] = 20; s7p[4] = 10
  s7q[0] = 50; s7q[1] = 40; s7q[2] = 30; s7q[3] = 20; s7q[4] = 10
  let s7m44: i64 = dss_bm25q_fuse(s7p, s7q, 5)
  var t44: i64 = 1
  if s7m44 != 0 { t44 = 0 }
  if s7p[0] != 50 { t44 = 0 }
  if s7p[1] != 40 { t44 = 0 }
  if s7p[2] != 30 { t44 = 0 }
  if s7p[3] != 20 { t44 = 0 }
  if s7p[4] != 10 { t44 = 0 }
  g_puts("T44 fuse-identity: moved="); g_num(s7m44); g_puts(" scores="); g_num(s7p[0]); g_puts(","); g_num(s7p[1]); g_puts(","); g_num(s7p[2]); g_puts(","); g_num(s7p[3]); g_puts(","); g_num(s7p[4])
  g_puts("\n")
  gv_check("T44-fuse-identity", t44, ctr)
  // T45 fuse moves on a 3-cycle: plain A>B>C (300,200,100), bm25q B>C>A -> fused B,A,C: B takes 300, A 200, C 100, moved=2
  s7p[0] = 300; s7p[1] = 200; s7p[2] = 100
  s7q[0] = 100; s7q[1] = 300; s7q[2] = 200
  let s7m45: i64 = dss_bm25q_fuse(s7p, s7q, 3)
  var t45: i64 = 1
  if s7m45 != 2 { t45 = 0 }
  if s7p[1] != 300 { t45 = 0 }
  if s7p[0] != 200 { t45 = 0 }
  if s7p[2] != 100 { t45 = 0 }
  g_puts("T45 fuse-3cycle: moved="); g_num(s7m45); g_puts(" A="); g_num(s7p[0]); g_puts(" B="); g_num(s7p[1]); g_puts(" C="); g_num(s7p[2])
  g_puts("\n")
  gv_check("T45-fuse-3cycle", t45, ctr)
  // T46 neg-control pair-swap-is-a-tie: two participants swapped by the second arm stay in plain order (moved=0); a
  // disqualified candidate (-1) never participates and keeps -1
  s7p[0] = 0 - 1; s7p[1] = 200; s7p[2] = 100; s7p[3] = 0 - 1
  s7q[0] = 0 - 1; s7q[1] = 100; s7q[2] = 200; s7q[3] = 0 - 1
  let s7m46: i64 = dss_bm25q_fuse(s7p, s7q, 4)
  var t46: i64 = 1
  if s7m46 != 0 { t46 = 0 }
  if s7p[1] != 200 { t46 = 0 }
  if s7p[2] != 100 { t46 = 0 }
  if s7p[0] != (0 - 1) { t46 = 0 }
  if s7p[3] != (0 - 1) { t46 = 0 }
  g_puts("T46 neg-control pair-swap-tie-and-disqualified: moved="); g_num(s7m46); g_puts(" scores="); g_num(s7p[0]); g_puts(","); g_num(s7p[1]); g_puts(","); g_num(s7p[2]); g_puts(","); g_num(s7p[3])
  g_puts("\n")
  gv_check("T46-neg-control-pair-swap-tie-and-disqualified", t46, ctr)
  // T47 a disqualified candidate beside a 3-cycle: the -1 stays where it is, the three participants move as in T45
  s7p[0] = 0 - 1; s7p[1] = 300; s7p[2] = 200; s7p[3] = 100
  s7q[0] = 0 - 1; s7q[1] = 100; s7q[2] = 300; s7q[3] = 200
  let s7m47: i64 = dss_bm25q_fuse(s7p, s7q, 4)
  var t47: i64 = 1
  if s7m47 != 2 { t47 = 0 }
  if s7p[0] != (0 - 1) { t47 = 0 }
  if s7p[2] != 300 { t47 = 0 }
  if s7p[1] != 200 { t47 = 0 }
  if s7p[3] != 100 { t47 = 0 }
  g_puts("T47 fuse-3cycle-with-disqualified: moved="); g_num(s7m47); g_puts(" scores="); g_num(s7p[0]); g_puts(","); g_num(s7p[1]); g_puts(","); g_num(s7p[2]); g_puts(","); g_num(s7p[3])
  g_puts("\n")
  gv_check("T47-fuse-3cycle-with-disqualified", t47, ctr)
  // T48 THE WIRE, identity leg: a no-repeat multi-term query through dss_search announces repeats=0 moved=0
  let s7bq: *i64 = sys_mmap(16) as *i64
  let q48: *u8 = "divorce custody" as *u8
  let n48: i64 = dss_search(dom, q48, g_strlen(q48), cids, scores, 10)
  dss_bm25q_stats(s7bq)
  var t48: i64 = 1
  if n48 < 1 { t48 = 0 }
  if s7bq[0] != 0 { t48 = 0 }
  if s7bq[1] != 0 { t48 = 0 }
  g_puts("T48 wire-identity divorce custody: n="); g_num(n48); g_puts(" repeats="); g_num(s7bq[0]); g_puts(" moved="); g_num(s7bq[1])
  g_puts("\n")
  gv_check("T48-wire-identity-divorce-custody", t48, ctr)
  // T49 THE WIRE, fusion leg (fixture 970-975, see the writer): "zqxrep zqxrep zqzrare" repeats zqxrep, so the two
  // arms disagree beyond a pair swap and the fusion MOVES candidates -- the fixture reached the condition when
  // repeats=1, and the tooth demands moved>=1 and 971 (the short rare-term doc) on top. The scores printed are the
  // served ones (after coordination), the moved count is taken before it.
  let q49: *u8 = "zqxrep zqxrep zqzrare" as *u8
  let dom2: *u8 = "ssgatefuse" as *u8
  let n49: i64 = dss_search(dom2, q49, g_strlen(q49), cids, scores, 10)
  dss_bm25q_stats(s7bq)
  var t49: i64 = 1
  if n49 != 4 { t49 = 0 }
  if s7bq[0] != 1 { t49 = 0 }
  if s7bq[1] < 1 { t49 = 0 }
  if n49 > 0 { if cids[0] != 971 { t49 = 0 } }
  g_puts("T49 wire-fusion zqxrep zqxrep zqzrare: bytes 970/971/972/973="); g_num(s7l970); g_puts("/"); g_num(s7l971); g_puts("/"); g_num(s7l972); g_puts("/"); g_num(s7l973); g_puts(" n="); g_num(n49); g_puts(" repeats="); g_num(s7bq[0]); g_puts(" moved="); g_num(s7bq[1]); g_puts(" order="); g_num(cids[0]); g_puts(","); g_num(cids[1]); g_puts(","); g_num(cids[2]); g_puts(" served="); g_num(scores[0]); g_puts(","); g_num(scores[1]); g_puts(","); g_num(scores[2])
  g_puts("\n")
  gv_check("T49-wire-fusion-zqxrep-zqxrep-zqzrare", t49, ctr)
801
  // T50-T52 S9 ENTITY DISCRIMINATORS (2026-09-17): the two-word name over the ssgatetest shard, webdiv=1.
  // Old code (score order under the 0.5x results-page multiplier): 852 (rare word x16) first, 850 second, 851
  // last. New code: (coverage, content-before-results-page, ex) tiers -> 850, 851, 852; 851 precedes 852 with a
  // LOWER score, which no score-ordered selection can produce (T50b), and webdiv=0 keeps the pure score order
  // with the results page on top (T52) -- the discriminators live on the web path only.
  let q50: *u8 = "zqnamea zqnameb" as *u8
  let td5: *i64 = sys_mmap(S9G_TOTAL_SLOTS * DSS_I64_BYTES) as *i64
  let t50n: i64 = dss_search_off_div(dom, q50, g_strlen(q50), cids, scores, S9G_PAGE, 0, td5, 1)
  var t50: i64 = 0
  if t50n == S9G_PAGE { if td5[0] == S9G_MATCHING { if cids[0] == S9G_DOC_CONTENT { if cids[1] == S9G_DOC_RESULTS { if cids[S9G_RANK_THIRD] == S9G_DOC_SCATTER { t50 = 1 } } } } }
  g_puts("T50 S9 name query webdiv=1: content-both, results-page-both, rare-word-only"); g_puts(" n="); g_num(t50n); g_puts(" total="); g_num(td5[0])
  g_puts(" cids="); g_num(cids[0]); g_puts(","); g_num(cids[1]); g_puts(","); g_num(cids[S9G_RANK_THIRD]); g_puts(" scores="); g_num(scores[0]); g_puts(","); g_num(scores[1]); g_puts(","); g_num(scores[S9G_RANK_THIRD]); g_puts("\n")
  gv_check("T50-S9-adjacent-content-before-adjacent-results-page-before-scattered-content", t50, ctr)
  var t53: i64 = 0
  if t50n == S9G_PAGE { if cids[S9G_RANK_FOURTH] == S9G_DOC_RARE { t53 = 1 } }
  g_puts("T53 S9b scattered both-words page ranks above the rare-word-only page but below the adjacent name"); g_puts(" cids[3]="); g_num(cids[S9G_RANK_FOURTH]); g_puts("\n")
  gv_check("T53-S9b-scattered-both-words-above-rare-word-only-below-the-adjacent-name", t53, ctr)
  // ---- S11 ENTITY PIN: a resolved canonical page takes the band above every S9 tier; no row = unchanged; a pin
  // whose page is not a candidate changes nothing and announces the miss ----
  let pinpath: *u8 = "/tmp/nx_docportal_search_seg_gate_entitypin.tsv" as *u8
  s9g_write_file(pinpath, "zqnamea zqnameb\t853\thttps://content.example.com/notes/zq\tzq\t1\t0\n" as *u8)
  dss_ent_set_path(pinpath)
  let t54n: i64 = dss_search_off_div(dom, q50, g_strlen(q50), cids, scores, S9G_PAGE, 0, td5, 1)
  let ens: *i64 = sys_mmap(S9G_ENT_SLOTS * DSS_I64_BYTES) as *i64
  dss_entity_stats(ens)
  var t54: i64 = 0
  if t54n == S9G_PAGE { if cids[0] == S9G_DOC_SCATTER { if cids[1] == S9G_DOC_CONTENT { if ens[0] == 1 { if ens[1] == S9G_DOC_SCATTER { t54 = 1 } } } } }
  g_puts("T54 S11 pinned canonical page (853) tops the S9 order"); g_puts(" cids[0]="); g_num(cids[0]); g_puts(" cids[1]="); g_num(cids[1]); g_puts(" pinned="); g_num(ens[0]); g_puts(" cid="); g_num(ens[1]); g_puts(" rows="); g_num(ens[2]); g_puts("\n")
  gv_check("T54-S11-pinned-canonical-page-tops-the-S9-order-and-announces-pinned=1", t54, ctr)
  // T54d S11-b: the card fields come from the matched row (jp, url, titles) and only while the pin fired
  let cjp: *u8 = sys_mmap(S9G_BUF_4K)
  let cjn: i64 = dss_entity_field(DSS_ENT_FIELD_JP, cjp, S9G_BUF_4K)
  let curl: *u8 = sys_mmap(S9G_BUF_4K)
  let cun: i64 = dss_entity_field(DSS_ENT_FIELD_URL, curl, S9G_BUF_4K)
  var t54d: i64 = 0
  if cjn == 2 { if cjp[0] as i64 == S9G_CH_Z { if cjp[1] as i64 == S9G_CH_Q { if cun > 0 { if dss_entity_titles() == 1 { t54d = 1 } } } } }
  g_puts("T54d S11-b card fields jp="); g_puts(cjp); g_puts(" url="); g_puts(curl); g_puts(" titles="); g_num(dss_entity_titles()); g_puts("\n")
  gv_check("T54d-S11b-card-fields-jp-url-titles-come-from-the-matched-row", t54d, ctr)
  // T54g S11-c: the memo's two words carry the pin across a reset (what a memoised answer restores), and the card row
  // is re-found by cid after the restore
  let mw: *i64 = sys_mmap(DSQ_ENT_W * DSS_I64_BYTES) as *i64
  dss_ent_memo_save(mw)
  dss_ent_set(0, 0)
  dss_entity_stats(ens)
  var t54g_reset: i64 = 0
  if ens[0] == 0 { if dss_entity_field(DSS_ENT_FIELD_JP, cjp, S9G_BUF_4K) == 0 { t54g_reset = 1 } }
  gv_check("neg-control-T54g0-after-the-reset-the-announce-and-the-card-read-nothing", t54g_reset, ctr)
  dss_ent_memo_load(mw)
  dss_entity_stats(ens)
  let mjn: i64 = dss_entity_field(DSS_ENT_FIELD_JP, cjp, S9G_BUF_4K)
  var t54g: i64 = 0
  if mw[0] == 1 { if mw[1] == S9G_DOC_SCATTER { if ens[0] == 1 { if ens[1] == S9G_DOC_SCATTER { if mjn == 2 { if dss_entity_titles() == 1 { t54g = 1 } } } } } }
  g_puts("T54g memo words pinned="); g_num(mw[0]); g_puts(" cid="); g_num(mw[1]); g_puts(" restored pinned="); g_num(ens[0]); g_puts(" jp="); g_puts(cjp); g_puts("\n")
  gv_check("T54g-S11c-the-memo-words-restore-the-pin-and-the-card-row-is-re-found-by-cid", t54g, ctr)
  // ---- S12 FRESHNESS: the fetch-epoch row round-trips beside the doc, an absent row abstains, the page arithmetic holds ----
  let hfe: *i64 = ss_open(prefix)
  gv_check("T55-S12-the-fixture-shard-opens-for-the-fetch-epoch-read", ((hfe as i64) != 0) as i64, ctr)
  let fk: *u8 = sys_mmap(DSS_FE_KEY_BYTES)
  dss_mkfekey(101, fk)
  var t55k: i64 = 0
  if fk[0] == (102 as u8) { if fk[1] == (101 as u8) { if fk[2] == (58 as u8) { if fk[3] == (49 as u8) { if fk[4] == (48 as u8) { if fk[5] == (49 as u8) { if fk[6] == (0 as u8) { t55k = 1 } } } } } } }
  gv_check("T55a-the-fetch-epoch-key-is-fe-colon-cid-null-terminated", t55k, ctr)
  gv_check_eq("T55b-a-planted-fetch-epoch-reads-back-exactly", dss_doc_fetch_epoch(hfe, 101), S9G_FE_101, ctr)
  gv_check_eq("T55c-the-second-planted-epoch-reads-back-exactly", dss_doc_fetch_epoch(hfe, 102), S9G_FE_102, ctr)
  gv_check_eq("neg-control-T55d-a-doc-without-the-row-abstains-as-minus-one-never-zero", dss_doc_fetch_epoch(hfe, 103), 0 - 1, ctr)
  gv_check_eq("neg-control-T55e-an-absent-doc-abstains-too", dss_doc_fetch_epoch(hfe, S9G_DOC_ABSENT), 0 - 1, ctr)
  let fea: *i64 = sys_mmap(8 * 8) as *i64
  let fst: *i64 = sys_mmap(8 * DSS_FRESH_SLOTS) as *i64
  fea[0] = S9G_FE_101; fea[1] = S9G_FE_102; fea[2] = 0 - 1
  dss_fresh_stats(fea, 3, S9G_FE_NOW, fst)
  gv_check_eq("T55f-observed-counts-only-the-results-with-an-epoch", fst[0], 2, ctr)
  gv_check_eq("T55g-newest-epoch-is-the-max-over-the-observed", fst[1], S9G_FE_102, ctr)
  gv_check_eq("T55h-even-count-median-age-is-the-mean-of-the-two-middle-ages", fst[2], ((S9G_FE_NOW - S9G_FE_101) + (S9G_FE_NOW - S9G_FE_102)) / 2, ctr)
  fea[2] = S9G_FE_NOW - S9G_FE_YOUNG
  dss_fresh_stats(fea, 3, S9G_FE_NOW, fst)
  gv_check_eq("T55i-odd-count-median-age-is-the-middle-age", fst[2], S9G_FE_NOW - S9G_FE_102, ctr)
  gv_check_eq("T55j-observed-rises-with-the-third-epoch", fst[0], 3, ctr)
  fea[0] = 0 - 1; fea[1] = 0 - 1
  dss_fresh_stats(fea, 2, S9G_FE_NOW, fst)
  var t55l: i64 = 0
  if fst[0] == 0 { if fst[1] == (0 - 1) { if fst[2] == (0 - 1) { t55l = 1 } } }
  gv_check("neg-control-T55l-a-page-with-no-observed-epoch-abstains-on-every-field", t55l, ctr)
  fea[0] = S9G_FE_NOW + S9G_FE_YOUNG
  dss_fresh_stats(fea, 1, S9G_FE_NOW, fst)
  gv_check_eq("T55m-a-fetch-epoch-ahead-of-the-clock-reads-as-age-zero-not-negative", fst[2], 0, ctr)
  s9g_write_file(pinpath, "someone else\t853\thttps://content.example.com/notes/zq\tzq\t1\t0\n" as *u8)
  dss_ent_set_path(pinpath)
  let t54bn: i64 = dss_search_off_div(dom, q50, g_strlen(q50), cids, scores, S9G_PAGE, 0, td5, 1)
  dss_entity_stats(ens)
  var t54b: i64 = 0
  if t54bn == S9G_PAGE { if cids[0] == S9G_DOC_CONTENT { if ens[0] == 0 { if ens[1] == 0 { t54b = 1 } } } }
  g_puts("T54b a row for another query: order unchanged"); g_puts(" cids[0]="); g_num(cids[0]); g_puts(" pinned="); g_num(ens[0]); g_puts(" cid="); g_num(ens[1]); g_puts("\n")
  gv_check("neg-control-T54b-a-row-for-another-query-leaves-the-S9-order-and-announces-no-pin", t54b, ctr)
  gv_check("neg-control-T54e-no-pin-no-card-fields", (dss_entity_field(DSS_ENT_FIELD_JP, cjp, S9G_BUF_4K) == 0) as i64, ctr)
  s9g_write_file(pinpath, "zqnamea zqnameb\t999\thttps://nowhere.example.com/\tzz\t1\t0\n" as *u8)
  dss_ent_set_path(pinpath)
  let t54cn: i64 = dss_search_off_div(dom, q50, g_strlen(q50), cids, scores, S9G_PAGE, 0, td5, 1)
  dss_entity_stats(ens)
  var t54c: i64 = 0
  if t54cn == S9G_PAGE { if cids[0] == S9G_DOC_CONTENT { if ens[0] == 0 { if ens[1] == S9G_DOC_ABSENT { t54c = 1 } } } }
  g_puts("T54c a pin whose page is not a candidate: order unchanged, miss announced"); g_puts(" cids[0]="); g_num(cids[0]); g_puts(" pinned="); g_num(ens[0]); g_puts(" cid="); g_num(ens[1]); g_puts("\n")
  gv_check("T54c-a-pin-whose-page-is-not-a-candidate-changes-nothing-and-announces-the-miss", t54c, ctr)
  dss_ent_set_path(DSS_ENT_PATH_DEFAULT)
  var t50b: i64 = 0
  if t50n >= S9G_TOP3 { if scores[0] < scores[1] { t50b = 1 } }
  gv_check("T50b-neg-control-tier-overrode-a-higher-score-(the-first-result-scores-below-the-second)", t50b, ctr)
  let t52n: i64 = dss_search_off_div(dom, q50, g_strlen(q50), cids, scores, S9G_PAGE, 0, td5, 0)
  var t52: i64 = 0
  if t52n == S9G_PAGE { if cids[0] == S9G_DOC_RESULTS { t52 = 1 } }
  g_puts("T52 S9 webdiv=0 control: pure score order, the results page tops"); g_puts(" cids[0]="); g_num(cids[0]); g_puts("\n")
  gv_check("T52-S9-webdiv0-control-results-page-tops-on-score-alone", t52, ctr)
913
  // EVIDENCE (2026-07-30): this gate is the SEARCH lane's only NAS-runnable witness -- 36 teeth over
  // BM25 ranking, proximity, title-field boost and Cyrillic/CJK case-folding -- and it wrote its
  // verdict to STDOUT ONLY, so nx_gatereg_derive could not see the lane and the maturity rollup could
  // not grade it. Same defect that hid lab-science and the browser renderer.
  // ★It is SAFE to publish: every tooth runs against SYNTHETIC fixture docs (800/801/900/901/950-952),
  // never sampled production content, so no dp-*-secret / dp-*-prv material can reach this log.
  // ★Plain verdict=GREEN|RED -- gv_is_pass accepts GREEN|PASS|VALID only, and this ecosystem has
  // already invented four different pass-words. Do not add a fifth.
  let lfd: i64 = sys_openat_append("knowledge/status/search_seg_gate.log\x00" as *u8, 420)
  if lfd >= 0 {
      let lb: *u8 = sys_mmap(256)
      var lo: i64 = 0
      lo = dsg_cat(lb, lo, "DSS-GATE rows=" as *u8)
      lo = dsg_catn(lb, lo, ctr[1])
      lo = dsg_cat(lb, lo, " passed=" as *u8)
      lo = dsg_catn(lb, lo, ctr[0])
      if ctr[0] == ctr[1] { lo = dsg_cat(lb, lo, " verdict=GREEN\n" as *u8) } else { lo = dsg_cat(lb, lo, " verdict=RED\n" as *u8) }
      sys_write(lfd, lb, lo)
      sys_close(lfd)
  }
934
  // D001 migration 2026-09-16: the exit code carries the verdict (gv_verdict, positional last line), the log above keeps its shape
  return gv_verdict("nx_docportal_search_seg_gate", ctr, "sovereign seg_store search end to end over a synthetic fixture shard (dp-ssgatetest-pub-), the S7 served BM25Q fusion wired 2026-09-16")
937}
nx_docportal_search_seg_gate.nx source

`nx_docportal_search_seg_gate.nx` source
