nx_p256_wnaf_bench.nx
buildroot/runtime/nx_p256_wnaf_bench.nx
about
nx_p256_wnaf_bench.nx -- is wNAF-4 actually faster than generic double-and-add for variable-base
k*P (the verify's u2*Q)? Includes the per-call precompute (odd multiples + negations + recode),
exactly as verify would pay it. Dependent-chain (DCE-proof). expect_exit: 0 license_tier: ORIGINAL
dependencies 4 imports · 0 importers
imports: nx_syscalls.nxnx_csprng.nxnx_p256_scalar_mul_wnaf.nxnx_p256_scalar_mul.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
| 8 | const K_MAGIC_1000000000: i64 = 1000000000 |
| 10 | const NI: i64 = 400 |
functions
| 12 | 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 } |
| 13 | func bn(v: i64) -> i64 |
| 19 | 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 |
| 21 | func main() -> i64 |