> . Until the brute force finds a hash that meets difficulty, it’s computing literally nothing of value

It's not doing nothing. It's searching - searching for a hash that can be used to protect the ledger from attacks.

Saying it's doing nothing is like saying Dijkstra's algorithm is doing nothing until it finally finds the shortest path. That's just plain wrong. Sorry.