code wiki / (root) / nx_p256_ecverify_core_bench.nx

nx_p256_ecverify_core_bench.nx

buildroot/runtime/nx_p256_ecverify_core_bench.nx

3175 B71 linesdepth 9pulls 15 transitivereach 0 importersview sourcekind benchtopic p256

docs dependencies structs consts functions

about

nx_p256_ecverify_core_bench.nx -- SAME-RUN clean comparison of the verify's EC core (u1*G + u2*Q + point_add), optimized (comb u1*G + wNAF u2*Q) vs baseline (generic + generic). Both paths use the same (already-live fast) field reducer, so this isolates the SCALAR-MULT-ALGORITHM speedup. Table built once (amortized). Dependent chain. expect_exit: 0 license_tier: ORIGINAL

dependencies 6 imports · 0 importers

imports: nx_syscalls.nxnx_csprng.nxnx_p256_comb.nxnx_p256_scalar_mul_wnaf.nxnx_p256_scalar_mul.nxnx_p256_point_add.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_1000000000: i64 = 1000000000
13	const NI: i64 = 300

functions

15	func bp(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } called by 1: main calls 1: sys_write
16	func bn(v: i64) -> i64 called by 1: main calls 2: sys_mmap sys_write
22	func now_ns(ts: i64) -> i64 { __syscall(SYS_CLOCK_GETTIME, 1, ts as i64, 0, 0, 0, 0); return ts[0] K_MAGIC_1000000000 + ts[1] } called by 1: main
24	func main() -> i64 calls 15: sys_mmap p256_comb_build p256_point_alloc p256_point_load_g u256_alloc nx_csprng_fill+9