code wiki / (root) / nx_p256_verify_components.nx

nx_p256_verify_components.nx

buildroot/runtime/nx_p256_verify_components.nx

3082 B66 linesdepth 9pulls 15 transitivereach 0 importersview sourcekind tooltopic p256
docsdependenciesstructsconstsfunctions

about

nx_p256_verify_components.nx -- decompose the ECDSA verify budget so the next optimization targets the actual biggest remaining cost (not a guess). Times: modn_inv (s^-1 mod n), generic scalar_mul (u2*Q), comb scalar_mul (u1*G), point_to_affine (field inversion mod p). expect_exit: 0 license_tier: ORIGINAL

dependencies 5 imports · 0 importers

nx_syscalls.nx nx_csprng.nx nx_p256_comb.nx nx_p256_scalar_mul.nx nx_p256_modn.nx nx_p256_verify_components.nx

imports: nx_syscalls.nxnx_csprng.nxnx_p256_comb.nxnx_p256_scalar_mul.nxnx_p256_modn.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main sys_mmap p256_comb_build nx_scratch_save nx_scratch_init sys_mmap ↻ p256_point_alloc nx_scratch nx_scratch_init ↻ nx_scratch_oom sys_write sys_exit sys_mmap ↻ u256_alloc nx_scratch ↻ p256_field_one u256_one u256_zero p256_field_zero u256_zero ↻ p256_point_load_g p256_field_one ↻ p256_point_copy u256_copy p256_comb_store p256_point_add p256_point_is_infinity u256_is_zero p256_point_copy ↻ nx_scratch_save ↻ u256_alloc ↻ u256_copy ↻ p256_field_sq p256_field_mul nx_scratch_save ↻ u256_wide_alloc nx_scratch ↻ u256_mul_wide _p256_solinas_reduce u256_alloc ↻

structs

none

consts

10const K_MAGIC_1000000000: i64 = 1000000000
21const NI: i64 = 300

functions

12func 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
13func bn(v: i64) -> i64
called by 1: main calls 2: sys_mmapsys_write
19func 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
23func main() -> i64