code wiki / (root) / nx_p256_field_inv_test.nx

nx_p256_field_inv_test.nx

buildroot/runtime/nx_p256_field_inv_test.nx

3779 B111 linesdepth 6pulls 7 transitivereach 0 importersview sourcekind gate/prooftopic p256
docsdependenciesstructsconstsfunctions

about

nx_p256_field_inv_test.nx -- KAT for P-256 modular inverse via Fermat's little theorem. Strategy: prove a * inv(a) == 1 mod p for many a values. expect_exit: 0 license_tier: ORIGINAL

dependencies 5 imports · 0 importers

nx_syscalls.nx nx_u256.nx nx_p256_field.nx nx_p256_field_mul.nx nx_p256_field_inv.nx nx_p256_field_inv_test.nx

imports: nx_syscalls.nxnx_u256.nxnx_p256_field.nxnx_p256_field_mul.nxnx_p256_field_inv.nx

imported by: nobody (leaf or entry point)

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

main u256_alloc nx_scratch nx_scratch_init sys_mmap nx_scratch_oom sys_write sys_exit sys_mmap ↻ p256_field_one u256_one u256_zero p256_field_load_p p256_field_load_p_minus_2 u256_zero ↻ p256_field_bit_at p256_field_inv nx_scratch_save nx_scratch_init ↻ u256_alloc ↻ p256_field_load_p_minus_2 ↻ u256_copy p256_field_one ↻ p256_field_sq p256_field_mul nx_scratch_save ↻ u256_wide_alloc nx_scratch ↻ u256_mul_wide _p256_solinas_reduce u256_alloc ↻ p256_field_load_p ↻ nx_scratch ↻ _r_reduce9 _r_cmp8 nx_scratch_restore p256_field_bit_at ↻ p256_field_mul ↻ nx_scratch_restore ↻ p256_field_eq

structs

none

consts

none

functions

15func main() -> i64
calls 12: u256_allocp256_field_onep256_field_load_pp256_field_load_p_minus_2u256_zerop256_field_bit_at+6