You wish, but the reality says no.

In the paper they look at 14, 20, and 32 bit elliptic curves. The corresponding weights storage is 2¹³, 2^13.5, 2^14.2. Theoretically the storage would be in the order of 2⁷, 2¹⁰, and 2¹⁶. So all looks good, no breakthrough.

To even learn the secp256k1 weights you'd need at least 2¹²⁸ examples. Good luck executing that.