Meh, use multisig and wait to see if new math gets discovered that somehow manages to break our current understanding of the fundamentals. It’s not like we are just missing a clever algorithm. It would take a major disturbance to number theory or breakthrough in advanced mathematics to be an issue. See reasons why quantum algos are not a threat here: https://open.substack.com/pub/antic/p/response-to-the-end-of-cryptocurrency
If ECDSA breaks, multisig will not save you. Hashed pubkeys will though, or at least force adversaries to wait until your tx has already hit the mempool.
reply
Multisig makes it so much more difficult. If you can reverse the hash to a pub key and then factor the pub key, that’s 3 difficult problems. Then finding enough of the m of n combos in the entire set of possible keys that creates a single hash output is a whole other problem. When you don’t even know what the m or n values are, you have to brute force every single permutation. We don’t even have a quantum algorithm for that.