code wiki / _hdl_build / nx_bip39_wordlist_kat.nx
nx_bip39_wordlist_kat.nx
buildroot/runtime/_hdl_build/nx_bip39_wordlist_kat.nx
about
nx_bip39_wordlist_kat.nx -- DIRECT data-integrity KAT for the nx_bip39_wordlist table (the raw 2048-word
BIP-0039 English list). The full mnemonic vectors are covered by nx_bip39_kat via the encoder; THIS gates
the wordlist DATA directly (the honesty audit wants a direct edge on nx_bip39_wordlist): exactly 2048 words,
uniform 32/chunk, first="abandon", second="ability", last="zoo". A dropped/dup word (which corrupts every
mnemonic index + checksum) fails here. license_tier: ORIGINAL expect_exit:0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_bip39_wordlist.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
| none |
functions
| 9 | func w(s: *u8) -> i64 { var k:i64=0; while s[k]!=(0 as u8){k=k+1} sys_write(1,s,k); return 0 } |
| 10 | func n(v: i64) -> i64 { let b:*u8=sys_mmap(24); var m:i64=v; if m<0{sys_write(1,"-" as *u8,1);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 j:i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 } |
| 11 | func wc(s: *u8) -> i64 { var i:i64=0; var sp:i64=0; var any:i64=0; while s[i]!=(0 as u8){ if s[i]==(32 as u8){sp=sp+1} else {any=1} i=i+1 } if any==0 { return 0 } return sp+1 } called by 1: main |
| 12 | func slen(s: *u8) -> i64 { var i:i64=0; while s[i]!=(0 as u8){i=i+1} return i } called by 1: main |
| 14 | func main() -> i64 |