code wiki / _hdl_build / nx_dp_reclassify_gate.nx

nx_dp_reclassify_gate.nx

buildroot/runtime/_hdl_build/nx_dp_reclassify_gate.nx

7610 B120 linesdepth 7pulls 19 transitivereach 0 importersview sourcekind gate/prooftopic dp
docsdependenciesstructsconstsfunctions

about

nx_dp_reclassify_gate.nx -- MEASURED hermetic gate for per-doc secret reclassification. Seeds its OWN fixture docs in a FRESH per-run shard (dpsec<unix-sec> -- append-only tombstones from a prior run would otherwise poison a re-run's T1), then proves LOGICAL secret-isolation by construction: T1 pre : docS is live -- found by dss_search AND readable via dp_read(pub) T2 run : dpr_run(domain, cidS) returns 0 T3 gone : dss_search now OMITS docS (tombstone shadows its postings) T4 moved: dp_read(pub) MISS, but the secret shard HIT with byte-identical content (bytes preserved) T5 neg : a sibling public doc (docK) is untouched -- still searchable Verdict MEASURED. GREEN iff 5/5. Appends knowledge/status/dp_reclassify_gate.log. license_tier: ORIGINAL

dependencies 3 imports · 0 importers

nx_dp_reclassify.nx nx_docportal_lib.nx nx_docportal_search_seg.nx nx_dp_reclassify_gate.nx

imports: nx_dp_reclassify.nxnx_docportal_lib.nxnx_docportal_search_seg.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main g_puts g_cat g_catnum dp_ingest_policy dpr_http_body dpr_load_conf dpr_conf_one lc_geti sys_mmap lc_read lc_slen dpr_find_ci dpr_lc dpr_is_html dpr_load_conf ↻ dpr_http_body ↻ dpr_find_ci ↻ sys_mmap ↻ bd_fit_text bd_load_conf bd_conf_one lc_geti ↻ bd_count_lt sys_mmap ↻ bd_scan bd_set bd_rec bd_is_name bd_is_suppress bd_name_eq bd_lc bd_find_close bd_lc ↻ bd_name_eq ↻ bd_sem_slot bd_name_eq ↻ bd_is_block bd_lc ↻ bd_name_eq ↻

structs

none

consts

none

functions

14func 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 }
called by 1: main
15func g_num(v: i64) -> i64
called by 1: main
21func g_w(fd: i64, s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(fd, s, n); return 0 }
called by 1: main
22func g_wn(fd: i64, v: i64) -> i64
called by 1: main
28func g_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
called by 1: main
29func g_cat(out: *u8, o: i64, s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { out[o] = s[i]; o = o + 1; i = i + 1 } return o }
called by 1: main
30func g_catnum(out: *u8, o: i64, v: i64) -> i64
called by 1: main
36func g_eq(a: *u8, al: i64, b: *u8, bl: i64) -> i64 { if al != bl { return 0 } var i: i64 = 0; while i < al { if a[i] != b[i] { return 0 } i = i + 1 } return 1 }
called by 1: main
38func main() -> i64