Example Rainbow Table GenerationIf you mean the first 5 nibbles of the hash function, then yes probably. "Real" rainbow table reduction functions are going to vary from program to program. You can try and look at the source code or the particular rainbow table generation or contact the developers ask them what they use. You're can't be 100% sure that the reduction function is going to generate all the values between 0 and 999999 unless you prove it. So if you dont have 11111 in a chain, you'll have to start a new chain.

Example Rainbow Table Generation@calccrypto I can revise my answer to better explain what are you looking for. What kind of language do you want me to provide a sample for? What hashes are looking to store? Do you want to optimize speed or space? Do you want me to explain the generation and look up process? Do you want to know how to use a reduction function?(Different question all together)