The thread is about brute forcing private keys, not about breaking secp256k1
I somehow feel that OP meant of having any practical way to compute a private key - and not to feed the semantic trolls

So depends on how are you defining the brute-forcing itself.
For any practical purposes, it is empirically probable that:
1. RIPEMD-160 & SHA256 & ECDSA algorithms will weaken in our lifetime due to advancing mathematics or weaknesses in design.
2. Quantum computing will advance. Modified Shor's/Grover's algorithms (or any new ones) will decrease the iteration count. I wonder how much acceleration the current theoretical implementions would give.
The probability for combination of these events in our lifetime (or even 10/5/2 years) can be roughly estimated, so that may show some interesting possibility on having the working tool.