What attack is used to crack passwords by using a precomputed table of hashed passwords?

A brute force attack systematically computes hashes for every possible character combination at runtime, with no precomputed table involved.

Rainbow table attacks work by precomputing chains of hash values and storing them in a lookup table, trading disk space for speed when cracking captured password hashes. When a hash is obtained, the attacker simply looks it up in the table rather than computing hashes on the fly. This is far faster than brute force and more comprehensive than a dictionary attack for unsalted hashes.

A dictionary attack hashes words from a wordlist at runtime and compares them to the target hash, rather than consulting a precomputed lookup table.

A hybrid attack combines dictionary words with brute force character mutations at runtime, still computing hashes live rather than referencing precomputed data.