code wiki / p256
topic: p256
42 modules sharing the p256 name family (derived from the tree's prefix discipline).
The 'p256' topic family in the Nishi sovereign ecosystem provides cryptographic functionality for the NIST P-256 elliptic curve, supporting operations like scalar multiplication, key exchange, and verification. Modules such as nx_p256_comb enable efficient fixed-base scalar multiplication, while nx_p256_ecdh implements secure ECDH key exchange. nx_p256_field_inv handles modular inversion, essential for field operations, ensuring robust and optimized cryptographic performance across the ecosystem.
auto-narrated by the local model from this topic's module headers; links verified against the wiki index.
narrated overview -- maintained by the narration lane, module links verified against this wiki.
| module | description | lines | funcs |
|---|---|---|---|
| nx_p256_comb.nx | fixed-base windowed scalar multiplication for the | 115 | 5 |
| nx_p256_comb_bench.nx | does the fixed-base comb (p256_scalar_mul_base, precomputed G-table) beat | 68 | 4 |
| nx_p256_comb_gen.nx | build the P-256 fixed-base comb table once and | 23 | 1 |
| nx_p256_comb_test.nx | oracle test: fixed-base comb k*G must equal the | 68 | 4 |
| nx_p256_ecdh.nx | ECDH key exchange on P-256 (secp256r1) for the | 144 | 5 |
| nx_p256_ecverify_core_bench.nx | SAME-RUN clean comparison of the verify's EC core (u1*G + u2*Q + | 71 | 4 |
| nx_p256_field.nx | NIST P-256 prime field arithmetic. | 165 | 10 |
| nx_p256_field_inv.nx | P-256 prime-field modular inverse via | 138 | 4 |
| nx_p256_field_inv_test.nx | KAT for P-256 modular inverse via | 111 | 1 |
| nx_p256_field_mul.nx | P-256 prime field multiplication. | 308 | 11 |
| nx_p256_field_mul_oracle_test.nx | validates the FAST Solinas | 96 | 5 |
| nx_p256_field_mul_test.nx | KAT for P-256 field multiplication. | 193 | 1 |
| nx_p256_field_test.nx | KAT for P-256 prime field add/sub/neg. | 179 | 1 |
| nx_p256_fieldmul_3way_bench.nx | DEFINITIVE single-run decomposition of the P-256 field-mul win: | 94 | 8 |
| nx_p256_fieldmul_bench.nx | a NON-const-foldable P-256 field-mul benchmark. | 43 | 1 |
| nx_p256_fieldmul_full_bench.nx | the FULLY-optimized P-256 field multiply: fused __mul256_wide | 84 | 6 |
| nx_p256_fieldmul_mulx.nx | P-256 field multiply using the FUSED __mul256_wide intrinsic | 46 | 4 |
| nx_p256_fieldmul_mulx_bench.nx | field-mul-level speed: production p256_field_mul (u256_mul_wide | 60 | 4 |
| nx_p256_fieldmul_mulx_difftest.nx | prove the fused-intrinsic P-256 field multiply is bit-exact | 61 | 5 |
| nx_p256_keyshare_test.nx | B4-P256-KEYSHARE gate row. | 175 | 3 |
| nx_p256_modn.nx | arithmetic in Z/nZ where n is the NIST P-256 | 385 | 20 |
| nx_p256_modn_mont_test.nx | oracle test for the Montgomery fast | 81 | 5 |
| nx_p256_modn_test.nx | KAT for arithmetic in Z/nZ where n is | 138 | 1 |
| nx_p256_point.nx | NIST P-256 elliptic-curve point operations. | 382 | 13 |
| nx_p256_point_add.nx | P-256 Jacobian point addition. | 177 | 2 |
| nx_p256_point_add_test.nx | KAT for P-256 Jacobian point addition. | 121 | 1 |
| nx_p256_point_test.nx | KAT for P-256 point operations. | 133 | 1 |
| nx_p256_pointloop_bench.nx | reusable crypto perf workload for codegen A/B. | 33 | 1 |
| nx_p256_scalar_mul.nx | P-256 scalar multiplication k * P. | 104 | 2 |
| nx_p256_scalar_mul_test.nx | KAT for P-256 scalar multiplication. | 120 | 1 |
| nx_p256_scalar_mul_wnaf.nx | variable-base scalar mult via width-4 wNAF (signed non-adjacent form). | 110 | 2 |
| nx_p256_sign_bench.nx | measure the ACTUAL per-handshake server crypto: | 54 | 3 |
| nx_p256_solinas_difftest.nx | DIFFERENTIAL correctness gate for the | 456 | 10 |
| nx_p256_solinas_fast.nx | a FASTER NIST P-256 Solinas reducer, bit-exact with the production | 119 | 2 |
| nx_p256_solinas_fast_bench.nx | reduce-only speed: production _p256_solinas_reduce (~60 _r_addw | 48 | 4 |
| nx_p256_solinas_fast_difftest.nx | prove the deferred-carry _p256_solinas_reduce_fast is bit-exact | 54 | 5 |
| nx_p256_solinas_timing.nx | honest FAST(Solinas) vs SLOW(bit-serial) | 122 | 3 |
| nx_p256_verify_bench.nx | end-to-end ECDSA P-256 verify throughput (u1*G + u2*Q double-and-add). | 59 | 4 |
| nx_p256_verify_components.nx | decompose the ECDSA verify budget so the next optimization targets | 66 | 4 |
| nx_p256_verify_timing.nx | end-to-end ECDSA-P256 verify timing on the | 138 | 2 |
| nx_p256_wnaf_bench.nx | is wNAF-4 actually faster than generic double-and-add for variable-base | 52 | 4 |
| nx_p256_wnaf_difftest.nx | prove p256_scalar_mul_wnaf == p256_scalar_mul (generic double-and-add, | 75 | 4 |