nx_treegen_gate.nx source

1// nx_treegen_gate.nx -- prove SOVEREIGN INFINIGEN vegetation: seeds grow distinct procedural TREES. 2// T1 a tree generates a reasonable part count (trunk + branches + leaf clusters) and renders (trunk + canopy) 3// T2 ★VARIETY: different seeds -> different trees (part counts differ AND render L1 large) 4// T3 determinism + gallery PNG knowledge/nx_treegen.png (3 trees) 5// license_tier: ORIGINAL expect_exit: 0 6import "nx_syscalls.nx" 7import "nx_png.nx" 8import "nx_treegen.nx" 9 10func hw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } 11func pn(v: i64) -> i64 { let b: *u8=sys_mmap(32) as *u8; var x: i64=v; var ng: i64=0; if x<0{ng=1;x=0-x} var i: i64=31; if x==0{b[i]=48 as u8;i=i-1} while x>0{b[i]=(48+x%10) as u8;x=x/10;i=i-1} if ng==1{b[i]=45 as u8;i=i-1} sys_write(1,(b as i64+i+1) as *u8,31-i); return 0 } 12func lum(px: i64) -> i64 { return (px&255)+((px>>8)&255)+((px>>16)&255) } 13func L1(a: *i64, b: *i64, n: i64) -> i64 { var s: i64=0; var i: i64=0; while i<n { var d: i64=(a[i]&255)-(b[i]&255); if d<0{d=0-d} s=s+d; i=i+1 } return s } 14 15func main() -> i64 { 16 hw("=== nx_treegen_gate -- procedural vegetation: seeds grow distinct trees ===\n" as *u8) 17 var fails: i64 = 0 18 let W: i64 = tg_w(); let H: i64 = tg_h(); let npx: i64 = W*H 19 let P: *i64 = sys_mmap(TG_CAP*TG_STR*8) as *i64 20 let fb0: *i64 = sys_mmap(npx*8) as *i64 21 let fb1: *i64 = sys_mmap(npx*8) as *i64 22 let fb2: *i64 = sys_mmap(npx*8) as *i64 23 let seeds: *i64 = sys_mmap(3*8) as *i64 24 seeds[0]=3; seeds[1]=17; seeds[2]=91 25 let counts: *i64 = sys_mmap(3*8) as *i64 26 27 let n0: i64 = treegen_build(P, seeds[0]); counts[0]=n0 28 treegen_render(P, n0, 300, 4, 210, 224, 238, fb0) 29 let n1: i64 = treegen_build(P, seeds[1]); counts[1]=n1 30 treegen_render(P, n1, 300, 4, 210, 224, 238, fb1) 31 let n2: i64 = treegen_build(P, seeds[2]); counts[2]=n2 32 treegen_render(P, n2, 300, 4, 210, 224, 238, fb2) 33 hw(" parts: tree0="); pn(n0); hw(" tree1="); pn(n1); hw(" tree2="); pn(n2); hw("\n" as *u8) 34 35 // T1: canopy (leaf-green) + trunk (brown) present in tree0 36 var green: i64 = 0; var brown: i64 = 0 37 var i: i64 = 0 38 while i < npx { let px: i64=fb0[i]; let r: i64=px&255; let g: i64=(px>>8)&255; let b: i64=(px>>16)&255 39 if g>r { if g>b { if g>60 { green=green+1 } } } 40 if r>g { if g>b { if r<160 { if r>50 { brown=brown+1 } } } } 41 i=i+1 } 42 hw(" tree0 canopy(green)px="); pn(green); hw(" trunk(brown)px="); pn(brown); hw("\n" as *u8) 43 var T1: i64 = 0 44 if n0 > 60 { if green > 2000 { if brown > 300 { T1 = 1 } } } 45 if T1 == 1 { hw("T1 PASS a tree generates branches + canopy and renders\n" as *u8) } 46 else { fails=fails+1; hw("T1 FAIL\n" as *u8) } 47 48 let d01: i64 = L1(fb0, fb1, npx); let d02: i64 = L1(fb0, fb2, npx); let d12: i64 = L1(fb1, fb2, npx) 49 hw(" variety L1: t0-t1="); pn(d01); hw(" t0-t2="); pn(d02); hw(" t1-t2="); pn(d12); hw("\n" as *u8) 50 var T2: i64 = 0 51 if d01 > 300000 { if d02 > 300000 { if d12 > 300000 { T2 = 1 } } } 52 if T2 == 1 { hw("T2 PASS VARIETY: different seeds -> different trees\n" as *u8) } 53 else { fails=fails+1; hw("T2 FAIL trees too similar\n" as *u8) } 54 55 // determinism: regen+render seed 17 56 let chk: *i64 = sys_mmap(npx*8) as *i64 57 let nc: i64 = treegen_build(P, seeds[1]) 58 treegen_render(P, nc, 300, 4, 210, 224, 238, chk) 59 var ddet: i64 = 0 60 i = 0 61 while i < npx { if chk[i]!=fb1[i] { ddet=ddet+1 } i=i+1 } 62 var T3: i64 = 0 63 if ddet == 0 { T3 = 1 } 64 if T3 == 1 { hw("T3 PASS determinism (same seed -> same tree)\n" as *u8) } 65 else { fails=fails+1; hw("T3 FAIL ddet="); pn(ddet); hw("\n" as *u8) } 66 67 // gallery: 3 trees side by side 68 let GW: i64 = W*3 69 let gal: *i64 = sys_mmap(GW*H*8) as *i64 70 var y: i64 = 0 71 while y < H { var x: i64=0; while x<W { gal[y*GW+x]=fb0[y*W+x]; gal[y*GW+W+x]=fb1[y*W+x]; gal[y*GW+W*2+x]=fb2[y*W+x]; x=x+1 } y=y+1 } 72 write_png(gal, GW, H, "knowledge/nx_treegen.png" as *u8) 73 hw("T4 gallery -> knowledge/nx_treegen.png (seed3 | seed17 | seed91)\n" as *u8) 74 75 if fails == 0 { hw("TREEGEN-GATE 3/3 GREEN -- procedural vegetation: seeds grow distinct trees (recursive branching + leaf clusters), integer + deterministic, no ML, no assets\n" as *u8); sys_exit(0); return 0 } 76 hw("TREEGEN-GATE RED fails="); pn(fails); hw("\n" as *u8) 77 sys_exit(1) 78 return 1 79}