nx_p256_fieldmul_full_bench.nx
buildroot/runtime/nx_p256_fieldmul_full_bench.nx
about
nx_p256_fieldmul_full_bench.nx -- the FULLY-optimized P-256 field multiply: fused __mul256_wide
(MULX/ADCX/ADOX) multiply + deferred-carry fast Solinas reduce, vs the production p256_field_mul.
Both components are individually proven bit-exact; this verifies the COMPOSITION (correctness
pre-check) then times it. Dependent-chain harness (DCE/hoist-proof). Uses __mul256_wide ->
build via nx_cand_build_run (candidate compiler; zero live risk). expect_exit: 0 license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_p256_solinas_fast.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
| 7 | const N_MAGIC_1000000000: i64 = 1000000000 |
| 8 | const N_MAGIC_6364136223846793005: i64 = 6364136223846793005 |
| 9 | const N_MAGIC_1442695040888963407: i64 = 1442695040888963407 |
| 10 | const N_MAGIC_2000: i64 = 2000 |
| 12 | const N_ITER: i64 = 3000000 |
functions
| 14 | 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 |
| 15 | func bn(v: i64) -> i64 called by 1: main |
| 21 | func now_ns(ts: *i64) -> i64 { __syscall(SYS_CLOCK_GETTIME, 1, ts as i64, 0, 0, 0, 0); return ts[0] * N_MAGIC_1000000000 + ts[1] } called by 1: main |
| 22 | func lcg(st: *i64) -> i64 { let x: i64 = st[0] * N_MAGIC_6364136223846793005 + N_MAGIC_1442695040888963407; st[0] = x; return x } called by 1: main |
| 25 | func p256_field_mul_full(out8: *i64, a: *i64, b: *i64, a64: *i64, b64: *i64, prod: *i64, c16: *i64) -> i64 |
| 35 | func main() -> i64 |