Hello,

I was wondering if should one could explain in detail how chains work in rainbow tables as though you would a complete novice but with relevance to programming.

I understand that a chain is 16 bytes long. 8 bytes mark the starting point and 8 mark the end. I also understand that in the filename we have the chain length i.e. 2400. Which means that between our starting point and end point in just 16 bytes we have 2400 possible clear texts? What? How does that work? in those 16 bytes how do i get my 2400 hashes and clear texts or am i miss understanding this?

Your help is greatly appreciated.

Thanks

P.s. I have read the related papers and googled this topic a fair bit. I think im just missing something important to make these gears turn.