We can halve the size of the SRS download by using the standard point compression technique of storing (x, sign_bit) instead of (x,y). This may have nontrivial decompression costs given the size of our SRS but (a) maybe it's acceptable if we can hide it in some init stage and (b) maybe there's an algorithm where we can speed up decompression by storing "hints" for computing the square roots at the expense of slightly worse compression.
We can halve the size of the SRS download by using the standard point compression technique of storing (x, sign_bit) instead of (x,y). This may have nontrivial decompression costs given the size of our SRS but (a) maybe it's acceptable if we can hide it in some init stage and (b) maybe there's an algorithm where we can speed up decompression by storing "hints" for computing the square roots at the expense of slightly worse compression.