Been thinking of a basic item hidding mechanism for #iCS lately.

Having and index array of all the possible arrays with known words would allow for a ^[A-Za-z]\d+$ regexp check where [A-Za-z] is the index array position and the trailing digit(s) are the position within the reference array.

So a basic 2-Table solution but also doing the ball-hash to hide that token inside a hash where we could maybe use bitwise to obtain data from that hash without opening the hash.

Would need a way to delete sections so having a simple CHARACTER then NUMBER I should always be able to determine each slot but the slots don't have to equal pack position number allowing for some amount of randomness.

I do not know if I can get these basic concepts to work in JS vanilla but no time like now to try.