code wiki / _hdl_build / nx_hf_enumerate_probe.nx
nx_hf_enumerate_probe.nx
buildroot/runtime/_hdl_build/nx_hf_enumerate_probe.nx
about
nx_hf_enumerate_probe.nx -- LIVE proof of M2 (enumerate) on the REAL Apertus repo: fetch the HF tree API over
sovereign TLS, chunked_decode if needed (dynamic API), parse per-shard path + lfs.oid(sha256) + real size, and
print the shard manifest + total bytes -> the concrete input for the operator's go/no-go on the full weights pull.
Metadata only (no weights downloaded). Composes the TLS fetch + nx_http_chunked + nx_hf_tree_parse -- all no-crypto
here (no nx_sha256), so no M32 collision with the TLS stack. license_tier: ORIGINAL expect_exit: 0
dependencies 5 imports · 0 importers
imports: nx_syscalls.nxnx_x509_trust_store.nxnx_trust_store_load_from_certdata.nxnx_https_fetch_follow.nxnx_hf_tree_parse.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
| 11 | const K_MAGIC_4194304: i64 = 4194304 |
| 12 | const K_MAGIC_1000000000: i64 = 1000000000 |
functions
| 14 | func w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 15 | func wn(v: i64) -> i64 { var m: i64=v; if m<0{w("-" as *u8);m=0-m} let t:*u8=sys_mmap(24); 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; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1} sys_write(1,o,k); return 0 } |
| 16 | func en_slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } |
| 18 | func main() -> i64 |