Sorry to rain on this, but this method is useless.

I managed to decode how to split multiple keys using this method (I even made a script that reproduces your example, but it's private at the request of someone else, not that the results would be useful/practical to anyone here), and it turns out you're just using mod(32)-sized ranges.

Now as we all know, when you modinv a small number on secp256k1 you get a very large number (and modinv a "decimal number" is really just modinv(denominator) * numerator so this still holds for that)

This effectively means that the range becomes humungous, way bigger than 2^120 where we started.

---

The ranges look something like this (P = public key):

1*modinv(32) 2*modinv(32)     1P
2*modinv(32) 3*modinv(32)     2P
...
32*modinv(32) 33*modinv(32) (32*modinv(32) = 1)      32P

The ranges are much bigger than when you divide-and-split them down by a number.

Now of course you can replace 32 with an extremely huge number to make the ranges manageable/smaller but what's the point? Now you have an unmanageable amount of public keys.