code wiki / _hdl_build / nx_omniforge_census.nx
nx_omniforge_census.nx
buildroot/runtime/_hdl_build/nx_omniforge_census.nx
about
nx_omniforge_census.nx -- R0 GENESIS GATE of the OMNIFORGE doomsday->automated-fabrication arc.
Operator 2026-06-20: "rebuild from a doomsday scenario, every step up ... from nothing to an
automated future state with NO FLOAT" -- ALL legs (mechanical bootstrap, 3D-print, CAD kernel,
PCB/EDA, silicon, no-float compute substrate, materials/supply, self-replication). This is the
honest, data-driven MATURITY SCORECARD: one row per (pillar x capability), graded
ABSENT->PRESENT->PARITY->EXCEEDS from EVIDENCE. The gate LIAR-KILLS any PARITY/EXCEEDS row
lacking measured evidence (has_ev=1 only when a real gate / head-to-head backs it) -- so no
"exceeds KiCad / Fusion / a commercial fab" can be claimed without proof, BY CONSTRUCTION.
Negative control proves the liar-kill fires. EVERY ev-backed cell cites a gate RE-RUN THIS
SESSION 2026-06-20 (nx_cad_exceed_gate 8/8, nx_dcc_slice_watertight_gate 10/10,
nx_stl_write_mesh_test 12/12, nx_print_exceed_compose_test run-exit=0 -- all SOVEREIGN nx_cc->nxasm).
Everything unbuilt is honestly ABSENT with its cited real-world yardstick (a later rung EARNS a
grade by attaching a measured gate). Mirrors nx_connect_census.nx (proven R0 idiom). 100% sovereign.
license_tier: ORIGINAL expect_exit: 0
dependencies 1 imports · 0 importers
imports: nx_syscalls.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| 17 | const G_ABSENT: i64 = 0 |
| 18 | const G_PRESENT: i64 = 1 |
| 19 | const G_PARITY: i64 = 2 |
| 20 | const G_EXCEEDS: i64 = 3 |
functions
| 22 | func sw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 23 | func sn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)} 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 } |
| 25 | func grade_name(g: i64) -> i64 |
| 34 | func cap_valid(grade: i64, has_ev: i64) -> i64 |
| 39 | func row(pillar: *u8, cap: *u8, grade: i64, base: *u8, evidence: *u8, has_ev: i64, tot: *i64) -> i64 |
| 49 | func main() -> i64 |