batch.md

batch inversion specification invert N field elements simultaneously using Montgomery's trick. cost: 1 inversion + 3(N−1) multiplications — amortized cost per element approaches 3 multiplications as N grows. algorithm correctness after phase 1: `prefix[i] = a[0] · a[1] · ... · a[i]`. after phase 2:…

batch inversion specification invert N tower field elements simultaneously using Montgomery's trick. cost: 1 inversion + 3(N-1) multiplications. the algorithm applies identically at every tower level. algorithm correctness after phase 1: `prefix[i] = a[0] * a[1] * ... * a[i]`. after phase 2:…