((A , B , C) , (D , E , F, G, H))
A is 0x0-0xF, (1 of 16)
B is 0x00-0xFF (1 of 256)
C is an 8 digit integer
D is a one of a list of one hundred words padded to 12 characters
E is a one of a list of one hundred words padded to 12 characters
F is a one of a list of one hundred words padded to 12 characters
G is a nine-digit numerical value, that could be one of 3 derived from (D,E,F) through research
H is an alphanumeric "secret" of a(hopefully but humans are lazy) secure nature
Where ABC are hashed to a 32-byte value, DEFGH to another, then both resulting values are concatenated and hashed together
These metrics are based an very pessimistic assumptions about the randomness of my inputs.
In my naive understanding that gives me 1.2289e20 permutations assuming that the "secret" can be derived from a 100 word rainbow table lol.
The objective is to make it impractical to derive hash-seed candidates in the foreseeable future.
my equally naive analysis is that at 1,000,000,000 hashes generated per second this would require a median time to match of about 1900 years per hash?