nx_recip_synth_test.nx

nx_recip_synth_test.nx -- TRIANGULATED validation of the Newton-Raphson reciprocal divider instantiated as an NxGsim GATE-NETWORK (nx_recip_synth.nx). Three INDEPENDENT legs must agree on every vector (a bug would have to fool all three), exactly mirroring how nx_alu_divider_test proves the restoring divider gate-network and how nx_alu_divider_newton proves the scalar math: LEG A the GATE-NETWORK Newton divider, run through nx_nxgate_sim (q and r) LEG B an independent restoring (shift-subtract) divider, SCALAR (a DIFFERENT algorithm -- the radix-2 reference) LEG C the i64 oracle / and % Battery = the SAME 2,297,160-vector triangulation the scalar proof passed: dense D in [1,256] x N in [0,8191] (2,097,152 vectors) + 200,000 random full-range W=16 (N,D in [1,65535]) + 8 explicit edges Known answer (FAIL LOUD): "<ok> <total> <q_chk> <r_chk>", ok must == total. On success prints e.g. "2297160 2297160 3 1" and sys_exit(0); any mismatch prints the bad counts and exits non-zero.