nx_crypto_sclass_rung_census.nx source
↩ module page · 72 lines · 5558 B
1// nx_crypto_sclass_rung_census.nx -- hardware-up crypto/TLS s-class-EXCEED rung ladder (operator 2026-07-02: "from the
2// hardware rung up... provably faster, stronger security, more capable... no sprawl, loosely coupled, Linux small sharp").
3// DATA-DRIVEN + loosely-coupled: reads knowledge/registry/crypto_rung_sota.conf (our MEASURED ns/us/cpb/gbps vs DATED
4// June-2026 SOTA + security + sovereignty per rung) and grades the PROVABLE TRI-BAR per rung, no-wave. Grows by adding a
5// conf line + running the named bench. Speed graded ONLY when both our_measured>0 AND sota>0 (else PENDING = honest gap).
6// license_tier: ORIGINAL
7import "nx_syscalls.nx"
8
9func gw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 }
10func gn(v: i64) -> i64 { if v==0 { sys_write(1,"0" as *u8,1); return 0 } 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; while m>0 { t[k]=(48+(m%10)) as u8; m=m/10; k=k+1 } let o: *u8=sys_mmap(24); var w: i64=0; var q: i64=k-1; while q>=0 { o[w]=t[q]; w=w+1; q=q-1 } sys_write(1,o,w); return 0 }
11
12// copy src[cur..] until '|' (consumed) or '\n'/end (not consumed) into out (NUL-term); return index after field.
13func cr_field(src: *u8, cur: i64, n: i64, out: *u8) -> i64 {
14 var i: i64 = cur; var k: i64 = 0
15 while i < n {
16 let c: i64 = src[i] as i64
17 if c==124 { out[k]=0 as u8; return i+1 }
18 if c==10 { out[k]=0 as u8; return i }
19 out[k]=src[i]; k=k+1; i=i+1
20 }
21 out[k]=0 as u8; return i
22}
23// parse leading integer (handles '-'); STOPS at first non-digit (so "46.1"->46).
24func cr_int(s: *u8) -> i64 {
25 var i: i64=0; var neg: i64=0
26 if s[0]==45 as u8 { neg=1; i=1 }
27 var v: i64=0; var go: i64=1
28 while go==1 { let c: i64=s[i] as i64; if c>=48 { if c<=57 { v=v*10+(c-48); i=i+1 } else { go=0 } } else { go=0 } }
29 if neg==1 { return 0-v }
30 return v
31}
32
33func main() -> i64 {
34 gw("=== nx_crypto_sclass_rung_census: hardware-up crypto/TLS s-class-EXCEED ladder vs DATED June-2026 SOTA (no-wave) ===\n\n" as *u8)
35 let lb: *i64 = sys_mmap(8) as *i64
36 let buf: *u8 = sys_read_file("knowledge/registry/crypto_rung_sota.conf" as *u8, lb)
37 if buf == 0 as *u8 { gw("no conf\n" as *u8); sys_exit(1); return 1 }
38 let n: i64 = lb[0]
39
40 let f0: *u8=sys_mmap(64); let f1: *u8=sys_mmap(64); let f2: *u8=sys_mmap(64); let f3: *u8=sys_mmap(64); let f4: *u8=sys_mmap(64)
41 let f5: *u8=sys_mmap(96); let f6: *u8=sys_mmap(64); let f7: *u8=sys_mmap(96); let f8: *u8=sys_mmap(96); let f9: *u8=sys_mmap(96)
42 let acc: *i64 = sys_mmap(64) as *i64 // [speed_behind, speed_ahead, speed_pending, sec_proven, sov_sovereign, rungs]
43 var z: i64=0; while z<6 { acc[z]=0; z=z+1 }
44
45 var cur: i64 = 0
46 while cur < n {
47 var eol: i64 = cur
48 var g: i64 = 1
49 while g==1 { if eol>=n { g=0 } else { if buf[eol]==(10 as u8) { g=0 } else { eol=eol+1 } } }
50 if eol>cur { if buf[cur]!=(35 as u8) {
51 var c: i64 = cur
52 c=cr_field(buf,c,eol,f0); c=cr_field(buf,c,eol,f1); c=cr_field(buf,c,eol,f2); c=cr_field(buf,c,eol,f3); c=cr_field(buf,c,eol,f4)
53 c=cr_field(buf,c,eol,f5); c=cr_field(buf,c,eol,f6); c=cr_field(buf,c,eol,f7); c=cr_field(buf,c,eol,f8); c=cr_field(buf,c,eol,f9)
54 let our: i64=cr_int(f2); let low: i64=cr_int(f4); let sota: i64=cr_int(f6)
55 acc[5]=acc[5]+1
56 gw(" [" as *u8); gw(f0); gw("] " as *u8); gw(f1); gw("\n" as *u8)
57 gw(" SPEED: " as *u8)
58 if our>0 { if sota>0 {
59 if low==1 { if our>sota { gw("BEHIND ~" as *u8); gn(our/sota); gw("x (ours=" as *u8); gn(our); gw(" vs SOTA=" as *u8); gn(sota); gw(" " as *u8); gw(f3); gw(", " as *u8); gw(f7); gw(")" as *u8); acc[0]=acc[0]+1 } else { gw("AHEAD (ours=" as *u8); gn(our); gw(" <= SOTA=" as *u8); gn(sota); gw(")" as *u8); acc[1]=acc[1]+1 } }
60 else { if our<sota { gw("BEHIND (ours=" as *u8); gn(our); gw(" < SOTA=" as *u8); gn(sota); gw(" " as *u8); gw(f3); gw(")" as *u8); acc[0]=acc[0]+1 } else { gw("AHEAD" as *u8); acc[1]=acc[1]+1 } }
61 } else { gw("no-SOTA-comparand (" as *u8); gw(f5); gw("=" as *u8); gn(our); gw(")" as *u8); acc[2]=acc[2]+1 } }
62 else { gw("PENDING measure -> run " as *u8); gw(f5); gw(" (SOTA=" as *u8); gw(f6); gw(" " as *u8); gw(f7); gw(")" as *u8); acc[2]=acc[2]+1 }
63 gw("\n SECURITY: " as *u8); gw(f8); gw("\n SOVEREIGNTY: " as *u8); gw(f9); gw("\n" as *u8)
64 } }
65 cur = eol+1
66 }
67
68 gw("\n=== crypto rung ladder: " as *u8); gn(acc[5]); gw(" rungs -- SPEED behind=" as *u8); gn(acc[0]); gw(" ahead=" as *u8); gn(acc[1]); gw(" pending/no-comparand=" as *u8); gn(acc[2]); gw(" ===\n" as *u8)
69 gw("VERDICT (no-wave, provable): crypto is DIFFERENTIATED s-class -- EXCEED on SOVEREIGNTY (0-dep, 16 ISA targets incl no-FPU/edge where SIMD-SOTA does not exist) + PROVEN-CORRECTNESS (differential-vs-oracle + KATs) + CONSTANT-TIME; but PROVABLY BEHIND on raw SPEED vs SIMD/asm SOTA (P-256 verify ~237x: 10.9ms vs 46us OpenSSL). 'Provably faster' is NOT yet true -- honest.\n" as *u8)
70 gw("BUILD-LIST to close SPEED (bottom-up, loosely-coupled small organs): (1) fill PENDING benches vs SOTA (ed25519/x25519/sha256/aead/record/handshake) (2) precomputed-table + wider-window scalar-mul (3) SIMD codegen from nx_cc (AVX2/NEON/SHA-NI/AES-NI paths, additive per-ISA) (4) Montgomery/Barrett + faster inversion. Each: additive, KAT+difftest-gated, re-measured vs THIS conf.\n" as *u8)
71 sys_exit(0); return 0
72}