Checking a trillion combinations per second, and running continuously for 40 years you'd go through 1.261×10²¹ keys. That's one sextillion, 261 quintillion! Sure sounds impressive, doesn't it? It is, but even so, you'd have made no progress... that rather impressive number still only amounts to about 0.000000000000000000000000000000000000000000000000000001% of the keyspace.

What if you can go faster, you ask? Let's go as fast as physics will let us go, cost and technological constraits be damned. Here's what Bruce Schneier had to say about brute-forcing 256-bit symmetric keys in the seminal tome Applied Cryptography:

One of the consequences of the second law of thermodynamics is that a certain amount of energy is necessary to represent information. To record a single bit by changing the state of a system requires an amount of energy no less than kT, where T is the absolute temperature of the system and k is the Boltzman constant. (Stick with me; the physics lesson is almost over.)

Given that k = 1.38×10^-16 erg/°Kelvin, and that the ambient temperature of the universe is 3.2°Kelvin, an ideal computer running at 3.2°K would consume 4.4×10^-16 ergs every time it set or cleared a bit. To run a computer any colder than the cosmic background radiation would require extra energy to run a heat pump.

Now, the annual energy output of our sun is about 1.21×10⁴¹ ergs. This is enough to power about 2.7×10⁵⁶ single bit changes on our ideal computer; enough state changes to put a 187-bit counter through all its values. If we built a Dyson sphere around the sun and captured all its energy for 32 years, without any loss, we could power a computer to count up to 2^192. Of course, it wouldn't have the energy left over to perform any useful calculations with this counter.

But that's just one star, and a measly one at that. A typical supernova releases something like 10⁵¹ ergs. (About a hundred times as much energy would be released in the form of neutrinos, but let them go for now.) If all of this energy could be channeled into a single orgy of computation, a 219-bit counter could be cycled through all of its states.

These numbers have nothing to do with the technology of the devices; they are the maximums that thermodynamics will allow. And they strongly imply that brute-force attacks against 256-bit keys will be infeasible until computers are built from something other than matter and occupy something other than space.

The hilarious neutrino joke aside, the conclusion is inescapable (even though Schneier is talking about brute-forcing symmetric keys and we aren't quite dealing with those):

Brute-forcing of 256-bit seed phrases ain't happening until computers are built from something other than matter and occupy something other than space.