Now, given a hash value "h" that we want to invert (find the corresponding password for), compute a chain starting with "h" by applying R, then H, then R, and so on. If at any point we observe a value matching one of the endpoints in the table, we get the corresponding starting point and use it to recreate the chain. There's a good chance that this chain will contain the value "h", and if so, the immediately preceding value in the chain is the password "p" that we seek.