code wiki / _hdl_build / nx_seg_merkle_gate.nx

nx_seg_merkle_gate.nx source

↩ module page · 43 lines · 2913 B

1import "nx_gate_gn.nx" 2// nx_seg_merkle_gate.nx -- exceed-gate for CAP-SEG-MERKLE. Proves proof-of-inclusion: a valid leaf+proof recomputes 3// the root, a wrong leaf is rejected, a single-byte tampered proof is rejected, and both a normal and an odd-tail 4// leaf verify. This is what a bare content-hash CANNOT do: prove membership with O(log n) bytes, no full store read. 5// Sovereign: nx_syscalls + nx_sha256 + nx_seg_merkle. expect_exit: 0 6import "nx_syscalls.nx" 7import "nx_sha256.nx" 8import "nx_seg_merkle.nx" 9 10func gp(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } 11 12func main(argc: i64, argv: *i64) -> i64 { 13 gp("=== nx_seg_merkle_gate (proof-of-inclusion: valid=verify, wrong/tamper=reject) ===\n" as *u8) 14 let leaves: *u8 = sys_mmap(5*32) 15 sha256_digest("alpha" as *u8, 5, (leaves as i64 + 0*32) as *u8) 16 sha256_digest("bravo" as *u8, 5, (leaves as i64 + 1*32) as *u8) 17 sha256_digest("charlie" as *u8, 7, (leaves as i64 + 2*32) as *u8) 18 sha256_digest("delta" as *u8, 5, (leaves as i64 + 3*32) as *u8) 19 sha256_digest("echo" as *u8, 4, (leaves as i64 + 4*32) as *u8) 20 let root: *u8 = sys_mmap(32); mk_root(leaves, 5, root) 21 let proof: *u8 = sys_mmap(32*16); let dirs: *i64 = sys_mmap(8*16) as *i64 22 var pass: i64=0; var fail: i64=0 23 24 let depth: i64 = mk_proof(leaves, 5, 2, proof, dirs) 25 if mk_verify((leaves as i64 + 2*32) as *u8, proof, dirs, depth, root) == 1 { pass=pass+1; gp(" T1 leaf 2 inclusion proof (depth " as *u8); gn(depth); gp(") verifies to root PASS\n" as *u8) } else { fail=fail+1; gp(" T1 FAIL\n" as *u8) } 26 27 let wrong: *u8 = sys_mmap(32); sha256_digest("nope" as *u8, 4, wrong) 28 if mk_verify(wrong, proof, dirs, depth, root) == 0 { pass=pass+1; gp(" T2 wrong leaf -> REJECTED PASS\n" as *u8) } else { fail=fail+1; gp(" T2 FAIL wrong accepted\n" as *u8) } 29 30 proof[0] = (proof[0] as i64 ^ 1) as u8 31 if mk_verify((leaves as i64 + 2*32) as *u8, proof, dirs, depth, root) == 0 { pass=pass+1; gp(" T3 single-byte tampered proof -> REJECTED PASS\n" as *u8) } else { fail=fail+1; gp(" T3 FAIL tamper accepted\n" as *u8) } 32 proof[0] = (proof[0] as i64 ^ 1) as u8 33 34 let d0: i64 = mk_proof(leaves, 5, 0, proof, dirs) 35 if mk_verify((leaves as i64 + 0*32) as *u8, proof, dirs, d0, root) == 1 { pass=pass+1; gp(" T4 leaf 0 verifies PASS\n" as *u8) } else { fail=fail+1; gp(" T4 FAIL\n" as *u8) } 36 37 let d4: i64 = mk_proof(leaves, 5, 4, proof, dirs) 38 if mk_verify((leaves as i64 + 4*32) as *u8, proof, dirs, d4, root) == 1 { pass=pass+1; gp(" T5 leaf 4 (odd tail) verifies PASS\n" as *u8) } else { fail=fail+1; gp(" T5 FAIL\n" as *u8) } 39 40 gp("RESULT pass=" as *u8); gn(pass); gp(" fail=" as *u8); gn(fail) 41 if fail == 0 { gp(" verdict=GREEN (O(log n) verifiable inclusion -- IPLD/CT-class)\n" as *u8); sys_exit(0); return 0 } 42 gp(" verdict=RED\n" as *u8); sys_exit(1); return 1 43}