# Batched Double-and-Encode

The encoding is not batchable, since it requires an inverse square root. However, since $$\theta \circ \hat \theta = [2] P$$, it's possible to compute the encoding of $$[2]P$$ by using $$\hat \theta$$ instead of $$\theta^{-1}$$. Since $$\hat \theta$$ only requires inversions, given $$P_1, \ldots, P_n$$, it's possible to compute the encodings of $$[2]P_1, \ldots, [2]P_n$$ in a batch.

XXX write up details